Related papers: Octagonal continued fraction and diagonal changes
Dzhaparidze and Spreij [5] showed that the quadratic variation of a semimartingale can be approximated using a randomized periodogram. We show that the same approximation is valid for a special class of continuous stochastic processes. This…
A unitary shift operator (GSO) for signals on a graph is introduced, which exhibits the desired property of energy preservation over both backward and forward graph shifts. For rigour, the graph differential operator is also derived in an…
We define two types of the $\alpha$-Farey maps $F_{\alpha}$ and $F_{\alpha, \flat}$ for $0 < \alpha < \tfrac{1}{2}$, which were previously defined only for $\tfrac{1}{2} \le \alpha \le 1$ by R.~Natsui (2004). Then, for each $0 < \alpha <…
Finite field transforms are offered as a new tool of spreading sequence design. This approach exploits orthogonality properties of synchronous non-binary sequences defined over a complex finite field. It is promising for channels supporting…
We compute explicitly the density of the invariant measure for the Reverse algorithm which is absolutely continuous with respect to Lebesgue measure, using a method proposed by Arnoux and Nogueira. We also apply the same method on the…
A well known method for convergence acceleration of continued fraction $\K(a_n/b_n)$ is to use the modified approximants $S_n(\omega_n)$ in place of the classical approximants $S_n(0)$, where $\omega_n$ are close to tails $f^{(n)}$ of…
A discrete rotation algorithm can be apprehended as a parametric application $f\_\alpha$ from $\ZZ[i]$ to $\ZZ[i]$, whose resulting permutation ``looks like'' the map induced by an Euclidean rotation. For this kind of algorithm, to be…
The Arithmetic Fourier Transform is a numerical formulation for computing Fourier series and Taylor series coefficients. It competes with the Fast Fourier Transform in terms of speed and efficiency, requiring only addition operations and…
The Replica Fourier Transform introduced previously is related to the standard definition of Fourier transforms over a group. Its use is illustrated by block-diagonalizing the eigenvalue equation of a four-replica Parisi matrix.
Classical results on Diophantine approximation, such as Roth's theorem, provide the most effective techniques for proving the transcendence of special kinds of continued fractions. Multidimensional continued fractions are a generalization…
In this paper, we introduce a graph matching method that can account for constraints of arbitrary order, with arbitrary potential functions. Unlike previous decomposition approaches that rely on the graph structures, we introduce a…
The Farey map is the universal triangular map whose automorphism group is the classical modular group. We study the quotients of the Farey map by the principal congruence subgroups of the modular group. We also study the structure of the…
The Farey sequence is a natural exhaustion of the set of rational numbers between 0 and 1 by finite lists. Ford Circles are a natural family of mutually tangent circles associated to Farey fractions: they are an important object of study in…
Calculating dynamical diffraction patterns for X-ray topography and similar x-ray scattering-imaging techniques require the numerical integration of the Takagi-Taupin equations. This is usually performed with a simple second order finite…
In previous work, we introduced a version of the Fukaya algebra associated to a degeneration of a symplectic manifold, whose structure maps count collections of maps in the components of the degeneration satisfying matching conditions. In…
The question of how Algebra can be used to solve dynamical systems and characterize chaos was first posed in a fertile mathematical context by Ziglin, Morales, Ramis and Sim\'o using differential Galois theory. Their study was aimed at…
A new transform over finite fields, the finite field Hartley transform (FFHT), was recently introduced and a number of promising applications on the design of efficient multiple access systems and multilevel spread spectrum sequences were…
This paper introduces a design method for densergraph-frequency graph Fourier frames (DGFFs) to enhance graph signal processing and analysis. The graph Fourier transform (GFT) enables us to analyze graph signals in the graph spectral domain…
Arithmetic complexity has a main role in the performance of algorithms for spectrum evaluation. Arithmetic transform theory offers a method for computing trigonometrical transforms with minimal number of multiplications. In this paper, the…
We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…