Sciweavers

DM
1999
81views more  DM 1999»
13 years 4 months ago
Basis partitions and Rogers-Ramanujan partitions
Every partition has, for some d, a Durfee square of side d. Every partition with Durfee square of side d gives rise to a "successive rank vector" r = (r1,
Michael D. Hirschhorn
DM
1999
56views more  DM 1999»
13 years 4 months ago
Niemeier lattices and Type II codes over Z4
Alexis Bonnecaze, Philippe Gaborit, Masaaki Harada...
DM
1999
68views more  DM 1999»
13 years 4 months ago
Analytic combinatorics of non-crossing configurations
Philippe Flajolet, Marc Noy
DM
1999
55views more  DM 1999»
13 years 4 months ago
Forbidden subsequences and Chebyshev polynomials
Timothy Chow, Julian West
DM
1999
62views more  DM 1999»
13 years 4 months ago
Directed animals, forests and permutations
In this paper, we illustrate a method to enumerate two-dimensional directed animals, with compact sources, on both the square and the triangular lattice. We give a recursive descr...
Elena Barcucci, Alberto Del Lungo, Elisa Pergola, ...
DM
1999
52views more  DM 1999»
13 years 4 months ago
A simple bijection for the regions of the Shi arrangement of hyperplanes
Christos A. Athanasiadis, Svante Linusson
DM
1999
90views more  DM 1999»
13 years 4 months ago
The density of ones in Pascal's rhombus
Pascal's rhombus is a variation of Pascal's triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the n...
John L. Goldwasser, William Klostermeyer, Michael ...
DM
1999
61views more  DM 1999»
13 years 4 months ago
On an equivalence in discrete extremal problems
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
Sergei L. Bezrukov
DM
1999
109views more  DM 1999»
13 years 4 months ago
Hamiltonian powers in threshold and arborescent comparability graphs
We examine powers of Hamiltonian paths and cycles as well as Hamiltonian (power) completion problems in several highly structured graph classes. For threshold graphs we give effic...
Sam Donnelly, Garth Isaak
DM
1999
63views more  DM 1999»
13 years 4 months ago
A class of functions and their application in constructing semi-biplanes and association schemes
We give an alternative proof of the fact that a planar function cannot exist on groups of even order. The argument involved leads us to define a class of functions which we
Robert S. Coulter, Marie Henderson