English
Related papers

Related papers: Bipartite Determinantal Ideals and concurrent vert…

200 papers

Nakajima's graded quiver varieties naturally appear in the study of bases of cluster algebras. One particular family of these varieties, namely the bipartite determinantal varieties, can be defined for any bipartite quiver and gives a vast…

Commutative Algebra · Mathematics 2024-06-25 Josua Illian , Li Li

Following the approach in the book "Commutative Algebra", by D. Eisenbud, where the author describes the generic initial ideal by means of a suitable total order on the terms of an exterior power, we introduce first the generic initial…

Algebraic Geometry · Mathematics 2016-11-22 Cristina Bertone , Francesca Cioffi , Margherita Roggero

A certain squarefree monomial ideal $H_P$ arising from a finite partially ordered set $P$ will be studied from viewpoints of both commutative algebra and combinatorics. First, it is proved that the defining ideal of the Rees algebra of…

Commutative Algebra · Mathematics 2007-05-23 Juergen Herzog , Takayuki Hibi

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

alg-geom · Mathematics 2008-02-03 David Eisenbud , Bernd Sturmfels

This paper studies a class of binomial ideals associated to graphs with finite vertex sets. They generalize the binomial edge ideals, and they arise in the study of conditional independence ideals. A Gr\"obner basis can be computed by…

Commutative Algebra · Mathematics 2014-06-18 Johannes Rauh

For any finite poset $P$ we have the poset of isotone maps $\text{Hom}(P,\mathbb{N})$, also called $P^{op}$-partitions. To any poset ideal ${\mathcal J}$ in $\text{Hom}(P,\mathbb{N})$, finite or infinite, we associate monomial ideals: the…

Commutative Algebra · Mathematics 2018-04-26 Gunnar Fløystad

We present a new approach to the study of multiplier ideals in a local, two-dimensional setting. Our method allows us to deal with ideals, graded systems of ideals and plurisubharmonic functions in a unified way. Among the applications are…

Complex Variables · Mathematics 2007-05-23 Charles Favre , Mattias Jonsson

Abhyankar defined an ideal to be Hilbertian if its Hilbert polynomial coincides with its Hilbert function for all nonnegative integers. In 1984, he proved that the ideal of (r+1)-order minors of a generic p x q matrix is Hilbertian. We give…

Commutative Algebra · Mathematics 2026-01-16 Ada Stelzer , Alexander Yong

This paper investgates Stanley-Reisner ideals with pure resolutions. We first describe two infinite families of such ideals associated to highly symmetric complexes. We then prove a partial analogue to the first Boij-S\"oderberg Conjecture…

Commutative Algebra · Mathematics 2024-09-13 David Carey , Mordechai Katzman

Specht polynomials classically realize the irreducible representations of the symmetric group. The ideals defined by these polynomials provide a strong connection with the combinatorics of Young tableaux and have been intensively studied by…

Combinatorics · Mathematics 2023-05-30 Sebastian Debus , Philippe Moustrou , Cordian Riener , Hugues Verdure

In this article we study some algebraic aspects of multicomplex numbers $\mathbb M_n$. For $n\geq 2$ a canonical representation is defined in terms of the multiplication of $n-1$ idempotent elements. This representation facilitates…

Mathematical Physics · Physics 2025-01-23 Derek Courchesne , Sébastien Tremblay

We study initial algebras of determinantal rings, defined by minors of generic matrices, with respect to their classical generic point. This approach leads to very short proofs for the structural properties of determinantal rings. Moreover,…

Commutative Algebra · Mathematics 2021-05-18 Winfried Bruns , Tim Roemer , Attila Wiebe

We study birational maps with empty base locus defined by almost complete intersection ideals. Birationality is shown to be expressed by the equality of two Chern numbers. We provide a relatively effective method of their calculation in…

Commutative Algebra · Mathematics 2007-05-23 J. Hong , A. Simis , W. V. Vasconcelos

We study the structure of ideals generated by some classes of 2 \times 2 permanents of hypermatrices. This generalizes [9] on 2 x 2 permanental ideal of generic matrices. We compare the obtained structure to that of the corresponding…

Commutative Algebra · Mathematics 2012-05-28 Julia Porcino , Irena Swanson

We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…

Logic in Computer Science · Computer Science 2026-05-21 Arka Ghosh , Sławomir Lasota

This survey of methods surrounding lattice point methods for binomial ideals begins with a leisurely treatment of the geometric combinatorics of binomial primary decomposition. It then proceeds to three independent applications whose…

Commutative Algebra · Mathematics 2010-09-16 Ezra Miller

Strongly stable monomial ideals are important in algebraic geometry, commutative algebra, and combinatorics. Prompted, for example, by combinatorial approaches for studying Hilbert schemes and the existence of maximal total Betti numbers…

Commutative Algebra · Mathematics 2011-12-05 Dennis Moore , Uwe Nagel

We describe first-degree prime ideals of biquadratic extensions in terms of first-degree prime ideals of two underlying quadratic fields. The identification of the prime divisors is given by numerical conditions involving their ideal norms.…

Number Theory · Mathematics 2021-12-22 Giordano Santilli , Daniele Taufer

We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…

Commutative Algebra · Mathematics 2016-04-08 Thomas Kahle

We develop a probabilistic algorithm for computing elimination ideals of likelihood equations, which is for larger models by far more efficient than directly computing Groebner bases or the interpolation method proposed in the first…

Symbolic Computation · Computer Science 2018-10-15 Xiaoxian Tang , Timo De Wolff , Rukai Zhao
‹ Prev 1 2 3 10 Next ›