English
Related papers

Related papers: Geometric Complexity Theory II: Towards explicit o…

200 papers

This article describes a formal strategy of geometric complexity theory (GCT) to resolve the {\em self referential paradox} in the $P$ vs. $NP$ and related problems. The strategy, called the {\em flip}, is to go for {\em explicit proofs} of…

Computational Complexity · Computer Science 2010-09-02 Ketan Mulmuley

We discuss the possibility of extending different versions of the Campbell-Magaard theorem, which have already been established in the context of semi-Riemannian geometry, to the context of Weyl's geometry. We show that some of the known…

General Relativity and Quantum Cosmology · Physics 2017-01-31 R. Avalos , F. Dahia , C. Romero

Let K be a Lie group and P be a K-principal bundle on a manifold M. Suppose given furthermore a central extension 1\to Z\to \hat{K}\to K\to 1 of K. It is a classical question whether there exists a \hat{K}-principal bundle \hat{P} on M such…

Algebraic Topology · Mathematics 2008-09-04 Camille Laurent-Gengoux , Friedrich Wagemann

We reduce the isomorphism problem for undirected graphs without loops to the isomorphism problems for a class of finite dimensional $2$-step nilpotent Lie algebras over a field and for a class of finite $p$-groups. We show that the…

Group Theory · Mathematics 2020-08-03 Ruvim Lipyanski , Natalia Vanetik

In this paper, we establish an innovative framework in logarithmic Hodge theory for toroidal varieties, introducing weighted toroidal structures and developing a systematic obstruction theory for Hodge classes. Building upon recent advances…

Algebraic Geometry · Mathematics 2025-09-30 Jiaming Luo

Geometric complexity theory (GCT) is an approach towards separating algebraic complexity classes through algebraic geometry and representation theory. Originally Mulmuley and Sohoni proposed (SIAM J Comput 2001, 2008) to use occurrence…

Computational Complexity · Computer Science 2021-02-16 Markus Bläser , Julian Dörfler , Christian Ikenmeyer

Motivated by the theory of proof complexity generators we consider the following $\Sigma^p_2$ search problem $\mbox{DD}_P$ determined by a propositional proof system $P$: given a $P$-proof $\pi$ of a disjunction $\bigvee_i {\alpha}_i$, no…

Computational Complexity · Computer Science 2026-05-13 Jan Krajicek

Let G be a finite group. Over any finite G-poset P we may define a transporter category as the corresponding Grothendieck construction. The classifying space of the transporter category is the Borel construction on the G-space BP, while the…

Group Theory · Mathematics 2011-08-29 Fei Xu

We investigate the $\mathcal F$-Borel complexity of topological spaces in their different compactifcations. We provide a simple proof of the fact that a space can have arbitrarily many different complexities in different compactifications.…

General Topology · Mathematics 2018-04-24 Vojtěch Kovařík

We study cohomological obstructions to the existence of global conserved quantities. In particular, we show that, if a given local variational problem is supposed to admit global solutions, certain cohomology classes cannot appear as…

Mathematical Physics · Physics 2015-10-30 M. Francaviglia , M. Palese , E. Winterroth

Several physically inspired problems have been proven undecidable; examples are the spectral gap problem and the membership problem for quantum correlations. Most of these results rely on reductions from a handful of undecidable problems,…

A general structure theorem on higher order invariants is proven. For an arithmetic group, the structure of the corresponding Hecke module is determined. It is shown that the module does not contain any irreducible submodule. This explains…

Number Theory · Mathematics 2017-09-04 Anton Deitmar

In the previous paper, we studied obstructions to the existence of complex sections on almost complex manifolds up to cobordism. We determined the obstruction rationally, in terms of the Chern classes. In this paper, we study the torsion…

Algebraic Topology · Mathematics 2024-09-04 Dennis Nguyen

This is the continuation of the article by the author that proves a broader class of families admitting the theorem of restriction of sections other than Abelian varieties and gives new examples of pseudo-N\'eron models. In this work, we…

Algebraic Geometry · Mathematics 2019-09-18 Santai Qu

We develop a complexity theory for approximate real computations. We first produce a theory for exact computations but with condition numbers. The input size depends on a condition number, which is not assumed known by the machine. The…

Computational Complexity · Computer Science 2020-05-05 Gregorio Malajovich , Mike Shub

Let $G$ be an algebraic group and let $X$ be a smooth $G$-variety with two orbits: an open orbit and a a closed orbit of codimension $1$. We give an algebraic description of the category of $G$-equivariant vector bundles on $X$ under a mild…

Algebraic Geometry · Mathematics 2022-02-22 Lucas Mason-Brown , James Tao

Let $C$ be a curve of genus $g$. A fundamental problem in the theory of algebraic curves is to understand maps $C \to \mathbb{P}^r$ of specified degree $d$. When $C$ is general, the moduli space of such maps is well-understood by the main…

Algebraic Geometry · Mathematics 2025-01-08 Eric Larson , Hannah Larson , Isabel Vogt

Let $k$ be a field, let $G$ be a reductive algebraic group over $k$, and let $V$ be a linear representation of $G$. Geometric invariant theory involves the study of the $k$-algebra of $G$-invariant polynomials on $V$, and the relation…

Number Theory · Mathematics 2012-08-07 Manjul Bhargava , Benedict H. Gross

Geometric complexity theory (GCT) is an approach to the $P$ vs. $NP$ and related problems through algebraic geometry and representation theory. This article gives a high-level exposition of the basic plan of GCT based on the principle,…

Computational Complexity · Computer Science 2007-09-07 Ketan D. Mulmuley

We investigate the intersection problem for finite semigroups, which asks for a given set of regular languages, represented by recognizing morphisms to finite semigroups, whether there exists a word contained in their intersection. We…

Formal Languages and Automata Theory · Computer Science 2018-06-14 Lukas Fleischer