default search action
Journal of Combinatorial Theory, Series A, Volume 53
Volume 53, Number 1, January 1990
- Peter McMullen, Egon Schulte:
Constructions for regular polytopes. 1-28 - Kathleen M. O'Hara:
Unimodality of gaussian coefficients: A constructive proof. 29-52 - Don Rawlings:
Multicolored simon newcomb problems. 53-67 - Stefan Heiss:
Two sporadic geometries related to the Hoffman-Singleton graph. 68-80 - Tom C. Brown, Paul Erdös, Allen R. Freedman:
Quasi-progressions and descending waves. 81-95 - Shaiy Pilpel:
Descending subsequences of random permutations. 96-116 - Yoshiaki Ueno:
Branching flags, branching nets, and reverse matchings. 117-127 - Shahar Mozes:
Reflection processes on graphs and weyl groups. 128-142 - Soichi Okada:
Partially strict shifted plane partitions. 143-156 - Ian P. Goulden, David M. Jackson:
A combinatorial construction for products of linear transformations over a finite field. 157-160 - L. Brian Lawrence:
Using partitions to characterize the minimum cardinality of an unbounded family in omegaomega. 161-164
Volume 53, Number 2, March 1990
- Philippe Flajolet, Michèle Soria:
Gaussian limiting distributions for the number of components in combinatorial structures. 165-182 - John H. Conway, Jeffrey C. Lagarias:
Tiling with polyominoes and combinatorial group theory. 183-208 - Sheila Sundaram:
The Cauchy identity for Sp(2n). 209-238 - Sheila Sundaram:
Orthogonal tableaux and an insertion algorithm for SO(2n + 1). 239-256 - Ira M. Gessel:
Symmetric functions and P-recursiveness. 257-285 - Joel H. Spencer:
Threshold functions for extension statements. 286-305 - Zoltán Füredi, Jerrold R. Griggs, Ron Holzman, Daniel J. Kleitman:
Representations of families of triples over GF(2). 306-315 - Eric L. Grinberg:
The admissibility theorem for the hyperplane transform over a finite field. 316-320 - Lajos Takács:
On Cayley's formula for counting forests. 321-323
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.