Related papers: Algebraic metacomplexity and representation theory
The framework of algebraically natural proofs was independently introduced in the works of Forbes, Shpilka and Volk (2018), and Grochow, Kumar, Saks and Saraf (2017), to study the efficacy of commonly used techniques for proving lower…
We observe that a certain kind of algebraic proof - which covers essentially all known algebraic circuit lower bounds to date - cannot be used to prove lower bounds against VP if and only if what we call succinct hitting sets exist for VP.…
We survey recent progress in the proof complexity of strong proof systems and its connection to algebraic circuit complexity, showing how the synergy between the two gives rise to new approaches to fundamental open questions, solutions to…
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least as strong as Frege---yielding a semantic way to define a…
We give upper and lower bounds on the power of subsystems of the Ideal Proof System (IPS), the algebraic proof system recently proposed by Grochow and Pitassi, where the circuits comprising the proof come from various restricted algebraic…
A class of representations of a Lie superalgebra (over a commutative superring) in its symmetric algebra is studied. As an application we get a direct and natural proof of a strong form of the Poincare'-Birkhoff-Witt theorem, extending this…
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…
Proofs of the fundamental theorem of algebra can be divided up into three groups according to the techniques involved: proofs that rely on real or complex analysis, algebraic proofs, and topological proofs. Algebraic proofs make use of the…
Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…
Let h \subset g be an inclusion of Lie algebras with quotient h-module n. There is a natural degree filtration on the h-module U(g)/U(g)h whose associated graded h-module is isomorphic to S(n). We give a necessary and sufficient condition…
We consider symmetric (under the action of products of finite symmetric groups) real algebraic varieties and semi-algebraic sets, as well as symmetric complex varieties in affine and projective spaces, defined by polynomials of degrees…
In a recent paper with Sahi and Stokman, we introduced quasi-polynomial generalizations of Macdonald polynomials for arbitrary root systems via a new class of representations of the double affine Hecke algebra. These objects depend on a…
The weight systems of finite-dimensional representations of complex, simple Lie algebras exhibit patterns beyond Weyl-group symmetry. These patterns occur because weight systems can be decomposed into lattice polytopes in a natural way.…
In one of his last papers, Boris Weisfeiler proved that if modular semisimple Lie algebra possesses a solvable maximal subalgebra which defines in it a long filtration, then associated graded algebra is isomorphic to one constructed from…
We develop an elementary method for proving the PBW theorem for associative algebras with an ascending filtration. The idea is roughly the following. At first, we deduce a proof of the PBW property for the {\it ascending} filtration (with…
We prove new modularity lifting theorems for p-adic Galois representations in situations where the methods of Wiles and Taylor--Wiles do not apply. Previous generalizations of these methods have been restricted to situations where the…
Cylindrical Algebraic Decomposition (CAD) has long been one of the most important algorithms within Symbolic Computation, as a tool to perform quantifier elimination in first order logic over the reals. More recently it is finding…
We show that the polytopes obtained from the Birkhoff polytope by imposing additional inequalities restricting the "longest increasing subsequence" have Ehrhart quasi-polynomials which are honest polynomials, even though they are just…
We introduce a new algebraic proof system, which has tight connections to (algebraic) circuit complexity. In particular, we show that any super-polynomial lower bound on any Boolean tautology in our proof system implies that the permanent…
For a restricted Lie superalgebra g over an algebraically closed field of characteristic p > 2, we generalize the deformation method of Premet and Skryabin to obtain results on the p-power and 2-power divisibility of dimensions of…