Related papers: NP-completeness of Partial Chirotope Extendibility
We consider various notions of completeness in symplectic topology and ask two related questions. Does a complete open symplectic manifold remain complete after excising a subset? Can two sets be made arbitrarily far apart by adjusting the…
Illumination complexes are examples of 'flat polyhedral complexes' which arise if several copies of a convex polyhedron (convex body) Q are glued together along some of their common faces (closed convex subsets of their boundaries). A…
The Krotov combining construction of perfect 1-error-correcting binary codes from 2000 and a theorem of Heden saying that every non-full-rank perfect 1-error-correcting binary code can be constructed by this combining construction is…
We prove the decidability for a class of languages which extend BST and NP-completeness for a subclass of them. The languages BST extended with unordered cartesian product, BST extended with ordered cartesian product and BST extended with…
Comprehensive - that is, gauge and family - unification using spinors has many attractive features, but it has been challenged to explain chirality. Here, by combining an orbifold construction with more traditional ideas, we address that…
Given a chiral d-polytope K with regular facets, we describe a construction for a chiral (d + 1)-polytope P with facets isomorphic to K. Furthermore, P is finite whenever K is finite. We provide explicit examples of chiral 4-polytopes…
For a partial lattice L the so-called two-point extension is defined in order to extend L to a lattice. We are motivated by the fact that the one-point extension broadly used for partial algebras does not work in this case, i.e. the…
Carbon nanotubes (CNT) hold enormous technological promise. It can only be harnessed if one controls in a practical way the CNT chirality, the feature of the tubular carbon topology that governs all the CNT properties---electronic, optical,…
Two fundamental contributions to categorical quantum mechanics are presented. First, we generalize the CP-construction, that turns any dagger compact category into one with completely positive maps, to arbitrary dimension. Second, we…
On example of tasks of class NP the questions concerning accuracy of work of already existing and possible in the future algorithms for the solution of tasks on discrete structures are considered.
Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…
In this paper the concept of a partial cone metric space is investigated, some continuity type theorems, and fixed point theorems of contractive mappings in this generalized setting are proved as well as some theorems related to topological…
The classical tools which ensure the completeness of vector fields and second order differential equations for mechanical systems are revisited. Possible extensions in three directions are discussed: infinite dimensional Banach and Hilbert…
In this series of papers, the primary goal is to enumerate Hamiltonian cycles (HC's) on the grid cylinder graphs $P_{m+1}\times C_n$, where $n$ is allowed to grow whilst $m$ is fixed. In Part~I, we studied the so-called non-contractible…
We introduce homotopical variants of the axioms of countable and dependent choice for infinity-topoi and use them to give criteria for Postnikov completeness, revisiting a result of Mondal and Reinecke.
We give a sufficient condition under which every finite-satisfiable formula of a given PCTL fragment has a model with at most doubly exponential number of states (consequently, the finite satisfiability problem for the fragment is in…
These notes are the output of a decade of research on how the results about dilations of one-parameter CP-semigroups with the help of product systems, can be put forward to d-parameter semigroups - and beyond. While exisiting work on the…
We show that the finite satisfiability problem for the unary negation fragment with arbitrary number of transitive relations is decidable and 2-ExpTime-complete. Our result actually holds for a more general setting in which one can require…
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…
This article will be a continuation of our research into self-justifying systems. It will introduce several new theorems and their applications. (One of these results will transform our previous infinite-sized self-verifying formalisms into…