default search action
Journal of Combinatorial Theory, Series A, Volume 107
Volume 107, Number 1, July 2004
- Nantel Bergeron, Florent Hivert, Jean-Yves Thibon:
The peak algebra and the Hecke-Clifford algebras at q=0. 1-19 - Chihiro Suetake:
The nonexistence of projective planes of order 12 with a collineation group of order 16. 21-48 - Weidong Gao, Imre Z. Ruzsa, R. Thangadurai:
Olson's constant for the group Zp+Zp. 49-67 - Weidong Gao, R. Thangadurai:
A variant of Kemnitz Conjecture. 69-86 - Thomas Lam:
Growth diagrams, domino insertion and sign-imbalance. 87-115 - Edward A. Bender, Atefeh Mashatan, Daniel Panario, L. Bruce Richmond:
Asymptotics of combinatorial structures with large smallest component. 117-125 - Edwin R. van Dam, Edward Spence:
Combinatorial designs with two singular values--I: uniform multiplicative designs. 127-142 - Masaaki Harada, Masaaki Kitazume, Akihiro Munemasa:
On a 5-design related to an extremal doubly even self-dual code of length 72. 143-146 - Shmuel Onn, Rom Pinchasi:
A note on the minimum number of edge-directions of a convex polytope. 147-151 - Adam Marcus, Gábor Tardos:
Excluded permutation matrices and the Stanley-Wilf conjecture. 153-160
Volume 107, Number 2, August 2004
- Etienne Rassart:
A polynomiality property for Littlewood-Richardson coefficients. 161-179 - Peter Rowley, Louise Walker:
A 11, 707, 448, 673, 375 vertex graph related to the baby monster - I. 181-213 - Peter Rowley, Louise Walker:
A 11, 707, 448, 673, 375 vertex graph related to the baby monster - II. 215-261 - Peter Rowley, Louise Walker:
On point orbits of the Co2-minimal parabolic geometry. 263-293 - Béla Bollobás, Peter Keevash, Benny Sudakov:
Multicoloured extremal problems. 295-312 - Ae Ja Yee:
On partition functions of Andrews and Stanley. 313-321
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.