English
Related papers

Related papers: Geometric complexity theory for product-plus-power

200 papers

We study modules for the divided power algebra $D$ in a single variable over a commutative noetherian ring $k$. Our first result states that $D$ is a coherent ring. In fact, we show that there is a theory of Gr\"obner bases for finitely…

Commutative Algebra · Mathematics 2018-02-20 Rohit Nagpal , Andrew Snowden

We construct new knot polynomials. Let $V$ be the standard solid torus in 3-space and let $pr$ be its standard projection onto an annulus. Let $M$ be the space of all smooth oriented knots in $V$ such that the restriction of $pr$ is an…

Geometric Topology · Mathematics 2007-05-23 Thomas Fiedler

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

Let $f$ be a homogeneous polynomial over a field. For many fields, including number fields and function fields, we prove that the strength of $f$ is bounded above by a constant multiple of the Birch rank of $f.$ The constant depends only on…

Number Theory · Mathematics 2025-09-03 Benjamin Baily , Amichai Lampert

Geometric complexity theory (GCT) is an approach to the P vs. NP and related problems. This article gives its complexity theoretic overview without assuming any background in algebraic geometry or representation theory.

Computational Complexity · Computer Science 2009-08-19 Ketan D. Mulmuley

The Stolz--Teichner program proposes a deep connection between geometric field theories and certain cohomology theories. In this paper, we extend this connection by developing a theory of geometric power operations for geometric field…

Algebraic Topology · Mathematics 2022-11-09 Tobias Barthel , Daniel Berwick-Evans , Nathaniel Stapleton

We study the relationship between the tensor product multiplicities of a compact semisimple Lie algebra $\mathfrak{g}$ and a special function $\mathcal{J}$ associated to $\mathfrak{g}$, called the volume function. The volume function arises…

Combinatorics · Mathematics 2020-04-28 Colin McSwiggen

We extend the existing skew polynomial representations of matrix algebras which are direct sum of matrix spaces over division rings. In this representation, the sum-rank distance between two tuples of matrices is captured by a weight…

Information Theory · Computer Science 2025-12-10 Alessandro Neri , Paolo Santonastaso

We establish a quantitative relationship between mixed de Rham classes and the geometric complexity of metric connections with totally skew torsion on product manifolds where both factors are compact oriented surfaces. For any…

Differential Geometry · Mathematics 2026-04-21 Alexander Pigazzini , Magdalena Toda

We determine the Waring ranks of all sextic binary forms with complex coefficients using a Geometric Invariant Theory approach. Using the five basic invariants for sextic binary forms, our results give a rapid method to determine the Waring…

Algebraic Geometry · Mathematics 2022-08-10 Alexandru Dimca , Gabriel Sticlaru

We introduce an equivariant Pontrjagin-Thom construction which identifies equivariant cohomotopy classes with certain fixed point bordism classes. This provides a concrete geometric model for equivariant cohomotopy which works for any…

Algebraic Topology · Mathematics 2018-11-22 Daniel Grady

We propose a novel algebraic framework for treating probability distributions represented by their cumulants such as the mean and covariance matrix. As an example, we consider the unsupervised learning problem of finding the subspace on…

We derive a spacetime formulation of quantum general relativity from (hamiltonian) loop quantum gravity. In particular, we study the quantum propagator that evolves the 3-geometry in proper time. We show that the perturbation expansion of…

General Relativity and Quantum Cosmology · Physics 2014-11-17 Michael P Reisenberger , Carlo Rovelli

We extend the Ax-Katz theorem for a single polynomial from finite fields to the rings Z_m with m composite. This extension not only yields the analogous result, but gives significantly higher divisibility bounds. We conjecture what computer…

Computational Complexity · Computer Science 2014-08-19 Robert L. Surowka , Kenneth W. Regan

In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…

Algebraic Geometry · Mathematics 2024-12-24 Kartoue Mady Demdah , Ibrahim Nonkane

Let $G$ be a connected reductive group acting on a complex vector space $V$ and projective space ${\mathbb P}V$. Let $x\in V$ and ${\cal H}\subseteq {\cal G}$ be the Lie algebra of its stabilizer. Our objective is to understand points…

Representation Theory · Mathematics 2022-01-04 Bharat Adsul , Milind Sohoni , K V Subrahmanyam

The permanent vs. determinant problem is one of the most important problems in theoretical computer science, and is the main target of geometric complexity theory proposed by Mulmuley and Sohoni. The current best lower bound for the…

Computational Complexity · Computer Science 2015-04-02 Akihiro Yabe

Using Green's hyperplane restriction theorem, we prove that the rank of a Hermitian form on the space of holomorphic polynomials is bounded by a constant depending only on the maximum rank of the form restricted to affine manifolds. As an…

Complex Variables · Mathematics 2014-05-08 Dusty Grundmeier , Jiri Lebl , Liz Vivas

We consider polynomial approximations of z-bar to better understand the torsional rigidity of polygons. Our main focus is on low degree approximations and associated extremal problems that are analogous to Polya's conjecture for torsional…

Classical Analysis and ODEs · Mathematics 2024-11-13 Adam Kraus , Brian Simanek

Connected clustering denotes a family of constrained clustering problems in which we are given a distance metric and an undirected connectivity graph $G$ that can be completely unrelated to the metric. The aim is to partition the $n$…

Data Structures and Algorithms · Computer Science 2025-11-25 Jan Eube , Heiko Röglin
‹ Prev 1 8 9 10 Next ›