Related papers: Computation of invariant densities for continued f…
We construct a deterministic approximation algorithm for computing a permanent of a $0,1$ $n$ by $n$ matrix to within a multiplicative factor $(1+\epsilon)^n$, for arbitrary $\epsilon>0$. When the graph underlying the matrix is a constant…
Three new graph invariants are introduced which may be measured from a quantum graph state and form examples of a framework under which other graph invariants can be constructed. Each invariant is based on distinguishing a different number…
We present recent advances in harmonic analysis on infinite graphs. Our approach combines combinatorial tools with new results from the theory of unbounded Hermitian operators in Hilbert space, geometry, boundary constructions, and spectral…
The classical continued fraction is generalized for studying the rational approximation problem on multi-formal Laurent series in this paper, the construction is called m-continued fraction. It is proved that the approximants of an…
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper we study convex graph invariants, which are graph invariants…
Several conjectural continued fractions found with the help of various algorithms are published in this paper.
New invariants for 2-dimensional cell complexes are defined, which can be interpreted as curvature bounds. These invariants are proved to be rational and computable in a companion article. This document is a survey that collects theorems…
Most well-known multidimensional continued fractions, including the M\"{o}nkemeyer map and the triangle map, are generated by repeatedly subdividing triangles. This paper constructs a family of multidimensional continued fractions by…
We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…
This paper continues the author's previous studies on continued fractions and Heron's algorithm, as from his former JMM2017 presentation (see \cite{CF.HA}).\par\medskip Extending the notion of continued fraction to the $p$-adic fields, one…
We study dynamic graph algorithms in the Massively Parallel Computation model, which was inspired by practical data processing systems. Our goal is to provide algorithms that can efficiently handle large batches of edge insertions and…
We statistically compare the relationships between frequencies of digits in continued fraction expansions of typical rational points in the unit interval and higher dimensional generalisations. This takes the form of a Large Deviation and…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
We study the dynamics of a family of continued fraction maps parametrized by the unit interval. This family contains as special instances the Gauss continued fraction map and the Fibonacci map. We determine the transfer operators of these…
We generalize Roth's theorem on three term arithmetic progressions to translation invariant quadratic forms in at least 17 variables. We use Fourier-analysis, restriction theory, uniformity norms and Roth's density increment method to show…
Model sets (also called cut and project sets) are generalizations of lattices, and multi-component model sets are generalizations of lattices with colourings. In this paper, we study self-similarities of multi-component model sets. The main…
Fundamental to the theory of continued fractions is the fact that every infinite continued fraction with positive integer coefficients converges; however, it is unknown precisely which continued fractions with integer coefficients (not…
Studying the factorization theory of numerical monoids relies on understanding several important factorization invariants, including length sets, delta sets, and $\omega$-primality. While progress in this field has been accelerated by the…
The fundamental model of a periodic structure is a periodic point set up to rigid motion or isometry. Our recent paper in SoCG 2021 defined isometry invariants (density functions), which are complete in general position and continuous under…
There is a digraph corresponding to every square matrix over $\mathbb{C}$. We generate a recurrence relation using the Laplace expansion to calculate the characteristic, and permanent polynomials of a square matrix. Solving this recurrence…