相关论文: Combinatorial symbolic powers

Asymptotic expansions of Gaussian integrals may often be interpreted as generating functions for certain combinatorial objects (graphs with additional data). In this article we discuss a general approach to all such cases using colored…

The classical construction of representations of quivers enables us to consider linear maps between several vector spaces. The mixed representations of quivers helps us to work with linear maps as well as bilinear forms on several vector…

Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field $K$, and let $A$ be a finitely generated standard graded $S$-algebra. We show that if the defining ideal of $A$ has a quadratic initial ideal, then all the graded components of…

As a generalization of the ideals of star configurations of hypersurfaces, we consider the $a$-fold product ideal $I_a(f_1^{m_1}\cdots f_s^{m_s})$ when ${f_1,\dots,f_s}$ is a sequence of generic forms and $1\le a\le m_1+\cdots+m_s$.…

Using perfectoid algebras, we introduce a mixed characteristic analog of the multiplier ideal, respectively test ideal, from characteristic zero, respectively $p > 0$, in the case of a regular ambient ring. We prove several properties about…

We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…

In this paper we study the $s$-th symbolic powers of the edge ideals of complete graphs. In particular, we provide a criterion for finding an Eliahou-Kervaire splitting on these ideals, and use the splitting to provide a description for the…

Graphs are a natural representation for systems based on relations between connected entities. Combinatorial optimization problems, which arise when considering an objective function related to a process of interest on discrete structures,…

Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…

In this paper, we propose a uniform approach to tackle problems about squarefree monomial ideals whose powers have good properties. We employ this approach to achieve a twofold goal: (i) recover and extend several well--known results in the…

A fundamental problem from invariant theory is to describe the endomorphism algebra of multilinear functions on a representation V invariant under the action of a group G. According to Weyl's classic, a first main (later: fundamental)…

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…

We propose a new family of combinatorial inference problems for graphical models. Unlike classical statistical inference where the main interest is point estimation or parameter testing, combinatorial inference aims at testing the global…

It has been conjectured that the toric ideal of the base ring of a discrete polymatroid is generated by symmetric exchange binomials. In the present paper, we give several classes of discrete polymatroids which yield toric ideals generated…

We investigate the structure of ideals generated by binomials (polynomials with at most two terms) and the schemes and varieties associated to them. The class of binomial ideals contains many classical examples from algebraic geometry, and…

We consider homogeneous binomial ideals $I=(f_1,\ldots,f_n)$ in $K[x_1, \ldots, x_n]$, where $f_i = a_i x_i^{d_i} - b_i m_i$ and $a_i \neq 0$. When such an ideal is a complete intersection, we show that the monomials which are not divisible…

We revisit a well-known family of polynomial ideals encoding the problem of graph-$k$-colorability. Our paper describes how the inherent combinatorial structure of the ideals implies several interesting algebraic properties. Specifically,…

Let $G$ be a simple graph. We demonstrate a method for using $t$-admissible subgraphs of $G$ to determine the regularity of the $t$-th symbolic power of the cover ideal of $G$. As an application, we compute the regularity of powers of cover…

We explicitly compute the least degree of generators of all symbolic powers of the defining ideal of Fermat-like configuration of lines in $\mathbb{P}^3_\mathbb{C}$, except for the second symbolic powers, where we provide bounds for them.…

We investigate the rational powers of ideals. We find that in the case of monomial ideals, the canonical indexing leads to a characterization of the rational powers yielding that symbolic powers of squarefree monomial ideals are indeed…