Related papers: A fractional Helly theorem for set systems with sl…

We consider quantitative versions of Helly-type questions, that is, instead of finding a point in the intersection, we bound the volume of the intersection. Our first main geometric result is a quantitative version of the Fractional Helly…

In this note we will discuss a potentially interesting extension of some recent results on primitive solutions to completely integrable partial differential equations. We will discuss a family distributions that are holomorphic on the…

We discuss a basic thermodynamic properties of systems with multifractal structure. This is possible by extending the notion of Gibbs-Shannon's entropy into more general framework - Renyi's information entropy. We show a connection of…

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

We study the homology of an explicit finite-index subgroup of the automorphism group of a partially commutative group, in the case when its defining graph is a tree. More concretely, we give a lower bound on the first Betti number of this…

We analytically calculate gaps for the 1/3, 2/5, and 3/7 polarized and partially polarized Fractional Quantum Hall states based on the Hamiltonian Chern-Simons theory we have developed. For a class of potentials that are soft at high…

We prove the following sparse approximation result for polytopes. Assume that $Q$ is a polytope in John's position. Then there exist at most $2d$ vertices of $Q$ whose convex hull $Q'$ satisfies $Q \subseteq - 2d^2 \, Q'$. As a consequence,…

In this thesis, we consider semi-algebraic sets over a real closed field $R$ defined by quadratic polynomials. Semi-algebraic sets of $R^k$ are defined as the smallest family of sets in $R^k$ that contains the algebraic sets as well as the…

Fractons are anyons classified into equivalence classes and they obey a specific fractal statistics. The equivalence classes are labeled by a fractal parameter or Hausdorff dimension $h$. We consider this approach in the context of the…

Real algebraic geometry is the study of semi-algebraic sets, subsets of $\R^k$ defined by Boolean combinations of polynomial equalities and inequalities. The focus of this thesis is to study quantitative results in real algebraic geometry,…

We study the maximum size of a set system on $n$ elements whose trace on any $b$ elements has size at most $k$. We show that if for some $b \ge i \ge 0$ the shatter function $f_R$ of a set system $([n],R)$ satisfies $f_R(b) < 2^i(b-i+1)$…

We establish the following fractional Hardy's inequality $$\int_{\mathbb{H}^n_+}\frac{|f(\xi)|^p}{x_1^{sp}|z|^\alpha}d\xi\leq C\int_{\mathbb{H}^n_+}\int_{\mathbb{H}^n_+}\frac{|f(\xi)-f(\xi')|^p}{d({\xi}^{-1}\circ…

Local scaling of a set means that in a neighborhood of a point the structure of the set can be mapped into a finer scale structure of the set. These scaling transformations are compact sets of locally affine (that is: with uniformly…

In this article, we prove that finite (weakly) systolic and Helly complexes can be reconstructed from their boundary distances (computed in their 1-skeleta). Furthermore, Helly complexes and 2-dimensional systolic complexes can be…

Let $H$ be a complete $r$-uniform hypergraph such that two vertices are marked in each edge as its `boundary' vertices. A linear ordering of the vertex set of $H$ is called an {\em agreeing linear order}, provided all vertices of each edge…

Fractal geometry and analysis constitute a growing field, with numerous applications, based on the principles of fractional calculus. Fractals sets are highly effective in improving convex inequalities and their generalisations. In this…

We prove the following Helly-type result. Let $\mathcal{C}_1,\dots,\mathcal{C}_{3d}$ be finite families of convex bodies in $\mathbb{R}^d$. Assume that for any colorful selection of $2d$ sets, $C_{i_k}\in \mathcal{C}_{i_k}$ for each $1\leq…

A collection of sets is {\em intersecting} if every two members have nonempty intersection. We describe the structure of intersecting families of $r$-sets of an $n$-set whose size is quite a bit smaller than the maximum ${n-1 \choose r-1}$…

We prove that two closed subsets of complex space $\C^n$ with corresponding complex homothetic sections (projections) are complex homothetic. The proof uses a new Helly-type theorem for cosets of closed subgroups of $\S ^1$.

Fox, Gromov, Lafforgue, Naor, and Pach proved a regularity lemma for semi-algebraic $k$-uniform hypergraphs of bounded complexity, showing that for each $\epsilon>0$ the vertex set can be equitably partitioned into a bounded number of parts…