English
Related papers

Related papers: Subalgebra Analogue to Standard Basis for Ideal

200 papers

The Gr\"obner basis detection (GBD) is defined as follows: Given a set of polynomials, decide whether there exists -and if "yes" find- a term order such that the set of polynomials is a Gr\"obner basis. This problem was shown to be NP-hard…

Computational Complexity · Computer Science 2011-05-04 Prabhanjan Ananth , Ambedkar Dukkipati

We take a unifying and new approach toward polynomial and trigonometric approximation in an arbitrary number of variables, resulting in a precise and general ready-to-use tool that anyone can easily apply in new situations of interest. The…

Classical Analysis and ODEs · Mathematics 2023-05-31 Marcel de Jeu

In this article we produce Groebner bases for the defining ideal of a monomial curve that corresponds to an almost arithmetic sequence of positive integers, correcting previous work of Sengupta,(2003).

Commutative Algebra · Mathematics 2007-05-23 Ibrahim Al-Ayyoub

In this paper, we introduce (almost) skew 2-nomial algebras and look for a one-sided or two-sided Gr\"obner basis theory for such algebras at a modest level. That is, we establish the existence of a skew multiplicative $K$-basis for every…

Rings and Algebras · Mathematics 2010-01-15 Huishi Li

In this paper, we elaborate Gr\"obner-Shirshov bases method for Leibniz (super)algebras. We show that there is a unique reduced Gr\"obner-Shirshov basis for every (graded) ideal of a free Leibniz (super)algebra. As applications, we…

Rings and Algebras · Mathematics 2020-08-12 Yuxiu Bai , Yuqun Chen

We introduce the general polynomial algebras characterizing a class of higher order superintegrable systems that separate in Cartesian coordinates. The construction relies on underlying polynomial Heisenberg algebras and their defining…

Mathematical Physics · Physics 2023-07-20 Danilo Latini , Ian Marquette , Yao-Zhong Zhang

The problem of computing the dimension of a left/right ideal in a group algebra F[G] of a finite group G over a field F is considered. The ideal dimension is related to the rank of a matrix originating from a regular left/right…

Information Theory · Computer Science 2019-09-09 Michele Elia , Elisa Gorla

We define Macaulay bases of modules, which are a common generalization of Groebner bases and Macaulay $H$-bases to suitably graded modules over a commutative graded $\mathbf{k}$-algebra, where the index sets of the two gradings may differ.…

Commutative Algebra · Mathematics 2021-08-10 Sujit Rao

For a finite group $G$, we introduce a generalization of norm relations in the group algebra $\mathbb Q[G]$. We give necessary and sufficient criteria for the existence of such relations and apply them to obtain relations between the…

Number Theory · Mathematics 2025-04-07 Jean-François Biasse , Claus Fieker , Tommy Hofmann , Aurel Page

The paper addresses parametric inequality systems described by polynomial functions in finite dimensions, where state-dependent infinite parameter sets are given by finitely many polynomial inequalities and equalities. Such systems can be…

Optimization and Control · Mathematics 2015-09-15 G. Li , B. S. Mordukhovich , T. T. A. Nghia , T. S. Pham

Let $A$ be a finite dimensional real algebra with a division grading by a finite abelian group $G$. In this paper we provide finite basis for the $T_G$-ideal of graded identities and for the $T_G$-space of graded central polynomials for…

Rings and Algebras · Mathematics 2021-07-28 Diogo Diniz , Claudemir Fidelis , Sérgio Mota

Leibniz algebras are non-antisymmetric generalizations of Lie algebras that have attracted substantial interest due to their close relation with the latter class. A Leibniz algebra $A$ is called perfect if it coincides with its derived…

Rings and Algebras · Mathematics 2025-09-09 Nikolaos Panagiotis Souris

Let $\Lambda$ be a commutative Noetherian ring, and let $I$ be a proper ideal of $\Lambda$, $R=\Lambda /I$. Consider the polynomial rings $T=\Lambda [x_1,...x_n]$ and $A=R[x_1,...,x_n]$. Suppose that linear equations are solvable in…

Rings and Algebras · Mathematics 2012-07-04 Huishi Li

Quaternionic polynomials occur naturally in applications of quaternions in science and engineering, and normalization of quaternionic polynomials is a basic manipulation. Once a Groebner basis is certified for the defining ideal I of the…

Symbolic Computation · Computer Science 2025-04-22 Hongbo Li , Zhengyang Wang , Yue Liu , Lei Huang , Changpeng Shao

Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…

Symbolic Computation · Computer Science 2022-07-04 Hiroshi Kera

In the context of the integration over algebras introduced in a previous paper, we obtain several results for a particular class of associative algebras with identity. The algebras of this class are called self-conjugated, and they include,…

Mathematical Physics · Physics 2009-10-31 R. Casalbuoni

A criterion for determining exactly when an order of a maximal subfield of a central simple algebra over a number field can be embedded into an order of this algebra is given. Various previous results have been generalized and recovered by…

Number Theory · Mathematics 2025-02-10 Jiaqi Xie , Fei Xu

We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…

Rings and Algebras · Mathematics 2025-06-24 Alberto Elduque , Mikhail Kochetov

We describe the ideals, especially the prime ideals, of semirings of polynomials over layered domains, and in particular over supertropical domains. Since there are so many of them, special attention is paid to the ideals arising from…

Commutative Algebra · Mathematics 2011-11-29 Zur Izhakian , Louis Rowen

Assuming sufficiently many terms of a n-dimensional table defined over a field are given, we aim at guessing the linear recurrence relations with either constant or polynomial coefficients they satisfy. In many applications, the table terms…

Symbolic Computation · Computer Science 2021-11-19 Jérémy Berthomieu , Mohab Safey El Din