相关论文: The Cube Recurrence
An algorithm for calculating two-loop propagator type Feynman diagrams with arbitrary masses and external momentum is proposed. Recurrence relations allowing to express any scalar integral in terms of basic integrals are given. A minimal…
In this paper we construct inverse bijections between two sequences of finite sets. One sequence is defined by planar diagrams and the other by lattice walks. G. Kuperberg has shown that the number of elements in these two sets are equal.…
We obtain new recurrence relations, an explicit formula, and convolution identities for higher order geometric polynomials. These relations generalize known results for geometric polynomials, and lead to congruences for higher order…
In this work, we define a more general family of polynomials in several variables satisfying a linear recurrence relation. Then we provide explicit formulas and determinantal expressions. Finally, we apply these results to recurrent…
We investigate the sequence $(P_{n}(z))_{n=0}^{\infty}$ of random polynomials generated by the three-term recurrence relation $P_{n+1}(z)=z P_{n}(z)-a_{n} P_{n-1}(z)$, $n\geq 1$, with initial conditions $P_{\ell}(z)=z^{\ell}$, $\ell=0, 1$,…
The orthogonal polynomials with recurrence relation \[(\la\_n+\mu\_n-z) F\_n(z)=\mu\_{n+1} F\_{n+1}(z)+\la\_{n-1} F\_{n-1}(z)\] with two kinds of cubic transition rates $\la\_n$ and $\mu\_n,$ corresponding to indeterminate Stieltjes moment…
A classic result of Conway and Coxeter on frieze patterns has been generalized to a bijection between $p$-angulations of regular polygons and frieze patterns of type $\Lambda_p$. One of the features of Conway-Coxeter theory is a…
Connected the generalized Goncharov polynomials associated to a pair ($\partial,\mathcal{Z}$) if a delta operator $\partial$ and an interpolation grid $\mathcal{Z}$, introduced by Lorentz, Tringali and Yan in [7], with the theory of…
One of the most popular and studied recursive series is the Fibonacci sequence. It is challenging to see how Fibonacci numbers can be used to generate other recursive sequences. In our article, we describe some families of integer…
It is shown that a SU(1,1) algebra may be used to provide a unified description of the simple hamonic oscillator and the angular momentum algebras and a class of other semi-infinite algebras. A normal ordered representation of a Unitary…
We present a multidimensional generalization of Zeckendorf's Theorem (any positive integer can be written uniquely as a sum of non-adjacent Fibonacci numbers) to a large family of linear recurrences. This extends work of Anderson and…
This article is dedicated to the memory of Vadim Kuznetsov, and begins with some of the author's recollections of him. Thereafter, a brief review of Somos sequences is provided, with particular focus being made on the integrable structure…
We provide a simple method to recognize classical orthogonal polynomials on lattices defined only by their coefficients of the three term recurrence relation.
The classical congruences satisfied by the Fibonacci and Lucas sequences are reflected with the decomposition of primes in the ring generated by the gold number. This generalizes to establish a correspondence that we hope will be new…
We define Bernstein-Gelfand-Ponomarev reflection functors in the cluster categories of hereditary algebras. They are triangle equivalences which provide a natural quiver realization of the "truncated simple reflections" on the set of almost…
We exhibit products of Mandelbrot sets in the two-dimensional complex parameter space of cubic polynomials. These products were observed by J. Milnor in computer experiments which inspired Lavaurs' proof of non local-connectivity for the…
We present a finite-order system of recurrence relations for a permanent of circulant matrices containing a band of k any-value diagonals on top of a uniform matrix (for k = 1, 2, and 3) as well as the method for deriving such recurrence…
Two doubly indexed families of polynomials in several indeterminates are considered. They are related to the falling and rising factorials in a similar way as the potential polynomials (introduced by L. Comtet) are related to the ordinary…
The cyclic sieving phenomenon provides a link between a polynomial analogue of Gauss congruence known as $q$-Gauss congruence, and a combinatorial analogue of Gauss congruence based on sequences of cyclic group actions. We strengthen this…
A new class of algebras have been introduced by Khovanov and Lauda and independently by Rouquier. These algebras categorify one-half of the Quantum group associated to arbitrary Cartan data. In this paper, we use the combinatorics of Lyndon…