English
Related papers

Related papers: Combinatorial interpretation of the recurrence rel…

200 papers

In this paper, we find several determinants expressing the Fibonomial coefficients. We also give the generating functions, Vandermonde identity, and continued fractions about Fibonomial coefficients.

Number Theory · Mathematics 2026-05-15 Takao Komatsu

In a recent series of communications we have shown that the reordering problem of bosons leads to certain combinatorial structures. These structures may be associated with a certain graphical description. In this paper, we show that there…

Symbolic Computation · Computer Science 2016-08-16 Gérard Henry Edmond Duchamp , Pawel Blasiak , Andrzej Horzela , Karol A. Penson , Allan I. Solomon

A three term recurrence relation is derived for a basis consisting of polynomials multiplied by sines and cosines with large, but fixed frequencies. A numerical method for computing the coefficients of the three term recurrence relation is…

Numerical Analysis · Mathematics 2023-01-19 Rockford Sison

In this paper, we pose many challenging conjectures on congruences involving binomial coefficients and Ap\'ery-like numbers.

Number Theory · Mathematics 2020-08-18 Zhi-Hong Sun

We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.

Combinatorics · Mathematics 2007-05-23 Igor Pak , Ernesto Vallejo

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

Combinatorics · Mathematics 2016-09-06 Daniel E. Loeb

Fibonomial coefficients count the number of specific finite birth self-similar subposets of an infinite non-tree poset naturally related to the Fibonacci tree of rabbits growth process.

Combinatorics · Mathematics 2008-02-11 A. K. Kwasniewski

In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…

Combinatorics · Mathematics 2016-05-10 Zhumagali Shomanov

Following Lucas and then other Fibonacci people Kwasniewski had introduced and had started ten years ago the open investigation of the overall F-nomial coefficients which encompass among others Binomial, Gaussian and Fibonomial coefficients…

Combinatorics · Mathematics 2009-08-25 M. Dziemianczuk

Associated to a finite measure on the real line with finite moments are recurrence coefficients in a three-term formula for orthogonal polynomials with respect to this measure. These recurrence coefficients are frequently inputs to modern…

Numerical Analysis · Mathematics 2021-02-01 Zexin Liu , Akil Narayan

We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…

Combinatorics · Mathematics 2009-03-05 Dan Drake

In this paper we shall evaluate two alternating sums of binomial coefficients by a combinatorial argument. Moreover, by combining the same combinatorial idea with partition theoretic techniques, we provide $q$-analogues involving the…

Number Theory · Mathematics 2016-06-07 Mohamed El Bachraoui

Motivated by the definition of the edge elimination polynomial of a graph we define the covered components polynomial counting spanning subgraphs with respect to their number of components, edges and covered components. We prove a…

Combinatorics · Mathematics 2012-03-02 Martin Trinks

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 combinatorially prove a new recurrence between the Tutte polynomials of graphs obtained by contraction of the complete graphs $K_{n}$%. This generalizes, to two variables, a relation previously obtained by the author between the…

Combinatorics · Mathematics 2025-11-19 Vincent Brugidou

A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…

Combinatorics · Mathematics 2013-10-07 Matthias Beck

We define recursive harmonic numbers as a generalization of harmonic numbers. The table of recursive harmonic numbers, which is like Pascal's triangle, is constructed. A formula for recursive harmonic numbers containing binomial…

Combinatorics · Mathematics 2017-11-30 Aung Phone Maw , Aung Kyaw

In this paper, with the help of trinomial coefficients we study some arithmetic properties of certain determiants involving reciprocals of binary quadratic forms over finite fields.

Number Theory · Mathematics 2024-07-25 Yue-Feng She , Hai-Liang Wu

We give a short proof of polynomial recurrence with large intersection for additive actions of finite-dimensional vector spaces over countable fields on probability spaces, improving upon the known size and structure of the set of strong…

Dynamical Systems · Mathematics 2014-09-25 Vitaly Bergelson , Donald Robertson

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…

Number Theory · Mathematics 2021-06-08 Levent Kargın , Mehmet Cenkci