English
Related papers

Related papers: Complexity Classes as Mathematical Axioms II

200 papers

The motivation of this work is to define cohomology classes in the space of knots that are both easy to find and to evaluate, by reducing the problem to simple linear algebra. We achieve this goal by defining a combinatorial graded cochain…

Geometric Topology · Mathematics 2016-01-14 Arnaud Mortier

We seek random versions of some classical theorems on complex approximation by polynomials and rational functions, as well as investigate properties of random compact sets in connection to complex approximation.

Complex Variables · Mathematics 2017-09-26 Simon St-Amant , Jérémie Turcotte

We extend Matveev's complexity of 3-manifolds to PL compact manifolds of arbitrary dimension, and we study its properties. The complexity of a manifold is the minimum number of vertices in a simple spine. We study how this quantity changes…

Geometric Topology · Mathematics 2011-09-06 Bruno Martelli

We introduce an equivariant version of contextuality with respect to a symmetry group, which comes with natural applications to quantum theory. In the equivariant setting, we construct cohomology classes that can detect contextuality. This…

Quantum Physics · Physics 2023-10-30 Cihan Okay , Igor Sikora

Presented is a topological representation of quantum logic that views entangled qubit spacetime histories (or qubit world lines) as a generalized braid, referred to as a superbraid. The crossing of world lines is purely quantum in nature,…

Quantum Physics · Physics 2015-05-13 Jeffrey Yepez

Substructural logics are formal logical systems that omit familiar structural rules of classical and intuitionistic logic such as contraction, weakening, exchange (commutativity), and associativity. This leads to a resource-sensitive…

Logic in Computer Science · Computer Science 2025-05-01 Nikolaos Galatos , Vitor Greati , Revantha Ramanayake , Gavin St. John

We consider a large class of $q$-series that have the structure of Nahm sums, or equivalently motivic generating series for quivers. First, we initiate a systematic analysis and classification of classical and quantum A-polynomials…

High Energy Physics - Theory · Physics 2020-08-26 Helder Larraguivel , Dmitry Noshchenko , Miłosz Panfil , Piotr Sułkowski

Following work of Mazur-Tate and Satoh, we extend the definition of division polynomials to arbitrary isogenies of elliptic curves, including those whose kernels do not sum to the identity. In analogy to the classical case of division…

Number Theory · Mathematics 2026-04-20 Katherine E. Stange

This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group -- often called `complexity geometries' following the definition of…

Quantum Physics · Physics 2024-07-03 Adam R. Brown

We survey recent results concerning the complexity of regular languages represented by their minimal deterministic finite automata. In addition to the quotient complexity of the language -- which is the number of its (left) quotients, and…

Formal Languages and Automata Theory · Computer Science 2017-02-17 Janusz A. Brzozowski

We obtain a complete classification of hypercomplex manifolds, on which a compact group of automorphisms acts transitively. The description of the spaces as well as the proofs of our results use only the structure theory of reductive…

Differential Geometry · Mathematics 2012-04-25 George Dimitrov , Vasil Tsanov

In previous work with Schoenfeld, we considered a string-type chain complex of curves on surfaces, with differential given by resolving crossings, and computed the homology of this complex for discs. In this paper we consider the…

Geometric Topology · Mathematics 2014-11-07 Daniel V. Mathews

The dual complex of a singularity is defined, up-to homotopy, using resolutions of singularities. In many cases, for instance for isolated singularities, we identify and study a "minimal" representative of the homotopy class that is well…

Algebraic Geometry · Mathematics 2014-03-18 Tommaso de Fernex , János Kollár , Chenyang Xu

The primary objects of study in the ``knot theory of complex plane curves'' are C-links: links (or knots) cut out of a 3-sphere in the complex plane by complex plane transverse and totally tangential. Transverse C-links are naturally…

Geometric Topology · Mathematics 2007-05-23 Lee Rudolph

We study closed orientable manifolds whose topological complexity is at most 3 and determine their cohomology rings. For some of admissible cohomology rings we are also able to identify corresponding manifolds up to homeomorphism.

Algebraic Topology · Mathematics 2024-07-10 Petar Pavešić

The autocorrelation values of two classes of binary sequences are shown to be good in [6]. We study the 2-adic complexity of these sequences. Our results show that the 2-adic complexity of such sequences is large enough to resist the attack…

Information Theory · Computer Science 2020-11-25 Shiyuan Qiang , Xiaoyan Jing , Minghui Yang

We study the complexity of computational problems from quantum physics. Typically, they are studied using the complexity class QMA (quantum counterpart of NP) but some natural computational problems appear to be slightly harder than QMA. We…

Quantum Physics · Physics 2014-04-11 Andris Ambainis

We show that the components, appearing in the decomposition theorem for contraction maps of torus actions of complexity one, are intersection cohomology complexes of even codimensional subvarieties. As a consequence, we obtain the vanishing…

Algebraic Geometry · Mathematics 2026-03-10 Marta Agustin Vicente , Narasimha Chary Bonala , Kevin Langlois

We consider topological twists of four-dimensional $\mathcal{N}=2$ supersymmetric QCD with gauge group SU(2) and $N_f\leq 3$ fundamental hypermultiplets. The twists are labelled by a choice of background fluxes for the flavour group, which…

High Energy Physics - Theory · Physics 2023-12-21 Johannes Aspman , Elias Furrer , Jan Manschot

Due to M\"{u}ller's theorem, the Kolmogorov complexity of a string was shown to be equal to its quantum Kolmogorov complexity. Thus there are no benefits to using quantum mechanics to compress classical information. The quantitative amount…

Computational Complexity · Computer Science 2024-07-04 Samuel Epstein
‹ Prev 1 8 9 10 Next ›