A 2-coloring of can have monochromatic Schur triples, but not less.
Page 1 Next
Displaying 1 – 20 of 341
-analogue of some binomial coefficient identities of Y. Sun.
Guo, Victor J.W., Yang, Dan-Mei (2011)
The Electronic Journal of Combinatorics [electronic only]
A bijection between 3-Motzkin paths and Schröder paths with no peak at odd.
Shapiro, Louis W., Wang, Carol J. (2009)
Journal of Integer Sequences [electronic only]
A bijection between atomic partitions and unsplitable partitions.
Chen, William Y.C., Li, Teresa X.S., Wang, David G.L. (2011)
The Electronic Journal of Combinatorics [electronic only]
A bijection between classes of fully packed loops and plane partitions.
Di Francesco, P., Zinn-Justin, P., Zuber, J.-B. (2004)
The Electronic Journal of Combinatorics [electronic only]
A bijection between planar constellations and some colored Lagrangian trees.
Chauve, Cedric (2003)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
A bijection on Dyck paths and its cycle structure.
Callan, David (2007)
The Electronic Journal of Combinatorics [electronic only]
A bijective proof of a major index theorem of Garsia and Gessel.
Novick, Mordechai (2010)
The Electronic Journal of Combinatorics [electronic only]
A bijective proof of Borchardt's identity.
Singer, Dan (2004)
The Electronic Journal of Combinatorics [electronic only]
A bijective proof of Garsia's -Lagrange inversion theorem.
Singer, Dan W. (1998)
The Electronic Journal of Combinatorics [electronic only]
A bijective proof of the hook-content formula for super Schur functions and a modified jeu de taquin.
Krattenthaler, C. (1996)
The Electronic Journal of Combinatorics [electronic only]
A binomial coefficient identity associated to a conjecture of Beukers.
Ahlgren, Scott, Ekhad, Shalosh B., Ono, Ken, Zeilberger, Doron (1998)
The Electronic Journal of Combinatorics [electronic only]
A binomial coefficient identity associated with Beukers' conjecture on Apéry numbers.
Chu, Wenchang (2004)
The Electronic Journal of Combinatorics [electronic only]
A binomial representation of the 3x + 1 problem
Maurice Margenstern, Yuri Matiyasevich (1999)
Acta Arithmetica
A card shuffling analysis of deformations of the Plancherel measure of the symmetric group.
Fulman, Jason (2004)
The Electronic Journal of Combinatorics [electronic only]
A CAT algorithm for the exhaustive generation of ice piles
Paolo Massazza, Roberto Radicioni (2010)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
We present a CAT (constant amortized time) algorithm for generating those partitions of n that are in the ice pile model(n), a generalization of the sand pile model(n). More precisely, for any fixed integer k, we show that the negative lexicographic ordering naturally identifies a tree structure on the lattice (n): this lets us design an algorithm which generates all the ice piles of (n) in amortized time O(1) and in space O().
A CAT algorithm for the exhaustive generation of ice piles
Paolo Massazza, Roberto Radicioni (2011)
RAIRO - Theoretical Informatics and Applications
We present a CAT (constant amortized time) algorithm for generating those partitions of n that are in the ice pile model(n), a generalization of the sand pile model(n). More precisely, for any fixed integer k, we show that the negative lexicographic ordering naturally identifies a tree structure on the lattice (n): this lets us design an algorithm which generates all the ice piles of (n) in amortized time O(1) and in space O().
A Catalan transform and related transformations on integer sequences.
Barry, Paul (2005)
Journal of Integer Sequences [electronic only]
A census of vertices by generations in regular tessellations of the plane.
Paul, Alice, Pippenger, Nicholas (2011)
The Electronic Journal of Combinatorics [electronic only]
A chaotic cousin of Conway's recursive sequence.
Pinn, Klaus (2000)
Experimental Mathematics
Currently displaying 1 – 20 of 341
Page 1 Next