English
Related papers

Related papers: Number Theory meets Wireless Communications: an in…

200 papers

It's widely perceived that Reconfigurable Intelligent Surfaces (RIS) cannot increase Degrees of Freedom (DoF) due to their relay nature. A notable exception is Jiang \& Yu's work. They demonstrate via simulation that in an ideal $K$-user…

Information Theory · Computer Science 2024-10-10 Junzhi Wang , Jun Sun , Zheng Xiao , Limin Liao , Yingzhuang Liu

The main goal of this note is to develop a metrical theory of Diophantine approximation within the framework of the de Mathan-Teulie Conjecture, also known as the `Mixed Littlewood Conjecture'. Let p be a prime. A consequence of our main…

Number Theory · Mathematics 2010-05-12 Yann Bugeaud , Alan Haynes , Sanju Velani

We establish a weighted simultaneous Khintchine-type theorem, both convergence and divergence, for all nondegenerate manifolds, which answers a problem posed in [Math. Ann., 337(4):769-796, 2007]. This extends the main results of [Acta…

Number Theory · Mathematics 2026-02-12 Victor Beresnevich , Shreyasi Datta , Lei Yang

We consider a constant $K$-user Gaussian interference channel with $M$ antennas at each transmitter and $N$ antennas at each receiver, denoted as a $(K,M,N)$ channel. Relying on a result on simultaneous Diophantine approximation, a real…

Information Theory · Computer Science 2013-01-29 Mahdi Zamanighomi , Zhengdao Wang

We study some problems in metric Diophantine approximation over local fields of positive characteristic.

Number Theory · Mathematics 2018-12-19 Arijit Ganguly , Anish Ghosh

Quantization of diffeomorphism invariant theories of connections is studied. A solutions of the diffeomorphism constraints is found. The space of solutions is equipped with an inner product that is shown to satisfy the physical reality…

General Relativity and Quantum Cosmology · Physics 2010-11-01 Abhay Ashtekar , Jerzy Lewandowski , Donald Marolf , Jose Mourao , Thomas Thiemann

Minkowski's First Theorem and Dirichlet's Approximation Theorem provide upper bounds on certain minima taken over lattice points contained in domains of Euclidean spaces. We study the distribution of such minima and show, under some…

Number Theory · Mathematics 2022-01-14 Michael Björklund , Alexander Gorodnik

This is the second paper in a series of two in which a global algebraic number theory of the reals is formulated with the purpose of providing a unified setting for algebraic and transcendental number theory. In this paper, to any real…

Number Theory · Mathematics 2016-03-30 T. M. Gendron

For a tuple $(\theta_1,..,\theta_M)$ of complex number, buliding on the approximation techniques in earlier papers of this series, this paper engages in deducing lower estimates on the transcendence degree of the field generated by…

Number Theory · Mathematics 2010-01-12 Heinrich Massold

Consider the classical problem of rational simultaneous approximation to a point in $\mathbb{R}^{n}$. The optimal lower bound on the gap between the induced ordinary and uniform approximation exponents has been established by Marnat and…

Number Theory · Mathematics 2021-03-11 Johannes Schleischitz

We discuss the problem of finding optimal exponents in Diophantine estimates involving one real number and, in some cases where such an exponent is known, present some properties of the corresponding extremal numbers.

Number Theory · Mathematics 2007-05-23 Damien Roy

The convergence theory for the set of simultaneously $\psi$-approximable points lying on a planar curve is established. Our results complement the divergence theory developed in `Diophantine approximation on planar curves and the…

Number Theory · Mathematics 2019-05-29 R. C. Vaughan , S. L. Velani

Let $\psi: \mathbb{N} \to [0,1/2]$ be given. The Duffin-Schaeffer conjecture, recently resolved by Koukoulopoulos and Maynard, asserts that for almost all reals $\alpha$ there are infinitely many coprime solutions $(p,q)$ to the inequality…

Number Theory · Mathematics 2022-02-03 Christoph Aistleitner , Bence Borda , Manuel Hauke

Although interference alignment (IA) can theoretically achieve the optimal degrees of freedom (DoFs) in the $K$-user Gaussian interference channel, its direct application comes at the prohibitive cost of precoding over exponentially-many…

Information Theory · Computer Science 2014-08-01 Vasilis Ntranos , Mohammad Ali Maddah-Ali , Giuseppe Caire

The badly approximable points in $\mathbb{R}^d$ are those for which Dirichlet's approximation theorem cannot be improved by more than a constant, that is, they are the points most difficult to approximate by rational vectors. An important…

Number Theory · Mathematics 2026-03-13 Roope Anttila , Jonathan M. Fraser , Henna Koivusalo

We show that a multiplicative form of Dirichlet's theorem on simultaneous Diophantine approximation as formulated by Minkowski, cannot be improved for almost all points on any analytic curve on R^k which is not contained in a proper affine…

Number Theory · Mathematics 2019-02-18 Nimish A. Shah

Given a monotonically decreasing $\psi: \mathbb{N} \to [0,\infty)$, Khintchine's Theorem provides an efficient tool to decide whether, for almost every $\alpha \in \mathbb{R}$, there are infinitely many $(p,q) \in \mathbb{Z}^2$ such that…

Number Theory · Mathematics 2024-03-19 Lorenz Frühwirth , Manuel Hauke

We quantify the density of rational points in the unit sphere $S^n$, proving analogues of the classical theorems on the embedding of $\q^n$ into $\r^n$. Specifically, we prove a Dirichlet theorem stating that every point $\alpha \in S^n$ is…

Number Theory · Mathematics 2013-05-28 Dmitry Kleinbock , Keith Merrill

Interference alignment allows multiple users to share the same frequency and time resource in a wireless communications system. At present, two performance bounds, in terms of degree of freedom, have been proposed. One is for…

Information Theory · Computer Science 2015-11-02 Feng Ouyang

Representations of Boolean functions by real polynomials play an important role in complexity theory. Typically, one is interested in the least degree of a polynomial p(x_1,...,x_n) that approximates or sign-represents a given Boolean…

Computational Complexity · Computer Science 2008-05-15 Alexander A. Sherstov
‹ Prev 1 8 9 10 Next ›