English
Related papers

Related papers: Large Salem Sets Avoiding Nonlinear Configurations

200 papers

It is hereby established that the set of Lipschitz functions $f:\mathcal{U}\rightarrow \mathbb{R}$ ($\mathcal{U}$ nonempty open subset of $\ell_{d}^{1}$) with maximal Clarke subdifferential contains a linear subspace of uncountable…

Functional Analysis · Mathematics 2023-05-22 Aris Daniilidis , Gonzalo Flores

Let $\mathfrak{F}_n$ be the set of unitary cuspidal automorphic representations of $\mathrm{GL}_n$ over a number field $F$, and let $S\subseteq\mathfrak{F}_n$ be an arbitrary finite subset. Given $\pi_0\in\mathfrak{F}_{n_0}$, we establish…

Number Theory · Mathematics 2025-09-16 Alexandru Pascadi , Jesse Thorner

Let $E \subseteq R^n$ be a closed set of Hausdorff dimension $\alpha$. For $m \geq n$, let $\{B_1,\ldots,B_k\}$ be $n \times (m-n)$ matrices. We prove that if the system of matrices $B_j$ is non-degenerate in a suitable sense, $\alpha$ is…

Classical Analysis and ODEs · Mathematics 2013-07-05 Vincent Chan , Izabella Laba , Malabika Pramanik

In this paper we study the notion of Salem set from the point of view of descriptive set theory. We first work in the hyperspace $\mathbf{K}([0,1])$ of compact subsets of $[0,1]$ and show that the closed Salem sets form a…

Logic · Mathematics 2023-01-03 Alberto Marcone , Manlio Valenti

Let $\ell_1,\ell_2,\dots$ be a countable collection of lines in ${\mathbb R}^d$. For any $t \in [0,1]$ we construct a compact set $\Gamma\subset{\mathbb R}^d$ with Hausdorff dimension $d-1+t$ which projects injectively into each $\ell_i$,…

Metric Geometry · Mathematics 2021-08-25 Frank Coen , Nate Gillman , Tamás Keleti , Dylan King , Jennifer Zhu

A family $\mbox{$\cal F$}=\{F_1,\ldots,F_m\}$ of subsets of $[n]$ is said to be ordered, if there exists an $1\leq r\leq m$ index such that $n\in F_i$ for each $1\leq i\leq r$, $n\notin F_i$ for each $i>r$ and $|F_i|\leq |F_j|$ for each…

Combinatorics · Mathematics 2024-11-08 Gábor Hegedüs

We study Non-autonomous Iterated Function Systems (NIFSs) with overlaps. A NIFS on a compact subset $X\subset\mathbb{R}^m$ is a sequence $\Phi=(\{\phi^{(j)}_{i}\}_{i\in I^{(j)}})_{j=1}^{\infty}$ of collections of uniformly contracting maps…

Dynamical Systems · Mathematics 2023-12-22 Yuto Nakajima

This paper extends some results of [M5] and [M3], in particular, removing assumptions of positive lower density. We give conditions on a general family $P_{\lambda}:\mathbb{R}^{n}\to\mathbb{R}^{m}, \lambda \in \Lambda,$ of orthogonal…

Classical Analysis and ODEs · Mathematics 2023-10-12 Pertti Mattila

Peter Lappan in [9] proved that for each $n\in \mathbb{N}=\{1,2,3,\dots\}$, let $f_{1,n}, f_{2,n}$ and $f_{3,n}$ be three continuous functions on $\mathbb{D}:=\{z\in \mathbb{C} : |z| < 1\}$ such that for each $j=1,2,3,$ the sequence…

Complex Variables · Mathematics 2026-05-13 Gopal Datt , Kushal Lalwani , Ashish Kumar Trivedi

A More Sums Than Differences (MSTD) set is a set of integers A contained in {0, ..., n-1} whose sumset A+A is larger than its difference set A-A. While it is known that as n tends to infinity a positive percentage of subsets of {0, ...,…

Number Theory · Mathematics 2013-03-05 Steven J. Miller , Sean Pegado , Luc Robinson

A $\left(n,\ell,\gamma\right)$-sharing set family of size $m$ is a family of sets $S_1,\ldots,S_m\subseteq [n]$ s.t. each set has size $\ell$ and each pair of sets shares at most $\gamma$ elements. We let $m\left(n,\ell,\gamma\right)$…

Computational Complexity · Computer Science 2014-04-18 Calvin Beideman , Jeremiah Blocki

In this paper, we construct explicit families of polynomials $P \in \mathbb{F}_q[x_1,\dots,x_n]$ with large root sets which have restricted intersections with affine lines. We use these sets to make substantial progress on a number of…

Combinatorics · Mathematics 2026-02-12 Jakob Führer , Vladislav Taranchuk

Let $\mathcal F\subset 2^{[n]}$ be an $s$-uniform family such that every two distinct sets have a nonempty intersection but intersect in at most $k$ elements. By the well-known Ray-Chaudhuri--Wilson theorem, since the intersections can take…

Combinatorics · Mathematics 2026-05-26 Kristina Ago , Gyula O. H. Katona

We prove that for any singular measure $\mu$ on $\mathbb{R}^n$ it is possible to cover $\mu$-almost every point with $n$ families of Lipschitz slabs of arbitrarily small total width. More precisely, up to a rotation, for every $\delta>0$…

Functional Analysis · Mathematics 2017-05-16 Andrea Marchese

We prove that the maximum size of a family of $k$-element subsets of the set $[n] = \{1, 2, \ldots, n\}$ which contains no singleton intersection is $\binom{n-2}{k-2}$ when $3k-3 \le n \le k^2-k+1$. This improves upon a recent result of…

Combinatorics · Mathematics 2026-04-02 William Linz

We construct the first explicit (i.e., non-random) examples of Salem sets in $\mathbb{R}^n$ of arbitrary prescribed Hausdorff dimension. This completely resolves a problem proposed by Kahane more than 60 years ago. The construction is based…

Classical Analysis and ODEs · Mathematics 2020-09-07 Robert Fraser , Kyle Hambrook

We investigate predicative aspects of constructive univalent foundations. By predicative and constructive, we respectively mean that we do not assume Voevodsky's propositional resizing axioms or excluded middle. Our work complements…

Logic in Computer Science · Computer Science 2024-02-14 Tom de Jong , Martín Hötzel Escardó

Let $V$ be an $(n+\ell)$-dimensional vector space over a finite field, and $W$ a fixed $\ell$-dimensional subspace of $V$. Write ${V\brack n,0}$ to be the set of all $n$-dimensional subspaces $U$ of $V$ satisfying $\dim(U\cap W)=0$. A…

Combinatorics · Mathematics 2021-03-23 Mengyu Cao , Benjian Lv , Kaishun Wang

We show that in $\mathbb{R}^d$ there are purely unrectifiable sets of Hausdorff (and even box counting) dimension $d-1$ which are not tube null, settling a question of Carbery, Soria and Vargas, and improving a number of results by the same…

Classical Analysis and ODEs · Mathematics 2015-11-06 Pablo Shmerkin , Ville Suomala

The $\mathcal{N}$ poset consists of four distinct sets $W,X,Y,Z$ such that $W\subset X$, $Y\subset X$, and $Y\subset Z$ where $W$ is not necessarily a subset of $Z$. A family $\mathcal{F}$ as a subposet of the $n$-dimensional Boolean…

Combinatorics · Mathematics 2017-04-18 Ryan R. Martin , Shanise Walker