English
Related papers

Related papers: A sufficient condition for $(\alpha, \beta)$ Somos…

200 papers

Let $(q_{\alpha, n})_{n \geq 0}$ be the sequence of convergent denominators to the simple continued fraction expansion of $\alpha$. For certain specific choices of $\alpha$, this sequence is a Lehmer sequence. In this paper, we show that…

Number Theory · Mathematics 2025-08-18 Mohit Mittal

In the paper, we give the recurrent equations of the Hankel determinants of the Cantor sequence, and show that the Hankel determinants as a double sequence is 3-automatic. With the help of the Hankel determinants, we prove that the…

Number Theory · Mathematics 2014-11-12 Zhi-xiong Wen , Wen Wu

We obtain solutions to the recursive sequences of the form $$x_{n + 1} = \frac{x_{n - 3}x_{n }}{x_{n - 2}(a_n + b_nx_{n -3}x_{n})}$$ where $a_n$ and $b_n$ are arbitrary sequences of real numbers, and the initial values are gives as;…

Dynamical Systems · Mathematics 2019-02-19 Mensah Folly-Gbetoula , Darlison Nyirenda

We prove the Oppenheim conjecture for indefinite ternary diagonal forms of the type $x^{2}+y^{2} -\alpha z^{2}$ where $ \alpha $ is an irrational number. Our method is explicit in the sense that we are able to construct a solution to the…

Number Theory · Mathematics 2021-10-29 Youssef Lazar

We compute to all loop orders correlation function of four heavy BPS operators in $\mathcal{N}$= 4 SYM with special polarisations considered recently by Frank Coronado. Our main result is an expression for the octagon form factor as…

High Energy Physics - Theory · Physics 2019-06-19 Ivan Kostov , Valentina B. Petkova , Didina Serban

This paper consists of three independent parts: First we use only elementary algebra to prove that the quartic algorithm of the Borwein brothers has exactly the same output as the Brent-Salamin algorithm, but that the latter needs twice as…

Number Theory · Mathematics 2025-06-11 Lorenz Milla

We prove the rank-4 case of the conjecture of Ha-Hai-Nghia for the invariant subspace of the truncated polynomial ring $\mathcal{Q}_m(n)=\mathbb{F}_q[x_1,\dots,x_n]/(x_1^{q^m},\dots,x_n^{q^m}),$ under a new, explicit technical hypothesis.…

Commutative Algebra · Mathematics 2025-10-30 Dang Vo Phuc

Basic results in combinatorial mathematics provide the foundation for a theory and calculus for reasoning about sequential behavior. A key concept of the theory is a generalization of Boolean implicant which deals with statements of the…

Logic in Computer Science · Computer Science 2007-05-23 Frederick Furtek

We prove a polynomial continued fraction identity for the constant $-\pi/4$, conjectured by the Ramanujan Machine project. The proof proceeds by explicitly solving the underlying second-order linear difference equation. We derive a…

General Mathematics · Mathematics 2026-04-08 Chao Wang

Arhangelskii's properties $\alpha_2$ and $\alpha_4$ defined for convergent sequences may be characterized in terms of Scheeper's selection principles. We generalize these results to hold for more general collections and consider these…

General Topology · Mathematics 2019-11-11 Steven Clontz

We complete the classification of $4\times 4$ regular solutions of the Yang-Baxter equation. Apart from previously known models, we find four new models of non-difference form. All the new models give rise to Hamiltonians and transfer…

High Energy Physics - Theory · Physics 2024-02-22 Luke Corcoran , Marius de Leeuw

We study the generalized Hankel transform of the family of sequences satisfying the recurrence relation $a_{n+1} = \bigl(\alpha + \frac{\beta}{n+\gamma}\bigr) a_n$. We apply the obtained formula to several particular important sequences.…

Combinatorics · Mathematics 2012-03-27 Mario Garcia-Armas

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

Logic in Computer Science · Computer Science 2011-02-02 Wil Dekkers

We develop a new algorithm to compute determinants of all possible Hankel matrices made up from a given finite length sequence over a finite field. Our algorithm fits within the dynamic programming paradigm by exploiting new recursive…

Cryptography and Security · Computer Science 2022-01-04 Claude Gravel , Daniel Panario , Bastien Rigault

Commutative hypercomplex algebras offer significant advantages over traditional quaternions due to their compatibility with linear algebra techniques and efficient computational implementation, which is crucial for broad applicability. This…

We consider systems of recursively defined combinatorial structures. We give algorithms checking that these systems are well founded, computing generating series and providing numerical values. Our framework is an articulation of the…

Combinatorics · Mathematics 2012-12-18 Carine Pivoteau , Bruno Salvy , Michele Soria

The six-vertex model with Domain Wall Boundary Conditions, or square ice, is considered for particular values of its parameters, corresponding to 1-, 2-, and 3-enumerations of Alternating Sign Matrices (ASMs). Using Hankel determinant…

Mathematical Physics · Physics 2011-02-16 F. Colomo , A. G. Pronko

We introduce a proof system for Hajek's logic BL based on a relational hypersequents framework. We prove that the rules of our logical calculus, called RHBL, are sound and invertible with respect to any valuation of BL into a suitable…

Logic in Computer Science · Computer Science 2007-05-23 S. Bova , F. Montagna

We establish new combinatorial transcendence criteria for continued fraction expansions. Let $\alpha = [0; a_1, a_2,...]$ be an algebraic number of degree at least three. One of our criteria implies that the sequence of partial quotients…

Number Theory · Mathematics 2012-11-26 Yann Bugeaud

For almost a century, the decidability of the Skolem Problem - that is, the problem of finding whether a given linear recurrence sequence (LRS) has a zero term - has remained open. A breakthrough in the 1980s established that the Skolem…

Formal Languages and Automata Theory · Computer Science 2025-12-10 Piotr Bacik