Related papers: Monomization of Power Ideals and Parking Functions
We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.
Let $K$ be a field, $I\subset R=K[x_1,\dots,x_n]$ and $J\subset T=K[y_1,\dots,y_m]$ be graded ideals. Set $S=R\otimes_KT$ and let $L=IS+JS$. The behaviour of the $\text{v}$-function $\text{v}(L^k)$ in terms of the $\text{v}$-functions…
We investigate the asymptotic number of induced subgraphs in power-law uniform random graphs. We show that these induced subgraphs appear typically on vertices with specific degrees, which are found by solving an optimization problem.…
A graph-theoretic method, simpler than existing ones, is used to characterize the minimal set of monomial generators for the integral closure of any algebra of polynomials generated by quadratic monomials. The toric ideal of relations…
Machine learning on graphs, especially using graph neural networks (GNNs), has seen a surge in interest due to the wide availability of graph data across a broad spectrum of disciplines, from life to social and engineering sciences. Despite…
We give an elementary proof of an interesting combinatorial identity which is of particular interest in graph theory and its applications. Two applications to enumeration of forests with closed-form expressions are given.
In this paper, we study random embeddings of polymer networks distributed according to any potential energy which can be expressed in terms of distances between pairs of monomers. This includes freely jointed chains, steric effects,…
We classify all unicycle graphs whose edge-binomials form a $d$-sequence, particularly linear type binomial edge ideals. We also classify unicycle graphs whose parity edge-binomials form a $d$-sequence. We study the regularity of powers of…
In this article, we study the powers of the generalized binomial edge ideal $\mathcal{J}_{K_m,P_n}$ of a path graph $P_n$. We explicitly compute their regularities and determine the limit of their depths. We also show that these ordinary…
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…
We show that the second power of the cover ideal of a path graph has linear quotients. To prove our result we construct a recursively defined order on the generators of the ideal which yields linear quotients. Our construction has a natural…
This article is built upon three main ideas. First, for a class of monomial ideals, it is proven that the multiplicity of an ideal equals the number of realizations of its codimension (an intuitive concept that we define later). Next, for…
Graphs can have different properties that lead to several graph types and may allow for a varying representation of diverse information. In order to clarify the modeling power of graphs, we introduce a partial order on the most common graph…
We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…
Let $A, B$ be polynomial rings over a field $k$, and $I\subseteq A, J\subseteq B$ proper homogeneous ideals. We analyze the associated primes of powers of $I+J\subseteq A\otimes_k B$ given the data on the summands. The associated primes of…
Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…
In this paper we construct a combinatorial algorithm of resolution of singularities for binomial ideals, over a field of arbitrary characteristic. This algorithm is applied to any binomial ideal. This means ideals generated by binomial…
We associate to each $r$-multigraded, locally finitely generated ideal in the "large polynomial ring" on countably many indeterminates a power series in $r$ variables; this power series is the limit in the adic topology of the numerators of…
Let $R=\mathbb{K}[X_1, \ldots , X_n ]$ be a polynomial ring over a field $\mathbb{K}$. We introduce an endomorphism $\mathcal{F}^{[m]}: R \rightarrow R $ and denote the image of an ideal $I$ of $R$ via this endomorphism as $I^{[m]}$ and…
In this paper, we investigate certain graphs defined on groups, with a focus on infinite groups. The graphs discussed are the power graph, the enhanced power graph, and the commuting graph whose vertex set is a group $G$. The power graph is…