Related papers: A hypergraph characterization of nearly complete i…
We study conditions under which an edge-coloured hypergraph has a particular substructure that contains more than the trivially guaranteed number of monochromatic edges. Our main result solves this problem for perfect matchings under…
For the almost complete intersection ideals $(x_1^2, \dots, x_n^2, (x_1 + \cdots + x_n)^k)$, we compute their reduced Gr\"obner basis for any term ordering, revealing a combinatorial structure linked to lattice paths, elementary symmetric…
Let $I$ be a monomial almost complete intersection ideal of a polynomial algebra $S$ over a field. Then Stanley's Conjecture holds for $S/I$ and $I$.
Let $R$ be a standard graded polynomial ring over a field $k$. The paper focuses on homogeneous ideals $J \subset R$ of codimension $2$ generated by three forms of the same degree $d \geq 2$ that are almost Cohen--Macaulay, i.e., of…
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…
Monomial ideals corresponding to strong quasi-n-partite graphs are considered. Some algebraic and combinatorial properties of generalized graph ideals of a strong quasi-n-partite graph are studied. Furthermore, we show that the edge ideal…
We deal with the complete-intersection property of maximally differential ideals. Also, we connect the Gorenstein homology of derivations to the Gorenstein property of the base rings. These equipped with some applications.
In contrast to the univariate case, interpolation with polynomials of a given maximal total degree is not always possible even if the number of interpolation points and the space dimension coincide. Due to that, numerous constructions for…
A hypergraph is 2-intersecting if any two edges intersect in at least two vertices. Blais, Weinstein and Yoshida asked (as a first step to a more general problem) whether every 2-intersecting hypergraph has a vertex coloring with a constant…
A celebrated theorem of Pippenger, and Frankl and R\"odl states that every almost-regular, uniform hypergraph $\mathcal{H}$ with small maximum codegree has an almost-perfect matching. We extend this result by obtaining a ``conflict-free''…
Let $I$ be ideal of an $n$-dimensional local Gorenstein ring $R$. In this paper we will describe several necessary and sufficient conditions such that the ideal $I$ becomes cohomologically complete intersections. In fact, as a technical…
We compute the Stanley depth for a particular, but important case, of the quotient of complete intersection monomial ideals. Also, in the general case, we give sharp bounds for the Stanley depth of a quotient of complete intersection…
Complete intersections may be unexpectedly simple over fields of positive characteristic: for instance, they may be unirational despite being of general type. One explanation is given by profiles, structure that tracks the special shape of…
We show that the Stanley-Reisner ideal of the one-dimensional simplicial complex whose diagram is an $n$-gon is always a set-theoretic complete intersection in any positive characteristic.
An ideal I of a local Cohen-Macaulay ring R is called a cohomologically complete intersection if H^i_I(R) = 0 for all i \neq c = height(I). Here H^i_I(R), i \in Z denotes the local cohomology of R with respect to I. For instance, a…
In this article we give explicit descriptions of the multiplicities of some classes of monomial ideals. For instance, we give a formula for the multiplicities of all codimension 1 monomial ideals, and another formula for the multiplicities…
The random intersection graph model $\mathcal G(n,m,p)$ is considered. Due to substantial edge dependencies, studying even fundamental statistics such as the subgraph count is significantly more challenging than in the classical binomial…
There is a natural infinite graph whose vertices are the monomial ideals in a polynomial ring. The definition involves Gr\"obner bases or the action of an algebraic torus. We present algorithms for computing the (affine schemes…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H} $ and the conflicts to…