Related papers: Componentwise linear ideals and exchange propertie…
We show that any lexsegment ideal with linear resolution has linear quotients with respect to a suitable ordering of its minimal monomial generators. For completely lexsegment ideals with linear resolution we show that the decomposition…
In this paper, basic properties of monomial difference ideals are studied. We prove the finitely generated property of well-mixed difference ideals generated by monomials. Furthermore, a finite prime decomposition of radical well-mixed…
It is shown that from some solutions of generalized Knizhnik-Zamolodchikov equations one can construct eigenfunctions of the Calogero-Sutherland-Moser Hamiltonians with exchange terms, which are characterized by any given permutational…
We classify all complete uniform multipartite hypergraphs with respect to some algebraic properties, such as being (almost) complete intersection, Gorenstein, level, $l$-Cohen-Macaulay, $l$-Buchsbaum, unmixed, and satisfying Serre's…
We introduce a certain class of so-called perfectoid rings and spaces, which give a natural framework for Faltings' almost purity theorem, and for which there is a natural tilting operation which exchanges characteristic 0 and…
We study ideals of Borel type, including $k$-Borel ideals and $t$-spread Veronese ideals. We determine their free resolutions and their homological shift ideals. The multiplicity and the analytic spread of equigenerated squarefree principal…
This paper introduces the concept of metric ideals in AL-monoids. We also examine the structure of AL-monoids and describe some of the properties of homomorphism and fundamentalisomorphism theorems.Additionaly we introduce and examine a…
We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their…
Let $\mathcal{D}$ be a weighted oriented graph and let $I(\mathcal{D})$ be its edge ideal. Under a natural condition that the underlying (undirected) graph of $\mathcal{D}$ contains a perfect matching consisting of leaves, we provide…
For the family of graded lattice ideals of dimension 1, we establish a complete intersection criterion in algebraic and geometric terms. In positive characteristic, it is shown that all ideals of this family are binomial set theoretic…
Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex…
The aim of this work is to compare symbolic and ordinary powers of monomial ideals using commutative algebra and combinatorics. Monomial ideals whose symbolic and ordinary powers coincide are called Simis ideals. Weighted monomial ideals…
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 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…
One deals with catalectic codimension two perfect ideals and certain degenerations thereof, with a view towards the nature of their symbolic powers. In the spirit of [10] one considers linearly presented such ideals, only now in the…
We study random relational structures that are \emph{relatively exchangeable}---that is, whose distributions are invariant under the automorphisms of a reference structure $\mathfrak{M}$. When $\mathfrak{M}$ has {\em trivial definable…
Let C be a clutter and let I(C) be its edge ideal. This is a survey paper on the algebraic and combinatorial properties of R/I(C) and C, respectively. We give a criterion to estimate the regularity of R/I(C) and apply this criterion to give…
A relationally exchangeable structure is a random combinatorial structure whose law is invariant with respect to relabeling its relations, as opposed to its elements. Aside from exchangeable random partitions, examples include edge…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
In this paper, we define an invariant, which we believe should be the substitute for total K-theory in the case when there is one distinguished ideal. Moreover, some diagrams relating the new groups to the ordinary K-groups with…