English
Related papers

Related papers: Splitting full matrix algebras over algebraic numb…

200 papers

The fastest known algorithm for factoring univariate polynomials over finite fields is the Kedlaya-Umans (fast modular composition) implementation of the Kaltofen-Shoup algorithm. It is randomized and takes $\widetilde{O}(n^{3/2}\log q + n…

Computational Complexity · Computer Science 2016-06-16 Zeyu Guo , Anand Kumar Narayanan , Chris Umans

Let $C$ be an arithmetic circuit of $poly(n)$ size given as input that computes a polynomial $f\in\mathbb{F}[X]$, where $X=\{x_1,x_2,\ldots,x_n\}$ and $\mathbb{F}$ is any field where the field arithmetic can be performed efficiently. We…

Data Structures and Algorithms · Computer Science 2020-06-03 V. Arvind , Abhranil Chatterjee , Rajit Datta , Partha Mukhopadhyay

We generalize Amitsur's construction of central simple algebras over a field $F$ which are split by field extensions possessing a derivation with field of constants $F$ to nonassociative algebras: for every central division algebra $D$ over…

Rings and Algebras · Mathematics 2021-04-13 Susanne Pumpluen

We find a basis for the $G$-graded identities of the $n\times n$ matrix algebra $M_n(K)$ over an infinite field $K$ of characteristic $p>0$ with an elementary grading such that the neutral component corresponds to the diagonal of $M_n(K)$.

Rings and Algebras · Mathematics 2014-07-08 Diogo Diniz Pereira da Silva e Silva

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

Symbolic Computation · Computer Science 2020-05-11 Simon Abelard

Let X be an affine irreducible variety over an algebraically closed field k of characteristic zero. Given an automorphism F, we denote by k(X)^F its field of invariants, i.e. the set of rational functions f on X such that f(F)=f. Let n(F)…

Algebraic Geometry · Mathematics 2007-05-23 Philippe Bonnet

We consider the class of polynomial optimization problems $\inf \{f(x):x\in K\}$ for which the quadratic module generated by the polynomials that define $K$ and the polynomial $c-f$ (for some scalar $c$) is Archimedean. For such problems,…

Optimization and Control · Mathematics 2013-07-05 Vaithilingam Jeyakumar , Jean-Bernard Lasserre , G. Li

We determine explicit quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centers and block diagonal forms {of these algebras.} In the case where $q$ is {an arbitrary} root of unity, this further…

Quantum Algebra · Mathematics 2012-10-29 Hans Plesner Jakobsen , Chiara Pagani

The algebras considered in this paper are commutative rings of which the additive group is a finite-dimensional vector space over the field of rational numbers. We present deterministic polynomial-time algorithms that, given such an…

Commutative Algebra · Mathematics 2016-10-05 H. W. Lenstra , A. Silverberg

Let $f,g\in Z[X]$ be monic polynomials of degree $n$ and let $C,D\in M_n(Z)$ be the corresponding companion matrices. We find necessary and sufficient conditions for the subalgebra $Z< C,D>$ to be a sublattice of finite index in the full…

Rings and Algebras · Mathematics 2010-08-10 Natalio H. Guersenzvaig , Fernando Szechtman

Let $k$ be any field and $k^s$ its separable closure. Let $X$ be an affine variety over $k$ which is isomorphic to affine $n$-space over the field extension $k^s$. Then $X$ is isomorphic to affine $n$ space over $k$.

Algebraic Geometry · Mathematics 2007-05-23 S. Subramanian

We deal with the existing problem of filtered multiplicative bases of finite-dimensional associative algebras. For an associative algebra A over a field, we investigate when the property of having a filtered multiplicative basis is…

Rings and Algebras · Mathematics 2014-10-02 V. Bovdi , A. Grishkov , S. Siciliano

We compute the factorization homology of a polynomial algebra over a compact and closed manifold with trivialized tangent bundle up to weak equivalence in a new way. This calculation is based on the model of a graph complex and an explicit…

Quantum Algebra · Mathematics 2018-05-22 Lennart Döppenschmitt

The purpose of this note is to survey a methodology to solve systems of polynomial equations and inequalities. The techniques we discuss use the algebra of multivariate polynomials with coefficients over a field to create large-scale linear…

Optimization and Control · Mathematics 2011-12-08 Jesus A. De Loera , Peter N. Malkin , Pablo A. Parrilo

Let $V$ be the set of real common solutions to $F = (f_1, \ldots, f_s)$ in $\mathbb{R}[x_1, \ldots, x_n]$ and $D$ be the maximum total degree of the $f_i$'s. We design an algorithm which on input $F$ computes the dimension of $V$. Letting…

Symbolic Computation · Computer Science 2021-06-15 Piere Lairez , Mohab Safey El Din

Quantum affine reflection algebras are coideal subalgebras of quantum affine algebras that lead to trigonometric reflection matrices (solutions of the boundary Yang-Baxter equation). In this paper we use the quantum affine reflection…

Quantum Algebra · Mathematics 2007-09-11 Gustav W. Delius , Alan George

We describe a simple approach to factorize non-commutative (nc) polynomials, that is, elements in free associative algebras (over a commutative field), into atoms (irreducible elements) based on (a special form of) their minimal linear…

Rings and Algebras · Mathematics 2018-08-09 Konrad Schrempf

We study the images of polynomial maps over algebraically closed division rings. Our first result generalizes the classical Ax-Grothendieck theorem: We show that if $ f_1, \ldots, f_m $ are elements of the free associative algebra $…

Rings and Algebras · Mathematics 2025-05-13 Elad Paran , Tran Nam Son

For a field $F$ and an integer $d\geq 1$, we consider the universal associative $F$-algebra $A$ generated by two sets of $d+1$ mutually orthogonal idempotents. We display four bases for the $F$-vector space $A$ that we find attractive. We…

Rings and Algebras · Mathematics 2009-06-23 Tatsuro Ito , Paul Terwilliger

We introduce determinantal sieving, a new, remarkably powerful tool in the toolbox of algebraic FPT algorithms. Given a polynomial $P(X)$ on a set of variables $X=\{x_1,\ldots,x_n\}$ and a linear matroid $M=(X,\mathcal{I})$ of rank $k$,…

Data Structures and Algorithms · Computer Science 2025-10-08 Eduard Eiben , Tomohiro Koana , Magnus Wahlström