Related papers: Euclidean algorithms are Gaussian over imaginary q…
When the Euclidean algorithm produces a symmetric sequence of quotients, we give explicit formulas for the remainders that allow the analysis of two families of quadratic forms in the remainders.
We discuss the application of random projections to the fundamental problem of deciding whether a given point in a Euclidean space belongs to a given set. We show that, under a number of different assumptions, the feasibility and…
Doubly intractable distributions arise in many settings, for example in Markov models for point processes and exponential random graph models for networks. Bayesian inference for these models is challenging because they involve intractable…
We establish the validity of asymptotic limits for the general transportation problem between random i.i.d. points and their common distribution, with respect to the squared Euclidean distance cost, in any dimension larger than three.…
This article focuses on some rings of integers of number fields which are known to be norm-Euclidean domains, but for which no explicit algorithm computing the Euclidean division has yet been studied or implemented. The rings of integers we…
This paper presents a new multi-query motion planning algorithm for linear Gaussian systems with the goal of reaching a Euclidean ball with high probability. We develop a new formulation for ball-shaped ambiguity sets of Gaussian…
We study the bit complexity of two methods, related to the Euclidean algorithm, for computing cubic and quartic analogs of the Jacobi symbol. The main bottleneck in such procedures is computation of a quotient for long division. We give…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
In this thesis, we study value distribution theoretical properties of the Gauss map of pseudo-algebraic minimal surfaces in n-dimensional Euclidean space. After reviewing basic facts, we give estimates for the number of exceptional values…
For the each of the five Euclidean rings of complex quadratic integers, we consider a complex continued fraction algorithm with digits in the ring. We show for each algorithm that the maximal digit obeys a Fr\'echet distribution. We use…
We formulate a thermodynamical approach to the study of distribution of modular symbols, motivated by the work of Baladi-Vall\'ee. We introduce the modular partitions of continued fractions and observe that the statistics for modular…
This paper introduces and characterizes a new family of continuous probability distributions applicable to norm distributions in three-dimensional random spaces, specifically for the Euclidean norm of three random Gaussian variables with…
A modified form of Euclid's algorithm has gained popularity among musical composers following Toussaint's 2005 survey of so-called Euclidean rhythms in world music. We offer a method to easily calculate Euclid's algorithm by hand as a…
We present a randomized iterative algorithm that exponentially converges in expectation to the minimum Euclidean norm least squares solution of a given linear system of equations. The expected number of arithmetic operations required to…
We introduce a generalization of the Euclidean algorithm for rings equipped with an involution, and completely enumerate all isomorphism classes of orders over definite, rational quaternion algebras equipped with an orthogonal involution…
If several independent algorithms for a computer-calculated quantity exist, then one can expect their results (which differ because of numerical errors) to follow approximately Gaussian distribution. The mean of this distribution,…
We analyse the axioms of Euclidean geometry according to standard object-oriented software development methodology. We find a perfect match: the main undefined concepts of the axioms translate to object classes. The result is a suite of C++…
We solve crossing equations analytically in the deep Euclidean regime. Large scaling dimension $\Delta$ tails of the weighted spectral density of primary operators of given spin in one channel are matched to the Euclidean OPE data in the…
The matching problem is a notorious combinatorial optimization problem that has attracted for many years the attention of the statistical physics community. Here we analyze the Euclidean version of the problem, i.e. the optimal matching…
In this paper we study Euclidean algorithms and the corresponding continued fractions for oriented linear Grassmanians $G(k,n)$. We propose two algorithms: Maximal Element Elimination algorithm and Minimal Element Elimination algorithm. The…