Related papers: Hyperpfaffians and Geometric Complexity Theory

The main result of this paper is the existence of a hyperinvariant subspace of weighted composition operator $Tf=vf\circ\tau$ on $L^p([0,1]^d)$, ($1 \leq p \leq \infty$) when the weight $v$ is in the class of ``generalized polynomials'' and…

In 1979 Valiant introduced the complexity class VNP of p-definable families of polynomials, he defined the reduction notion known as p-projection and he proved that the permanent polynomial and the Hamiltonian cycle polynomial are…

Let R be a commutative ring with 1. We prove that every homogeneous polynomial f(x_0,x_1,x_2) in R[x_0,x_1,x_2] up to degree 5 admits a linear Pfaffian R-representation. We believe that conceptually we give the shortest self-contained proof…

Let $\mathcal A$ be a hyperplane arrangement in a vector space $V$ and $G \leq GL(V)$ a group fixing $\mathcal A$. In case when $G$ is a complex reflection group and $\mathcal A=\mathcal A(G)$ is its reflection arrangement in $V$, Douglass,…

Valiant's famous determinant versus permanent problem is the flagship problem in algebraic complexity theory. Mulmuley and Sohoni (Siam J Comput 2001, 2008) introduced geometric complexity theory, an approach to study this and related…

We introduce new polynomial invariants of a finite-dimensional semisimple and cosemisimple Hopf algebra A over a field by using the braiding structures of A. We investigate basic properties of the polynomial invariants including stability…

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 develop a representation theoretic technique for detecting closed orbits that is applicable in all characteristics. Our technique is based on Kempf's theory of optimal subgroups and we make some improvements and simplify the theory from…

We study the topological complexity of sets defined using Khovanskii's Pfaffian functions, in terms of an appropriate notion of format for those sets. We consider semi- and sub-Pfaffian sets, but more generally any definable set in the…

We provide a list of new natural $\mathsf{VNP}$-intermediate polynomial families, based on basic (combinatorial) $\mathsf{NP}$-complete problems that are complete under parsimonious reductions. Over finite fields, these families are in…

Given a complex orthosymplectic superspace $V$, the orthosymplectic Lie superalgebra $\mathfrak {osp}(V)$ and general linear algebra ${\mathfrak {gl}}_N$ both act naturally on the coordinate super-ring $\mathcal{S}(N)$ of the dual space of…

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…

Integrals of the Pfaffian form over the nonsingular part of a projective variety compute information closely related to the Mather-Chern class of the variety and to other invariants such as the local Euler obstruction along strata of its…

We introduce a subexponential algorithm for geometric solving of multivariate polynomial equation systems whose bit complexity depends mainly on intrinsic geometric invariants of the solution set. From this algorithm, we derive a new…

We study the Hopf monoid of convex geometries, which contains partial orders as a Hopf submonoid, and investigate the combinatorial invariants arising from canonical characters. Each invariant consists of a pair: a polynomial and a more…

Valiant's conjecture asserts that the circuit complexity classes VP and VNP are distinct, meaning that the permanent does not admit polynomial-size algebraic circuits. As it is the case in many branches of complexity theory, the…

Questions concerning small fractional parts of polynomials and pseudo-polynomials have a long history in analytic number theory. In this paper, we improve on earlier work by Madritsch and Tichy. In particular, let $f=P+\phi$ where $P$ is a…

In this work we study oblivious complexity classes. These classes capture the power of interactive proofs where the prover(s) are only given the input size rather than the actual input. In particular, we study the connections between the…

Gabrielov introduced the notion of relative closure of a Pfaffian couple as an alternative construction of the o-minimal structure generated by Khovanskii's Pfaffian functions. In this paper, use the notion of format (or complexity) of a…

We find a class of minimal hypersurfaces H(k) as the zero level set of Pfaffians, resp. determinants of real 2k+2 dimensional antisymmetric matrices. While H(1) and H(2) are congruent to a 6-dimensional quadratic cone resp. Hsiang's cubic…