Related papers: Toric ideals of normalized graph algebras

In this paper we show that the agglomeration of rows or columns of a contingency table with a hierarchical clustering algorithm yields statistical models defined through toric ideals. In particular, starting from the classical independence…

In this article, we investigate the strongly robust property of toric ideals associated with weighted oriented graphs. We establish that the toric ideals of a broad class of monomial ideals are strongly robust; this class encompasses the…

In this note we consider monoidal complexes and their associated algebras, called toric face rings. These rings generalize Stanley-Reisner rings and affine monoid algebras. We compute initial ideals of the presentation ideal of a toric face…

We give an explicit way of writing down a minimal set of generators for the canonical ideal of a non-degenerate curve, or of a more general smooth projective curve in a toric surface, in terms of its defining Laurent polynomial.

We study the ideal of the algebraic relations among 3-point functions from a combinatorial and topological perspective. We place this problem in the broader setting of incidence toric ideals associated with incidence matrices of t-subsets…

We study conditions on polynomials such that the ideal generated by their orbits under the symmetric group action becomes a monomial ideal or has a monomial radical. If the polynomials are homogeneous, we expect that such an ideal has a…

In this paper, we introduce and study families of squarefree monomial ideals called clique ideals and independence ideals that can be associated to a finite graph. A family of clique ideals with linear resolutions has been characterized.…

Let $R$ be a finite commutative ring with identity, and let $P$ be a proper prime ideal of $R$. The prime ideal graph $\Gamma_P(R)$ has vertex set of $R\setminus\{0\}$, where two distinct vertices $x$ and $y$ are adjacent if and only if…

Let $X$ be a variety over a complete nontrivially valued field $K$. We construct an algebraizable formal model for the analytification of $X$ in the case $X$ admits a closed embedding into a toric variety. By algebraizable we mean that the…

The construction of joins and secant varieties is studied in the combinatorial context of monomial ideals. For ideals generated by quadratic monomials, the generators of the secant ideals are obstructions to graph colorings, and this leads…

Matrix congruence can be used to mimic linear maps between homogeneous quadratic polynomials in $n$ variables. We introduce a generalization, called standard-form congruence, which mimics affine maps between non-homogeneous quadratic…

In this paper we find monomial bases for the integer cohomology rings of compact wonderful models of toric arrangements. In the description of the monomials various combinatorial objects come into play: building sets, nested sets, and the…

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Let $M$ and $N$ be two monomials of the same degree, and let $I$ be the smallest Borel ideal containing $M$ and $N$. We show that the toric ring of $I$ is Koszul by constructing a quadratic Gr\"obner basis for the associated toric ideal.…

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…

A monomial algebra B is defined as a quotient of a polynomial ring by a monomial ideal, which is an ideal generated by a finite set of monomials. In this paper, we determine the automorphism group of a monomial algebra B, under the…

In this article, we introduce a relation including ideals of an evolution algebra and hereditary subsets of vertices of its associated graph and establish some properties among them. This relation allows us to determine maximal ideals and…

A cut ideal of a graph records the relations among the cuts of the graph. These toric ideals have been introduced by Sturmfels and Sullivant who also posed the problem of relating their properties to the combinatorial structure of the…

In this paper, our main focus is to explore different classes of nearly normally torsion-free ideals. We first characterize all finite simple connected graphs with nearly normally torsion-free cover ideals. Next, we characterize all…

We consider the phylogenetic tree model in which every node of the tree is observed and binary and the transitions are given by the same matrix on each edge of the tree. We are able to compute the Grobner basis and Markov basis of the toric…