Related papers: Monomization of Power Ideals and Parking Functions
We develop tools to study the problem of containment of symbolic powers $I^{(m)}$ in powers $I^r$ for a homogeneous ideal $I$ in a polynomial ring $k[{\bf P}^N]$ in $N+1$ variables over an algebraically closed field $k$. We obtain results…
The general normal ordering problem for boson strings is a combinatorial problem. In this note we restrict ourselves to single-mode boson monomials. This problem leads to elegant generalisations of well-known combinatorial numbers, such as…
Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal…
Given an ideal $I$ in a commutative ring $A$, a divided power structure on $I$ is a collection of maps $\{\gamma_n \colon I \to A\}_{n \in \mathbb{N}}$, subject to axioms that imply that it behaves like the family $\{x \mapsto…
In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial…
Power diagrams, a type of weighted Voronoi diagrams, have many applications throughout operations research. We study the problem of power diagram detection: determining whether a given finite partition of $\mathbb{R}^d$ takes the form of a…
This paper is a continuation of a previous work by the author and G. Puninski where iterated intersections of powers of ideals were studied in rings of iterated differential polynomials. We present a method which can be used to show that…
We introduce a linearized version of group field theory. It can be viewed either as a group field theory over the additive group of a vector space or as an asymptotic expansion of any group field theory around the unit group element. We…
We classify all unmixed monomial ideals I of codimension 2 which are generically a complete intersection and which have the property that the symbolic power algebra A(I) is standard graded. We give a lower bound for the highest degree of a…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
Let $S=\mathbb{K}[x_1,\ldots, x_n]$ be the polynomial ring over a field $\mathbb{K}$ and $\mathfrak{m}= (x_1, \ldots, x_n)$ be the irredundant maximal ideal of $S$. For an ideal $I \subset S$, let $\mathrm{sat}(I)$ be the minimum number $k$…
We define a new combinatorial object, which we call a labeled hypergraph, uniquely associated to any square-free monomial ideal. We prove several upper bounds on the regularity of a square-free monomial ideal in terms of simple…
Monomial ideals corresponding to strong quasi-n-partite graphs are considered. Some algebraic and combinatorial properties of generalized graph ideals of a strong quasi-n-partite graph are studied. Furthermore, we show that the edge ideal…
In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…
Symmetric strongly shifted ideals are a class of monomial ideals which come equipped with an action of the symmetric group and are analogous to the well-studied class of strongly stable monomial ideals. In this paper we focus on algebraic…
Given a symbolic power of a homogeneous ideal in a polynomial ring, we study the problem of determining which powers of the ideal contain it. For ideals defining 0-dimensional subschemes of projective space, as an immediate corollary of our…
Theorem 1.2.6 of [ATW20] provides a relatively functorial logarithmic principalization of ideals on relative logarithmic orbifolds $X\to B$ in characteristic 0, relying on a delicate monomialization theorem for Kummer ideals. The paper…
This paper presents a combinatorial study of the power contamination problem, a dynamic variant of power domination modeled on grid graphs. We resolve a conjecture posed by Ainouche and Bouroubi (2021) by proving it is false and instead…
Divided symmetrization of a function $f(x_1,\dots,x_n)$ is symmetrization of the ratio $$DS_G(f)=\frac{f(x_1,\dots,x_n)}{\prod (x_i-x_j)},$$ where the product is taken over the set of edges of some graph $G$. We concentrate on the case when…
In our previous paper an effective algorithm for inverting polynomial automorphisms was proposed. We extend its application to the case of formal power series over a field of arbitrary characteristic and illustrate the proposed approach…