Related papers: Smooth Combinatorial Cubes are IDP
Let $G$ be a group, $\mathcal{P}_G$ be the family of all subsets of $G$. For a subset $A\subseteq G$, we put $\Delta(A)=\{g\in G:|gA\cap A|=\infty\}$. The mapping $\Delta:\mathcal{P}_G\rightarrow\mathcal{P}_G$, $A\mapsto\Delta(A)$, is…
We construct a smooth symmetric compactification of the space of all labeled tetrahedra in P^3.
The Lasserre's reconstruction algorithm is extended to the D-polytopes with the construction of their shape space. Thus, the areas of d-skeletons $(1\leq d\leq D)$ can be expressed as functions of the areas and normal bi-vectors of the…
The complexity class DP is the class of all languages that are the intersection of a language in NP and a language in coNP. It was conjectured that recognizing a facet for the knapsack polytope is DP-complete. We provide a positive answer…
We introduce constructible directed complexes, a combinatorial presentation of higher categories inspired by constructible complexes in poset topology. Constructible directed complexes with a greatest element, called atoms, encompass common…
The geometry of the moduli space of stable spin curves is studied, with emphasis on its combinatorial properties. In this context, the standard graph theoretic framework is not just a book-keeping device: some purely combinatorial results…
We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…
The aim of this paper is to explain how to get a complex of smooth representations out of the dual vector space to a smooth representation of a p-adic Lie group, in natural characteristic. The construction does not depend on any…
We explain how to see finite combinatorics of preorders implicit in the {text} of basic topological definitions or arguments in (Bourbaki, General topology, Ch.I), and define a concise combinatorial notation such that complete definitions…
A classification of discrete integrable systems on quad-graphs, i.e. on surface cell decompositions with quadrilateral faces, is given. The notion of integrability laid in the basis of the classification is the three-dimensional…
We show that all the semi-smooth stable complex Godeaux surfaces, classified in [FPR18a], are smoothable, and that the moduli stack is smooth of the expected dimension 8 at the corresponding points.
We prove that $\delta$-invariants of smooth cubic surfaces are at least $\frac{6}{5}$.
Abstract polytopes are combinatorial objects that generalise geometric objects such as convex polytopes, maps on surfaces and tilings of the space. Chiral polytopes are those abstract polytopes that admit full combinatorial rotational…
The effective dc-conductivity problem of isotropic, two-dimensional (2D), three-component, symmetric, regular composites is considered. A simple cubic equation with one free parameter for $\sigma_{e}(\sigma_1,\sigma_2,\sigma_3)$ is…
The deformation problem for pseudoholomorphic curves and related geometrical properties of the total moduli space of pseudoholomorphic curves are studied. A sufficient condition for the saddle point property of the total moduli space is…
This paper puts forward a new generalized polynomial dimensional decomposition (PDD), referred to as GPDD, comprising hierarchically ordered measure-consistent multivariate orthogonal polynomials in dependent random variables. Unlike the…
This paper is a continuation of our previous work in which we defined the notion of a polytope complex and its $K$-theory. In this paper we produce formulas for the delooping of a simplicial polytope complex and the cofiber of a morphism of…
In a d-simplex every facet is a (d-1)-simplex. We consider as generalized simplices other combinatorial classes of polytopes, all of whose facets are in the class. Cubes and multiplexes are two such classes of generalized simplices. In this…
We introduce a deformed product construction for simple polytopes in terms of lower-triangular block matrix representations. We further show how Gale duality can be employed for the construction and for the analysis of deformed products…
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…