Related papers: On the complexity of evaluating highest weight vec…
We consider models of gravitation that are based on unimodular general coordinate transformations (GCT). These transformations include only those which do not change the determinant of the metric. We treat the determinant as a separate…
In two papers, B\"urgisser and Ikenmeyer (STOC 2011, STOC 2013) used an adaption of the geometric complexity theory (GCT) approach by Mulmuley and Sohoni (Siam J Comput 2001, 2008) to prove lower bounds on the border rank of the matrix…
We study algebraic complexity classes and their complete polynomials under \emph{homogeneous linear} projections, not just under the usual affine linear projections that were originally introduced by Valiant in 1979. These reductions are…
We propose a graded classification of the entire field of multivector physics, including all alternative points of view. The (often tacit) postulates of different types of formulations are contrasted, summarizing their consequences.…
Let G=GL_n be the general linear group over an algebraically closed field k and let g=gl_n be its Lie algebra. Let U be the subgroup of G which consists of the upper unitriangular matrices. Let k[g] be the algebra of regular functions on…
The largest known class of gravitational backgrounds with an exact string theoretical description is based on coset G/H CFTs and the corresponding gauged WZW models. These backgrounds generically lack isometries and are quite complicated.…
Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$…
Let G=GL_n be the general linear group over an algebraically closed field k and let g=gl_n be its Lie algebra. Let U be the subgroup of G which consists of the upper unitriangular matrices. Let k[g] be the algebra of polynomial functions on…
I survey methods from differential geometry, algebraic geometry and representation theory relevant for the permanent v. determinant problem from computer science, an algebraic analog of the P v. NP problem.
We develop a new method for representing Hilbert series based on the highest weight Dynkin labels of their underlying symmetry groups. The method draws on plethystic functions and character generating functions along with Weyl integration.…
We present two geometric interpretations for complex multivectors and determinants: a little known one in terms of square roots of volumes, and a new one which uses fractions of volumes and allows graphical representations. The fraction…
We discuss the geometry of orbit closures and the asymptotic behavior of Kronecker coefficients in the context of the Geometric Complexity Theory program to prove a variant of Valiant's algebraic analog of the P not equal to NP conjecture.…
Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures. This area has been thriving in the last decade, leading…
General factors are a generalization of matchings. Given a graph $G$ with a set $\pi(v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general factor problem is to find a (spanning) subgraph $F$ of $G$…
We formalize a framework of algebraically natural lower bounds for algebraic circuits. Just as with the natural proofs notion of Razborov and Rudich for boolean circuit lower bounds, our notion of algebraically natural lower bounds captures…
We determine set-theoretic defining equations for the variety of hypersurfaces of degree d in an N-dimensional complex vector space that have dual variety of dimension at most k. We apply these equations to the Mulmuley-Sohoni variety, the…
Representing graphs by their homomorphism counts has led to the beautiful theory of homomorphism indistinguishability in recent years. Moreover, homomorphism counts have promising applications in database theory and machine learning, where…
We study the variety membership testing problem in the case when the variety is given as an orbit closure and the ambient space is the set of all 3-tensors. The first variety that we consider is the slice rank variety, which consists of all…
Highest weight categories are described in terms of standard objects and recollements of abelian categories, working over an arbitrary commutative base ring. Then the highest weight structure for categories of strict polynomial functors is…
Motivated by the concept of Euclidean Distance Degree, which measures the complexity of finding the nearest point to an algebraic set in Euclidean space, we introduce the notion of Grassmann Distance Complexity (GDC). This concept…