Searcharxiv⌕ Search

arXiv subjects

Aldo Conca

Publications and source records attributed to Aldo Conca.

At least 19 recordsLinked to original sources
arXiv2025

Generalized binomial edge ideals are Cartwright-Sturmfels

Binomial edge ideals associated to a simple graph G were introduced by Herzog and collaborators and, independently, by Ohtani. They became an ``instant classic" in combinatorial commutative algebra with more than 100 papers devoted to their investigation over the past 15 years. They exhibit many striking properties, including being radical and, moreover, Cartwright-Sturmfels. Using the fact that binomial edge ideals can be seen as ideals of 2-minors of a matrix of variables with two rows, generalized binomial edge ideals of 2-minors of matrices of m rows were introduced by Rauh and proved to be radical. The goal of this paper is to prove that generalized binomial edge ideals are Cartwright-Sturmfels. On the way we provide results on ideal constructions preserving the Cartwright-Sturmfels property. We also give examples and counterexamples to the Cartwright-Sturmfels property for higher minors.

math.AC↗
arXiv2025

Sagbi bases, defining ideals and algebra of minors

This paper extends the article of the Bruns and Conca on SAGBI bases and their computation (J. Symb. Comput. 120 (2024)) in two directions. (i) We describe the extension of the Singular library sagbiNormaliz.sing to the computation of defining ideals of subalgebras of polynomial rings. (ii) We give a complete classification of the algebras of minors for which the generating set is a SAGBI basis with respect to a suitable monomial order and we identify universal SAGBI basis in three cases. The investigation is illustrated by several examples.

math.AC↗
arXiv2025

F-singularities of polynomials with square-free support

We show that the intersection of the irreducible components of a hypersurface defined by a polynomial with square-free support has F-rational singularities in characteristic $p>0$. As a consequence, we obtain that hypersurfaces defined by irreducible polynomials with square-free support have F-rational singularities, positively answering a question of Bath, Musta\c{t}\u{a}, and Walther.

math.AC↗
arXiv2024

Ideals generated by power sums

We consider ideals in a polynomial ring generated by collections of power sum polynomials, and obtain conditions under which these define complete intersection rings, normal domains, and unique factorization domains. We also settle a key case of a conjecture of Conca, Krattenthaler, and Watanabe, and prove other results in that direction.

math.AC↗
arXiv2024

Invariant rings of the special orthogonal group have nonunimodal $h$-vectors

For $K$ an infinite field of characteristic other than two, consider the action of the special orthogonal group $\operatorname{SO}_t(K)$ on a polynomial ring via copies of the regular representation. When $K$ has characteristic zero, Boutot's theorem implies that the invariant ring has rational singularities; when $K$ has positive characteristic, the invariant ring is $F$-regular, as proven by Hashimoto using good filtrations. We give a new proof of this, viewing the invariant ring for $\operatorname{SO}_t(K)$ as a cyclic cover of the invariant ring for the corresponding orthogonal group; this point of view has a number of useful consequences, for example it readily yields the $a$-invariant and information on the Hilbert series. Indeed, we use this to show that the $h$-vector of the invariant ring for $\operatorname{SO}_t(K)$ need not be unimodal.

math.AC↗
arXiv2024

A universal tale of determinants and Gr\"obner bases

In 1965 Buchberger defined Gr\"obner bases and an algorithm to compute them. Despite a slow start, already in the eighties Gr\"obner bases had become the main device for symbolic computations involving polynomials as well as a theoretical tool for the investigation of ideals and varieties via the so-called Gr\"obner deformation techniques. Rings and algebraic varieties defined by means of determinants are among the most classical objects in commutative algebra, algebraic geometry and invariant theory. By the end of the the eighties the time was ripe for the computation of Gr\"obner bases of determinantal ideals. We will tell the tale of how (universal) Gr\"obner bases of determinantal ideals were identified and the key role played by Bernd Sturmfels and his collaborators in this enterprise.

math.AC↗
arXiv2024

On the Castelnuovo-Mumford regularity of subspace arrangements

Let $X$ be the union of $n$ generic linear subspaces of codimension $>1$ in $\mathbb{P}^d$. Improving an earlier bound due to Derksen and Sidman, we prove that the Castelnuovo-Mumford regularity of $X$ satisfies $ \operatorname{reg}(X) \le n - [n / (2d-1)]$.

math.AC↗
arXiv2023

A note on the $v$-invariant

Let $R$ be a finitely generated $\mathbb N$-graded algebra domain over a Noetherian ring and let $I$ be a homogeneous ideal of $R$. Given $P\in Ass(R/I)$ one defines the $v$-invariant $v_P(I)$ of $I$ at $P$ as the least $c\in \mathbb N$ such that $P=I:f$ for some $f\in R_c$. A classical result of Brodmann asserts that $Ass(R/I^n)$ is constant for large $n$. So it makes sense to consider a prime ideal $P\in Ass(R/I^n)$ for all the large $n$ and investigate how $v_P(I^n)$ depends on $n$. We prove that $v_P(I^n)$ is eventually a linear function of $n$. When $R$ is the polynomial ring over a field this statement has been proved independently also by Ficarra and Sgroi in a recent preprint.

math.AC↗
arXiv2023

Taylor Polynomials of Rational Functions

A Taylor variety consists of all fixed order Taylor polynomials of rational functions, where the number of variables and degrees of numerators and denominators are fixed. In one variable, Taylor varieties are given by rank constraints on Hankel matrices. Inversion of the natural parametrization is known as Pad\'e approximation. We study the dimension and defining ideals of Taylor varieties. Taylor hypersurfaces are interesting for projective geometry, since their Hessians tend to vanish. In three and more variables, there exist defective Taylor varieties whose dimension is smaller than the number of parameters. We explain this with Fr\"oberg's Conjecture in commutative algebra.

math.AG↗
arXiv2023

Sagbi combinatorics of maximal minors and a Sagbi algorithm

The maximal minors of a matrix of indeterminates are a universal Gr\"obner basis by a theorem of Bernstein, Sturmfels and Zelevinsky. On the other hand it is known that they are not always a universal Sagbi basis. By an experimental approach we discuss their behavior under varying monomial orders and their extensions to Sagbi bases. These experiments motivated a new implementation of the Sagbi algorithm which is organized in a Singular script and falls back on Normaliz for the combinatorial computations. In comparison to packages in the current standard distributions of Macaulay 2 and Singular it extends the range of computability by at least one order of magnitude.

math.AC↗
arXiv2022

Multidegrees, prime ideals, and non-standard gradings

We study several properties of multihomogeneous prime ideals. We show that the multigraded generic initial ideal of a prime has very special properties, for instance, its radical is Cohen-Macaulay. We develop a comprehensive study of multidegrees in arbitrary positive multigraded settings. In these environments, we extend the notion of Cartwright-Sturmfels ideals by means of a standardization technique. Furthermore, we recover or extend important results in the literature, for instance: we provide a multidegree version of Hartshorne's result stating the upper semicontinuity of arithmetic degree under flat degenerations, and we give an alternative proof of Brion's result regarding multiplicity-free varieties.

math.AC↗
arXiv2022

Radical support for multigraded ideals

Can one tell if an ideal is radical just by looking at the degrees of the generators? In general, this is hopeless. However, there are special collections of degrees in multigraded polynomial rings, with the property that any multigraded ideal generated by elements of those degrees is radical. We call such a collection of degrees a radical support. In this paper, we give a combinatorial characterization of radical supports. Our characterization is in terms of properties of cycles in an associated labelled graph. We also show that the notion of radical support is closely related to that of Cartwright-Sturmfels ideals. In fact, any ideal generated by multigraded generators whose multidegrees form a radical support is a Cartwright-Sturmfels ideal. Conversely, a collection of degrees such that any multigraded ideal generated by elements of those degrees is Cartwright-Sturmfels is a radical support.

math.AC↗
arXiv2021

Castelnuovo-Mumford regularity and powers

This note has two goals. The first is to give a short and self contained introduction to the Castelnuovo-Mumford regularity for standard graded ring $R$ over a general base ring. The second is to present a simple and concise proof of a classical result due to Cutkosky, Herzog and Trung and, independently, to Kodiyalam asserting that the regularity of powers of an homogeneous ideal $I$ of $R$ is eventually a linear function in $v$. Finally we show how the flexibility of the definition of the Castelnuovo-Mumford regularity over general base rings can be used to give a simple characterization of the ideals whose powers have a linear resolution in terms of the regularity of the Rees ring.

math.AC↗
arXiv2019

A characteristic free approach to secant varieties of triple Segre products

The goal of this short note is to study the secant varieties of the triple Segre product of type (1,a,b) by means of the standard tools of combinatorial commutative algebra. We reprove and extend to arbitrary characteristic results of Landsberg and Weyman regarding the defining ideal and the Cohen-Macaulay property of the secant varieties. Furthermore for these varieties we compute the degree and give a bound for their Castelnuovo-Mumford regularity which is sharp in many cases.

math.AC↗
arXiv2019

Resolution of ideals associated to subspace arrangements

Let $I_1,\dots,I_n$ be ideals generated by linear forms in a polynomial ring over an infinite field and let $J = I_1 \cdots I_n$. We describe a minimal free resolution of $J$ and show that it is supported on a polymatroid obtained from the underlying representable polymatroid by means of the so-called Dilworth truncation. Formulas for the projective dimension and Betti numbers are given in terms of the polymatroid as well as a characterization of the associated primes. Along the way we show that $J$ has linear quotients. In fact, we do this for a large class of ideals $J_P$, where $P$ is a certain poset ideal associated to the underlying subspace arrangement.

math.AC↗
arXiv2018

On Fr\"oberg-Macaulay conjectures for algebras

Macaulay's theorem and Fr\"oberg's conjecture deal with the Hilbert function of homogeneous ideals in polynomial rings $S$ over a field $K$. In this short note we present some questions related to variants of Macaulay's theorem and Fr\"oberg's conjecture for $K$-subalgebras of polynomial rings. In details, given a subspace $V$ of forms of degree $d$ we consider the $K$-subalgebra $K[V]$ of $S$ generated by $V$. What can be said about Hilbert function of $K[V]$? The analogy with the ideal case suggests several questions. To state them we start by recalling Macaulay's theorem, Fr\"oberg's conjecture and Gotzmann's persistence theorem for ideals. Then we presents the variants for $K$-subalgebras along with some partial results and examples.

math.AC↗
arXiv2018

An algebraic-geometric approach for linear regression without correspondences

Linear regression without correspondences is the problem of performing a linear regression fit to a dataset for which the correspondences between the independent samples and the observations are unknown. Such a problem naturally arises in diverse domains such as computer vision, data mining, communications and biology. In its simplest form, it is tantamount to solving a linear system of equations, for which the entries of the right hand side vector have been permuted. This type of data corruption renders the linear regression task considerably harder, even in the absence of other corruptions, such as noise, outliers or missing entries. Existing methods are either applicable only to noiseless data or they are very sensitive to initialization or they work only for partially shuffled data. In this paper we address these issues via an algebraic geometric approach, which uses symmetric polynomials to extract permutation-invariant constraints that the parameters $\xi^* \in \Re^n$ of the linear regression model must satisfy. This naturally leads to a polynomial system of $n$ equations in $n$ unknowns, which contains $\xi^*$ in its root locus. Using the machinery of algebraic geometry we prove that as long as the independent samples are generic, this polynomial system is always consistent with at most $n!$ complex roots, regardless of any type of corruption inflicted on the observations. The algorithmic implication of this fact is that one can always solve this polynomial system and use its most suitable root as initialization to the Expectation Maximization algorithm. To the best of our knowledge, the resulting method is the first working solution for small values of $n$ able to handle thousands of fully shuffled noisy observations in milliseconds.

cs.LG↗