English
Related papers

Related papers: Converting Subalgebra Bases with the Sagbi Walk

200 papers

The maximal minors of a p by (m + p) matrix of univariate polynomials of degree n with indeterminate coefficients are themselves polynomials of degree np. The subalgebra generated by their coefficients is the coordinate ring of the quantum…

Algebraic Geometry · Mathematics 2007-05-23 Frank Sottile , Bernd Sturmfels

We consider the problem of constructing semisimple subalgebras of real (semi-) simple Lie algebras. We develop computational methods that help to deal with this problem. Our methods boil down to solving a set of polynomial equations. In…

Rings and Algebras · Mathematics 2013-10-02 Paolo Faccin , Willem A. de Graaf

In this paper we will define analogs of Gr\"obner bases for $R$-subalgebras and their ideals in a polynomial ring $R[x_1,\ldots,x_n]$ where $R$ is a noetherian integral domain with multiplicative identity and in which we can determine ideal…

Commutative Algebra · Mathematics 2009-09-25 J. Lyn Miller

If $A$ is a finite-dimensional algebra graded by a group $G$, and $\sigma \in G$, we define a variant of paratrophic matrix associated with $A$ and $\sigma$, and we use it to characterize the $\sigma$-graded Frobenius property for $A$. We…

Rings and Algebras · Mathematics 2025-12-18 Sorin Dascalescu , Constantin Nastasescu , Laura Nastasescu , Paul Rebenciuc

Recently Hashemi and Kapur published an algorithm [1] for Groebner basis conversion by truncating polynomials according to a source and a target monomial order. Here we present a counterexample to this algorithm.

Symbolic Computation · Computer Science 2025-10-08 Anna Nymann Heisel , Niels Lauritzen

By changing to an orthogonal basis, we give a short proof that the subfactor of the graded algebra of a planar algebra reproduces the planar algebra.

Operator Algebras · Mathematics 2008-07-28 Vaughan Jones , Dimitri Shlyakhtenko , Kevin Walker

We describe new algorithms to compute Whitney stratifications of real algebraic varieties. Using either conormal or polar techniques, these algorithms stratify a complexification of a given real variety. We then show that the resulting…

Algebraic Geometry · Mathematics 2025-09-03 Martin Helmer , Anton Leykin , Vidit Nanda

We study walk algebras and Hecke algebras for Kac-Moody root systems. Each choice of orientation for the set of real roots gives rise to a corresponding "oriented" basis for each of these algebras. We show that the notion of distinguished…

Representation Theory · Mathematics 2018-01-08 Dinakar Muthiah , Daniel Orr

We provide an algorithm that factorizes one-dimensional quantum walks into a protocol of two basic operations: A fixed conditional shift that transports particles between cells and suitable coin operators that act locally in each cell. This…

Quantum Physics · Physics 2025-12-09 C. Cedzich , T. Geib , R. F. Werner

In this paper we introduce an algebra embedding $\iota:K< X >\to S$ from the free associative algebra $K< X >$ generated by a finite or countable set $X$ into the skew monoid ring $S = P * \Sigma$ defined by the commutative polynomial ring…

Rings and Algebras · Mathematics 2012-05-24 Roberto La Scala , Viktor Levandovskyy

In this paper we briefly discuss \Rings --- an efficient lightweight library for commutative algebra. Polynomial arithmetic, GCDs, polynomial factorization and Gr\"obner bases are implemented with the use of modern asymptotically fast…

Symbolic Computation · Computer Science 2018-09-25 Stanislav Poslavsky

Gr{\"o}bner bases is one the most powerful tools in algorithmic non-linear algebra. Their computation is an intrinsically hard problem with a complexity at least single exponential in the number of variables. However, in most of the cases,…

Symbolic Computation · Computer Science 2019-02-04 Matías Bender , Jean-Charles Faugère , Elias Tsigaridas

In this paper, we suggest a new efficient algorithm in order to compute S-polynomial reduction rapidly in the known algorithm for computing Grobner bases, and compare the complexity with others.

Symbolic Computation · Computer Science 2015-07-14 Yong-Jin Kim , Hyon-Song Paek , Nam-Chol Kim , Chong-Il Byon

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

Symbolic Computation · Computer Science 2010-10-04 Yao Sun , Dingkang Wang

In this paper, we characterized the relationship between Groebner bases and u-bases: any minimal Groebner basis of the syzygy module for n univariate polynomials with respect to the term-over-position monomial order is its u-basis.…

Symbolic Computation · Computer Science 2021-01-01 Dingkang Wang , Hesong Wang , Fanghui Xiao

Let $\mathrm{R}$ be a real closed field, and $\mathrm{D} \subset \mathrm{R}$ an ordered domain. We describe an algorithm that given as input a polynomial $P \in \mathrm{D} [ X_{1},\ldots,X_{k} ]$, and a finite set, $\mathcal{A}= \{ p_{1},…

Algebraic Geometry · Mathematics 2016-10-11 Saugata Basu , Marie-Francoise Roy

We have developed a patch implementing multivariate polynomials seen as a multi-base algebra. The patch is to be released into the software Sage and can already be found within the Sage-Combinat distribution. One can use our patch to define…

Combinatorics · Mathematics 2012-07-03 Viviane Pons

Let $\mathrm{R}$ be a real closed field and $\mathrm{C}$ the algebraic closure of $\mathrm{R}$. We give an algorithm for computing a semi-algebraic basis for the first homology group, $\mathrm{H}_1(S,\mathbb{F})$, with coefficients in a…

Algebraic Geometry · Mathematics 2021-07-20 Saugata Basu , Sarah Percival

Let K be an algebraic number field of degree d and discriminant D over Q. Let A be an associative algebra over K given by structure constants such that A is isomorphic to the algebra M_n(K) of n by n matrices over K for some positive…

Rings and Algebras · Mathematics 2011-12-22 Gábor Ivanyos , Lajos Rónyai , Josef Schicho

Let $\mathbb{K}$ be an algebraically closed field, and $A \subset \mathbb{K}[x_{1}, \ldots, x_n]$ be a subalgebra of finite codimension. It is known that there exists a (not necessarily unique) finite filtration of $\mathbb{K}$-algebras \[…

Commutative Algebra · Mathematics 2026-03-26 Erik Leffler