English
Related papers

Related papers: Generalised Hilbert Numerators II

200 papers

Gr\"{o}bner bases are nowadays central tools for solving various problems in commutative algebra and algebraic geometry. A typical use of Gr\"{o}bner bases is the multivariate polynomial system solving, which enables us to construct…

Symbolic Computation · Computer Science 2024-03-05 Momonari Kudo , Kazuhiro Yokoyama

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over the field $K$, and let $I\subset S$ be a graded ideal. It is shown that for $k \gg0$ the postulation number of $I^k$ is bounded by a linear function of $k$, and it is a linear function…

Algebraic Geometry · Mathematics 2017-04-24 Seyed Shahab Arkian , Amir Mafi

In [4] Sturmfels linked the Hilbert Nullstellensatz to Gr\"obner bases through final polynomials. In (loc. cit.) it was claimed that final polynomials always appear in a lexicographic Gr\"obner basis of a certain ideal. In this paper, we…

Commutative Algebra · Mathematics 2024-05-28 Peter Lundgaard , Andreas Bøgh Poulsen

Motivated by better understanding the bideterminant (=product of minors) basis on the polynomial ring in $n \times m$ variables, we develop theory \& algorithms for Gr\"obner bases in not only algebras with straightening law (ASLs or Hodge…

Commutative Algebra · Mathematics 2025-10-14 Joshua A. Grochow , Abhiram Natarajan

We will use commutators to provide decompositions of $3\times 3$ matrices as sums whose terms satisfy some polynomial identities, and we apply them to bounded linear operators and endomorphisms of free modules of infinite rank. In…

Rings and Algebras · Mathematics 2022-09-08 Simion Breaz , Cristian Rafiliu

We study determinants of matrices whose entries are powers of Fibonacci numbers. We then extend the results to include entries that are powers of generalized Fibonacci numbers defined as a second-order linear recurrence relation. These…

Combinatorics · Mathematics 2016-08-02 Aram Tangboonduangjit , Thotsaporn Thanatipanonda

We introduce and study the toric fiber product of two ideals in polynomial rings that are homogeneous with respect to the same multigrading. Under the assumption that the set of degrees of the variables form a linearly independent set, we…

Commutative Algebra · Mathematics 2007-05-23 Seth Sullivant

We outline a generalization of the Groebner fan of a homogeneous ideal with maximal cells parametrizing truncated Groebner bases. This "truncated" Groebner fan is usually much smaller than the full Groebner fan and offers the natural…

Commutative Algebra · Mathematics 2007-05-23 Niels Lauritzen

We continue a very fruitful line of inquiry into the multiplicative ideal theory of an arbitrary Leavitt path algebra L. Specifically, we show that factorizations of an ideal in L into irredundant products or intersections of finitely many…

Rings and Algebras · Mathematics 2023-04-25 Zachary Mesyan , Kulumani M. Rangaswamy

Let R be the quotient of a polynomial ring over a field k by an ideal generated by monomials. We derive a formula for the multigraded Poincare' series of R, i.e., the generating function for the ranks of the modules in a minimal multigraded…

Commutative Algebra · Mathematics 2010-10-19 Alexander Berglund

In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…

Commutative Algebra · Mathematics 2010-12-24 Cristina Bertone

We generalize the Umbral Calculus of G-C. Rota by studying not only sequences of polynomials and inverse power series, or even the logarithms studied in, but instead we study sequences of formal expressions involving the iterated logarithms…

Combinatorics · Mathematics 2016-09-06 Daniel E. Loeb

We present algorithms for computing the reduced Gr\"{o}bner basis of the vanishing ideal of a finite set of points in a frame of ideal interpolation. Ideal interpolation is defined by a linear projector whose kernel is a polynomial ideal.…

Commutative Algebra · Mathematics 2024-01-17 Xue Jiang , Yihe Gong

Let $d_1,...,d_r$ be positive integers and let $I = (F_1,...,F_r)$ be an ideal generated by general forms of degrees $d_1,...,d_r$, respectively, in a polynomial ring $R$ with $n$ variables. When all the degrees are the same we give a…

Commutative Algebra · Mathematics 2007-05-23 J. Migliore , R. M. Miró-Roig

In the framework of abstract linear inverse problems in infinitedimensional Hilbert space we discuss generic convergence behaviours of approximate solutions determined by means of general projection methods, namely outside the standard…

Numerical Analysis · Mathematics 2021-02-22 Noe Caruso , Alessandro Michelangeli , Paolo Novati

Bounds for the Castelnuovo-Mumford regularity and Hilbert coefficients are given in terms of the arithmetic degree (if the ring is reduced) or in terms of the defining degrees. From this it follows that there exists only a finite number of…

Commutative Algebra · Mathematics 2018-09-21 Lê Tuân Hoa

Let $\cal R$ be either the Grothendieck semiring (semiring with multiplication) of complex algebraic varieties, or the Grothendieck ring of these varieties, or the Grothendieck ring localized by the class of the complex affine line. We…

Algebraic Geometry · Mathematics 2007-05-23 S. M. Gusein-Zade , I. Luengo , A. Melle-Hernandez

In this expositional paper, we discuss commutative algebra -- a study inspired by the properties of integers, rational numbers, and real numbers. In particular, we investigate rings and ideals, and their various properties. After, we…

Algebraic Geometry · Mathematics 2021-10-19 Marc Maliar

We study the set of circuits of a homogeneous ideal and that of its truncations, and introduce the notion of generic circuits set. We show how this is a well-defined invariant that can be used, in the case of initial ideals with respect to…

Commutative Algebra · Mathematics 2013-09-23 Giulio Caviglia , Enrico Sbarra

We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…

Algebraic Geometry · Mathematics 2014-02-26 Pierrette Cassou-Noguès , Willem Veys
‹ Prev 1 4 5 6 7 8 10 Next ›