Results 51 to 60 of about 1,648,333 (245)
Fibonacci Numbers with a Prescribed Block of Digits
Mathematics, 2020 In this paper, we prove that F 22 = 17711 is the largest Fibonacci number whose decimal expansion is of the form a b … b c … c . The proof uses lower bounds for linear forms in three logarithms of algebraic numbers and some tools from ...
Pavel Trojovský
doaj +1 more source
IET Information Security, 2021 A simultaneous Diophantine approximation (SDA) algorithm takes instances of the partial approximate common divisor (PACD) problem as input and outputs a solution.
Wonhee Cho, Jiseung Kim, Changmin Lee
doaj +1 more source
Expanding measures: Random walks and rigidity on homogeneous spaces
Forum of Mathematics, Sigma, 2023 Let G be a real Lie group, $\Lambda
Roland Prohaska +2 more
doaj +1 more source
Markov random walks on homogeneous spaces and Diophantine approximation on fractals [PDF]
Transactions of the American Mathematical Society, 2019 In the first part, using the recent measure classification results of Eskin–Lindenstrauss, we give a criterion to ensure a.s. equidistribution of empirical measures of an i.i.d.
Roland Prohaska, Cagri Sert
semanticscholar +1 more source
Mathematics, 2021 The Lattice String Approximation algorithm (or LSA algorithm) of M. L. Lapidus and M. van Frankenhuijsen is a procedure that approximates the complex dimensions of a nonlattice self-similar fractal string by the complex dimensions of a lattice self ...
Michel L. Lapidus +2 more
doaj +1 more source
Metric Diophantine approximation with congruence conditions [PDF]
International Journal of Number Theory, 2019 We prove a version of the Khinchin–Groshev theorem for Diophantine approximation of matrices subject to a congruence condition. The proof relies on an extension of the Dani correspondence to the quotient by a congruence subgroup.
Erez Nesharim, René Rühr, Ronggang Shi
semanticscholar +1 more source
How smooth is quantum complexity?
Journal of High Energy Physics, 2021 The “quantum complexity” of a unitary operator measures the difficulty of its construction from a set of elementary quantum gates. While the notion of quantum complexity was first introduced as a quantum generalization of the classical computational ...
Vir B. Bulchandani, S. L. Sondhi
doaj +1 more source
On homogeneous and inhomogeneous Diophantine approximation over the fields of formal power series [PDF]
Pacific Journal of Mathematics, 2019 We prove over fields of power series the analogues of several Diophantine approximation results obtained over the field of real numbers. In particular we establish the power series analogue of Kronecker's theorem for matrices, together with a ...
Y. Bugeaud, Zhenliang Zhang
semanticscholar +1 more source
Location of approximations of a Markoff theorem
International Journal of Mathematics and Mathematical Sciences, 1990 Relative to the first two theorems of the well known Markoff Chain (J.W.S. Cassels, An introduction to diophantine approximation approximations are well located.
K. C. Prasad, M. Lari, P. Singh
doaj +1 more source
Diophantine approximation, large intersections and geodesics in negative curvature [PDF]
Proceedings of the London Mathematical Society, 2019 In this paper, we prove quantitative results about geodesic approximations to submanifolds in negatively curved spaces. Among the main tools is a new and general Jarník–Besicovitch type theorem in Diophantine approximation. Our framework allows manifolds
Anish Ghosh, Debanjan Nandi
semanticscholar +1 more source