English
Related papers

Related papers: Explicit Salem sets in $\mathbb{R}^n$

200 papers

Given a compact metric space (X,d) equipped with a non-atomic, probability measure m and a real, positive decreasing function p we consider a `natural' class of limsup subsets La(p) of X. The classical limsup sets of `well approximable'…

Number Theory · Mathematics 2007-05-23 Victor Beresnevich , Detta Dickinson , Sanju Velani

Diophantine approximation is the problem of approximating a real number by rational numbers. We propose a version of this in which the numerators are approximately related to the denominators by a Laurent polynomial. Our definition is…

Number Theory · Mathematics 2011-05-30 Eli Hawkins , Alan Haynes

We consider the problem of approximating the reachable set of a discrete-time polynomial system from a semialgebraic set of initial conditions under general semialgebraic set constraints. Assuming inclusion in a given simple set like a box…

Optimization and Control · Mathematics 2019-06-06 Victor Magron , Pierre-Loic Garoche , Didier Henrion , Xavier Thirioux

We study the Folklore set of Dirichlet improvable matrices in $\mathbb R^{m\times n}$ which are neither singular nor badly approximable. We prove the non-emptiness for all positive integer pairs $m,n$ apart from $\{m,n\}=\{ 1,1\}$ and…

Number Theory · Mathematics 2025-02-17 Mumtaz Hussain , Johannes Schleischitz , Benjamin Ward

Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…

Number Theory · Mathematics 2024-03-20 Jonathan M. Fraser , Henna Koivusalo , Felipe A. Ramirez

A Skolem sequence is a sequence a_1,a_2,...,a_2n (where a_i \in A = {1,...,n }), each a_i occurs exactly twice in the sequence and the two occurrences are exactly a_i positions apart. A set A that can be used to construct Skolem sequences…

Combinatorics · Mathematics 2007-05-23 Gustav Nordh

We investigate the complexity of explicit construction problems, where the goal is to produce a particular object of size $n$ possessing some pseudorandom property in time polynomial in $n$. We give overwhelming evidence that $\bf{APEPP}$,…

Computational Complexity · Computer Science 2022-02-14 Oliver Korten

Given some integer $m \geq 3$, we find the first explicit collection of countably many intervals in $(1,2)$ such that for any $q$ in one of these intervals, the set of points with exactly $m$ base $q$ expansions is nonempty and moreover has…

Dynamical Systems · Mathematics 2025-01-17 Simon Baker , George Bender

We initiate the study of an intrinsic notion of Diophantine approximation on a rational Carnot group $G$. If $G$ has Hausdorff dimension $Q$, we show that its Diophantine exponent is equal to $(Q+1)/Q$, generalizing the case $G=\mathbb…

Number Theory · Mathematics 2015-10-22 Anton Lukyanenko , Joseph Vandehey

We establish sharp bounds for the Hausdorff dimension of sets of irrational numbers in $(0,1)$ whose digits in the $N$-expansion are either uniformly bounded or tend to infinity. For sets with digits bounded by an integer $M \ge N$, we…

Number Theory · Mathematics 2026-03-31 Andreea Catalina Chitu , Gabriela Ileana Sebe , Dan Lascu

A Hausdorff measure version of W.M. Schmidt's inhomogeneous, linear forms theorem in metric number theory is established. The key ingredient is a `slicing' technique motivated by a standard result in geometric measure theory. In short,…

Number Theory · Mathematics 2007-05-23 Victor Beresnevich , Sanju Velani

The set of badly approximable numbers, Bad, is known to be winning for Schmidt's game and hence has full Hausdorff dimension. It is also known that the set of inhomogeneously badly approximable numbers has full dimension. We prove that the…

Number Theory · Mathematics 2024-12-03 Dorsa Hatefi , David Simmons

We present a universal construction of Diophantine equations with bounded complexity in Isabelle/HOL. This is a formalization of our own work in number theory. Hilbert's Tenth Problem was answered negatively by Yuri Matiyasevich, who showed…

Logic in Computer Science · Computer Science 2025-09-30 Jonas Bayer , Marco David

A certain number of lists of small Salem numbers, some of which are certified as complete, are available online. Notably, the website of M. J. Mossinghoff features a list of 47 Salem numbers smaller than 1.3, as well as complete lists of…

Number Theory · Mathematics 2025-02-10 Jean-Marc Sac-Épée

Gallagher's theorem is a sharpening and extension of the Littlewood conjecture that holds for almost all tuples of real numbers. We provide a fibre refinement, solving a problem posed by Beresnevich, Haynes and Velani in 2015. Hitherto,…

Number Theory · Mathematics 2019-09-25 Sam Chow , Niclas Technau

In this article, we study the Hausdorff measure of shrinking target sets on self-conformal sets. The Hausdorff dimension of the sets we are interested in here was established by Hill and Velani in 1995. However, until recently, little more…

Dynamical Systems · Mathematics 2021-05-19 Demi Allen , Balázs Bárány

We establish a strong form of Littlewood's conjecture with inhomogeneous shifts, for a full-dimensional set of pairs of badly approximable numbers on a vertical line. We also prove a uniform assertion of this nature, generalising a strong…

Number Theory · Mathematics 2021-03-15 Sam Chow , Agamemnon Zafeiropoulos

Following in the footsteps of P. Erd\H{o}s and A. R\'enyi we compute the Hausdorff dimension of sets of numbers whose digits with respect to their $Q$-Cantor series expansions satisfy various statistical properties. In particular, we…

Number Theory · Mathematics 2014-07-16 Dylan Airey , Bill Mance

We show that the sets of weighted badly approximable vectors in $\Bbb R^n$ are winning sets of certain games, which are modifications of $(\alpha,\beta)$-games introduced by W. Schmidt in 1966. The latter winning property is stable with…

Number Theory · Mathematics 2011-06-10 Dmitry Kleinbock , Barak Weiss

Consider a nontrivial solution to a semilinear elliptic system of first order with smooth coefficients defined over an $n$-dimensional manifold. Assume the operator has the strong unique continuation property. We show that the zero set of…

Analysis of PDEs · Mathematics 2009-10-31 Christian Baer
‹ Prev 1 4 5 6 7 8 10 Next ›