Related papers: Effective cylindrical cell decompositions for rest…
We provide a structure theorem for all almost complete intersection ideals of depth three in any Noetherian local ring. In particular, we find that the minimal generators are the pfaffians of suitable submatrices of an alternating matrix.…
Recently, Forbes, Kumar and Saptharishi [CCC, 2016] proved that there exists an explicit $d^{O(1)}$-variate and degree $d$ polynomial $P_{d}\in VNP$ such that if any depth four circuit $C$ of bounded formal degree $d$ which computes a…
We prove a decomposition of definable groups in o-minimal structures generalizing the Jordan-Chevalley decomposition of linear algebraic groups. It follows that any definable linear group G is a semidirect product of its maximal normal…
We study the structure of bounded degree polynomials over finite fields. Haramaty and Shpilka [STOC 2010] showed that biased degree three or four polynomials admit a strong structural property. We confirm that this is the case for degree…
We generalize the seminal polynomial partitioning theorems of Guth and Katz to a set of semi-Pfaffian sets. Specifically, given a set $\Gamma \subseteq \mathbb{R}^n$ of $k$-dimensional semi-Pfaffian sets, where each $\gamma \in \Gamma$ is…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Given a polynomial $f$ and a semi-algebraic set $S$, we provide a symbolic algorithm to find the equations and inequalities defining a semi-algebraic set $Q$ which is identical to the closure of the image of $S$ under $f$, i.e.,…
Cylindrical algebraic decomposition (CAD) is an important tool for working with polynomial systems, particularly quantifier elimination. However, it has complexity doubly exponential in the number of variables. The base algorithm can be…
For each integer $d\geq 2$, let $M_d$ denote the moduli space of maps $f: \mathbb{P}^1\to \mathbb{P}^1$ of degree $d$. We study the geometric configurations of subsets of postcritically finite (or PCF) maps in $M_d$. A complex-algebraic…
We show that the class of $\mathcal{L}$-constructible functions is closed under integration for any $P$-minimal expansion of a $p$-adic field $(K,\mathcal{L})$. This generalizes results previously known for semi-algebraic and sub-analytic…
Certifying feasibility in decision-making, critical in many industries, can be framed as a constraint satisfaction problem. This paper focuses on characterising a subset of parameter values from an a priori set that satisfy constraints on a…
We investigate the combinatorial discrepancy of geometric set systems having bounded shallow cell complexity in the \emph{Beck-Fiala} setting, where each point belongs to at most $t$ ranges. For set systems with shallow cell complexity…
The \emph{Noetherian class} is a wide class of functions defined in terms of polynomial partial differential equations. It includes functions appearing naturally in various branches of mathematics (exponential, elliptic, modular, etc.). A…
We prove that a theorem of Pawlucki, showing that Whitney regularity for a subanalytic set with a smooth singular locus of codimension one implies the set is a finite union of differentiable manifolds with boundary, applies to definable…
The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…
In a sequence of seminal results in the 80's, Kaltofen showed that the complexity class VP is closed under taking factors. A natural question in this context is to understand if other natural classes of multivariate polynomials, for…
These notes focus on the Lipschitz geometry of sets that are definable in o-minimal structures (expanding the real field). We show that every set which is definable in a polynomially bounded o-minimal structure admits a stratification which…
Modular Decomposition focuses on repeatedly identifying a module M (a collection of vertices that shares exactly the same neighbourhood outside of M) and collapsing it into a single vertex. This notion of exactitude of neighbourhood is very…
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simple as path or tree decompositions, such dynamic programming…
It is known that point searching in basic semialgebraic sets and the search for globally minimal points in polynomial optimization tasks can be carried out using $(s\,d)^{O(n)}$ arithmetic operations, where $n$ and $s$ are the numbers of…