Table of Contents
Research Papers
| New symmetric designs from regular Hadamard matrices | |
| Yury J. Ionin | R1 |
| Lattice walks in $Z^d$ and permutations with no long ascending subsequences | |
| Ira Gessel, Jonathan Weinstein, Herbert S. Wilf | R2 |
| A construction for sets of integers with distinct subset sums | |
| Tom Bohman | R3 |
| An improved bound on the minimal number of edges in color-critical graphs | |
| Michael Krivelevich | R4 |
| Periodic Sorting Using Minimum Delay, Recursively Constructed Merging Networks | |
| Edward A. Bender, S. Gill Williamson | R5 |
| Permutations which are the union of an increasing and a decreasing subsequence | PDF COMMENT |
| M. D. Atkinson | R6 |
| All Ramsey numbers $r(K_{3},G)$ for connected graphs of order 9 | |
| Stephan Brandt, Gunnar Brinkmann, Thomas Harmuth | R7 |
| Multimatroids II. Orthogonality, minors and connectivity | |
| André Bouchet | R8 |
| A Note on Constructing Large Cayley Graphs of Given Degree and Diameter by Voltage Assignments | |
| Ljiljana Branković, Mirka Miller, Ján Plesník, Joe Ryan, Jozef Širáň | R9 |
| A Binomial Coefficient Identity Associated to a Conjecture of Beukers | |
| Scott Ahlgren, Shalosh B. Ekhad, Ken Ono, Doron Zeilberger | R10 |
| Maximising the Permanent of (0,1)-Matrices and the Number of Extensions of Latin Rectangles | |
| B. D. McKay, I. M. Wanless | R11 |
| Increasing Subsequences and the Classical Groups | |
| E. M. Rains | R12 |
| Perfect Matchings in $\epsilon$-regular Graphs | |
| Noga Alon, Vojtech Rödl, Andrzej Ruciński | R13 |
| Lattice Tilings by Cubes: Whole, Notched and Extended | |
| Mihail Kolountzakis | R14 |
| Asymptotics of the Number of $k$-words With An $\ell$-descent | |
| Amitai Regev | R15 |
| Minimal Cycle Bases of Outerplanar Graphs | |
| Josef Leydold, Peter F. Stadler | R16 |
| Finite Vector Spaces and Certain Lattices | |
| Thomas W. Cusick | R17 |
| Affine Weyl Groups as Infinite Permutations | |
| Henrik Eriksson, Kimmo Eriksson | R18 |
| A 2-Coloring of $[1,N]$ can have $(1/22)N^2+O(N)$ Monochromatic Schur Triples, but not less! | |
| Aaron Robertson, Doron Zeilberger | R19 |
| On the Number of Descendants and Ascendants in Random Search Trees | PDF APPENDIX |
| Conrado Martínez, Alois Panholzer, Helmut Prodinger | R20 |
| Multi-Statistic Enumeration of Two-Stack Sortable Permutations | |
| Mireille Bousquet-Mélou | R21 |
| On Kissing Numbers in Dimensions 32 to 128 | |
| Yves Edel, E. M. Rains, N. J. A. Sloane | R22 |
| A Note on the Asymptotics and Computational Complexity of Graph Distinguishability | |
| Alexander Russell, Ravi Sundaram | R23 |
| Short Score Certificates for Upset Tournaments | |
| Jeffrey L. Poet, Bryan L. Shader | R24 |
| Recognizing Circulant Graphs of Prime Order in Polynomial Time | |
| Mikhail E. Muzychuk, Gottfried Tinhofer | R25 |
| A Bijective Proof of Garsia's $q$-Lagrange Inversion Theorem | |
| Dan W. Singer | R26 |
| Extremal Infinite Overlap-Free Binary Words | |
| Jean-Paul Allouche, James Currie, Jeffrey Shallit | R27 |
| Proof of the Alon-Tarsi Conjecture for $n=2^rp$ | |
| Arthur A. Drisko | R28 |
| Some New Ramsey Colorings | |
| Geoffrey Exoo | R29 |
| Lattice Paths Between Diagonal Boundaries | |
| Heinrich Niederhausen | R30 |
| The Permutation Classes Equinumerous to the Smooth Class | |
| Miklós Bóna | R31 |
| Durfee Polynomials | |
| E. Rodney Canfield, Sylvie Corteel, Carla D. Savage | R32 |
| A Multivariate Lagrange Inversion Formula for Asymptotic Calculations | |
| Edward A. Bender, L. Bruce Richmond | R33 |
| Crooked Functions, Bent Functions, and Distance Regular Graphs | |
| T. D. Bending, D. Fon-Der-Flaass | R34 |
| On Minimal Words With Given Subword Complexity | |
| Ming-wei Wang, Jeffrey Shallit | R35 |
| Inclusion-Exclusion and Network Reliability | |
| Klaus Dohmen | R36 |
| Codes and Projective Multisets | |
| Stefan Dodunekov, Juriaan Simonis | R37 |
| Combinatorial Aspects of Multiple Zeta Values | |
| Jonathan M. Borwein, David M. Bradley, David J. Broadhurst, Petr Lisoněk | R38 |
| New Bounds for Union-free Families of Sets | |
| Don Coppersmith, James B. Shearer | R39 |
| Counting Simplexes in $R^3$ | |
| Claude Laflamme, István Szalkai | R40 |
| The Average Order of a Permutation | |
| Richard Stong | R41 |
| On Noncrossing and Nonnesting Partitions for Classical Reflection Groups | |
| Christos A. Athanasiadis | R42 |
| Another Infinite Sequence of Dense Triangle-Free Graphs | |
| Stephan Brandt, Tomaž Pisanski | R43 |
| Venn Diagrams with Few Vertices | |
| Bette Bultena, Frank Ruskey | R44 |
| A Macdonald Vertex Operator and Standard Tableaux Statistics | |
| Mike Zabrocki | R45 |
| An Exploration of the Permanent-Determinant Method | |
| Greg Kuperberg | R46 |
| Bijective Recurrences concerning Schröder Paths | |
| Robert A. Sulanke | R47 |
Articles
| Constructions for Cubic Graphs with Large Girth | |
| Norman Biggs | A1 |
ISSN: 1077-8926