default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series A, Volume 31
Volume 31, Number 1, July 1981
- Vladimir Lifschitz, Boris G. Pittel:
The Number of Increasing Subsequences of the Random Permutation. 1-20 - Ronald L. Graham, Wen-Ching Winnie Li, Jerome L. Paul:
Homogeneous Collinear Sets in Partitions of Zn. 21-32 - Robert A. Sulanke:
A Generalized q-Multinomial Vandermonde Convolution. 33-42 - Xavier Gérard Viennot:
Équidistribution des permutations ayant une forme donnée selon les avances et coavances. 43-55 - Richard P. Stanley:
Two Combinatorial Applications of the Aleksandrov-Fenchel Inequalities. 56-65 - Noboru Ito, Jeffrey S. Leon:
Classification of 3-(24, 12, 5) Designs and 24-Dimensional Hadamard Matrices. 66-93 - K. J. Harrison, W. E. Longstaff:
Subalgebras of Incidence Algebras Determined by Equivalence Relations. 94-97 - Gábor Korchmáros
:
Example of a Chain of Circles on an Elliptic Quadric of PG(3, q), q=7, 11. 98-100
Volume 31, Number 2, September 1981
- John Konvalina:
On the Number of Combinations without Unit Separation. 101-107 - Yoshimi Egawa:
Characterization of H(n, q) by the Parameters. 108-125 - Michael Mörs:
A New Result on the Problem of Zarankiewicz. 126-130 - Keisuke Uchimura:
An Identity for the Divisor Generating Function Arising from Sorting Theory. 131-135 - Tony T. Lee:
Order-Preserving Representations of the Partitions on the Finite Set. 136-145 - D. C. Van Leijenhorst:
Orbits on the Projective Line. 146-154 - William G. Bridges, Marshall Hall Jr., John L. Hayden:
Codes and Designs. 155-174 - Don Rawlings:
The r-Major Index. 175-183 - K. J. Falconer:
The Realization of Distances in Measurable Subsets Covering Rn. 184-189 - Norman Lindquist, Gerard Sierksma:
Extensions of Set Partitions. 190-198 - Aviezri S. Fraenkel, David Lichtenstein:
Computing a Perfect Strategy for n x n Chess Requires Time Exponential in n. 199-214 - Jacob E. Goodman, Richard Pollack:
Three Points Do Not Determine a (Pseudo-) Plane. 215-218 - Ching-Shui Cheng:
A Family of Pseudo Youden Designs with Row Size Less than the Number of Symbols. 219-221
Volume 31, Number 3, November 1981
- Daniel I. A. Cohen:
PIE-Sums: A Combinatorial Tool for Partition Theory. 223-236 - Louis J. Billera, Carl W. Lee:
A Proof of the Sufficiency of McMullen's Conditions for f-Vectors of Simplicial Convex Polytopes. 237-255 - Richard P. Anstee:
Properties of (0, 1)-Matrices without Certain Configurations. 256-269 - Christiane Lefèvre-Percsy:
Classification d'une famille d'ensembles de classe (0, 1, n, q+1) de PG(d, q). 270-276 - Joachim H. Ahrens:
Paving the Chessboard. 277-288 - Adriano M. Garsia, Stephen C. Milne:
A Rogers-Ramanujan Bijection. 289-339
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.
last updated on 2026-07-12 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
