scientific article; zbMATH DE number 6985711

zbMATH Open1400.05030MaRDI QIDQ4556754FDOQ4556754

Authors: Arthur T. Benjamin, Joel Ornstein 

Publication date: 28 November 2018

Full work available at URL: https://www.fq.math.ca/Abstracts/55-5/benjamin.pdf

Title of this publication is not available (Why is that?)

Recommendations

• A simple bijective proof of a familiar derangement recurrence
• scientific article; zbMATH DE number 1990689
• scientific article; zbMATH DE number 1439427
• A Bijection in the Theory of Derangements
• A bijective proof of a Touchard-Riordan formula
• A bijective proof of a theorem of Knuth
• Bijective proofs of recurrences involving two Schröder triangles
• A bijective proof of Borchardt's identity
• A note on a recursion for the number of derangements
• scientific article; zbMATH DE number 838639

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19)

Cited In (21)

• Recounting the Odds of an Even Derangement
• Bijectively deranging!
• A bijective proof of the Shor recurrence
• Proof of a bi-symmetric septuple equidistribution on ascent sequences
• A Bijection in the Theory of Derangements
• A short combinatorial proof of derangement identity
• Bijective proofs of formulas with \((-1)^n\)
• A Simple Continuous Bijection from Natural Sequences to Dyadic Sequences
• Bijections for restricted inversion sequences and permutations with fixed points
• A classic proof of a recurrence for a very classical sequence
• Derangements and Bell Numbers
• A Bijective Proof of Stanley's Shuffling Theorem
• Title not available (Why is that?)
• A simple bijective proof of a familiar derangement recurrence
• A bijective proof of a Touchard-Riordan formula
• On generalized derangements and some orthogonal polynomials
• On the combinatorics of derangements and related permutations
• Title not available (Why is that?)
• On a closed form for derangement numbers: an elementary proof
• A note on a recursion for the number of derangements
• \(k\)-fixed-points-permutations

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 Q4556754)