Related papers: Large Sets Avoiding Patterns
We study M-separability as well as some other combinatorial versions of separability. In particular, we show that the set-theoretic hypothesis b=d implies that the class of selectively separable spaces is not closed under finite products,…
Pattern avoidance is a central topic in graph theory and combinatorics. Pattern avoidance in matrices has applications in computer science and engineering, such as robot motion planning and VLSI circuit design. A $d$-dimensional zero-one…
Motivated by various geometric problems, we study the nodal set of solutions to Dirac equations on manifolds, of general form. We prove that such set has Hausdorff dimension less than or equal to $n-2$, $n$ being the ambient dimension. We…
In this paper we derive estimates for linear potentials that hold away from thin subsets. And, inspired by the celebrated work of Huber, we verify that, for a subset that is thin at a point, there is always a geodesic that reaches to the…
Several machine learning models are defined for inputs of any size, such as graphs with different numbers of nodes and point clouds containing varying numbers of points. The universality properties of such any-dimensional models remain…
A natural connection between rational functions of several real or complex variables, and subspace collections is explored. A new class of function, superfunctions, are introduced which are the counterpart to functions at the level of…
We introduce {\it (W')-specification} in terms of language decompositions of subshifts, and show that any recurrence set of a subshift with this property has full Hausdorff dimension. Our main result applies to a wide class of subshifts…
In the article [\emph{Deformations of hypersurfaces preserving the M\"obius metric and a reduction theorem}, Adv. Math. 256 (2014), 156--205], Li, Ma and Wang investigated the interesting class of Moebius deformable hypersurfaces, that is,…
We construct large subsets of the first $N$ positive integers which avoid certain arithmetic configurations. In particular, we construct a set of order $N^{0.7685}$ lacking the configuration $\{x,x+y,x+y^2\},$ surpassing the $N^{3/4}$ limit…
Given a self-similar set $\Lambda$ that is the attractor of an iterated function system (IFS) $\{f_1,\dots,f_N\}$, consider the following method for constructing a random subset of $\Lambda$: Let $\mathbf{p}=(p_1,\dots,p_N)$ be a…
We construct Salem sets in $\mathbb{R}/\mathbb{Z}$ of any dimension (including $1$) which do not contain any arithmetic progressions of length $3$. Moreover, the sets can be taken to be Ahlfors regular if the dimension is less than $1$, and…
Approximating functions of a large number of variables poses particular challenges often subsumed under the term ``Curse of Dimensionality'' (CoD). Unless the approximated function exhibits a very high level of smoothness the CoD can be…
We show that in a complex d-dimensional vector space, one can find O(d) bases whose elements form a 2-design. Such vector sets generalize the notion of a maximal collection of mutually unbiased bases (MUBs). MUBs have manifold applications…
Given a uniform algebra A on a compact Hausdorff space X and a point x in X, denote by M_x the ideal of functions in A that vanish at x and by J_x the ideal of functions in A that vanish on a neighborhood of x. It is shown that for each…
In this article we calculate the Hausdorff dimension of the set \begin{equation*} \mathcal{F}(\Phi )=\left\{ x\in \lbrack 0,1):\begin{aligned}a_{n+1}(x)a_n(x) \geq \Phi(n) \ {\rm for \ infinitely \ many \ } n\in \mathbb N \ {\rm and } \\…
A Sidon set $M$ is a subset of $\mathbb{F}_2^t$ such that the sum of four distinct elements of $M$ is never 0. The goal is to find Sidon sets of large size. In this note we show that the graphs of almost perfect nonlinear (APN) functions…
We construct a nonseparable Banach space $\mathcal X$ (actually, of density continuum) such that any uncountable subset $\mathcal Y$ of the unit sphere of $\mathcal X$ contains uncountably many points distant by less than $1$ (in fact, by…
A classical result in combinatorial number theory states that the largest subset of $[n]$ avoiding a solution to the equation $x+y=z$ is of size $\lceil n/2 \rceil$. For all integers $k>m$, we prove multicolored extensions of this result…
In a previous paper, dealing with "Applications in $\mathbb{R}^1$," the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS and studied some applications…
We introduce the cone of completely-positive functions, a subset of the cone of positive-type functions, and use it to fully characterize maximum-density distance-avoiding sets as the optimal solutions of a convex optimization problem. As a…