English
Related papers

Related papers: Non-Commutative Gebauer-Moeller Criteria

200 papers

There are two kinds of polynomial functions on matrix algebras over commutative rings: those induced by polynomials with coefficients in the algebra itself and those induced by polynomials with scalar coefficients. In the case of algebras…

Rings and Algebras · Mathematics 2016-10-27 Sophie Frisch

In this paper, we extend the characterization of $\mathbb{Z}[x]/\ < f \ >$, where $f \in \mathbb{Z}[x]$ to be a free $\mathbb{Z}$-module to multivariate polynomial rings over any commutative Noetherian ring, $A$. The characterization allows…

Symbolic Computation · Computer Science 2016-04-05 Maria Francis , Ambedkar Dukkipati

We consider a non-commutative polynomial in several independent $N$-dimensional random unitary matrices, uniformly distributed over the unitary, orthogonal or symmetric groups, and assume that the coefficients are $n$-dimensional matrices.…

Probability · Mathematics 2024-01-11 Charles Bordenave , Benoit Collins

We define the Buchberger resolution, which is a graded free resolution of a monomial ideal in a polynomial ring. Its construction uses a generalization of the Buchberger graph and encodes much of the combinatorics of the Buchberger…

Commutative Algebra · Mathematics 2014-09-12 Anda Olteanu , Volkmar Welker

We propose to extend ``invertibility'' to ``regularity'' for categories in general abstract algebraic manner. Higher regularity conditions and ``semicommutative'' diagrams are introduced. Distinction between commutative and…

Mathematical Physics · Physics 2007-05-23 Steven Duplij , Wladyslaw Marcinek

Considering commutator monomials of the non-commutative associative variables $X_1,\ldots,X_n$; we determine the maximal possible number of alternating associative monomials in their noncommutative polynomial expansions. This is achieved by…

Combinatorics · Mathematics 2024-02-14 Gyula Lakos

Positively graded algebras are fairly natural objects which are arduous to be studied. In this article we query quotients of non-standard graded polynomial rings with combinatorial and commutative algebra methods.

Commutative Algebra · Mathematics 2007-05-23 G. Dalzotto , E. Sbarra

For the last almost three decades, since the famous Buchberger-M\"oller(BM) algorithm emerged, there has been wide interest in vanishing ideals of points and associated interpolation polynomials. Our paradigm is based on the theory of…

Commutative Algebra · Mathematics 2010-01-11 Xiaoying Wang , Shugong Zhang , Tian Dong

The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…

Logic in Computer Science · Computer Science 2019-03-08 Thomas Powell , Peter M Schuster , Franziskus Wiesnet

We study matrices whose entries are free or exchangeable noncommutative elements in some tracial $W^*$-probability space. More precisely, we consider operator-valued Wigner and Wishart matrices and prove quantitative convergence to…

Probability · Mathematics 2022-02-16 Marwa Banna , Guillaume Cébron

The main result of this article establishes the free analog of Grothendieck's Theorem on bijective polynomial mappings of $\mathbb{C}^g$. Namely, we show if $p$ is a polynomial mapping in $g$ freely non-commuting variables sending…

Rings and Algebras · Mathematics 2018-10-03 Meric L. Augat

We introduce and study equivariant Hilbert series of ideals in polynomial rings in countably many variables that are invariant under a suitable action of a symmetric group or the monoid $Inc(\mathbb{N})$ of strictly increasing functions.…

Commutative Algebra · Mathematics 2021-05-18 Uwe Nagel , Tim Roemer

We prove conditions ensuring that a Lie ideal or an invariant additive subgroup in a ring contains all additive commutators. A crucial assumption is that the subgroup is fully noncentral, that is, its image in every quotient is noncentral.…

Rings and Algebras · Mathematics 2025-03-04 Eusebio Gardella , Tsiu-Kwen Lee , Hannes Thiel

We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…

Number Theory · Mathematics 2007-05-23 Mathias Lederer

It is shown how to compute quotients efficiently in non-commutative univariate polynomial rings. This extends earlier work where efficient generic quotients were studied with a primary focus on commutative domains. Fast algorithms are given…

Symbolic Computation · Computer Science 2023-06-29 Stephen M. Watt

This is a survey of recent progress in several areas of combinatorial algebra. We consider combinatorial problems about free groups, polynomial algebras, free associative and Lie algebras. Our main idea is to study automorphisms and, more…

Group Theory · Mathematics 2016-09-07 Alexander A. Mikhalev , Vladimir Shpilrain , Jie-Tai Yu

Two fundamental questions in the theory of Groebner bases are decision ("Is a basis G of a polynomial ideal a Groebner basis?") and transformation ("If it is not, how do we transform it into a Groebner basis?") This paper considers the…

Commutative Algebra · Mathematics 2019-02-20 John Perry

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

This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.

Commutative Algebra · Mathematics 2023-06-19 Deepak Kapur , Paliath Narendran

The algebraic diversity framework generalizes temporal averaging over multiple observations to algebraic group action on a single observation for second-order statistical estimation. The central open problem in this framework is…

Machine Learning · Computer Science 2026-05-11 Mitchell A. Thornton