COMBINATORICS 2007 | Sciweavers

12

COMBINATORICS
2007

66views more COMBINATORICS 2007»

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

13 years 4 months ago

Download www.math.rutgers.edu

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

claim paper

Read More »

21

click to vote

COMBINATORICS
2007

88views more COMBINATORICS 2007»

Transversal and Cotransversal Matroids via their Representations

13 years 4 months ago

Download math.sfsu.edu

Federico Ardila

claim paper

Read More »

7

click to vote

COMBINATORICS
2007

50views more COMBINATORICS 2007»

Hereditary Properties of Tournaments

13 years 4 months ago

Download www.math.uiuc.edu

József Balogh, Béla Bollobás,...

claim paper

Read More »

9

click to vote

COMBINATORICS
2007

87views more COMBINATORICS 2007»

Bartholdi Zeta Functions for Hypergraphs

13 years 4 months ago

Download www.combinatorics.org

Recently, Storm [8] deﬁned the Ihara-Selberg zeta function of a hypergraph, and gave two determinant expressions of it. We deﬁne the Bartholdi zeta function of a hypergraph, a...

Iwao Sato

claim paper

Read More »

13

click to vote

COMBINATORICS
2007

137views more COMBINATORICS 2007»

Distance Domination and Distance Irredundance in Graphs

13 years 4 months ago

Download www.combinatorics.org

Adriana Hansberg, Dirk Meierling, Lutz Volkmann

claim paper

Read More »

8

click to vote

COMBINATORICS
2007

39views more COMBINATORICS 2007»

On Mixed Codes with Covering Radius 1 and Minimum Distance 2

13 years 4 months ago

Download www.univie.ac.at

Wolfgang Haas, Jörn Quistorff

claim paper

Read More »

14

click to vote

COMBINATORICS
2007

87views more COMBINATORICS 2007»

A Bijection on Dyck Paths and its Cycle Structure

13 years 4 months ago

Download www.combinatorics.org

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

claim paper

Read More »

8

click to vote

COMBINATORICS
2007

55views more COMBINATORICS 2007»

A Note on a Problem of Hilliker and Straus

13 years 4 months ago

Download www3.combinatorics.org

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 ﬁnd x which has a unique repr...

Miroslawa Janczak

claim paper

Read More »

13

click to vote

COMBINATORICS
2007

99views more COMBINATORICS 2007»

The Spectral Radius of Subgraphs of Regular Graphs

13 years 4 months ago

Download www3.combinatorics.org

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 ﬁnite di...

Vladimir Nikiforov

claim paper

Read More »

13

click to vote

COMBINATORICS
2007

86views more COMBINATORICS 2007»

Combinatorial Interpretations for Rank-Two Cluster Algebras of Affine Type

13 years 4 months ago