English
Related papers

Related papers: Combinatorial interpretation of the recurrence rel…

200 papers

The explicit formula for mobiusien function of fibonacci cobweb poset P is given for the first time by the use of definition of P in plane grid coordinate system.

Combinatorics · Mathematics 2008-02-15 Ewa Krot

We investigate new generalizations of the Meixner polynomials on the lattice $\mathbb{N}$, on the shifted lattice $\mathbb{N}+1-\beta$ and on the bi-lattice $\mathbb{N}\cup (\mathbb{N}+1-\beta)$. We show that the coefficients of the…

Classical Analysis and ODEs · Mathematics 2011-07-14 Galina Filipuk , Walter Van Assche

In this work we develop an algebraic theory of linear recurrence equations and systems with constant coefficients and reflection. We obtain explicit solutions and the Green's functions associated to different problems under general linear…

Classical Analysis and ODEs · Mathematics 2019-09-10 F. Adrián F. Tojo

In this article we present a new recurrence formula for a finite sum involving the Fibonacci sequence. Furthermore, we state an algorithm to compute the sum of a power series related to Fibonacci series, without the use of term-by-term…

History and Overview · Mathematics 2008-05-20 Adilson J. V. Brandao , Joao L. Martins

One of equivalents of the Riemann hypothesis is Li's criterion that all Li coefficients are positive. We study recurrence relations of Li coefficients in this note.

Number Theory · Mathematics 2020-06-24 Huan Xiao

A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.

Combinatorics · Mathematics 2014-11-25 Hacène Belbachir , Amine Belkhir , Imad Eddine Bousbaa

We present a study of three families of Kronecker coefficients, which we describe in terms of reduced Kronecker coefficients. This study is grounded on the generating function of the coefficients, proved by a bijection between two…

Combinatorics · Mathematics 2016-04-05 L. Colmenarejo

We describe the combinatorics that arise in summing a double recursion formula for the enumeration of connected Feynman graphs in quantum field theory. In one index the problem is more tractable and yields concise formulas which are…

Combinatorics · Mathematics 2015-01-14 Christian Brouder , William J. Keith , Ângela Mestre

This paper will describe how combinatorial interpretations can help us understand the algebraic structure of two aspects of perturbative quantum field theory, namely analytic Dyson-Schwinger equations and periods of scalar Feynman graphs.…

Mathematical Physics · Physics 2013-08-22 Karen Yeats

We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…

Combinatorics · Mathematics 2020-10-13 Mirko D'Ovidio , Anna Chiara Lai , Paola Loreti

We use character polynomials to obtain a positive combinatorial interpretation of the multiplicity of the sign representation in irreducible polynomial representations of $GL_n(\mathbb{C})$ indexed by two-column and hook partitions. Our…

Representation Theory · Mathematics 2022-11-29 Sridhar P. Narayanan , Digjoy Paul , Amritanshu Prasad , Shraddha Srivastava

We study matrix three term relations for orthogonal polynomials in two variables constructed from orthogonal polynomials in one variable. Using the three term recurrence relation for the involved univariate orthogonal polynomials, the…

Classical Analysis and ODEs · Mathematics 2016-03-24 Misael Marriaga , Teresa E. Pérez , Miguel A. Piñar

We show that essentially the Fibonacci sequence is the unique binary recurrence which contains infinitely many three-term arithmetic progressions. A criterion for general linear recurrences having infinitely many three-term arithmetic…

Number Theory · Mathematics 2010-05-21 Akos Pinter , Volker Ziegler

A research problem for undergraduates and graduates is being posed as a cap for the prior antecedent regular discrete mathematics exercises. [Here cap is not necessarily CAP=Competitive Access Provider, though nevertheless ...] The object…

Combinatorics · Mathematics 2010-11-23 A. Krzysztof Kwaśniewski , Ewa Krot-Sieniawska

We prove a stronger version of Jarden's Theorem for recurrence of powers of recursive functions

Number Theory · Mathematics 2013-07-02 Cheng Lien Lang , Mong Lung Lang

For an arbitrary homogeneous linear recurrence sequence of order d with constant coefficients, we derive recurrence relations for all subsequences with indices in arithmetic progression. The coefficients of these recurrences are given…

Number Theory · Mathematics 2016-11-29 Daniel Birmajer , Juan B. Gil , Michael D. Weiner

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 give a coalgebra structure on 1-vertex irreducible graphs which is that of a cocommutative coassociative graded connected coalgebra. We generalize the coproduct to the algebraic representation of graphs so as to express a bare 1-particle…

Mathematical Physics · Physics 2015-03-13 Angela Mestre

New differential-recurrence properties of dual Bernstein polynomials are given which follow from relations between dual Bernstein and orthogonal Hahn and Jacobi polynomials. Using these results, a fourth-order differential equation…

Numerical Analysis · Mathematics 2018-06-19 Filip Chudy , Paweł Woźny

In this paper, we provide a combinatorial interpretation for Laurent polynomials obtained by iteratively mutating a certain periodic quiver that has been framed with frozen vertices. This yields a family of cluster variables with principal…

Combinatorics · Mathematics 2026-02-24 Qiyue Chen , Gregg Musiker