SearcharxivSearch

arXiv subjects

Alexandra Seceleanu

Publications and source records attributed to Alexandra Seceleanu.

At least 19 recordsLinked to original sources

Symbolic Powers and Asymptotic Invariants of GL-Invariant Ideals

This work concerns ideals invariant under the action of the group of linear base changes on a generic matrix; we call these GL-invariant ideals. We determine the ordinary powers, their saturations with respect to determinantal ideals, and the symbolic powers of GL-invariant ideals. We give explicit formulas for asymptotic invariants known as (skew) Waldschmidt constants and asymptotic resurgence, which measure the growth of these families and compare the ordinary and symbolic topologies. We also prove that the generalized symbolic Rees algebras associated with these ideals are Noetherian.

math.AC

Betti numbers of inductively pierced codes

Neural ideals were introduced by Curto, Itskov, et al as an algebraic tool to study neural codes. In this paper, we use the notion of polarization introduced by G\"{u}nt\"{u}rk\"{u}n, Jeffries, and Sun to compute Betti numbers of inductively pierced neural codes. We prove that quadratically generated neural ideals are inductively pierced if and only if they have regularity 2. Further, we demonstrate how the Betti numbers yield information on the number and type of piercings of the original code. This work shows the utility of algebraic invariants of the neural ideal in detecting geometric features of the associated receptive fields.

math.AC

Weighted Veronese Rings via Convex Semigroups

We determine properties of two-dimensional normal affine semigroup rings, and in particular of weighted Veronese rings, including determinantal presentation, Gr\"obner basis, graded Hilbert series and graded Betti numbers, the structure of their associated graded rings, and their Koszul property. We give examples in higher dimensions illustrating that the first and last properties may fail. Our approach leverages convex monomial ideals as introduced in Herzog-Qureshi-Saem(2019), which give rise to convex semigroups.

math.AC

Adjoints of Morphisms of Neural Codes

A combinatorial code $\mathcal{C}$ is a collection of subsets of $[n]$, or equivalently a set of points in $\{0,1\}^n$. A morphism of codes is a map from one combinatorial code to another such that the coordinates of points in the image can be expressed as products of coordinates in the domain. By representing morphisms of codes as binary matrices, we show that any morphism of codes is part of a Galois connection where its adjoint is boolean multiplication by the representative matrix. We use this to characterize those morphisms of codes which allow to factor a boolean matrix, with applications to estimating boolean matrix rank. Morphisms also induce a partial order on (isomorphism classes of) codes. We determine the covering relations in this partial order for which the two adjoint maps are mutual inverses in terms of \emph{free} neurons, a combinatorial condition on the index corresponding to the covering maps. We introduce the \emph{defect} of a code as a new tool to study this poset and show that defect decreases by exactly 0 or 1 under a covering map.

math.CO

Seshadri Regions and the Asymptotic Shape of Multigraded Regularity

We introduce the Seshadri region of a subvariety, a convex region packaging the classical Seshadri constants with respect to every line bundle simultaneously. We develop the theory of Seshadri regions as a measure of positivity along subvarieties and apply it to determine asymptotic Castelnuovo-Mumford regularity for ideal powers and symmetric powers on smooth projective toric varieties.

math.AG

The MacaulayPosets package for Macaulay2

We introduce the package MacaulayPosets written for the computational algebra system Macaulay2. This package utilized the poset data type introduced in the Posets package and offers functionality for studying the Macaulay property for posets, particularly those which arise as monomial posets of commutative rings. A Macaulay poset is characterized by a ranked structure and a total order that interacts harmoniously with the partial order, enabling the establishment of bounds on the sizes of subsets of a given rank within an order ideal.

math.AC

Boolean Rank via Monomial Ideals

Boolean matrix factorization (BMF) has many applications in data mining, bioinformatics, and network analysis. The goal of BMF is to decompose a given binary matrix as the Boolean product of two smaller binary matrices, revealing underlying structure in the data. When interpreting a binary matrix as the adjacency matrix of a bipartite graph, BMF is equivalent to the NP-hard biclique cover problem. By approaching this problem through the lens of commutative algebra, we utilize algebraic structures and techniques--particularly the Castelnuovo-Mumford regularity of combinatorially defined ideals--to establish new lower bounds for Boolean matrix rank.

math.AC

Multicomplex Configurations: a case study in Gorenstein Liaison

We introduce and investigate multicomplex configurations, a class of projective varieties constructed via specialization of the polarizations of Artinian monomial ideals. Building upon geometric polarization and geometric vertex decomposition, we establish conditions under which such configurations retain desirable algebraic properties. In particular, we show that, given suitable choices of linear forms for substitution, the resulting ideals admit Gr\"obner bases with prescribed initial ideals and are in the Gorenstein liaison class of a complete intersection.

math.AC

General symmetric ideals

We investigate the structure and properties of symmetric ideals generated by general forms in the polynomial ring under the natural action of the symmetric group. This work significantly broadens the framework established in our earlier collaboration with Harada on principal symmetric ideals. A novel aspect of our approach is the construction of a bijective parametrization of general symmetric ideals using Macaulay-Matlis duality, which is asymptotically independent of the number of variables of the ambient ring. We establish that general symmetric ideals exhibit extremal behavior in terms of Hilbert functions and Betti numbers, and satisfy the Weak Lefschetz Property. We also demonstrate explicit asymptotic stability in their algebraic and homological invariants under increasing numbers of variables, showing that such ideals form well-behaved $\mathfrak{S}_\infty$-invariant chains.

math.AC

Artinian Gorenstein algebras with binomial Macaulay dual generator

This paper initiates a systematic study for key properties of Artinian Gorenstein \(K\)-algebras having binomial Macaulay dual generators. In codimension 3, we demonstrate that all such algebras satisfy the strong Lefschetz property, can be constructed as a doubling of an appropriate 0-dimensional scheme in \(\mathbb{P}^2\), and we provide an explicit characterization of when they form a complete intersection. For arbitrary codimension, we establish sufficient conditions under which the weak Lefschetz property holds and show that these conditions are optimal.

math.AC

New families of Artinian Gorenstein algebras with the weak Lefschetz property

We construct new families of Artinian Gorenstein graded $K$-algebras of arbitrary codimension having binomial Macaulay dual generators and satisfying the weak or the strong Lefschetz property. This is a companion paper to \cite{ADFMMSV}, which studies codimension three algebras having binomial Macaulay dual generators in great depth, establishing in particular that they enjoy the strong Lefschetz property.

math.AC

Constructions of Macaulay Posets and Macaulay Rings

A poset is Macaulay if its partial order and an additional total order interact well. Analogously, a ring is Macaulay if the partial order defined on its monomials by division interacts nicely with any total monomial order. We investigate methods of obtaining new structures through combining Macaulay rings and posets by means of certain operations inspired by topology. We examine whether these new structures retain the Macaulay property, identifying new classes of posets and rings for which the operations preserve the Macaulay property.

math.CO

Lefschetz properties through a topological lens

These lecture notes were prepared for the Lefschetz Preparatory School, a graduate summer course held in Krakow, May 6-10, 2024. They present the story of the algebraic Lefschetz properties from their origin in algebraic geometry to some recent developments in commutative algebra. The common thread of the notes is a bias towards topics surrounding the algebraic Lefschetz properties that have a topological flavor. These range from the Hard Lefschetz Theorem for cohomology rings to commutative algebraic analogues of these rings, namely artinian Gorenstein rings, and topologically motivated operations among such rings.

math.AC

Polarization and Gorenstein liaison

A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen--Macaulay subscheme of $\mathbb{P}^n$ can be G-linked to a complete intersection. Migliore and Nagel showed that, if such a scheme is generically Gorenstein (e.g., reduced), then, after re-embedding so that it is viewed as a subscheme of $\mathbb{P}^{n+1}$, indeed it can be G-linked to a complete intersection. Motivated by this result, we consider techniques for constructing G-links on a scheme from G-links on a closely related reduced scheme. Polarization is a tool for producing a squarefree monomial ideal from an arbitrary monomial ideal. Basic double G-links on squarefree monomial ideals can be induced from vertex decompositions of their Stanley--Reisner complexes. Given a monomial ideal $I$ and a vertex decomposition of the Stanley--Reisner complex of its polarization $P(I)$, we give conditions that allow for the lifting of an associated basic double G-link of $P(I)$ to a basic double G-link of $I$ itself. We use the relationship we develop in the process to show that the Stanley--Reisner complexes of polarizations of stable Cohen--Macaulay monomial ideals are vertex decomposable. We then introduce and study polarization of a Gr\"obner basis of an arbitrary homogeneous ideal and give a relationship between geometric vertex decomposition of a polarization and elementary G-biliaison that is analogous to our result on vertex decomposition and basic double G-linkage.

math.AC

Products and powers of principal symmetric ideals

Principal symmetric ideals were recently introduced by Harada, Seceleanu, and Sega, with a focus on their homological properties. They are ideals generated by the orbit of a single polynomial under permutations of variables in a polynomial ring. In this paper we seek to determine when a product of two principal symmetric ideals is principal symmetric and when all the powers of a principal symmetric ideal are again principal symmetric ideals. We characterize the ideals that have the latter property as being generated by polynomials invariant up to a scalar multiple under permutation of variables. Recognizing principal symmetric ideals is an open question for the purpose of which we produce certain obstructions. We also demonstrate that the Hilbert functions of symmetric monomial ideals are not all given by symmetric monomial ideals, in contrast to the non-symmetric case.

math.AC

Betti numbers for connected sums of graded Gorenstein artinian algebras

The connected sum construction, which takes as input Gorenstein rings and produces new Gorenstein rings, can be considered as an algebraic analogue for the topological construction having the same name. We determine the graded Betti numbers for connected sums of graded Artinian Gorenstein algebras. Along the way, we find the graded Betti numbers for fiber products of graded rings; an analogous result was obtained in the local case by Geller. We relate the connected sum construction to the doubling construction, which also produces Gorenstein rings. Specifically, we show that a connected sum of doublings is the doubling of a fiber product ring.

math.AC

The minimal free resolution of a generic symmetric principal ideal

We introduce the class of principal symmetric ideals, which are ideals generated by the orbit of a single polynomial under the action of the symmetric group. Fixing the degree of the generating polynomial, this class of ideals is parametrized by points in a suitable projective space. We show that the minimal free resolution of a principal symmetric ideal is constant on a nonempty Zariski open subset of this projective space and we determine this resolution explicitly. Along the way, we study two classes of graded algebras which we term narrow and extremely narrow; both of which are instances of compressed artinian algebras.

math.AC