English
Related papers

Related papers: On Gr\"obner bases over Dedekind domains

200 papers

It has been shown previously that a large class of monomial maps equivariant under the action of an infinite symmetric group have finitely generated kernels up to the symmetric action. We prove that these symmetric toric ideals also have…

Commutative Algebra · Mathematics 2016-04-29 Robert Krone

The theory of border bases for zero-dimensional ideals has attracted several researchers in symbolic computation due to their numerical stability and mathematical elegance. As shown in (Francis & Dukkipati, J. Symb. Comp., 2014), one can…

Symbolic Computation · Computer Science 2017-02-03 Ambedkar Dukkipati , Nithish Pai , Maria Francis

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

The new type of ideal basis introduced herein constitutes a compromise between the Gr\"obner bases based on the Buchberger's algorithm and the characteristic sets based on the Wu's method. It reduces the complexity of the traditional…

Symbolic Computation · Computer Science 2022-02-22 Sheng-Ming Ma

Several problems in algebraic geometry and coding theory over finite rings are modeled by systems of algebraic equations. Among these problems, we have the rank decoding problem, which is used in the construction of public-key cryptography.…

Information Theory · Computer Science 2023-04-18 Hermann Tchatchiem Kamche , Hervé Talé Kalachi

The paper studies some properties of the ring of integer-valued quasi-polynomials. On this ring, theory of generalized Euclidean division and generalized GCD are presented. Applications to finite simple continued fraction expansion and…

Number Theory · Mathematics 2007-09-20 Nan Li , Sheng Chen

A commutative ring R has finite rank r, if each ideal of R is generated at most by r elements. A commutative ring R has the r-generator property, if each finitely generated ideal of R can be generated by r elements. Such rings are closely…

Commutative Algebra · Mathematics 2021-03-30 V. A. Bovdi , L. A. Kurdachenko

In this article, we study the monoid of fractional ideals and the ideal class semigroup of an arbitrary given one dimensional normal domain O obtained by an infinite integral extension of a Dedekind domain. We introduce a notion of "upper…

Number Theory · Mathematics 2018-04-18 Tatsuya Ohshita

In his Ph.D. thesis, Sean Griffin introduced a family of ideals and found monomial bases for their quotient rings. These rings simultaneously generalize the Delta Conjecture coinvariant rings of Haglund-Rhoades-Shimozono and the cohomology…

Combinatorics · Mathematics 2023-08-01 Tianyi Yu

In this paper we generalize the classical Groebner basis technique to prove the existence and present a method of computation of a dimension polynomial in two variables associated with a finitely generated D-module, that is, a finitely…

Rings and Algebras · Mathematics 2012-12-11 Christian Dönch , Alexander Levin

This habilitation (German variant of a PhD on top of a PhD) thesis presents the quintessence of the ideas and experiences with Groebner Bases of Birgit Reinert. She died unexpectedly without providing an abstract. As arXiv requires an…

Rings and Algebras · Mathematics 2009-03-29 Birgit Reinert

We introduce the notion of Groebner S-basis of an ideal of the free associative algebra K<X> over a field K invariant under the action of a semigroup S of endomorphisms of the algebra. We calculate the Groebner S-bases of the ideal…

Rings and Algebras · Mathematics 2007-05-23 Vesselin Drensky , Roberto La Scala

Let G be a finite graph on [n] = {1,2,3,...,n}, X a 2 times n matrix of indeterminates over a field K, and S = K[X] a polynomial ring over K. In this paper, we study about ideals I_G of S generated by 2-minors [i,j] of X which correspond to…

Commutative Algebra · Mathematics 2009-11-16 Masahiro Ohtani

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…

Rings and Algebras · Mathematics 2017-03-30 Dandan Huang , Yingpu Deng

In this paper, we extend the idea of comprehensive Gr\"{o}bner bases given by Weispfenning (1992) to border bases for zero dimensional parametric polynomial ideals. For this, we introduce a notion of comprehensive border bases and border…

Symbolic Computation · Computer Science 2013-12-31 Abhishek Dubey , Ambedkar Dukkipati

In this article, we compile the work done by various mathematicians on the topic of the fixed divisor of a polynomial. This article explains most of the results concisely and is intended to be an exhaustive survey. We present the results on…

Number Theory · Mathematics 2020-09-02 Devendra Prasad , Krishnan Rajkumar , A. Satyanarayana Reddy

In this paper we study the extent to which Golodness may be transferred along morphisms of DG-algebras. In particular, we show that if $I$ is a so-called fiber invariant ideal, then Golodness of $I$ is equivalent to Golodness of the initial…

Commutative Algebra · Mathematics 2022-02-10 Keller VandeBogert

This paper is a survey on the study of the behaviour of the composition of polynomials on the computation of Gr\"obner bases. This survey brings together some works published between 1995 and 2007. The authors of these papers gave answers…

Commutative Algebra · Mathematics 2018-02-01 Mahmoud S. Alsersawi , Manuel Ladra

The main result of this paper is a generalization of the theorem of Chevalley-Shephard-Todd to the rings of invariants of pseudoreflection groups over Dedekind domains. In the special case of a principal ideal domain in which the group…

Commutative Algebra · Mathematics 2022-05-30 David Mundelius

We focus on Gr\"obner bases for modules of univariate polynomial vectors over a ring. We identify a useful property, the "predictable leading monomial (PLM) property" that is shared by minimal Gr\"{o}bner bases of modules in F[x]^q, no…

Information Theory · Computer Science 2010-12-24 M. Kuijper , K. Schindelar
‹ Prev 1 4 5 6 7 8 10 Next ›