Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=J. Comb.~Theory Series A AND YEAR=1981
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The number of increasing subsequences of the random permutation
V. Lifschitz
,
B. Pittel
Journal of Combinatorial Theory Series A
31
, 1981, pp. 1-20
Homogeneous collinear sets in partitions of
Z^n
R.L. Graham
,
Weng-Ching Winnie Li
,
J.L. Paul
Journal of Combinatorial Theory Series A
31
, 1981, pp. 21-32
A generalized
q
-multinomial Vandermonde convolution
Robert A. Sulanke
Journal of Combinatorial Theory Series A
31
, 1981, pp. 33-42
Equidistribution des permutations ayant une forme donnée selon les avances et coavances
Gérard Viennot
Journal of Combinatorial Theory Series A
31
, 1981, pp. 43-55
Two combinatorial applications of the Aleksandrov-Fenchel inequalities
Richard P. Stanley
Journal of Combinatorial Theory Series A
31
, 1981, pp. 56-65
Classification of
3-(24,12,5)
designs and
24
-dimensional Hadamard matrices
Noburo Ito
,
Jeffrey S. Leon
,
Judith Q. Longyear
Journal of Combinatorial Theory Series A
31
, 1981, pp. 66-93
Subalgebras of incidence algebras determined by equivalence relations
K.J. Harrison
,
W.E. Longstaff
Journal of Combinatorial Theory Series A
31
, 1981, pp. 94-97
Example of a chain of circles on an elleptic quadric of
PG(3,q)
,
q = 7,11
G. Korchmáros
Journal of Combinatorial Theory Series A
31
, 1981, pp. 98-100
On the number of combinations without unit separation
John Konvalina
Journal of Combinatorial Theory Series A
31
, 1981, pp. 101-107
Characterization of
H(n,q)
by the parameters
Yoshimi Egawa
Journal of Combinatorial Theory Series A
31
, 1981, pp. 108-125
A new result on the problem of Zarankiewicz
Michael Mörs
Journal of Combinatorial Theory Series A
31
, 1981, pp. 126-130
An identify for the divisor generating function arising from sorting theory
Keisuke Uchimura
Journal of Combinatorial Theory Series A
31
, 1981, pp. 131-135
Order-preserving representations of the partitions on the finite set
Tony T. Lee
Journal of Combinatorial Theory Series A
31
, 1981, pp. 136-145
Orbits on the projective line
D.C. van Leijenhorst
Journal of Combinatorial Theory Series A
31
, 1981, pp. 146-154
Codes and designs
William G. Bridges
,
Marshall, Jr. Hall
,
John L. Hayden
Journal of Combinatorial Theory Series A
31
, 1981, pp. 155-174
The
r
-major index
Don Rawlings
Journal of Combinatorial Theory Series A
31
, 1981, pp. 175-183
The realization of distances in measurable subsets covering
R^n
K.J. Falconer
Journal of Combinatorial Theory Series A
31
, 1981, pp. 184-189
Extensions of set partitions
Norman Lindquist
,
Gerard Sierksma
Journal of Combinatorial Theory Series A
31
, 1981, pp. 190-198
Computing a perfect strategy for
n\times n
chess requires time exponential in
n
Aviezri S. Fraenkel
,
David Lichtenstein
Journal of Combinatorial Theory Series A
31
, 1981, pp. 199-214
Three points do not determine a (pseudo-)plane
Jacob E. Goodman
,
Richard Pollack
Journal of Combinatorial Theory Series A
31
, 1981, pp. 215-218
A family of pseudo Youden designs with row size less than the number of symbols
Ching-Shui Cheng
Journal of Combinatorial Theory Series A
31
, 1981, pp. 219-221
PIE-sums: A combinatorial tool for partition theory
Daniel I.A. Cohen
Journal of Combinatorial Theory Series A
31
, 1981, pp. 223-236
A proof of the sufficiency of McMullen's conditions for
f
-vectors of simplicial convex polytopes
Louis J. Billera
,
Carl W. Lee
Journal of Combinatorial Theory Series A
31
, 1981, pp. 237-255
Properties of
(0,1)
-matrices without certain configurations
R.P. Anstee
Journal of Combinatorial Theory Series A
31
, 1981, pp. 256-269
Classification d'une famille d'ensembles de classe
Christiane Lefevre-Percsy
Journal of Combinatorial Theory Series A
31
, 1981, pp. 270-276
Seiten 1
2
3
>