Related papers: Polylogarithmic Cuts in Models of V^0
Neural network pruning has shown to be an effective technique for reducing the network size, trading desirable properties like generalization and robustness to adversarial attacks for higher sparsity. Recent work has claimed that…
The subject logic in computer science should entail proof theoretic applications. So the question arises whether open problems in computational complexity can be solved by advanced proof theoretic techniques. In particular, consider the…
We use techniques of relative algebraic K-theory to develop a common refinement of the existing theories of metrized and hermitian Galois structures in arithmetic. As a first application of this very general approach, we then use it to…
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseudorandom with respect to linear phases. The Goldreich-Levin…
According to Kirillov's theory, the construction of a unitary irreducible representation of a nilpotent Lie group requires a precise computation of some polarizing subalgebra subordinated to a linear functional in the linear dual of the…
We demonstrate exponential convergence of Reduced Order Model (ROM) approximations for mixed boundary value problems of the stationary, incompressible Navier-Stokes equations in plane, polygonal domains $\Omega$. Admissible boundary…
Solving polynomial systems arising from applications is frequently made easier by the structure of the systems. Weighted homogeneity (or quasi-homogeneity) is one example of such a structure: given a system of weights…
We study an algebraic cycle of the form $Z_0= r {\mathbb P}^{\frac{n}{2}}+\check r \check{\mathbb P}^{\frac{n}{2}}$, $r \in{\mathbb N},\check r \in{\mathbb Z},\ \ 1\leq r , |\check r |\leq 10,\ \ \gcd ( r ,\check r )=1$, inside the cubic…
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…
In this article, we realize the subquotient based modules of certain tensor products or restricted modules via Lusztig's perverse sheaves on multi-framed quivers, and provide a construction of their canonical bases. As an application, we…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
We describe a class of sharply o-minimal structures, called analytically generated structures, whose definable sets and their complexity filtration are determined by the collection of definable complex cells. We prove a polynomially…
One of the few available complete methods for checking the satisfiability of sets of polynomial constraints over the reals is the cylindrical algebraic covering (CAlC) method. In this paper, we propose an extension for this method to…
This paper is a natural continuation of our previous work on conformal embeddings of vertex algebras [6], [7], [8]. Here we consider conformal embeddings in simple affine vertex superalgebra $V_k(\mathfrak g)$ where $\mathfrak g=\mathfrak…
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 show that algebraic formulas and constant-depth circuits are closed under taking factors. In other words, we show that if a multivariate polynomial over a field of characteristic zero has a small constant-depth circuit or formula, then…
We give a purely algebraic treatment of reduction theory for connections over the formal punctured disc. Our proofs apply to arbitrary connected linear algebraic groups over an algebraically closed field of characteristic 0. We also state…
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…
In this paper we investigate the complexity-theoretical aspects of cyclic and non-wellfounded proofs in the context of parsimonious logic, a variant of linear logic where the exponential modality ! is interpreted as a constructor for…
We study the irreducibility of Wronskian Hermite polynomials labelled by partitions. It is known that these polynomials factor as a power of x times a remainder polynomial. We show that the remainder polynomial is irreducible for the…