Related papers: Complete intersections in binomial and lattice ide…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We prove the complete intersection theorem and complete nontrivial-intersection theorem for systems of set partitions
Let $E$ be an arbitrary directed graph and let $L$ be the Leavitt path algebra of the graph $E$ over a field $K$. It is shown that every ideal of $L$ is an intersection of primitive/prime ideals in $L$ if and only if the graph $E$ satisfies…
The degree of a projective subscheme has an upper bound in term of the codimension and the reduction number. If a projective variety has an almost maximal degree, that is, the degree equals to the upper bound minus one, then its Betti table…
A set partition is $c$-uniform if every block has size $c$. Two families of $c$-uniform partitions of a finite set are said to be cross $t$-intersecting if two partitions from different families share at least $t$ blocks. In this paper, we…
An ideal $I$ of a local Gorenstein ring $(R, \mathfrak m)$ is called cohomologically complete intersection whenever $H^i_I(R) = 0$ for all $i \not= \height I.$ Here $H^i_I(R), i \in \mathbb Z,$ denotes the local cohomology of $R$ with…
We compute the generic initial ideal of a complete intersection of embedding dimension three with strong Lefschetz property and we show that it is an almost reverse lexicographic ideal. This enable us to give a proof for Moreno's conjecture…
Let $(R,\fm)$ be a local ring and $\fa$ be an ideal of $R$. The inequalities $$\begin{array}{ll} \ \Ht(\fa) \leq \cd(\fa,R) \leq \ara(\fa) \leq l(\fa) \leq \mu(\fa) \end{array}$$ are known. It is an interesting and long-standing problem to…
In this paper, we provide constructions to enumerate large numbers of CI-liaison classes. To this end, we introduce a liaison invariant and prove several results concerning it, notably that it commutes with hypersurface sections. This…
We study the regularity and the algebraic properties of certain lattice ideals. We establish a map I --> I\~ between the family of graded lattice ideals in an N-graded polynomial ring over a field K and the family of graded lattice ideals…
In this paper we prove conditions for transversal intersection of monomial ideals and derive a simplicial characterization of this phenomenon.
Given a set of objects $O$ in the plane, the corresponding intersection graph is defined as follows. Each object defines a vertex and an edge joins two vertices whenever the corresponding objects intersect. We study here the case of unit…
Let $G$ be a graph on the vertex set $[n]$ and $J_G$ the associated binomial edge ideal in the polynomial ring $S=\mathbb{K}[x_1,\ldots,x_n,y_1,\ldots,y_n]$. In this paper we investigate the depth of binomial edge ideals. More precisely, we…
This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…
We investigate a connection between two important classes of Euclidean lattices: well-rounded and ideal lattices. A lattice of full rank in a Euclidean space is called well-rounded if its set of minimal vectors spans the whole space. We…
In this paper, we classify all Leavitt path algebras which have the property that every Lie ideal is an ideal. As an application, we show that Leavitt path algebras with this property provide a class of locally finite, infinite-dimensional…
A perfect matching in the complete graph on $2k$ vertices is a set of edges such that no two edges have a vertex in common and every vertex is covered exactly once. Two perfect matchings are said to be $t$-intersecting if they have at least…
Three intersection theorems are proved. First, we determine the size of the largest set system, where the system of the pairwise unions is l-intersecting. Then we investigate set systems where the union of any s sets intersect the union of…
We characterize factor congruences in semilattices by using generalized notions of order ideal and of direct sum of ideals. When the semilattice has a minimum (maximum) element, these generalized ideals turn into ordinary (dual) ideals.
In this article, we introduce the study of a class of finite groups $G$ which admits a subgroup which intersects all non-trivial subgroups of $G$. We also explore a subclass of it consisting of all groups $G$ in which the prime order…