Related papers: Recognition of collapsible complexes is NP-complet…
In 1967, Chillingworth proved that all convex simplicial 3-balls are collapsible. Using the classical notion of tightness, we generalize this to arbitrary manifolds: We show that all tight simplicial 3-manifolds admit some perfect discrete…
It has recently been established by Below, De Loera, and Richter-Gebert that finding a minimum size (or even just a small) triangulation of a convex polyhedron is NP-complete. Their 3SAT-reduction proof is discussed.
A contractible simplicial complex is constructed that parametrizes different ways of representing a fixed one-dimensional homology class in a closed orientable surface by isotopy classes of systems of disjoint oriented simple closed curves.…
The goal of this paper is to formalize the notion of The Compositional Integral in The Complex Plane. We prove a convergence theorem guaranteeing its existence. We prove an analogue of Cauchy's Integral Theorem--and suggest an approach at…
In this paper, we extend earlier work by showing that if $X$ and $Y$ are simplicial complexes (i.e. simplicial sets whose nondegenerate simplices are determined by their vertices), an isomorphism $\mathcal{C}(X)\cong\mathcal{C}(Y)$ of…
We develop a theory of limits for sequences of dense abstract simplicial complexes, where a sequence is considered convergent if its homomorphism densities converge. The limiting objects are represented by stacks of measurable [0,1]-valued…
This paper develops a complete foundational treatment of simplicial complexes from Euclidean spaces through geometric realizations, emphasizing concrete computations, examples, and practical verification methods. Beginning with finite point…
We present a discrete Morse-theoretic method for proving that a regular CW complex is homeomorphic to a sphere. We use this method to define bisimplices, the cells of a class of regular CW complexes we call bisimplicial complexes. The…
We investigate the complexity of a puzzle that turns out to be NL-complete.
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…
The profinite completion of the fundamental group of a closed, orientable $3$-manifold determines the Kneser--Milnor decomposition. If $M$ is irreducible, then the profinite completion determines the Jaco--Shalen--Johannson decomposition of…
The set splittability problem is the following: given a finite collection of finite sets, does there exits a single set that contains exactly half the elements from each set in the collection? (If a set has odd size, we allow the floor or…
Given an irreducible contractible open 3-manifold W which is not homeomorphic to R^3, there is an associated simplicial complex S(W), the complex of end reductions of W. Whenever W covers a 3-manifold M one has that the fundamental group of…
It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
We show that deciding whether a sparse univariate polynomial has a p-adic rational root can be done in NP for most inputs. We also prove a polynomial-time upper bound for trinomials with suitably generic p-adic Newton polygon. We thus…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
We close three open problems in the separation complexity of valid inequalities for the knapsack polytope. Specifically, we establish that the separation problems for extended cover inequalities, (1,k)-configuration inequalities, and weight…
We focus on rational solutions or nearly-feasible rational solutions that serve as certificates of feasibility for polynomial optimization problems. We show that, under some separability conditions, certain cubic polynomially constrained…
A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…
A split of a polytope $P$ is a (regular) subdivision with exactly two maximal cells. It turns out that each weight function on the vertices of $P$ admits a unique decomposition as a linear combination of weight functions corresponding to…