Related papers: On topological lower bounds for algebraic computat…

A complex number $\alpha$ is said to satisfy the height reducing property if there is a finite set $F\subset \mathbb{Z}$ such that $\mathbb{Z}[\alpha]=F[\alpha]$, where $\mathbb{Z}$ is the ring of the rational integers. It is easy to see…

Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider…

In this paper we study topology of the variety of closed planar polygons with given side lengths. We describe the Betti numbers of the moduli spaces as functions of the length vector. We also find sharp upper bounds on the sum of Betti…

In this paper, we prove super-polynomial lower bounds for the model of \emph{sum of ordered set-multilinear algebraic branching programs}, each with a possibly different ordering ($\sum \mathsf{smABP}$). Specifically, we give an explicit…

Covering numbers are a powerful tool used in the development of approximation algorithms, randomized dimension reduction methods, smoothed complexity analysis, and others. In this paper we prove upper bounds on the covering number of…

Fix an integer h>=1. In the universe of coloured trees of height at most h, we prove that for any graph decision problem defined by an MSO formula with r quantifiers, there exists a set of kernels, each of size bounded by an elementary…

We prove that if $\alpha$ is a non-zero algebraic number of degree $d \geq 2$ which is not a root of unity, then $dh(\alpha)>(1/4) (\log(\log (d))/\log(d))^3.

Operators on the ring of algebraically constructible functions are used to compute local obstructions for a four-dimensional semialgebraic set to be homeomorphic to a real algebraic set. The link operator and arithmetic operators yield…

Since the breakthrough superpolynomial multilinear formula lower bounds of Raz (Theory of Computing 2006), proving such lower bounds against multilinear algebraic branching programs (mABPs) has been a longstanding open problem in algebraic…

We show that any Algebraic Branching Program (ABP) computing the polynomial $\sum_{i = 1}^n x_i^n$ has at least $\Omega(n^2)$ vertices. This improves upon the lower bound of $\Omega(n\log n)$, which follows from the classical result of Baur…

We prove several relations on the $f$-vectors and Betti numbers of flag complexes. For every flag complex $\Delta$, we show that there exists a balanced complex with the same $f$-vector as $\Delta$, and whose top-dimensional Betti number is…

Let $k$ be a number field and $S$ a finite set of places of $k$ containing the archimedean ones. We count the number of algebraic points of bounded height whose coordinates lie in the ring of $S$-integers of $k$. Moreover, we give an…

We study the question of the growth of Betti numbers of certain arithmetic varieties in tower of congruence coverings. In fact, our results are about Siegel varieties and varieties associated to orthogonal groups. We explain how a theorem…

We use Boij-S\"oderberg theory to provide some order of magnitude bounds on algebraic Betti numbers.

We prove a bound conjectured by Itenberg on the Betti numbers of real algebraic hypersurfaces near non-singular tropical limits. These bounds are given in terms of the Hodge numbers of the complexification. To prove the conjecture we…

We obtain a sharp upper bound for the length of arbitrary non-associative algebra and present an example demonstrating the sharpness of our bound. To show this we introduce a new method of characteristic sequences based on linear algebra…

In this work we analyze some topological properties of the remainder $\partial M:=\beta_s^* M\setminus M$ of the semialgebraic Stone-C\v{e}ch compactification $\beta_s^* M$ of a semialgebraic set $M\subset{\mathbb R}^m$ in order to…

We prove that any smooth action of $\mathbb Z^{m-1}, m\ge 3$ on an $m$-dimensional manifold that preserves a measure such that all non-identity elements of the suspension have positive entropy is essentially algebraic, i.e. isomorphic up to…

Bounds on the log partition function are important in a variety of contexts, including approximate inference, model fitting, decision theory, and large deviations analysis. We introduce a new class of upper bounds on the log partition…

Let $\mathcal{A}$ be an abelian category. Denote by $\mathrm{D}^{b}(\mathcal{A})$ the bounded derived category of $\mathcal{A}$. In this paper, we investigate the lower bounds for the levels of objects in $\mathrm{D}^{b}(\mathcal{A})$ with…