Related papers: Hyperpfaffians and Geometric Complexity Theory
Fix a finite group $G$. We analyze the computational complexity of the problem of counting homomorphisms $\pi_1(X) \to G$, where $X$ is a topological space treated as computational input. We are especially interested in requiring $G$ to be…
The subgroups of GL(n,R) that act irreducibly on R^n and that can occur as the holonomy of a torsion-free affine connection on an n-manifold are classified, thus completing the work on this subject begun by M. Berger in the 1950s. The…
Given an indefinite binary quaternionic Hermitian form $f$ with coefficients in a maximal order of a definite quaternion algebra over $\mathbb Q$, we give a precise asymptotic equivalent to the number of nonequivalent representations,…
For the p-adic group G=SL (2) , we present results of the computations of the sums of the Bernstein projectors of a given depth. Motivation for the computations is based on a conversation with Roger Howe in August 2013. The computations are…
This paper investigates second-order representations in the sense of Kawamura and Cook for spaces of integrable functions that regularly show up in analysis. It builds upon prior work about the space of continuous functions on the unit…
It has recently been shown that the problem of testing global convexity of polynomials of degree four is {strongly} NP-hard, answering an open question of N.Z. Shor. This result is minimal in the degree of the polynomial when global…
We classify the finite-dimensional rational representations $V$ of the exceptional algebraic groups $G$ with $\mathfrak g={\sf Lie}(G)$ such that the symmetric invariants of the semi-direct product $\mathfrak g\ltimes V$, where $V$ is an…
The self-consistent field method utilized for solving the Hartree-Fock (HF) problem and the closely related Kohn-Sham problem, is typically thought of as one of the cheapest methods available to quantum chemists. This intuition has been…
The classical Matrix-Tree Theorem allows one to list the spanning trees of a graph by monomials in the expansion of the determinant of a certain matrix. We prove that in the case of three-graphs (that is, hypergraphs whose edges have…
Motivated by the Novikov equation and its peakon problem, we propose a new mixed type Hermite--Pad\'{e} approximation whose unique solution is a sequence of polynomials constructed with the help of Pfaffians. These polynomials belong to the…
The main results presented in this dissertation are the following - We have shown that in $d=4$ weak hyperkahler torsion structures are the same that hypercomplex structures and the same that the Plebanski-Finley conformally invariant…
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of CNF formulas is always an upper bound on the width needed to refute them. Their proof is beautiful…
A second part of detailed elementary introduction into Khovanov homologies. This part is devoted to reduced Jones superpolynomials. The story is still about a hypercube of resolutions of a link diagram. Each resolution is a collection of…
This survey presents recent developments concerning the Shafarevich conjecture, non-abelian Hodge theories, hyperbolicity, and the topology of complex algebraic varieties, as well as the interplay among these areas. More precisely, we…
We consider the problem of computing succinct encodings of lists of generators for invariant rings for group actions. Mulmuley conjectured that there are always polynomial sized such encodings for invariant rings of…
The Solomon-Terao bi-polynomial was introduced by Solomon and Terao which degenerates to the characteristic polynomial of hyperplane arrangements. Also, it was proved recently that the other specialization of the Solomon-Terao…
This review is an extended version of the Seoul ICM 2014 proceedings.It is a short overview of the "topological recursion", a relation appearing in the asymptotic expansion of many integrable systems and in enumerative problems. We recall…
Mulmuley and Sohoni (GCT1 in SICOMP 2001, GCT2 in SICOMP 2008) proposed to view the permanent versus determinant problem as a specific orbit closure problem and to attack it by methods from geometric invariant and representation theory. We…
The Kervaire conjecture asserts that adding a generator and then a relator to a nontrivial group always results in a nontrivial group. We introduce new methods from stable commutator length to study this type of problems about nontriviality…
Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to…