Related papers: Algebraic Branching Programs, Border Complexity, a…
The nondeterministic advice complexity of the P-selective sets is known to be exactly linear. Regarding the deterministic advice complexity of the P-selective sets--i.e., the amount of Karp--Lipton advice needed for polynomial-time machines…
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and NP. They are defined using non-uniform sequences of…
It is known that there are classes of 2-CNFs requiring exponential size non-deterministic read-once branching programs to compute them. However, to the best of our knowledge, there are no superpolynomial lower bounds for branching programs…
The purpose of this paper is to study the Zariski tangent space of the punctual Hilbert scheme parametrizing subschemes of a smooth surface which are supported at a single point. We give a lower bound on the dimension of the tangent space…
We contribute to the program of proving lower bounds on the size of branching programs solving the Tree Evaluation Problem introduced by Cook et. al. (2012). Proving a super-polynomial lower bound for the size of nondeterministic thrifty…
In this paper we explore the noncommutative analogues, $\mathrm{VP}_{nc}$ and $\mathrm{VNP}_{nc}$, of Valiant's algebraic complexity classes and show some striking connections to classical formal language theory. Our main results are the…
In this paper, we proved two results regarding the arithmetics of separably $\mathbb{A}^1$-connected varieties of rank one. First we proved over a large field, there is an $\mathbb{A}^1$-curve through any rational point of the boundary, if…
In this paper, we establish some theoretical connections between Sum-Product Networks (SPNs) and Bayesian Networks (BNs). We prove that every SPN can be converted into a BN in linear time and space in terms of the network size. The key…
This article is the second one of three successive articles of the authors on the matrix-weighted Besov-type and Triebel--Lizorkin-type spaces. In this article, we obtain the sharp boundedness of almost diagonal operators on matrix-weighted…
We show that the class of Banach algebras that can be isometrically represented on an $L^p$-space, for $p\neq 2$, is not closed under quotients. This answers a question asked by Le Merdy 20 years ago. Our methods are heavily reliant on our…
Symmetry breaking is a widely popular approach to enhance solvers in constraint programming, such as those for SAT or MIP. Symmetry breaking predicates (SBPs) typically impose an order on variables and single out the lexicographic leader…
A recently introduced measure of Boolean functions complexity--disjunc\-tive complexity (DC)--is compared with other complexity measures: the space complexity of streaming algorithms and the complexity of nondeterministic branching programs…
The Zariski closure of the central path which interior point algorithms track in convex optimization problems such as linear, quadratic, and semidefinite programs is an algebraic curve. The degree of this curve has been studied in relation…
In some cases, computational benefit can be gained by exploring the hyper parameter space using a deterministic set of grid points instead of a Markov chain. We view this as a numerical integration problem and make three unique…
In this paper, we study linear convolutional networks with one-dimensional filters and arbitrary strides. The neuromanifold of such a network is a semialgebraic set, represented by a space of polynomials admitting specific factorizations.…
Let $p$ be a given modulus, let $u$ be prime to $p$, and consider the linear permutation $u\cdot n\pmod p$ of the residue system modulo $p$. Writing $\langle x\rangle_p$ to denote the least nonnegative residue of $x$ modulo $p$, we say that…
We prove that the kernel of a quotient operator from an $\mathcal L_1$-space onto a Banach space $X$ with the Bounded Approximation Property (BAP) has the BAP. This completes earlier results of Lusky --case $\ell_1$-- and Figiel, Johnson…
The strength of a homogeneous polynomial (or form) is the smallest length of an additive decomposition expressing it whose summands are reducible forms. Using polynomial functors, we show that the set of forms with bounded strength is not…
We study the expressivity and learning process for polynomial neural networks (PNNs) with monomial activation functions. The weights of the network parametrize the neuromanifold. In this paper, we study certain neuromanifolds using tools…
We show that codimension one dimensional Jacobian of the barycentric straightening map is uniformly bounded for most of the higher rank symmetric spaces. As a consequence, we prove that the locally finite simplicial volume of most $\mathbb…