Related papers: Geometric Complexity Theory VI: the flip via satur…
This paper gives a complete selfcontained proof of our result announced in hep-th/9909126 showing that renormalization in quantum field theory is a special instance of a general mathematical procedure of extraction of finite values based on…
We study the complexity of fundamental distributed graph problems in the recently popular setting where information about the input graph is available to the nodes before the start of the computation. We focus on the most common such…
It is quite common to use the generalized probabilistic theories (GPTs) as generic models to reconstruct quantum theory from a few basic principles and to gain a better understanding of the probabilistic or information theoretic foundations…
Let $G$ be a complex classical group, and let $V$ be its defining representation (possibly plus a copy of the dual). A foundational problem in classical invariant theory is to write down generators and relations for the ring of…
This paper is devoted to advancing the theoretical understanding of the iterated immediate snapshot (IIS) complexity of the Weak Symmetry Breaking task (WSB). Our rather unexpected main theorem states that there exist infinitely many values…
A dichotomy theorem for counting problems due to Creignou and Hermann states that or any nite set S of logical relations, the counting problem #SAT(S) is either in FP, or #P-complete. In the present paper we show a dichotomy theorem for…
This paper is motivated by questions such as P vs. NP and other questions in Boolean complexity theory. We describe an approach to attacking such questions with cohomology, and we show that using Grothendieck topologies and other ideas from…
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…
In this article, we define and study a geometry and an order on the set of partitions of an even number of objects. One of the definitions involves the partition algebra, a structure of algebra on the set of such partitions depending on an…
In our paper~\cite{KR} we began a systematic study of representations of the universal central extension $\widehat{\Cal D}\/$ of the Lie algebra of differential operators on the circle. This study was continued in the paper~\cite{FKRW} in…
A normalizable complex distribution $P(x)$ on a manifold $\mathcal{M}$ can be regarded as a complex weight, thereby allowing to define expectation values of observables $A(x)$ defined on $\mathcal{M}$. Straightforward importance sampling,…
We construct real and complex matrices in terms of Kronecker products of a Witt basis of 2n null vectors in the geometric algebra over the real and complex numbers. In this basis, every matrix is represented by a unique sum of products of…
Given a finite group G and a field F, a G-set X gives rise to an F[G]-permutation module F[X]. This defines a map from the Burnside ring of G to its representation ring over F. It is an old problem in representation theory, with…
In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. 1. Given a permutation group G=<S>, subgroup of $S_n$, and a parameter $k$, find a permutation $\pi$ in G such that…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
As the dimensions and operating voltages of computer electronics shrink to cope with consumers' demand for higher performance and lower power consumption, circuit sensitivity to soft errors increases dramatically. Recently, a new data-type…
One of the most beautiful results in the integral representation theory of finite groups is a theorem of A. Weiss that detects a permutation $R$-lattice for the finite $p$-group $G$ in terms of the restriction to a normal subgroup $N$ and…
The description of gravity in the form of an embedding theory is based on the hypothesis that our space-time is a four-dimensional surface in a flat ten-dimensional space. The choice of standard Einstein-Hilbert action leads in this case to…
Geometric Complexity Theory as initiated by Mulmuley and Sohoni in two papers (SIAM J Comput 2001, 2008) aims to separate algebraic complexity classes via representation theoretic multiplicities in coordinate rings of specific group…
We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…