Related papers: Effective cylindrical cell decompositions for rest…
An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…
We consider a global semianalytic set defined by real analytic functions definable in an o-minimal structure. When the o-minimal structure is polynomially bounded, we show that the closure of this set is a global semianalytic set defined by…
An algorithm is presented that solves the Minimum Dominating Set problem exactly using polynomial space based on dynamic programming for a tree decomposition. A direct application of dynamic programming based on a tree decomposition would…
One important question in algebraic complexity is understanding the complexity of polynomial ideals (Grochow, Bulletin of EATCS 131, 2020). Andrews and Forbes (STOC 2022) studied the determinantal ideals $I^{\det}_{n,m,r}$ generated by the…
This paper presents the first systematic study on the fundamental problem of seeking optimal cell average decomposition (OCAD), which arises from constructing efficient high-order bound-preserving (BP) numerical methods within Zhang--Shu…
The d-Segal conditions of Dyckerhoff and Kapranov are exactness properties for simplicial objects based on the geometry of cyclic polytopes in d-dimensional Euclidean space. 2-Segal spaces are also known as decomposition spaces, and most…
We consider cylindrical algebraic decompositions (CADs) as a tool for representing semi-algebraic subsets of $\mathbb{R}^n$. In this framework, a CAD $\mathscr{C}$ is adapted to a given set $S$ if $S$ is a union of cells of $\mathscr{C}$.…
Let $k$ be an algebraically closed field of characteristic $p>0$. Let $D$ be a $p$-divisible group over $k$. Let $n_D$ be the smallest non-negative integer for which the following statement holds: if $C$ is a $p$-divisible group over $k$ of…
Let G be a group of permutations of a denumerable set E. The profile of G is the function phi which counts, for each n, the number phi(n) of orbits of G acting on the n-subsets of E. Counting functions arising this way, and their associated…
A regularity lemma for polynomials provides a decomposition in terms of a bounded number of approximately independent polynomials. Such regularity lemmas play an important role in numerous results, yet suffer from the familiar shortcoming…
Computing the critical points of a polynomial function $q\in\mathbb Q[X_1,\ldots,X_n]$ restricted to the vanishing locus $V\subset\mathbb R^n$ of polynomials $f_1,\ldots, f_p\in\mathbb Q[X_1,\ldots, X_n]$ is of first importance in several…
One fundamental goal of high-dimensional statistics is to detect or recover planted structure (such as a low-rank matrix) hidden in noisy data. A growing body of work studies low-degree polynomials as a restricted model of computation for…
Explicit formulas determining the dimension and the degree of the singular subscheme of hypersurfaces in ${\mathbb P}^n$ are given in terms of the graded Betti numbers of the minimal free resolution of the corresponding Jacobian algebra.…
Let $K$ be an algebraically closed field that is complete with respect to a non-Archimedean absolute value, and let $\varphi\in K(z)$ have degree $d\geq 2$. We characterize maps for which the minimal resultant of an iterate $\varphi^n$ is…
Minimal free resolutions of graded modules over a noetherian polynomial ring have been attractive objects of interest for more than a hundred years. We introduce and study two natural extensions in the setting of graded modules over a…
Algorithms for computing or approximating optimal decompositions for decompositional parameters such as treewidth or clique-width have so far traditionally been tailored to specific width parameters. Moreover, for mim-width, no efficient…
We produce a family of complexes called trimming complexes and explore applications. We study how trimming complexes can be used to deduce the Betti table for the minimal free resolution of the ideal generated by subsets of a generating set…
We consider finite dimensional representations of the dihedral group $D_{2p}$ over an algebraically closed field of characteristic two where $p$ is an odd integer and study the degrees of generating and separating polynomials in the…
We give an explicit upper bound for the algebraic degree and an explicit lower bound for the absolute value of the minimum of a polynomial function on a compact connected component of a basic closed semialgebraic set when this minimum is…
In the paper, we show that the transformations between modified Jacobi and Bernstein bases of the constrained space of polynomials of degree at most $n$ can be performed with the complexity $O(n^2)$. As a result, the algorithm of degree…