Related papers: Gauss lattices and complex continued fractions
We consider the problem of recovering a real-valued $n$-dimensional signal from $m$ phaseless, linear measurements and analyze the amplitude-based non-smooth least squares objective. We establish local convergence of subgradient descent…
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,…
We prove maximum and comparison principles for fractional discrete derivatives in the integers. Regularity results when the space is a mesh of length $h$, and approximation theorems to the continuous fractional derivatives are shown. When…
We introduce an efficient algorithm for computing fractional integrals and derivatives and apply it for solving problems of the calculus of variations of fractional order. The proposed approximations are particularly useful for solving…
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also…
A periodic lattice in Euclidean space is the infinite set of all integer linear combinations of basis vectors. Any lattice can be generated by infinitely many different bases. This ambiguity was only partially resolved, but standard…
In this paper we present a method to derive Eulerian continued fractions arising from a sequence of integrals. As examples, through a new derivation, we reproduce classical continued fraction expansions for the natural logarithm, the…
We revisit Schnorr's lattice-based integer factorization algorithm, now with an effective point of view. We present effective versions of Theorem 2 of Schnorr's "Factoring integers and computing discrete logarithms via diophantine…
In this paper, we consider the problem of counting Diophantine inequalities with multiple natural constraints. We prove a very general result in this setting using dynamical techniques. More precisely, we consider the joint asymptotic…
In this paper we adopt a geometric point of view regarding a famous conjecture due to Littlewood in diophantine approximation of real numbers. Following the spirit of the geometric theory of continued fractions, we give a sufficient…
In this paper we initiate a new approach to studying approximations by rational points to points on smooth submanifolds of $\mathbb{R}^n$. Our main result is a convergence Khintchine type theorem for arbitrary nondegenerate submanifolds of…
In this paper we study algorithms to find a Gaussian approximation to a target measure defined on a Hilbert space of functions; the target measure itself is defined via its density with respect to a reference Gaussian measure. We employ the…
We study the general problem of equidistribution of expanding translates of an analytic curve by an algebraic diagonal flow on the homogeneous space $G/\Gamma$ of a semisimple algebraic group $G$. We define two families of algebraic…
The goal of this paper is to generalize the main results of [KM] and subsequent papers on metric Diophantine approximation with dependent quantities to the set-up of systems of linear forms. In particular, we establish `joint strong…
This paper aims to investigate the distributed stochastic optimization problems on compact embedded submanifolds (in the Euclidean space) for multi-agent network systems. To address the manifold structure, we propose a distributed…
Consider the integer best approximations of a linear form in $n\ge 2$ real variables. While it is well-known that any tail of this sequence always spans a lattice is sharp for any $n\ge 2$. In this paper, we determine the exact Hausdorff…
Bayesian inference has many advantages for complex models, but standard Monte Carlo methods for summarizing the posterior can be computationally demanding, and it is attractive to consider optimization-based variational methods. Our work…
We present a complete algorithm for finding an exact minimal polynomial from its approximate value by using an improved parameterized integer relation construction method. Our result is superior to the existence of error controlling on…
The Douglas Rachford algorithm is an algorithm that converges to a minimizer of a sum of two convex functions. The algorithm consists in fixed point iterations involving computations of the proximity operators of the two functions…
Graph matching is a fundamental tool in computer vision and pattern recognition. In this paper, we introduce an algorithm for graph matching based on the proximal operator, referred to as differentiable proximal graph matching (DPGM).…