Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThe Electronic Journal of Combinatorics, Volume 3
Volume 3, Number 1, 1996
- Fan R. K. Chung, John L. Goldwasser:
Maximum subsets of (0, 1] with no solutions to x+y = kz. - Shalosh B. Ekhad, Doron Zeilberger:
The Number of Solutions of X^2=0 in Triangular Matrices Over GF(q). - Alan R. Camina, Susanne Mischke:
Line-transitive Automorphism Groups of Linear Spaces. - Mihai Caragiu:
On a Class of Constant Weight Codes. - Martin Löbbing, Ingo Wegener:
The Number of Knight's Tours Equals 33, 439, 123, 484, 294 - Counting with Binary Decision Diagrams. - Konrad Piwakowski:
Applying Tabu Search to Determine New Ramsey Graphs. - Lily Yen:
A Symmetric Functions Approach to Stockhausen's Problem. - Ed Barbeau, Steve Tanny:
On a Strange Recursion of Golomb. - Richard Ehrenborg
, Einar Steingrímsson:
Playing Nim on a Simplicial Complex. - Timothy Y. Chow:
A Short Proof of the Rook Reciprocity Theorem. - Bette Bultena, Frank Ruskey:
Transition Restricted Gray Codes. - Todd Simpson:
Three generalizations of Weyl's denominator formula. - Tewodros Amdeberhan:
Faster and Faster Convergent Series for zeta(3). - Uri N. Peled, Julin Wu:
or Which Graphs Does Every Edge Belong to Exactly Two Chordless Cycles? - James B. Shearer:
A New Construction for Cancellative Families of Sets. - Ronald L. Graham, Boris D. Lubachevsky:
Repeated Patterns of Dense Packings of Equal Disks in a Square. - Matthew B. Squire:
Gray Codes for A-Free Strings. - Michael O. Albertson, Karen L. Collins:
Symmetry Breaking in Graphs. - Axel Riese:
A Generalization of Gosper's Algorithm to Bibasic Hypergeometric Summation. - Asad Ali Ali, William Staton:
On Extremal Graphs With No Long Paths. - Art M. Duval:
Algebraic Shifting and Sequentially Cohen-Macaulay Simplicial Complexes. - Anders Björner, Francesco Brenti:
An Improved Tableau Criterion for Bruhat Order. - Jonathan M. Borwein, Roland Girgensohn:
Evaluation of Triple Euler Sums. - Dmitry Fon-Der-Flaass:
Local equivalence of transversals in matroids. - Girish S. Bhat, Carla D. Savage:
Balanced Gray Codes. - Ermelinda DeLaViña, Siemion Fajtlowicz:
Ramseyan Properties of Graphs. - Laurent Alonso, Raphaël Cerf:
The three dimensional polyominoes of minimal area. - Ifor Morris, Christopher D. Wensley:
Enumeration by Stabilizer Class of Patterns with Local Restrictions. - Helmut Prodinger:
Descendants in heap ordered trees or a triumph of computer algebra. - Geoffrey Exoo:
A Simple Method for Constructing Small Cubic Graphs of Girths 14, 15, and 16. - Lauren K. Williams:
Enumerating Up-Side Self-Avoiding Walks on Integer Lattices. - Jan B. M. Melissen, P. C. Schuur:
Improved Coverings of a Square with Six and Eight Equal Circles. - Irene Gassko:
Stapled Sequences and Stapling Coverings of Natural Numbers. - Edward A. Bender, L. Bruce Richmond:
Admissible Functions and Asymptotics for Labelled Structures by Number of Components.
- In Memoriam: Marcel-Paul Schützenberger, 1920-1996.
Volume 3, Number 2, 1996
Research Papers
- Daniel Barsky, Michel Carpentier:
Polynômes de Jacobi généralisés et intégrales de Selberg. - Jean-Pierre Jouanolou:
Résultant anisotrope, comple'ments et applications. - Guo-Niu Han:
Ordres bipartitionnaires et statistiques sur les mots. - David M. Bressoud:
The Borwein conjecture and partitions with prescribed hook differences. - Donald E. Knuth:
Overlapping Pfaffians. - Richard P. Stanley:
Flag-symmetric and locally rank-symmetric partially ordered sets. - Peter Kirschenhofer:
A note on alternating sums. - Ira M. Gessel:
Counting forests by descents and leaves. - Ira M. Gessel, Bruce E. Sagan:
The Tutte polynomial of a graph, depth-first search, and simplicial complex partitions. - Michael D. Hirschhorn, James A. Sellers:
Two congruences involving 4-cores. - Bernard Leclerc, Jean-Yves Thibon:
The Robinson-Schensted correspondence as the quantum straightening at q=0. - Gilbert Labelle, Pierre Leroux:
An extension of the exponential formula in enumerative combinatorics. - Doron Zeilberger:
Proof of the alternating sign matrix conjecture. - Christian Krattenthaler:
A bijective proof of the hook-content formula for super Schur functions and a modified jeu de taquin. - Marc van Leeuwen:
The Robinson-Schensted and Schützenberger algorithms, an elementary approach. - Shalosh B. Ekhad, J. E. Majewicz:
A short WZ-style proof of Abel's identity. - Dominique Dumont, Armand Ramamonjisoa:
Grammaire de Ramanujan et arbres de Cayley. - Anders Björner, Francesco Brenti:
Affine permutations of type A. - Marko Petkovsek, Herbert S. Wilf:
A high-tech proof of the Mills-Robbins-Rumsey determinant formula. - Alun O. Morris, A. A. Abdel-Aziz:
Schur Q-functions and spin characters of symmetric groups I. - George E. Andrews:
Pfaff's method (III): Comparison with the WZ method. - Arthur Randrianarivony, Jiang Zeng:
Some equidistributioned statistics on Genocchi permutations. - Laurent Habsieger:
Some new lower bounds for ternary covering codes. - Adriano M. Garsia, Mark D. Haiman:
Some natural bigraded S_n-modules. - Aimé Fuchs, Giorgio Letta:
Le problème du premier chiffre décimal pour les nombres premiers. - Phil Hanlon:
A random walk on the rook placements on a Ferrers board. - Alain Lascoux, Marcel Paul Schützenberger:
Treillis et bases des groupes de Coxeter.
a service of 
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 2024-04-22 20:03 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 and maintained by:
the dblp computer science bibliography is funded and supported by:
