A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

We propose a deterministic polynomial time algorithm to find a splitting element in a given central simple algebra over an algebraic number field. This enables us to give deterministic polynomial time methods for some problems of algorithmic representation theory, where formerly only randomized (Las Vegas) methods were available, including the problem of decomposition of simple algebras over R and C.

Original languageEnglish
Pages (from-to)24-32
Number of pages9
JournalJournal of Algorithms
Volume16
Issue number1
DOIs
Publication statusPublished - Jan 1994

Fingerprint

Algebra
Polynomials
Central Simple Algebra
Algebraic number Field
Computing
Deterministic Algorithm
Representation Theory
Polynomial-time Algorithm
Polynomial time
Decomposition
Decompose

ASJC Scopus subject areas

  • Computational Mathematics
  • Computational Theory and Mathematics

Cite this

A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q. / Rónyai, L.

In: Journal of Algorithms, Vol. 16, No. 1, 01.1994, p. 24-32.

Research output: Contribution to journalArticle

@article{2ed501e80ad746158b1a2f0c2ecefaff,
title = "A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q",
abstract = "We propose a deterministic polynomial time algorithm to find a splitting element in a given central simple algebra over an algebraic number field. This enables us to give deterministic polynomial time methods for some problems of algorithmic representation theory, where formerly only randomized (Las Vegas) methods were available, including the problem of decomposition of simple algebras over R and C.",
author = "L. R{\'o}nyai",
year = "1994",
month = "1",
doi = "10.1006/jagm.1994.1002",
language = "English",
volume = "16",
pages = "24--32",
journal = "Journal of Algorithms",
issn = "0196-6774",
publisher = "Academic Press Inc.",
number = "1",

}

TY - JOUR

T1 - A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q

AU - Rónyai, L.

PY - 1994/1

Y1 - 1994/1

N2 - We propose a deterministic polynomial time algorithm to find a splitting element in a given central simple algebra over an algebraic number field. This enables us to give deterministic polynomial time methods for some problems of algorithmic representation theory, where formerly only randomized (Las Vegas) methods were available, including the problem of decomposition of simple algebras over R and C.

AB - We propose a deterministic polynomial time algorithm to find a splitting element in a given central simple algebra over an algebraic number field. This enables us to give deterministic polynomial time methods for some problems of algorithmic representation theory, where formerly only randomized (Las Vegas) methods were available, including the problem of decomposition of simple algebras over R and C.

UR - http://www.scopus.com/inward/record.url?scp=43949153098&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=43949153098&partnerID=8YFLogxK

U2 - 10.1006/jagm.1994.1002

DO - 10.1006/jagm.1994.1002

M3 - Article

VL - 16

SP - 24

EP - 32

JO - Journal of Algorithms

JF - Journal of Algorithms

SN - 0196-6774

IS - 1

ER -