Related papers: Componentwise linear ideals and exchange propertie…

We give a thorough structural analysis of the principal one-sided ideals of arbitrary semigroups, and then apply this to full transformation semigroups and symmetric inverse monoids. One-sided ideals of these semigroups naturally occur as…

Let $G$ be a $(C_4, 2K_2)$-free graph with edge ideal $I(G)\subset \Bbbk[x_1,\dots , x_n]$. We show that $I(G)^s$ has linear resolution for every $s\geq 2$. Also, we show that every power of the vertex cover ideal of $G$ has linear…

A coloring of a matroid is an assignment of colors to the elements of its ground set. We restrict to proper colorings - those for which elements of the same color form an independent set. Seymour proved that a $k$-colorable matroid is also…

We investigate the compatibility of the set of fully commutative elements of a Coxeter group with the various types of Kazhdan-Lusztig cells using a canonical basis for a generalized version of the Temperley-Lieb algebra.

In this work, we explore the close relationship between an ideal map structure S --> End(R) on a homomorphism of commutative k-algebras R --> S and an ideal simplicial algebra structure on the associated bar construction Bar(S, R).

Let $R=K[x_1,\ldots,x_n]$ denote the polynomial ring in $n$ variables over a field $K$ and $I$ be a polymatroidal ideal of $R$. In this paper, we provide a comprehensive classification of all unmixed polymatroidal ideals. This work…

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…

We explore various combinatorial problems mostly borrowed from physics, that share the property of being continuously or discretely integrable, a feature that guarantees the existence of conservation laws that often make the problems…

We discuss the property of (almost) complete intersection of LSS-ideals of graphs of some special forms, like trees, unicyclic, and bicyclic graphs. Further, we give a sufficient condition for the complete intersection property of twisted…

This paper gives exact formulas for the regularity of edge ideals of edge-weighted integrally closed trees. In addition, we provide some linear upper bounds on the regularity of powers of such ideals.

Article explicitly expresses Subgraph Isomorphism by a polynomial size asymmetric linear system.

For zero-dimensional complete intersections with homogeneous ideal generators of equal degrees over an algebraically closed field of characteristic zero, we give a combinatorial proof of the smoothness of the corresponding catalecticant…

We study the relationships among existing results about representations of distributive semilattices by ideals in dimension groups, von Neumann regular rings, C*-algebras, and complemented modular lattices. We prove additional…

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…

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 prove the existence of equilibrium states for partially hyperbolic endomorphisms with one-dimensional center bundle. We also prove, regarding a class of potentials, the uniqueness of such measures for endomorphisms defined on the 2-torus…

We study the injectivity of normed ideals of weighted holomorphic mappings. To be more precise, the concept of injective hull of normed weighted holomorphic ideals is introduced and characterized in terms of a domination property. The…

Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…

Beimel, Tassa and Weinreb (2008) and Farras and Padro (2010) partially characterized access structures of ideal weighted threshold secret sharing schemes in terms of the operation of composition. They classified indecomposable ideal…

In this paper, we find a criterium for universal equivalence of partially commutative Lie algebras whose defining graphs are trees. Besides, we obtain bases for partially commutative metabelian Lie algebras.