Related papers: Resolving Stanley's conjecture on $k$-fold acyclic…

The antiprism triangulation provides a natural way to subdivide a simplicial complex $\Delta$, similar to barycentric subdivision, which appeared independently in combinatorial algebraic topology and computer science. It can be defined as…

In 2000, Rees and Shalaby constructed simple indecomposable two-fold cyclic triple systems for all v congruent to 0, 1, 3, 4, 7, and 9 (mod 12) where v = 4 or v>11, using Skolem-type sequences. We construct, using Skolem-type sequences,…

We confirm Jones' Conjecture for subcubic graphs. Namely, if a subcubic planar graph does not contain $k+1$ vertex-disjoint cycles, then it suffices to delete $2k$ vertices to obtain a forest.

In 2006 J.G. Thompson conjectured: "If F is a field and A is in GL(n,F), then there is a permutation matrix P such that AP is cyclic, that is, the minimal polynomial of AP is also its characteristic polynomial" (open problem 16.95 in the…

The periodic tiling conjecture asserts that any finite subset of a lattice $\mathbb{Z}^d$ which tiles that lattice by translations, in fact tiles periodically. In this work we disprove this conjecture for sufficiently large $d$, which also…

Haj\'os conjecture asserts that a simple Eulerian graph on n vertices can be decomposed into at most (n - 1)/2 cycles. The conjecture is only proved for graph classes in which every element contains vertices of degree 2 or 4. We develop new…

The periodic tiling conjecture asserts that if a region $\Sigma\subset \mathbb R^d$ tiles $\mathbb R^d$ by translations then it admits at least one fully periodic tiling. This conjecture is known to hold in $\mathbb R$, and recently it was…

The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…

We extend the notion of face rings of simplicial complexes and simplicial posets to the case of finite-length (possibly infinite) simplicial posets with a group action. The action on the complex induces an action on the face ring, and we…

A path cover is a decomposition of the edges of a graph into edge-disjoint simple paths. Gallai conjectured that every connected $n$-vertex graph has a path cover with at most $\lceil n/2 \rceil$ paths. We prove Gallai's conjecture for…

We present a short proof of Reisner's Theorem, characterizing which simplicial complexes have a Cohen-Macaulay face ring. In some cases, we can also express some homological invariants of the face ring in terms of the reduced homology of…

We study the deformation theory of projective Stanley-Reisner schemes associated to combinatorial manifolds. We achieve detailed descriptions of first order deformations and obstruction spaces. Versal base spaces are given for certain…

A well-known conjecture of Simon (1994) states that any pure $d$-dimensional shellable complex on $n$ vertices can be extended to $\Delta_{n-1}^{(d)}$, the $d$-skeleton of the $(n-1)$-dimensional simplex, by attaching one facet at a time…

For compact K\"ahlerian manifolds, the holomorphic pseudosymmetry reduces to the local symmetry if additionally the scalar curvature is constant and the structure function is non-negative. Similarly, the holomorphic Ricci-pseudosymmetry…

We study systems of $2$-tangle equations which play an important role in the analysis of enzyme actions on DNA strands. We show that every system of framed tangle equations has at most one framed rational solution. Furthermore, we show that…

We prove that if $\pi$ is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are $\pi$-groups. In particular, when $\pi$ is the empty set, we obtain Henckell's decidability of…

For a Euclidean building $X$ of type $A_{2}$, we classify the 0-dimensional subbuildings $A$ of $\partial_{T}X$ that occur as the asymptotic boundary of closed convex subsets. In particular, we show that triviality of the holonomy of a…

Let $P$ be a poset of size $2^k$ that has a greatest and a least element. We prove that, for sufficiently large $n$, the Boolean lattice $2^{[n]}$ can be partitioned into copies of $P$. This resolves a conjecture of Lonc.

Let $Y$ admit a rectangular Lefschetz decomposition of its derived category, and consider a cyclic cover $X\to Y$ ramified over a divisor $Z$. In a setting not considered by Kuznetsov and Perry, we define a subcategory $\mathcal{A}_Z$ of…

An algorithm is presented that constructs an acyclic partial matching on the cells of a given simplicial complex from a vector-valued function defined on the vertices and extended to each simplex by taking the least common upper bound of…