English
Related papers

Related papers: On the Connection Between Irrationality Measures a…

200 papers

We introduce a $q$-analog of the higher continued fractions introduced by the last three authors in a previous work (together with Gregg Musiker), which are simultaneously a generalization of the $q$-rational numbers of Morier-Genoud and…

Combinatorics · Mathematics 2024-08-14 Amanda Burcroff , Nicholas Ovenhouse , Ralf Schiffler , Sylvester W. Zhang

We prove that the formula giving the exact value of the irrationality exponent of regular continued fractions remains valid for semi-regular continued fractions satisfyiong certain conditions.

Number Theory · Mathematics 2022-02-23 Daniel Duverney , Iekata Shiokawa

It is a classical fact that the irrationality of a number $\xi\in\mathbb R$ follows from the existence of a sequence $p_n/q_n$ with integral $p_n$ and $q_n$ such that $q_n\xi-p_n\ne0$ for all $n$ and $q_n\xi-p_n\to0$ as $n\to\infty$. In…

Number Theory · Mathematics 2018-08-06 Wadim Zudilin

The polynomial Fre\u{\i}man--Ruzsa conjecture is a fundamental open question in additive combinatorics. However, over the integers (or more generally $\mathbb{R}^d$ or $\mathbb{Z}^d$) the optimal formulation has not been fully pinned down.…

Number Theory · Mathematics 2017-09-29 Freddie Manners

We study Poincar\'e series associated to a finite collection of divisors on i. a finite graph and ii. a certain family of metric graphs called chain of loops. Our main results are proofs of rationality of the Poincar\'e series and…

Combinatorics · Mathematics 2022-03-28 Madhusudan Manjunath

Let $(F_n)_{n\geq 0}$ be the Fibonacci sequence given by $F_{n+2}=F_{n+1}+F_n$, for $n\geq 0$, where $F_0=0$ and $F_1=1$. There are several interesting identities involving this sequence such as $F_n^2+F_{n+1}^2=F_{2n+1}$, for all $n\geq…

Number Theory · Mathematics 2023-09-18 Ana Paula Chaves , Carlos Gustavo Moreira , Eduardo Henrique no Nascimento

For regular continued fraction, if a real number $x$ and its rational approximation $p/q$ satisfying $|x-p/q|<1/q^2$, then, after deleting the last integer of the partial quotients of $p/q$, the sequence of the remaining partial quotients…

Number Theory · Mathematics 2021-12-15 Yubin He , Ying Xiong

We study orthogonal polynomials associated with a continued fraction due to Hirschhorn. Hirschhorn's continued fraction contains as special cases the famous Rogers--Ramanujan continued fraction and two of Ramanujan's generalizations. The…

Classical Analysis and ODEs · Mathematics 2022-02-22 Gaurav Bhatnagar , Mourad E. H. Ismail

Functional Principal Components Analysis (FPCA) is a widely used analytic tool for dimension reduction of functional data. Traditional implementations of FPCA estimate the principal components from the data, then treat these estimates as…

Methodology · Statistics 2026-04-03 Joseph Sartini , Xinkai Zhou , Liz Selvin , Scott Zeger , Ciprian Crainiceanu

Fibonacci polynomials are generalizations of Fibonacci numbers, so it is natural to consider polynomial versions of the various results for Fibonacci numbers. According to Hong, Pongsriiam, Bulawa, and Lee, the generating function of the…

Number Theory · Mathematics 2023-07-18 Yuji Tsuno

Atserias and M\"uller (JACM, 2020) proved that for every unsatisfiable CNF formula $\varphi$, the formula $\operatorname{Ref}(\varphi)$, stating "$\varphi$ has small Resolution refutations", does not have subexponential-size Resolution…

Computational Complexity · Computer Science 2026-05-20 Noel Arteche , Albert Atserias , Susanna F. de Rezende , Erfan Khaniki

The determination of exponentially stable equilibria and their basin of attraction for a dynamical system given by a general autonomous ordinary differential equation can be achieved by means of a contraction metric. A contraction metric is…

Dynamical Systems · Mathematics 2019-09-24 Peter Giesl , Sigurdur Hafstein , Iman Mehrabinezhad

We study the problem of obtaining lower bounds for polynomial calculus (PC) and polynomial calculus resolution (PCR) on proof degree, and hence by [Impagliazzo et al. '99] also on proof size. [Alekhnovich and Razborov '03] established that…

Computational Complexity · Computer Science 2015-05-07 Mladen Mikša , Jakob Nordström

In \cite{GCF} it is proved that any quadratic irrational number has a representation as a continuous, infinite and periodic fraction. In 1848, Charles Hermite through a letter Jacobi \cite{Per} wondered if this fact could be generalized to…

Number Theory · Mathematics 2023-06-01 Y. Sifontes , D. Tejada

We consider series expansions in bases of classical orthogonal polynomials. When such a series solves a linear differential equation with polynomial coefficients, its coefficients satisfy a linear recurrence equation. We interpret this…

Classical Analysis and ODEs · Mathematics 2026-04-30 Alexandre Benoit , Nicolas Brisebarre , Bruno Salvy

In this paper, we present some generalizations of Lagrange's theorem in the classical theory of continued fractions motivated by the geometric interpretation of the classical theory in terms of closed geodesics on the modular curve. As a…

Number Theory · Mathematics 2017-12-25 Hohto Bekki

It oftens occurs that Taylor coefficients of (dimensionally regularized) Feynman amplitudes $I$ with rational parameters, expanded at an integral dimension $D= D_0$, are not only periods (Belkale, Brosnan, Bogner, Weinzierl) but actually…

Algebraic Geometry · Mathematics 2008-12-23 Yves André

Let $x$ be a periodic continued fraction with the initial block $0$ and the repeating block $c_1,\ldots,c_n$. So $x$ is a quadratic irrational of the form $x=a+\sqrt b$, where $a$, $b$ are rational numbers, $b>0$, $b$ not a square. The…

Number Theory · Mathematics 2017-07-12 Kurt Girstmair

Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question…

Number Theory · Mathematics 2026-01-21 Yuto Nakajima , Hiroki Takahasi , Baowei Wang

We study whether lower bounds against constant-depth algebraic circuits computing the Permanent over finite fields (Limaye-Srinivasan-Tavenas, J. ACM 2025; Forbes, CCC 2024) are hard to prove in certain proof systems. We focus on a DNF…

Computational Complexity · Computer Science 2025-09-23 Jiaqi Lu , Rahul Santhanam , Iddo Tzameret