Related papers: On the arithmetical rank of the edge ideals of for…
We study the weighted generalization of the edge coloring problem where the weight of each color class (matching) equals to the weight of its heaviest edge and the goal is to minimize the sum of the colors' weights. We present a…
In this paper we study a new variant of graph arboricity, which requires all the forests to have the same number of edges (up to a difference of 1). We prove that the new variant, which we call equitable arboricity, is equivalent to…
We show that the class of completely m-full ideals coincides with the class of componentwise linear ideals in a polynomial ring over an infinite field.
Symmetric ideals in increasingly larger polynomial rings that form an ascending chain are investigated. We focus on the asymptotic behavior of codimensions and projective dimensions of ideals in such a chain. If the ideals are graded it is…
We consider two varieties of labeled rooted trees, and the probability that a vertex chosen from all vertices of all trees of a given size uniformly at random has a given rank. We prove that this probability converges to a limit as the tree…
Squarefree powers of edge ideals are intimately related to matchings of the underlying graph. In this paper we give bounds for the regularity of squarefree powers of edge ideals, and we consider the question of when such powers are linearly…
We provide the necessary and sufficient conditions for the edge-binomials of the tree forming a $d$-sequence in terms of the degree sequence notion of a graph. We study the regularity of powers of the binomial edge ideals of trees generated…
We determine sets of elements which, under certain conditions, generate an intersection of ideals up to radical.
We calculate the real rank and stable rank of CCR algebras which either have only finite dimensional irreducible representations or have finite topological dimension. We show that either rank of A is determined in a good way by the ranks of…
Given a dominant rational self-map on a projective variety over a number field, we can define the arithmetic degree at a rational point. It is known that the arithmetic degree at any point is less than or equal to the first dynamical…
We calculate the exact number of contours of size $n$ containing a fixed vertex in $d$-ary trees and provide sharp estimates for this number for more general trees. We also obtain a characterization of the locally finite trees with…
In this paper, we give a formula to compute all the top degree graded Betti numbers of the path ideals of a cycle. As a consequence we can give a formula to compute its projective dimension and regularity.
We show that the Koszul homology algebra of a quotient by the edge ideal of a forest is generated by the lowest linear strand. This provides a large class of Koszul algebras whose Koszul homology algebras satisfy this property. We obtain…
In this article, we study the linearity of the minimal free resolution of powers of facets ideals of simplicial trees. We give a complete characterization of simplicial trees for which (some) power of its facet ideal has a linear…
A graded ideal $I$ in $\mathbb{K}[x_1,\ldots,x_n]$, where $\mathbb{K}$ is a field, is said to have almost maximal finite index if its minimal free resolution is linear up to the homological degree $\mathrm{pd}(I)-2$, while it is not linear…
Let $I$ be the edge ideal of a Cohen-Macaulay tree of dimension $d$ over a polynomial ring $S = \mathrm{k}[x_1,\ldots,x_{d},y_1,\ldots,y_d]$. We prove that for all $t \ge 1$, $$\operatorname{depth} (S/I^t) = \operatorname{max} \{d -t + 1, 1…
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…
In this paper we state and prove the analogous of the principal ideal theorem of algebraic number theory for the case of 3-manifolds from the point of view of arithmetic topology.
We consider uniformly random lozenge tilings of simply connected polygons subject to a technical assumption on their limit shape. We show that the edge statistics around any point on the arctic boundary, that is not a cusp or tangency…
We classify all normal edge ideals of edge-weighted graphs.