Related papers: Dilogarithm identities after Bridgeman
We prove the periodicities of the restricted T and Y-systems associated with the quantum affine algebra of type B_r at any level. We also prove the dilogarithm identities for the Y-systems of type B_r at any level. Our proof is based on the…
In the paper we provide some polynomial identities for finite-dimensional algebras. A list of well known single polynomial identities is exposed and the classification of all $2$-dimensional algebras with respect to these identities is…
Let $(L_n)_{n \geq 1}$ be the sequence of Lucas numbers, defined recursively by $L_1 := 1$, $L_2 := 3$, and $L_{n + 2} := L_{n + 1} + L_n$, for every integer $n \geq 1$. We determine the asymptotic behavior of $\log \operatorname{lcm} (L_1…
We construct a duality for F-manifolds with eventual identities and special families of connections and we describe its interactions with several well-known constructions from the theory of Frobenius and F-manifolds.
We discuss several topics related to polylogarithms with focus on dilogarithms. The topics are: a generating function with harmonic numbers coming from Ramanujan, extending the dilogarithm to complex numbers beyond the unit disk, and…
In their study of a binomial sum related to Wolstenholme's theorem, Chamberland and Dilcher prove that the corresponding sequence modulo primes $p$ satisfies congruences that are analogous to Lucas' theorem for the binomial coefficients…
Except for Koshy who devotes seven pages to applications of Fibonacci Numbers to electric circuits, most books and the Fibonacci Quarterly have been relatively silent on applications of graphs and electric circuits to Fibonacci numbers.…
In this article we shows some results about algebra with the group of units having special polynomial identity.
Divisibility sequences are defined by the property that their elements divide each other whenever their indices do. The divisibility sequences that also satisfy a linear recurrence, like the Fibonacci numbers, are generated by polynomials…
We present other proofs, generalizations and analogues of the identities concerning multiple Dirichlet series by Tahmi and Derbal (2022). As applications, we obtain asymptotic formulas with remainder terms for certain related sums.
This paper deals with the Landesman-Lazer type problem of elliptic equations associated with homogeneous Dirichlet boundary conditions. By using some dynamical arguments we derive some new results on bifurcation from infinity and…
We prove that certain sequences of finite continued fractions associated with a 2-periodic continued fraction with period a,b>0 are moment sequences of discrete signed measures supported in the interval [-1,1], and we give necessary and…
We afford the problem of counting the blocks of a given length made with symbols drawn from an alphabet and relate this number to Fibonacci-like recurrent relations. The recurrence polynomia allows to calculate the limit ratio of two…
By making use of the greatest common divisor's ($gcd$) properties we can highlight some connections between playing billiard inside a unit square and the Fibonacci sequence as well as the Euclidean algorithm. In particular by defining two…
We investigate general properties of number sequences which allow explicit representation in terms of products. We find that such sequences form whole families of number sequences sharing similar recursive identities. Restricting to the…
A fast simple O(\log n) iteration algorithm for individual Lucas numbers is given. This is faster than using Fibonacci based methods because of the structure of Lucas numbers. Using a sqrt 5 conversion factor on Lucus numbers gives a faster…
We give elementary proofs of some congruence criteria to compute binomial coefficients in modulo a prime. These criteria are analogues to the symmetry property of binomial coefficients. We give extended version of Lucas Theorem by using…
We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…
This paper generalizes a graph theoretic proof technique for a Fibonacci identity proposed by Lee Knisley Sanders, and explores characteristics of these generalized theorems ad infinitum.
We provide a new perspective on the divisor theory of graphs, using additive combinatorics. As a test case for this perspective, we compute the gonality of certain families of outerplanar graphs, specifically the strip graphs. The Jacobians…