Sciweavers

COMBINATORICS
2007
66views more  COMBINATORICS 2007»
13 years 11 months ago
The Number of [Old-Time] Basketball Games with Final Score n: n where the Home Team was Never Losing but also Never Ahead by Mor
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
Arvind Ayyer, Doron Zeilberger
COMBINATORICS
2007
50views more  COMBINATORICS 2007»
13 years 11 months ago
Hereditary Properties of Tournaments
József Balogh, Béla Bollobás,...
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 11 months ago
Bartholdi Zeta Functions for Hypergraphs
Recently, Storm [8] defined the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We define the Bartholdi zeta function of a hypergraph, a...
Iwao Sato
COMBINATORICS
2007
137views more  COMBINATORICS 2007»
13 years 11 months ago
Distance Domination and Distance Irredundance in Graphs
Adriana Hansberg, Dirk Meierling, Lutz Volkmann
COMBINATORICS
2007
39views more  COMBINATORICS 2007»
13 years 11 months ago
On Mixed Codes with Covering Radius 1 and Minimum Distance 2
Wolfgang Haas, Jörn Quistorff
COMBINATORICS
2007
87views more  COMBINATORICS 2007»
13 years 11 months ago
A Bijection on Dyck Paths and its Cycle Structure
The known bijections on Dyck paths are either involutions or have notoriously intractable cycle structure. Here we present a size-preserving bijection on Dyck paths whose cycle st...
David Callan
COMBINATORICS
2007
55views more  COMBINATORICS 2007»
13 years 11 months ago
A Note on a Problem of Hilliker and Straus
For a prime p and a vector ¯α = (α1, . . . , αk) ∈ Zk p let f (¯α, p) be the largest n such that in each set A ⊆ Zp of n elements one can find x which has a unique repr...
Miroslawa Janczak
COMBINATORICS
2007
99views more  COMBINATORICS 2007»
13 years 11 months ago
The Spectral Radius of Subgraphs of Regular Graphs
Let µ (G) and µmin (G) be the largest and smallest eigenvalues of the adjacency matrix of a graph G. Our main results are: (i) Let G be a regular graph of order n and finite di...
Vladimir Nikiforov