Related papers: Cantor sets in higher dimensions II: Optimal dimen…

In this note we analyze two algorithms, one for producing a matching and one for an independent set, on $k$-uniform $d$-regular hypergraphs of large girth. As a result we obtain new lower bounds on the size of a maximum matching or…

We show that for any pair of self-similar Cantor sets with sum of Hausdorff dimensions greater than 1, one can create an interval in the sumset by applying arbitrary small perturbations (without leaving the class of self-similar Cantor…

Let $C(\lambda )\subset \lbrack 0,1]$ denote the central Cantor set generated by a sequence $ \lambda = \left( \lambda_{n} \right) \in \left( 0,\frac{1}{2} \right) ^{\mathbb{N}}$. By the known trichotomy, the difference set $ C(\lambda…

It is known that the upper box-counting dimension of a Cartesian product satisfies the inequality $\dim_{B}\left(F\times G\right)\leq \dim_{B}\left(F\right) + \dim_{B}\left(G\right)$ whilst the lower box-counting dimension satisfies the…

The classical Cantor's intersection theorem states that in a complete metric space $X$, intersection of every decreasing sequence of nonempty closed bounded subsets, with diameter approaches zero, has exactly one point. In this article, we…

We study maximal averages associated with singular measures on $\rr$. Our main result is a construction of singular Cantor-type measures supported on sets of Hausdorff dimension $1 - \epsilon$, $0 \leq \epsilon < {1/3}$ for which the…

Cantor sets of integers have a rich set of arithmetic combinatorial properties. We consider classical Cantor sets, with a base and a fixed set of allowed digits. For such sets, we (a) give examples of such sets that satisfy the intersective…

By employing the residue polynomials, a construction of constant-composition codes is given. This construction generalizes the one proposed by Xing[16]. It turns out that when d=3 this construction gives a lower bound of…

We prove explicit lower bounds for the smallest singular value and upper bounds for the condition number of rectangular, multivariate Vandermonde matrices with scattered nodes on the complex unit circle. Analogously to the Shannon-Nyquist…

We develop a notion of containment for independent sets in hypergraphs. For every $r$-uniform hypergraph $G$, we find a relatively small collection $C$ of vertex subsets, such that every independent set of $G$ is contained within a member…

We present a construction of a proper holomorphic embedding $f\colon \Bbb P^1\setminus C\hookrightarrow \Bbb C^2$, where C is a Cantor set obtained by removing smaller and smaller vertical and horizontal strips from a square of side 2,…

Cantor sets are constructed from iteratively removing sections of intervals. This process yields a cumulative distribution function (CDF), constructed from the invariant measure associated with their iterated function systems. Under…

Families of boxes in $\mathbb R^d$ are considered. In the paper an upper bound on the size of a minimum transversal in terms of the space dimension and the independence number of the given family was improved.

Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…

Klee's measure problem (computing the volume of the union of $n$ axis-parallel boxes in $\mathbb{R}^d$) is well known to have $n^{\frac{d}{2}\pm o(1)}$-time algorithms (Overmars, Yap, SICOMP'91; Chan FOCS'13). Only recently, a conditional…

In this paper, we consider the problem of finding a maximum cardinality subset of vectors, given a constraint on the normalized squared length of vectors sum. This problem is closely related to Problem 1 from (Eremeev, Kel'manov, Pyatkin,…

The problem of bounding the size of a set system under various intersection restrictions has a central place in extremal combinatorics. We investigate the maximum number of disjoint pairs a set system can have in this setting. In…

This paper considers the question of how to succinctly approximate a multidimensional convex body by a polytope. Given a convex body $K$ of unit diameter in Euclidean $d$-dimensional space (where $d$ is a constant) and an error parameter…

For a hyperbolic map f on a saddle type fractal Lambda with self-intersections, the number of f- preimages of a point x in Lambda may depend on x. This makes estimates of the stable dimensions more difficult than for diffeomorphisms or for…

We generalized to higher dimensions the notions of optical orthogonal codes. We establish uper bounds on the capacity of general $ n $-dimensional OOCs, and on specific types of ideal codes (codes with zero off-peak autocorrelation). The…