Related papers: The EGH Conjecture and the Sperner property of com…
Haxell's condition is a natural hypergraph analog of Hall's condition, which is a well-known necessary and sufficient condition for a bipartite graph to admit a perfect matching. That is, when Haxell's condition holds it forces the…
Let T be a triangulated category, A a graded abelian category and h: T -> A a homology theory on T with values in A. If the functor h reflects isomorphisms, is full and is such that for any object x in A there is an object X in T with an…
We determine every Jordan type partition that occurs as the Jordan block decomposition for the multiplication map by a linear form in a height two homogeneous complete intersection (CI) Artinian algebra $A$ over an algebraically closed…
A chopped ideal is obtained from a homogeneous ideal by considering only the generators of a fixed degree. We investigate cases in which the chopped ideal defines the same finite set of points as the original one-dimensional ideal. The…
We study the computational limits of the following general hypothesis testing problem. Let H=H_n be an \emph{arbitrary} undirected graph on n vertices. We study the detection task between a ``null'' Erd\H{o}s-R\'{e}nyi random graph G(n,p)…
The second Veronese ideal $I_n$ contains a natural complete intersection $J_n$ generated by the principal $2$-minors of a symmetric $(n\times n)$-matrix. We determine subintersections of the primary decomposition of $J_n$ where one…
Given an ideal $I=(f_1,\ldots,f_r)$ in $\mathbb C[x_1,\ldots,x_n]$ generated by forms of degree $d$, and an integer $k>1$, how large can the ideal $I^k$ be, i.e., how small can the Hilbert function of $\mathbb C[x_1,\ldots,x_n]/I^k$ be? If…
We present an alternate proof of a result of F\'eray and Reiner characterizing posets whose $P$-partition rings are complete intersections. This shortened proof relates the complete intersection property to a simple structural property of a…
An algebra has the Howson property if the intersection of any two finitely generated subalgebras is finitely generated. A simple necessary and sufficient condition is given for the Howson property to hold on an inverse semigroup with…
We study a certain two-parameter family of non-standard graded complete intersections $A(m,n)$. In case $n=2$, we show that $A(m,2)$ has the strong Lefschetz property and the complex Hodge-Riemann property if and only if $m$ is even. This…
A string graph is the intersection graph of curves in the plane. We prove that there exists an absolute constant $c>0$ such that if $G$ is a string graph on $n$ vertices, then $G$ contains either a clique or an independent set of size at…
We characterise $t$-perfect plane triangulations by forbidden induced subgraphs. As a consequence, we obtain that a plane triangulation is $h$-perfect if and only if it is perfect.
In this paper we study the Lefschetz properties of monomial complete intersections in positive characteristic. We give a complete classification of the strong Lefschetz property when the number of variables is at least three, which proves a…
Motivated by the foundational result that a monomial complete intersection has the strong Lefschetz property (SLP) in characteristic zero, it is natural to ask when monomial almost complete intersections have the SLP. In this paper, using…
A perfect matching in a 4-uniform hypergraph is a subset of $\lfloor\frac{n}{4}\rfloor$ disjoint edges. We prove that if $H$ is a sufficiently large 4-uniform hypergraph on $n=4k$ vertices such that every vertex belongs to more than…
In this paper we give a new and simplified proof of the variational Hodge conjecture for complete intersection cycles on a hypersurface in projective space.
In this paper, we give a criterion of the nearly Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph: the Ehrhart ring of the stable set polytope of an h-perfect graph $G$ with connected components…
Let $G$ be a simple graph with maximum degree denoted as $\Delta(G)$. An overfull subgraph $H$ of $G$ is a subgraph satisfying the condition $|E(H)| > \Delta(G)\lfloor \frac{1}{2}|V(H)| \rfloor$. In 1986, Chetwynd and Hilton proposed the…
It is known that in the case of hyperelliptic curves the Shafarevich conjecture can be made effective, i.e., for any number field k and any finite set of places S of k, one can effectively compute the set of isomorphism classes of…
An end of a graph $G$ is an equivalence class of rays, where two rays are equivalent if there are infinitely many vertex-disjoint paths between them in $G$. The degree of an end is the maximum cardinality of a collection of pairwise…