English
Related papers

Related papers: The Cube Recurrence

200 papers

In this paper we obtained several properties that the characteristic polynomials of the unit-primitive matrix satisfy. In addition, using these properties we have shown that the recurrence relation given as in the formula (1) is true. In…

Combinatorics · Mathematics 2023-05-09 Byeong-Gil Choe , Hyeong-Kwan Ju

We show that several families of polynomials defined via fillings of diagrams satisfy linear recurrences under a natural operation on the shape of the diagram. We focus on key polynomials, (also known as Demazure characters), and Demazure…

Combinatorics · Mathematics 2018-09-26 Per Alexandersson

We show that any graph polynomial from a wide class of graph polynomials yields a recurrence relation on an infinite class of families of graphs. The recurrence relations we obtain have coefficients which themselves satisfy linear…

Combinatorics · Mathematics 2013-09-17 Tomer Kotek , Johann A. Makowsky

We present a certain generalization of a recent result of M. I. Cirnu on linear recurrence relations with coefficient in progressions [2]. We provide some interesting examples related to some well-known integer sequences, such as Fibonacci…

Number Theory · Mathematics 2015-03-19 Jerico B. Bacani , Julius Fergy T. Rabago

In a previous paper, we presented conjectures of the recurrence relations with constant coefficients for the multi-indexed orthogonal polynomials of Laguerre, Jacobi, Wilson and Askey-Wilson types. In this paper we present a proof for the…

Mathematical Physics · Physics 2016-02-10 Satoru Odake

We consider quivers/skew-symmetric matrices under the action of mutation (in the cluster algebra sense). We classify those which are isomorphic to their own mutation via a cycle permuting all the vertices, and give families of quivers which…

Combinatorics · Mathematics 2020-12-21 Allan P. Fordy , Bethany Marsh

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

Mathematical Physics · Physics 2014-11-03 Maryna Nesterenko , Jiri Patera , Agnieszka Tereszkiewicz

This note contains a solution to the following problem: reconstruct the definition field and the equation of a projective cubic surface, using only combinatorial information about the set of its rational points. This information is encoded…

Algebraic Geometry · Mathematics 2010-01-05 Yu. I. Manin

Kelly's combinatorial lemma is a basic tool in the study of Ulam's reconstruction conjecture. A generalization in terms of a family of t-elements subsets of a v-element set was given by Pouzet. We consider a version of this generalization…

Combinatorics · Mathematics 2013-02-19 Aymen Ben Amira , Jamel Dammak , Hamza Si Kaddour

We consider a self-convolutive recurrence whose solution is the sequence of coefficients in the asymptotic expansion of the logarithmic derivative of the confluent hypergeometic function $U(a,b,z)$. By application of the Hilbert transform…

Combinatorics · Mathematics 2020-02-27 Richard J. Martin , M. J. Kearney

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

Combinatorics · Mathematics 2022-12-05 Hung Phuc Hoang , Torsten Mütze

Motivated by a construction in the theory of cluster algebras (Fomin and Zelevinsky), one associates to each acyclic directed graph a family of sequences of natural integers, one for each vertex; this construction is called a {\em frieze};…

Number Theory · Mathematics 2012-04-24 Christophe Reutenauer

We consider two families of polynomials that play the same role in the Temperley Lieb algebra of a Coxeter group as the Kazhdan Lusztig and R polynomials play in the Hecke algebra of the group. We study these polynomials from a…

Combinatorics · Mathematics 2013-10-04 Alfonso Pesiri

We introduce the concepts of an amazing hypercube decomposition and a double shortcut for it, and use these new ideas to formulate a conjecture implying the Combinatorial Invariance Conjecture of the Kazhdan--Lusztig polynomials for the…

Combinatorics · Mathematics 2024-11-27 Francesco Esposito , Mario Marietti , Grant T. Barkley , Christian Gaetz

We give recurrence relations for any family of generalized Appell polynomials unifying so some known recurrences of many classical sequences of polynomials. Our main tool to get our goal is the Riordan group. We use the product of Riordan…

Combinatorics · Mathematics 2009-07-02 A. Luzon , M. A. Morón

In this note we augment the poly-Bernoulli family with two new combinatorial objects. We derive formulas for the relatives of the poly-Bernoulli numbers using the appropriate variations of combinatorial interpretations. Our goal is to show…

Combinatorics · Mathematics 2016-03-01 Beáta Bényi , Péter Hajnal

In the field of the Jacobian conjecture it is well-known after Druzkowski that from a polynomial "cubic-homogeneous" mapping we can build a higher-dimensional "cubic-linear" mapping and the other way round, so that one of them is invertible…

Complex Variables · Mathematics 2012-04-19 Gianluca Gorni , Gaetano Zampieri

We describe a family of polynomials discovered via a particular recursion relation, which have connections to Chebyshev polynomials of the first and the second kind, and the polynomial version of Pell's equation. Many of their properties…

Mathematical Physics · Physics 2018-09-11 Ben Cox , Mee Seong Im

We study the problem of solving integration-by-parts recurrence relations for a given class of Feynman integrals which is characterized by an arbitrary polynomial in the numerator and arbitrary integer powers of propagators, {\it i.e.}, the…

High Energy Physics - Phenomenology · Physics 2015-06-25 V. A. Smirnov , M. Steinhauser

We present a natural, combinatorial problem whose solution is given by the meta-Fibonacci recurrence relation $a(n) = \sum_{i=1}^p a(n-i+1 - a(n-i))$, where $p$ is prime. This combinatorial problem is less general than those given in [3]…

Combinatorics · Mathematics 2019-02-11 Ramin Naimi , Eric Sundberg