Related papers: Gauss lattices and complex continued fractions
Fast exact algorithms are known for Hamiltonian paths in undirected and directed bipartite graphs through elegant though involved algorithms that are quite different from each other. We devise algorithms that are simple and similar to each…
Following Schmidt, Thurnheer and Bugeaud-Kristensen, we study how Dirichlet's theorem on linear forms needs to be modified when one requires that the vectors of coefficients of the linear forms make a bounded acute angle with respect to a…
We use the theory of arithmetic quotients of the Bruhat-Tits tree developed by Serre and others to obtain Dirichlet-style theorems for Diophantine approximation on global function fields. This approach allows us to find sharp values for the…
This paper provides some preliminary results on the dynamics of certain complex continued fractions. After establishing some general number theoretic results, we explore the dynamics of the natural extension map associated to a specific…
This paper aims to introduce high school students to the intriguing world of continued fractions, a mathematical concept that provides a unique representation of numbers. The study focuses on the exploration and development of the…
The leading asymptotics of the truncation error for Gauss's continued fraction is determined exactly. Not only for this purpose but also for wider applicability elsewhere the discrete analogue of Laplace's method for hypergeometric series…
We present an iterative algorithm for calculating approximate greatest common divisor (GCD) of univariate polynomials with the real or the complex coefficients. For a given pair of polynomials and a degree, our algorithm finds a pair of…
A method for sequential inference of the fixed parameters of a dynamic latent Gaussian models is proposed and evaluated that is based on the iterated Laplace approximation. The method provides a useful trade-off between computational…
We propose an algorithm for Bayesian functional optimisation - that is, finding the function to optimise a process - guided by experimenter beliefs and intuitions regarding the expected characteristics (length-scale, smoothness, cyclicity…
In his celebrated book "Mathematical Treatise in Nine Sections" of 1247, Qin, Jiushao described the Chinese remainder theorem with great detail and generality. He also gave a method for computing modular inverse under the name of "DaYan…
Considering simultaneous approximation to three numbers, we study the geometry of the sequence of best approximations. We provide a sharper lower bound for the ratio between ordinary and uniform exponent of Diophantine approximation,…
Uncertainty propagation and filtering can be interpreted as gradient flows with respect to suitable metrics in the infinite dimensional manifold of probability density functions. Such a viewpoint has been put forth in recent literature, and…
Diophantine approximation is traditionally the study of how well real numbers are approximated by rationals. We propose a model for studying Diophantine approximation in an arbitrary totally bounded metric space where the rationals are…
Approximating complex probability distributions, such as Bayesian posterior distributions, is of central interest in many applications. We study the expressivity of geometric Gaussian approximations. These consist of approximations by…
We study the topological, dynamical, and descriptive set theoretic properties of Hurwitz continued fractions. Hurwitz continued fractions associate an infinite sequence of Gaussian integers to every complex number which is not a Gaussian…
Partitioning the vertices of a graph into two roughly equal parts while minimizing the number of edges crossing the cut is a fundamental problem (called Balanced Separator) that arises in many settings. For this problem, and variants such…
In two-dimensional geometric knapsack problem, we are given a set of n axis-aligned rectangular items and an axis-aligned square-shaped knapsack. Each item has integral width, integral height and an associated integral profit. The goal is…
To solve many problems on graphs, graph traversals are used, the usual variants of which are the depth-first search and the breadth-first search. Implementing a graph traversal we consequently reach all vertices of the graph that belong to…
Gauss quadrature integral approximation is extended to include integrals with a measure consisting of continuous as well as discrete components. That is, we give an approximation for the integral of a function plus its sum over a discrete…
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…