Balls on the lawn.
Page 1
Displaying 1 – 16 of 16
Basic calculus of signed permutations. II: Finite analogues of Bessel functions. (Calcul basique des permutations signées. II: Analogues finis des fonctions de Bessel.)
Foata, Dominique, Han, Guo-Niu (1997)
The Electronic Journal of Combinatorics [electronic only]
Baxter permutations and plane bipolar orientations.
Bonichon, Nicolas, Bousquet-Mélou, Mireille, Fusy, Éric (2009)
Séminaire Lotharingien de Combinatoire [electronic only]
Baxter permutations. (Permutations de Baxter.)
Dulucq, S., Guibert, O. (1994)
Séminaire Lotharingien de Combinatoire [electronic only]
Bell and Stirling numbers for graphs.
Duncan, Bryce, Peele, Rhodes (2009)
Journal of Integer Sequences [electronic only]
Bell polynomials and degenerate stirling numbers
F. T. Howard (1979)
Rendiconti del Seminario Matematico della Università di Padova
Bicoloured Dyck paths and the contact polynomial for non-intersecting paths in a half-plane lattice.
Brak, R., Essam, J.W. (2003)
The Electronic Journal of Combinatorics [electronic only]
Bijections for hook pair identities.
Krattenthaler, C. (2000)
The Electronic Journal of Combinatorics [electronic only]
Bijective counting of tree-rooted maps and shuffles of parenthesis systems.
Bernardi, Olivier (2007)
The Electronic Journal of Combinatorics [electronic only]
Bijective proofs of identities from colored binary trees.
Yan, Sherry H.F. (2008)
The Electronic Journal of Combinatorics [electronic only]
Bijective recurrences concerning Schröder paths.
Sulanke, Robert A. (1998)
The Electronic Journal of Combinatorics [electronic only]
Binary -words without the subword 1010. . . 10.
Doroslovački, Rade, Marković, Olivera (1998)
Novi Sad Journal of Mathematics
Binary strings without zigzags.
Munarini, Emanuele, Salvi, Norma Zagaglia (2002)
Séminaire Lotharingien de Combinatoire [electronic only]
Binary words containing infinitely many overlaps.
Currie, James, Rampersad, Narad, Shallit, Jeffrey (2006)
The Electronic Journal of Combinatorics [electronic only]
Bounds on the number of integer valued monotone functions of k integer arguments
Azad Bolour (1975)
Acta Arithmetica
Broken Circuits in Matroids-Dohmen’s Inductive Proof
Wojciech Kordecki, Anna Łyczkowska-Hanćkowiak (2013)
Discussiones Mathematicae Graph Theory
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Currently displaying 1 – 16 of 16
Page 1