Related papers: Geometric and arithmetic aspects of approximation …

This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…

We consider the problem of Diophantine approximation on semisimple algebraic groups by rational points with restricted numerators and denominators and establish a quantitative approximation result for all real points in the group by…

Let $\langle x\rangle$ denote the distance from $x\in\mathbb{R}$ to the set of integers $\mathbb{Z}$. The Littlewood Conjecture states that for all pairs $(\alpha,\beta)\in\mathbb{R}^{2}$ the product $q\langle q\alpha\rangle\langle…

We study multiplicative Diophantine approximation property of vectors and compute Diophantine exponents of hyperplanes via dynamics.

We prove effective joint equidistribution of several natural parameters associated to primitive vectors in $\mathbb{Z}^{n}$, as the norm of these vectors tends to infinity. These parameters include the direction, the orthogonal lattice, and…

The perimeter and area generating functions of exactly solvable polygon models satisfy q-functional equations, where q is the area variable. The behaviour in the vicinity of the point where the perimeter generating function diverges can…

The approximation constant $\lambda_{k}(\zeta)$ is defined as the supremum of real $\eta$ such that $\Vert \zeta^{j}x\Vert\leq x^{-\eta}$ for $1\leq j\leq k$ has infinitely many integer solutions $x$. Here $\Vert.\Vert$ denotes the distance…

We study finite dimensional vector spaces over fields of elliptic functions equipped with two commuting aotomorphisms \sigma and \tau induced by isogenies of relatively prime orders. We give a structure theorem for such objects, that…

We associate certain curves over function fields to given algebraic power series and show that bounds on the rank of Kodaira-Spencer map of this curves imply bounds on the exponents of the power series, with more generic curves giving lower…

Let $E\subset [0,1)^{d}$ be a set supporting a probability measure $\mu$ with Fourier decay $|\widehat{\mu}({\bf{t}})|\ll (\log |{\bf{t}}|)^{-s}$ for some constant $s>d+1.$ Consider a sequence of expanding integral matrices…

We solve a Pad\'e-type problem of approximating three specific functions simultaneously by $q$-analogues of polylogarithms, respectively by powers of the logarithm. This problem is intimately related to recent results of the authors and…

There are many methods developed to approximate a cloud of vectors embedded in high-dimensional space by simpler objects: starting from principal points and linear manifolds to self-organizing maps, neural gas, elastic maps, various types…

In this paper we consider the probabilistic theory of Diophantine approximation in projective space over a completion of Q. Using the projective metric studied by Bombieri, van der Poorten, and Vaaler we prove the analogue of Khintchine's…

We study the problem of Diophantine approximation on lines in $\mathbb{R}^d$ under certain primality restrictions.

In this paper we deal with a best approximation of a vector with respect to a closed semi-algebraic set $C$ in the space $\mathbb{R}^n$ endowed with a semi-algebraic norm $\nu$. Under additional assumptions on $\nu$ we prove…

We study a generalization of the knapsack problem with geometric and vector constraints. The input is a set of rectangular items, each with an associated profit and $d$ nonnegative weights ($d$-dimensional vector), and a square knapsack.…

Via multilinear algebra, we formulate a criterion for connectedness in the parametric geometry of numbers in terms of pencils, which are certain algebraic varieties in the space of matrices. As a consequence, we obtain a connectedness…

Consider $n$ $d$-dimensional vectors with iid entries from a lattice distribution $X$. We show that the probability that all distances between them are equal is asymptotically \[ C_n\cdot\frac{1}{d^{(m-1)/2}} \quad \text{for} \quad d \to…

We give a number of approximation metatheorems for monotone maximization problems expressible in the first-order logic, in substantially more general settings than the previously known. We obtain * constant-factor approximation algorithm in…

In Diophantine approximation, inhomogeneous problems are linked with homogeneous ones by means of the so-called Transference Theorems. We revisit this classical topic by introducing new exponents of Diophantine approximation. We prove that…