Related papers: On the Andrews-Curtis conjecture and algorithms fr…
In "Proof of the Arnold chord conjecture in three dimensions I", we deduced the Arnold chord conjecture in three dimensions from another result, which asserts that an exact symplectic cobordism between contact three-manifolds induces a map…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
Computing topological invariants of 3-manifolds is generally intractable, yet specialized algebraic structures can enable efficient algorithms. For Witten-Reshetikhin-Turaev (WRT) invariants of torus bundles, we exploit the non-commutative…
A common problem in the optimization of structures is the handling of uncertainties in the parameters. If the parameters appear in the constraints, the uncertainties can lead to an infinite number of constraints. Usually the constraints…
The automorphism groups of certain factorial complex affine threefolds admitting locally trivial actions of the additive group are determined. As a consequence new counterexamples to a generalized cancellation problem are obtained.
We give a simple proof of the Lalonde-McDuff conjecture for aspherical manifolds.
Tightness is a generalisation of the notion of convexity: a space is tight if and only if it is "as convex as possible", given its topological constraints. For a simplicial complex, deciding tightness has a straightforward exponential time…
We classify combinations of isolated singularities that can occur on complex cubic threefolds generalizing analogous results for cubic surfaces due to Schl\"{a}fli and Bruce--Wall. In addition, we provide concise combinatorial description…
The configuration-space topology in canonical General Relativity depends on the choice of the initial data 3-manifold. If the latter is represented as a connected sum of prime 3-manifolds, the topology receives contributions from all…
The Turaev-Viro invariants are scalar topological invariants of compact, orientable 3-manifolds. We give a quantum algorithm for additively approximating Turaev-Viro invariants of a manifold presented by a Heegaard splitting. The algorithm…
In a very recent work, G. E. Andrews defined the combinatorial objects which he called {\it singular overpartitions} with the goal of presenting a general theorem for overpartitions which is analogous to theorems of Rogers--Ramanujan type…
We initiate the study of simple games from the point of view of combinatorial topology. The starting premise is that the losing coalitions of a simple game can be identified with a simplicial complex. Various topological constructions and…
Due to a lack of coherent analysis, many common practices of humankind preserve low-efficient procedures. Balancing tubes during centrifugation exemplifies such a problem in laboratory practice. Using combination of symmetry group theory…
3-manifolds are commonly represented as triangulations, consisting of abstract tetrahedra whose triangular faces are identified in pairs. The combinatorial sparsity of a triangulation, as measured by the treewidth of its dual graph, plays a…
The main result of this paper is a proof using real analysis of the monotonicity of the topological entropy for the family of quadratic maps, sometimes called Milnor's Monotonicity Conjecture. In contrast, the existing proofs rely in one…
En nous basant sur les r\'esultats d'Arthur annonc\'es dans \cite[\S 30]{Arthur} nous d\'emontrons les conjectures \'enonc\'ees dans \cite{IMRN,BC,SMF} dans le cas des groupes orthogonaux \`a l'exclusion des groupes de type ${}^6 - D_4$. En…
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
We consider the operation to crush a subset of a manifold to one-point when the result of the crushing also be a manifold. Then the Poincare conjecture is split to two problems; for any closed orientable 3-manifold which is not homeomorphic…
After defining convex near-polygons, a formula enumerating the number of triangulations of such configurations is derived in terms of edge-polynomials. The paper describes also a transfer-matrix approach for computing quantities related to…
Beginning with the projectively invariant method for linear programming, interior point methods have led to powerful algorithms for many difficult computing problems, in combinatorial optimization, logic, number theory and non-convex…