Related papers: Quantitative visibility estimates for unrectifiabl…
A bound for Betti numbers of sets definable in o-minimal structures is presented. An axiomatic complexity measure is defined, allowing various concrete complexity measures for definable functions to be covered. This includes common concrete…
Orbit-finite models of computation generalise the standard models of computation, to allow computation over infinite objects that are finite up to symmetries on atoms, denoted by $\mathbb{A}$. Set theory with atoms is used to reason about…
Spectrahedra are sets defined by linear matrix inequalities. Projections of spectrahedra are called semidefinitely representable sets. Both kinds of sets are of practical use in polynomial optimization, since they occur as feasible sets in…
We calculate the particle spectrum of the SSM which follows from the assumption that the commonly assumed universal form of the soft supersymmetry --breaking terms is invariant under renormalisation. It is argued that this ``strong''…
Defining the $m$-th stratum of a closed subset of an $n$ dimensional Euclidean space to consist of those points, where it can be touched by a ball from at least $n-m$ linearly independent directions, we establish that the $m$-th stratum is…
A totally symmetric set is a finite subset of a group for which any permutation of the elements can be realized by conjugation in the ambient group. Such sets are rigid under homomorphisms, and so exert a great deal of control over the…
We study the modular representation theory of the symmetric and alternating groups. One of the most natural ways to label the irreducible representations of a given group or algebra in the modular case is to show the unitriangularity of the…
We describe the norming sets for the space of global holomorphic sections to a $k$-power of a positive holomorphic line bundle on a compact complex manifold $X$. We characterize in metric terms the sequence of measurable subsets…
We investigate the size of the distance set determined by two subsets of finite dimensional vector spaces over finite fields. A lower bound of the size is given explicitly in terms of cardinalities of the two subsets. As a result, we…
Kupavskii, Volostnov, and Yarovikov have recently shown that any set of $n$ points in general position in the plane has at least as many (partial) triangulations as the convex $n$-gon. We generalize this in two directions: we show that…
In a recent paper, C. Gambicchia and A. Pratelli proved a quantitative isoperimetric inequality involving the isoperimetric deficit $\delta(K)$ and the barycentric distance $\lambda_0(K)$ for sets $K\subset \mathbb{R}^N$ with given diameter…
The hypothesis of a discrete fabric of the universe--the "Planck scale"--is always on stage, since it solves mathematical and conceptual problems in the infinitely small. However, it clashes with special relativity, which is designed for…
A design is a finite set of points in a space on which every "simple" functions averages to its global mean. Illustrative examples of simple functions are low-degree polynomials on the Euclidean sphere or on the Hamming cube. We prove lower…
A central question in geometric measure theory is whether geometric properties of a set translate into analytical ones. In 1960, E. R. Reifenberg proved that if an $n$-dimensional subset $M$ of $\mathbb{R}^{n+k}$ is well approximated by…
Let $d \geq 3$ be a natural number. We show that for all finite, non-empty sets $A \subseteq \mathbb{R}^d$ that are not contained in a translate of a hyperplane, we have \[ |A-A| \geq (2d-2)|A| - O_d(|A|^{1- \delta}),\] where $\delta >0$ is…
The usual definition of the set of constructible reals is $\Sigma ^1_2$. This set can have a simpler definition if, for example, it is countable or if every real is constructible. H. Friedman asked if the set of constructible reals can be…
For a fixed $b\in\mathbb{N}=\{1,2,3,\ldots\}$ we say that a point $(r,s)$ in the integer lattice $\mathbb{Z} \times \mathbb{Z}$ is $b$-visible from the origin if it lies on the graph of a power function $f(x)=ax^b$ with $a\in\mathbb{Q}$ and…
Measurability with respect to ideals is tightly connected with absoluteness principles for certain forcing notions. We study a uniformization principle that postulates the existence of a uniformizing function on a large set, relative to a…
A joint characterization of reachability (controllability) and observability (constructibility) for linear SISO nonuniformly sampled discrete systems is presented. The work generalizes to the nonuniform sampling the criterion known for the…
We call a system super-linearizable if it admits finite-dimensional embedding as a linear system -- known as a finite-dimensional Koopman embedding; said otherwise, if its dynamics can be linearized by adding a finite set of observables. We…