English
Related papers

Related papers: Complexity Classes as Mathematical Axioms II

200 papers

We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…

Computational Complexity · Computer Science 2020-11-17 Balagopal Komarath , Anurag Pandey , C. S. Rahul

New obstructions for embedding one compact oriented 3-manifold in another are given. A theorem of D. Krebes concerning 4-tangles embedded in links arises as a special case. Algebraic and skein-theoretic generalizations for 2n-tangles…

Geometric Topology · Mathematics 2009-11-10 Jozef H. Przytycki , Daniel S. Silver , Susan G. Williams

A system's apparent simplicity depends on whether it is represented classically or quantally. This is not so surprising, as classical and quantum physics are descriptive frameworks built on different assumptions that capture, emphasize, and…

Quantum Physics · Physics 2016-03-01 Cina Aghamohammadi , John R. Mahoney , James P. Crutchfield

We obtain the strongest separation between quantum and classical query complexity known to date -- specifically, we define a black-box problem that requires exponentially many queries in the classical bounded-error case, but can be solved…

Quantum Physics · Physics 2007-05-23 J. Niel de Beaudrap , Richard Cleve , John Watrous

This is an expository article of our work on analogies between knot theory and algebraic number theory. We shall discuss foundational analogies between knots and primes, 3-manifolds and number rings mainly from the group-theoretic point of…

Geometric Topology · Mathematics 2009-04-23 Masanori Morishita

In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…

Computational Complexity · Computer Science 2007-05-23 Ketan D Mulmuley , Milind Sohoni

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

Combinatorics · Mathematics 2024-01-05 Hamid Reza Daneshpajouh , Frédéric Meunier

We investigate cut-elimination and cut-simulation in impredicative (higher-order) logics. We illustrate that adding simple axioms such as Leibniz equations to a calculus for an impredicative logic -- in our case a sequent calculus for…

Logic in Computer Science · Computer Science 2019-03-14 Christoph Benzmueller , Chad E. Brown , Michael Kohlhase

In this review we establish various connections between complex networks and symmetry. While special types of symmetries (e.g., automorphisms) are studied in detail within discrete mathematics for particular classes of deterministic graphs,…

General Finance · Quantitative Finance 2010-11-04 Diego Garlaschelli , Franco Ruzzenenti , Riccardo Basosi

Invariants of 3-manifolds from a non semi-simple category of modules over a version of quantum $sl(2)$ were obtained by the last three authors in arXiv:1202.3553 . They are invariants of $3$-manifolds together with a cohomology class which…

Geometric Topology · Mathematics 2016-05-27 Christian Blanchet , Francesco Costantino , Nathan Geer , Bertrand Patureau-Mirand

We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…

Computational Complexity · Computer Science 2016-02-05 Sylvain Schmitz

We study the complexity of isomorphism problems for d-way arrays, or tensors, under natural actions by classical groups such as orthogonal, unitary, and symplectic groups. Such problems arise naturally in statistical data analysis and…

Computational Complexity · Computer Science 2024-08-13 Zhili Chen , Joshua A. Grochow , Youming Qiao , Gang Tang , Chuanqi Zhang

A self-contained introduction is presented of the notion of the (abstract) differentiable manifold and its tangent vector fields. The way in which elementary topological ideas stimulated the passage from Euclidean (vector) spaces and linear…

Mathematical Physics · Physics 2012-04-12 K. Kanakoglou

We relate the computational complexity of finite strings to universal representations of their underlying symmetries. First, Boolean functions are classified using the universal covering topologies of the circuits which enumerate them. A…

Information Theory · Computer Science 2011-09-20 John Scoville

The class of quasi-chain graphs is an extension of the well-studied class of chain graphs. This latter class enjoys many nice and important properties, such as bounded clique-width, implicit representation, well-quasi-ordering by induced…

Combinatorics · Mathematics 2021-04-12 Bogdan Alecu , Aistis Atminas , Vadim Lozin , Dmitriy Malyshev

By considering a (not necessarily locally-flat) PL knot as the singular locus of a PL stratified pseudomanifold, we can use intersection homology theory to define intersection Alexander polynomials, a generalization of the classical…

Geometric Topology · Mathematics 2011-03-31 Greg Friedman

Classical contact Lie algebras are the fundamental algebraic structures on the manifolds of contact elements of configuration spaces in classical mechanics. Xu introduced a large category of contact simple Lie algebras which are related to…

Quantum Algebra · Mathematics 2007-05-23 Guang'an Song , Yucai Su

For the classical mind, quantum mechanics is boggling enough; nevertheless more bizarre behavior could be imagined, thereby concentrating on propositional structures (empirical logics) that transcend the quantum domain. One can also…

Quantum Physics · Physics 2017-01-09 Karl Svozil

Symmetry of geometrical figures is reflected in regularities of their algebraic invariants. Algebraic regularities are often preserved when the geometrical figure is topologically deformed. The most natural, intuitively simple but…

Geometric Topology · Mathematics 2007-05-23 Jozef H. Przytycki

The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication…

Computational Complexity · Computer Science 2007-05-23 Harry Buhrman , Ronald de Wolf