A combinatorial interpretation of the connection constants for persistent sequences of polynomials

DOI10.1016/J.EJC.2004.04.015MaRDI QIDQ2567285zbMATH OpenOpenAlexFDO

Authors Ottavio M. D'Antona, Emanuele Munarini

Publication date 29 September 2005

Published in European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejc.2004.04.015

zbMATH Keywords

binary pathsbinomial coefficientsconnection constantsDe Morgan numbersGaussian coefficientsgeneralized De Morgan numbersLagrange sumlah numberspersistent sequences of polynomialspreferential arrangement numbersStirling numbersVandermonde sum

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Combinatorial aspects of partitions of integers (05A17) Combinatorial identities, bijective combinatorics (05A19) Polynomials in number theory (11C08)

Recommendations

• On the Connection Constants
• Recurrence relations and enumerative interpretations of some combinatorial numbers and polynomials
• Sequences of binomial type with persistent roots
• A Combinatorial Approach to Biorthogonal Polynomials
• scientific article; zbMATH DE number 7695

Cites work

• Catalan-like numbers and determinants
• scientific article; zbMATH DE number 1577990 (Why is no real title available?)
• scientific article; zbMATH DE number 3645097 (Why is no real title available?)
• scientific article; zbMATH DE number 6016068 (Why is no real title available?)
• scientific article; zbMATH DE number 3851501 (Why is no real title available?)
• scientific article; zbMATH DE number 3943829 (Why is no real title available?)
• scientific article; zbMATH DE number 45266 (Why is no real title available?)
• scientific article; zbMATH DE number 194092 (Why is no real title available?)
• scientific article; zbMATH DE number 3513784 (Why is no real title available?)
• scientific article; zbMATH DE number 3389047 (Why is no real title available?)
• Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Continuous case
• Minimal recurrence relations for connection coefficients between classical orthogonal polynomials: Discrete case
• On Some Alternative Characterizations of Riordan Arrays
• On the Connection Constants
• On the Geometry of Numbers in Elementary Number Theory
• On the principal recurrence of data structures organization and orthogonal polynomials
• Preferential Arrangements
• Recurrence relations for connection coefficients between two families of orthogonal polynomials
• Sequences of binomial type with persistent roots
• The On-Line Encyclopedia of Integer Sequences
• The Riordan group
• The umbral calculus
• Tiling Bricks with Bricks

Cited in

(9)

• On connection sequence for equivalent polynomial sets
• On the Connection Constants
• scientific article; zbMATH DE number 6861080 (Why is no real title available?)
• scientific article; zbMATH DE number 7596588 (Why is no real title available?)
• q-derangement identities
• Callan-like identities
• Integer composition, connection Appell constants and Bell polynomials
• Joining polynomial and exponential combinatorics for some entire maps
• Walks, partitions, and normal ordering

Describes a project that uses

Uses Software

• OEIS

This page was built for publication: A combinatorial interpretation of the connection constants for persistent sequences of polynomials

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2567285)