Related papers: Self similar sets, entropy and additive combinator…
We show that in many parametrized families of self-similar measures, their projections, and their convolutions, the set of parameters for which the measure fails to be absolutely continuous is very small - of co-dimension at least one in…
We construct a sequence of subset partition graphs satisfying the dimension reduction, adjacency, strong adjacency, and endpoint count properties whose diameter has a superlinear asymptotic lower bound. These abstractions of polytope graphs…
While intersections of convex sets are convex, their unions have rather complicated behavior. Some natural contexts where they appear include duality arguments involving boundaries of convex sets and valuations, which have an Euler…
The essential minimum and equidistribution of small points are two well-established interrelated subjects in arithmetic geometry. However, there is lack of an analogue of essential minimum dealing with higher dimensional subvarieties, and…
Building on previous results of Xing, we give new lower bounds on the rate of intersecting codes over large alphabets. The proof is constructive, and uses algebraic geometry, although nothing beyond the basic theory of linear systems on…
The finitistic dimension conjecture is closely connected to the symmetry of the finitistic dimension. Recent work indicates that such connection extends to one of its upper bounds, the delooping level. In this paper, we show that the same…
We prove a comparison principle for the porous medium equation in more general open sets in $\mathbb{R}^{n+1}$ than space-time cylinders. We apply this result in two related contexts: we establish a connection between a potential theoretic…
We study problems related to indecomposability of modules over certain local finite dimensional trivial extension algebras. We do this by purely combinatorial methods. We introduce the concepts of graph of cyclic modules, of combinatorial…
We consider countable linear orders and study the quasi-order of convex embeddability and its induced equivalence relation. We obtain both combinatorial and descriptive set-theoretic results, and further extend our research to the case of…
We give a new lower bound for the minimal dispersion of a point set in the unit cube and its inverse function in the high dimension regime. This is done by considering only a very small class of test boxes, which allows us to reduce…
Assuming a lower bound on the dimension, we prove a long standing conjecture concerning the classification of global solutions of the obstacle problem with unbounded coincidence sets.
Given a compact pseudo-metric space, we associate to it upper and lower dimensions, depending only on the metric. Then we construct a doubling metric for which the measure of a dillated ball is closely related to these dimensions.
Until recently, it was an important open problem in Fractal Geometry to determine whether there exists an iterated function system acting on $\mathbb{R}$ with no exact overlaps for which cylinders are super-exponentially close at all small…
In 2010, Cilleruelo, Ruzsa, and Vinuesa established a surprising connection between the maximum possible size of a generalized Sidon set in the first $N$ natural numbers and the optimal constant in an ``analogous'' problem concerning…
Extended formulations are an important tool to obtain small (even compact) formulations of polytopes by representing them as projections of higher dimensional ones. It is an important question whether a polytope admits a small extended…
We describe recent advances in the study of random analogues of combinatorial theorems.
Ryser's Conjecture states that for any $r$-partite $r$-uniform hypergraph, the vertex cover number is at most $r{-}1$ times the matching number. This conjecture is only known to be true for $r\leq 3$ in general and for $r\leq 5$ if the…
Given a compact connected set $E$ in the unit disk $\mathbb{B}^{2}$, we give a new upper bound for the conformal capacity of the condenser $(\mathbb{B}^{2}, E)$ in terms of the hyperbolic diameter $t$ of $E$. Moreover, for $t>0$, we…
We study the connection between small-overlap conditions and automaticity of semigroups. We restrict the discussion to conditions that imply embeddability and under which each relation decomposes into at least seven pieces. For these…
We generalise Hochman's theorem on the dimension of self-similar measures to contracting on average measures and show that a weaker condition than exponential separation on all scales is sufficient. Our proof uses a technique we call the…