scientific article; zbMATH DE number 3433888

MaRDI QIDQ4401459zbMATH OpenFDO

Authors Richard Scoville, Leonard Carlitz

Publication date 1974

Full work available at URL https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002188767, https://eudml.org/doc/151403

Mathematics Subject Classification ID

Factorials, binomial coefficients, combinatorial functions (05A10) Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cited in

(39)

• Generalized Eulerian numbers and the topology of the Hessenberg variety of a matrix
• The combinatorial interpretation of the Jacobi identity from Lie algebras
• Une généralisation trivariee symétrique des nombres euleriens
• A binary tree decomposition space of permutation statistics
• On a generalized Eulerian distribution
• Some properties of the generalized Eulerian distribution
• Enumeration of up-down permutations by upper records
• Enumeration of pairs of permutations
• Some permutation problems
• On the exact distributions of Eulerian and Simon Newcomb numbers associated with random permutations
• A context-free grammar for peaks and double descents of permutations
• Deformations of the braid arrangement and trees
• Permutations and sequences
• A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials
• Rearrangements of the symmetric group and enumerative properties of the tangent and secant numbers
• An asymptotic distribution theory for Eulerian recurrences with applications
• Joint distributions of permutation statistics and the parabolic cylinder functions
• Hopping from Chebyshev polynomials to permutation statistics
• Actions on permutations and unimodality of descent polynomials
• Addendum to: Enumeration of up-down sequences
• Triangular recurrences, generalized Eulerian numbers, and related number triangles
• A Formal Calculus for the Enumerative System of Sequences-I. Combinatorial Theorems
• A Formal Calculus for the Enumerative System of Sequences-II. Applications
• A Formal Calculus for the Enumerative System of Sequences-III. Further Developments
• Enumeration of permutations by descents, idescents, imajor index, and basic components
• Stirling permutation codes
• Commuting Eulerian operators
• The Euler adic dynamical system and path counts in the Euler graph
• The binomial-Stirling-Eulerian polynomials
• Counting and signed counting permutations by descent-based statistics
• A \(q\)-analog of the Stirling-Eulerian polynomials
• A \(q\)-analogue of generalized Eulerian polynomials with applications
• A bi-Stirling-Euler-Mahonian polynomial
• On a generalization of Morisita's model for estimating the habitat preference
• Multinomial random combinatorial structures and r-versions of Stirling, Eulerian and Lah numbers
• Bijections in weakly increasing trees via binary trees
• The (, )-Eulerian polynomials and descent-Stirling statistics on permutations
• On arithmetic and asymptotic properties of up-down numbers
• Generalized Stirling permutations and forests: higher-order Eulerian and Ward numbers

This page was built for publication:

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