SearcharxivSearch

arXiv subjects

Matthias Orth

Publications and source records attributed to Matthias Orth.

6 recordsLinked to original sources

Relative Gr\"obner bases of modules and applications in persistence theory

Finitely generated modules over the polynomial ring in $n$ indeterminates are isomorphic to quotients of finite rank free modules. We introduce a theory of relative Gr\"obner bases for those quotients of free modules and, equivalently, for pairs of submodules; we prove corresponding Buchberger- and Schreyer-type theorems. As applications of this theory, we consider three problems in persistence theory, which can be solved by relative Gr\"obner bases. First, we show that the relative Schreyer's theorem can be used to compute free presentations of complexes of finitely generated torsion-free modules. In contrast to previous approaches, this allows computation of free presentations for multicritical persistent homology directly at the chain module level without additional topological constructions. Second, any finitely generated Artinian module embeds in an Artinian injective hull, giving rise to a flat-injective presentation. We represent the embedding of the module in this injective hull by a quotient of a free module and apply the relative Schreyer's theorem to construct an algorithm for the computation of a free presentation from a flat-injective presentation. Third, we investigate how free presentations, and more generally free resolutions, obtained by the two preceding applications can be minimized by standard reduction techniques.

math.AC

The Gr\"obner basis for powers of a general linear form in a monomial complete intersection

We study almost complete intersection ideals in a polynomial ring, generated by powers of all the variables together with a power of their sum. Our main result is an explicit description of the reduced Gr\"obner bases for these ideals under any term order. Our approach is primarily combinatorial, focusing on the structure of the initial ideal. We associate a lattice path to each monomial in the vector space basis of an Artinian monomial complete intersection and introduce a reflection operation on these paths, which enables a key counting argument. As a consequence, we provide a new proof that Artinian monomial complete intersections possess the strong Lefschetz property over fields of characteristic zero. Our results also offer new insights into the longstanding problem of classifying the weak Lefschetz property for such intersections in characteristic $p$. Furthermore, we show that the number of Gr\"obner basis elements in each degree is connected to several well-known sequences, including the (generalized) Catalan, Motzkin, and Riordan numbers, and connect these numbers to the study of entanglement detection in spin systems within quantum physics.

math.AC

Gr\"obner bases, resolutions, and the Lefschetz properties for powers of a general linear form in the squarefree algebra

For the almost complete intersection ideals $(x_1^2, \dots, x_n^2, (x_1 + \cdots + x_n)^k)$, we compute their reduced Gr\"obner basis for any term ordering, revealing a combinatorial structure linked to lattice paths, elementary symmetric polynomials, and Catalan numbers. Using this structure, we classify the weak Lefschetz property for these ideals. Additionally, we provide a new proof of the well-known result that the squarefree algebra satisfies the strong Lefschetz property. Finally, we compute the Betti numbers of the initial ideals and construct a minimal free resolution using a Mayer-Vietoris tree approach.

math.AC

Cohen-Macaulay, Gorenstein and complete intersection conditions by marked bases

Using techniques coming from the theory of marked bases, we develop new computational methods for detection and construction of Cohen-Macaulay, Gorenstein and complete intersection homogeneous polynomial ideals. Thanks to the functorial properties of marked bases, an elementary and effective proof of the openness of arithmetically Cohen-Macaulay, arithmetically Gorenstein and strict complete intersection loci in a Hilbert scheme follows, for a non-constant Hilbert polynomial.

math.AC

On the minimal free resolution of the Rees algebra of tri-generated bivariate monomial ideals

Let $I$ be a monomial ideal in two variables generated by three monomials and let $\mathcal{R}(I)$ be its Rees ideal. We describe an algorithm to compute the minimal generating set of $\mathcal{R}(I)$. Based on the data obtained by this algorithm, we build a graph that encodes the minimal free resolution of $\mathcal{R}(I)$. We explicitly describe the modules and differentials on the minimal free resolution of $\mathcal{R}(I)$.

math.AC

Open Covers and Lex Points of Hilbert schemes over quotient rings via relative marked bases

We introduce the notion of a relative marked basis over quasi-stable ideals, together with constructive methods and a functorial interpretation, developing computational methods for the study of Hilbert schemes over quotients of polynomial rings. Then we focus on two applications. The first has a theoretical flavour and produces an explicit open cover of the Hilbert scheme when the quotient ring is Cohen-Macaulay on quasi-stable ideals. Together with relative marked bases, we use suitable general changes of variables which preserve the structure of the quasi-stable ideal, against the expectations. The second application has a computational flavour. When the quotient rings are Macaulay-Lex on quasi-stable ideals, we investigate the lex-point of the Hilbert schemes and find examples of both smooth and singular lex-points.

math.AC