Related papers: Combinatorial Bounds in Distal Structures
The submodular partitioning problem asks to minimize, over all partitions $P$ of a ground set $V$, the sum of a given submodular function $f$ over the parts of $P$. The problem has seen considerable work in approximability, as it…
This article explains and extends semialgebraic homotopy theory (developed by H. Delfs and M. Knebusch) to o-minimal homotopy theory (over a field). The homotopy category of definable CW-complexes is equivalent to the homotopy category of…
An extended formulation of a polytope P is a polytope Q which can be projected onto P. Extended formulations of small size (i.e., number of facets) are of interest, as they allow to model corresponding optimization problems as linear…
We study combinatorial problems related to the singularities and boundary components of toroidal compactifications of orthogonal modular varieties. In particular, those associated with the moduli of algebraic deformation generalised Kummer…
We study lower bounds for the norm of the product of polynomials and their applications to the so called \emph{plank problem.} We are particularly interested in polynomials on finite dimensional Banach spaces, in which case our results…
We investigate the extrinsic geometry of causal sets in $(1+1)$-dimensional Minkowski spacetime. The properties of boundaries in an embedding space can be used not only to measure observables, but also to supplement the discrete action in…
This article provides examples of distal metric structures. One source of examples are metric valued fields. By analyzing indiscernible sequences, we show that real closed metric valued fields are distal, and conclude that algebraically…
In the problem of semialgebraic range searching, we are to preprocess a set of points in $\mathbb{R}^D$ such that the subset of points inside a semialgebraic region described by $O(1)$ polynomial inequalities of degree $\Delta$ can be found…
This paper constructs polynomial bases that capture the structure of the de Rham complex with boundary conditions in disks and cylinders (both periodic and finite) in a way that respects rotational symmetry. The starting point is explicit…
This paper generalizes a theorem of Hida on the structure of ordinary representations on unitary groups to $P$-ordinary representations, where $P$ is a general parabolic subgroup of some general linear group. When $P$ is minimal, we recover…
New lower bounds on the minimum distance of quasi-twisted codes over finite fields are proposed. They are based on spectral analysis and eigenvalues of polynomial matrices. They generalize the Semenov-Trifonov and Zeh-Ling bounds in a…
We define and study a class of finite topological spaces, which model the cell structure of a space obtained by gluing finitely many Euclidean convex polyhedral cells along congruent faces. We call these finite topological spaces,…
We show that static data structure lower bounds in the group (linear) model imply semi-explicit lower bounds on matrix rigidity. In particular, we prove that an explicit lower bound of $t \geq \omega(\log^2 n)$ on the cell-probe complexity…
Recent developments in unifying treatment of domain wall configurations and their global space-time structure is presented. Domain walls between vacua of non-equal cosmological constant fall in three classes depending on the value of their…
We study limitations of polynomials computed by depth two circuits built over read-once polynomials (ROPs) and depth three syntactically multi-linear formulas. We prove an exponential lower bound for the size of the $\Sigma\Pi^{[N^{1/30}]}$…
In these notes we give a brief introduction to decomposition theory and we summarize some classical and well-known results. The main question is that if a partitioning of a topological space (in other words a decomposition) is given, then…
We provide sharp cylindrical parametrizations of cylindrical cell decompositions by maps with bounded $C^{r}$ norm in the sharply o-minimal setting, thus generalizing and strengthening the Yomdin-Gromov Algebraic Lemma. We introduce forts,…
For orthogonal polynomials defined by compact Jacobi matrix with exponential decay of the coefficients, precise properties of orthogonality measure is determined. This allows showing uniform boundedness of partial sums of orthogonal…
We study error-correcting codes in the space $\mathcal{S}_{n,q}$ of length-$n$ multisets over a $q$-ary alphabet under the deletion metric, motivated by permutation channels in which ordering is completely lost and errors act only on symbol…
This paper answers several open questions around structures with o-minimal open core. We construct an expansion of an o-minimal structure $\mathcal{R}$ by a unary predicate such that its open core is a proper o-minimal expansion of…