English
Related papers

Related papers: Non-Salem sets in multiplicative Diophantine appro…

200 papers

Let $\mathcal{M}\subset \mathbb{R}^n$ be a compact and sufficiently smooth manifold of dimension $d$. Suppose $\mathcal{M}$ is nowhere completely flat. Let $N_{\mathcal{M}}(\delta,Q)$ denote the number of rational vectors $\mathbf{a}/q$…

Number Theory · Mathematics 2024-07-29 Damaris Schindler , Rajula Srivastava , Niclas Technau

The seminal work of Kurzweil (1955) provides for any fixed badly approximable $\alpha$ and monotonically decreasing $\psi$ a Khintchine-type statement on the set of the inhomogeneous real parameters $\gamma$ for which $\lVert n \alpha +…

Number Theory · Mathematics 2026-03-27 Manuel Hauke

In this work we develop an open quantum system view of the parametric approximation, which allows us to obtain systematic perturbative corrections to it. We consider the Jaynes-Cummings model with dissipation, assuming that the field is in…

Quantum Physics · Physics 2025-05-07 A. Yu. Karasev , A. E. Teretenkov

We compute the Hausdorff dimension of the set of $\psi$-exactly approximable vectors, in the simultaneous case, in dimension strictly larger than $2$ and for approximating functions $\psi$ with order at infinity less than or equal to $-2$.…

Number Theory · Mathematics 2024-01-19 Reynold Fregoli

Let $\alpha\in(0,1)\setminus{\Bbb Q}$ and $K=\{(e^z,e^{\alpha z}):\,|z|\leq1\}\subset{\Bbb C}^2$. If $P$ is a polynomial of degree $n$ in ${\Bbb C}^2$, normalized by $\|P\|_K=1$, we obtain sharp estimates for $\|P\|_{\Delta^2}$ in terms of…

Complex Variables · Mathematics 2010-09-23 Dan Coman , Evgeny A. Poletsky

Our primary objective in this article is to establish H\"ormander type $L^p \rightarrow L^q$ Fourier multiplier theorems in the context of noncompact type Riemannian symmetric spaces $\mathbb{X}$ of arbitrary rank for the range $1 < p \leq…

Functional Analysis · Mathematics 2024-11-07 Tapendu Rana , Michael Ruzhansky

A set of m distinct positive integers {a_{1},...a_{m}} is called a Diophantine m-tuple if a_{i}a_{j}+n is a square for each 1\leqi<j\leqm . The aim of this study is to show that some P_{k} sets can not be extendible to a Diophantine…

Number Theory · Mathematics 2017-04-24 Bilge Peker , Selin Cenberci

In a previous article (\textit{Int. Math. Res. Not.} 2014, 2730--2745) T. Orponen and the authors proved that the Fourier dimension of the graph of any real-valued function on $\mathbb{R}$ is bounded above by $1$. This partially answered a…

Probability · Mathematics 2018-03-16 Jonathan M. Fraser , Tuomas Sahlsten

Recent work by M. Afifurrahman established the first asymptotic estimates with error terms for the number of $2\times 2$ matrices with fixed non-zero determinant $n\in\mathbb{N}$, and with coefficients bounded in absolute value by $X$. In…

Number Theory · Mathematics 2026-04-01 Kavita Dhanda , Alan Haynes , Silmi Prasala

In this work, we study Fourier multipliers on noncommutative spaces. In particluar, we show a simple proof of $L^p$-$L^q$ estimate of Fourier multipliers on general noncommutative spaces associated with semi-finite von Neumann algebras.…

Functional Analysis · Mathematics 2025-08-05 Michael Ruzhansky , Kanat Tulenov

Let (X,d) be a metric space and (\Omega, d) a compact subspace of X which supports a non-atomic finite measure m. We consider `natural' classes of badly approximable subsets of \Omega. Loosely speaking, these consist of points in \Omega…

Number Theory · Mathematics 2007-05-23 Simon Kristensen , Rebecca Thorn , Sanju Velani

This note mainly concerns the binomial power function, defined as $(1+x^q)^{r}$. We construct systems of polynomials related to non-local approximation, which allows us to establish the density results on $C[a,b]$, where $a,b\in\mathbb{R}$.…

Classical Analysis and ODEs · Mathematics 2021-08-18 Brock Erwin , Jeff Ledford , Kira Pierce

In 1974, M. B. Nathanson proved that every irrational number $\alpha$ represented by a simple continued fraction with infinitely many elements greater than or equal to $k$ is approximable by an infinite number of rational numbers $p/q$…

Number Theory · Mathematics 2024-07-17 Jaroslav Hančl , Tho Phuoc Nguyen

We estimate short exponential sums weighted by the Fourier coefficients of a Maass form. This requires working out a certain transformation formula for non-linear exponential sums, which is of independent interest. We also discuss how the…

Number Theory · Mathematics 2015-04-08 Jesse Jääsaari , Esa V. Vesalainen

Moment-sum-of-squares hierarchies of semidefinite programs can be used to approximate the volume of a given compact basic semialgebraic set K. The idea consists of approximating from above the indicator function of K with a sequence of…

Optimization and Control · Mathematics 2016-12-14 Milan Korda , Didier Henrion

This paper describes an extension of Fourier approximation methods for multivariate functions defined on the torus $\mathbb{T}^d$ to functions in a weighted Hilbert space $L_{2}(\mathbb{R}^d, \omega)$ via a multivariate change of variables…

Numerical Analysis · Mathematics 2019-12-20 Robert Nasdala , Daniel Potts

In this paper we prove a noncommutative version of Hardy-Littlewood inequalities relating a function and its Fourier coefficients on the group $SU(2)$. As a consequence, we use it to obtain lower bounds for the $L^p-L^q$ norms of Fourier…

Functional Analysis · Mathematics 2016-04-29 Rauan Akylzhanov , Erlan Nursultanov , Michael Ruzhansky

Given an increasing integer sequence $(a_n)$, a real number $\alpha$, and a sequence $\psi(n)$, we study the set $W$ of real numbers $\gamma$ for which $a_n\alpha - \gamma$ is a distance less than $\psi(n)$ away from an integer. This is…

Number Theory · Mathematics 2025-08-05 Manuel Hauke , Felipe A. Ramírez

Intrinsic Diophantine approximation on fractals, such as the Cantor ternary set, was undoubtedly motivated by questions asked by K. Mahler (1984). One of the main goals of this paper is to develop and utilize the theory of infinite de…

Combinatorics · Mathematics 2016-10-18 Lior Fishman , Keith Merrill , David Simmons

We give a {\em deterministic} algorithm for approximately computing the fraction of Boolean assignments that satisfy a degree-$2$ polynomial threshold function. Given a degree-2 input polynomial $p(x_1,\dots,x_n)$ and a parameter $\eps >…

Computational Complexity · Computer Science 2013-11-28 Anindya De , Ilias Diakonikolas , Rocco A. Servedio
‹ Prev 1 8 9 10 Next ›