Related papers: Recognition of collapsible complexes is NP-complet…
We illustrate some simple ideas that can be used for obtaining a classification of small-dimensional solvable Lie algebras.Using these we obtain the classification of 3 and 4 dimensional solvable Lie algebras (over fields of any…
This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…
Every finite non-nilpotent group can be extended by a term operation such that solving equations in the resulting algebra is NP-complete and checking identities is co-NP-complete. This result was firstly proven by Horv\'ath and Szab\'o; the…
Let X,Y be finite sets and T a set of functions from X -> Y which we will call "tableaux". We define a simplicial complex whose facets, all of the same dimension, correspond to these tableaux. Such "tableau complexes" have many nice…
We extend the results of Deligne and Illusie on liftings modulo $p^2$ and decompositions of the de Rham complex in several ways. We show that for a smooth scheme $X$ over a perfect field $k$ of characteristic $p>0$, the truncations of the…
The problem of finding a triangulation of a convex three-dimensional polytope with few tetrahedra is proved to be NP-hard. We discuss other related complexity results.
Within the framework of generalized combinatorial approach, the complexity is determined for infinite set of self-similar hierarchical ensembles. This complexity is shown to increase with strengthening of the hierarchy coupling to the…
There are many fundamental algorithmic problems on triangulated 3-manifolds whose complexities are unknown. Here we study the problem of finding a taut angle structure on a 3-manifold triangulation, whose existence has implications for both…
A covering of a group is a finite set of proper subgroups whose union is the whole group. A covering is minimal if there is no covering of smaller cardinality, and it is nilpotent if all its members are nilpotent subgroups. We complete a…
A simplicial complex K is called d-representable if it is the nerve of a collection of convex sets in R^d; K is d-collapsible if it can be reduced to an empty complex by repeatedly removing a face of dimension at most d-1 that is contained…
We introduce a new Macaulay 2 package, SimplicialDecomposability, which works in conjunction with the extant package SimplicialComplexes in order to compute a shelling order, if one exists, of a specified simplicial complex. Further,…
We study the problem of synthesizing polyhedral Lyapunov functions for hybrid linear systems. Such functions are defined as convex piecewise linear functions, with a finite number of pieces. We first prove that deciding whether there exists…
In the monograph "Axioms and Hulls" (1992) Donald Knuth studies some axiomatizations of geometric situations. The structures described by one of the axiom systems are called CC-systems. Knuth proves that it is NP-complete to decide, whether…
We show that a projective triangulation of a subcomplex of a polyhedral complex can be extended to the whole complex. As a result, we show that the weak semistable reduction result of Abramovich - Karu alg-geom/9707012 can be refined, so…
Using the probability theory-based approach, this paper reveals the equivalence of an arbitrary NP-complete problem to a problem of checking whether a level set of a specifically constructed harmonic cost function (with all diagonal entries…
We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints. When the only constraint imposed on q(x) is to have a degree smaller…
Motivated by the problem of finding finite versions of classical incompleteness theorems, we present some conjectures that go beyond ${\bf NP\neq co NP}$. These conjectures formally connect computational complexity with the difficulty of…
We prove that the arc complex of a polygon with a marked point in its interior is a strongly collapsible combinatorial ball. We also show that the arc complex of a M\"{o}bius strip, with finitely many marked points on its boundary, is a…
The shellability status of previously investigated simplicial complexes with up to 24 facets is settled. In case of shellability the exact number of shellings is determined. Our algorithm merely relies on the facets, and not on additional…
In this article, we shall describe some of the most interesting topics in the subject of Complexity Science for a general audience. Anyone with a solid foundation in high school mathematics (with some calculus) and an elementary…