COMBINATORICS
2006
13 years 7 months ago
2006
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
COMBINATORICS
2006
13 years 7 months ago
2006
In 2001, Shimozono and White gave a description of the domino Schensted algorithm of Barbasch, Vogan, Garfinkle and van Leeuwen with the "color-to-spin" property, that i...
COMBINATORICS
2006
13 years 7 months ago
2006
The set of cycle lengths of almost all permutations in Sn are "Poisson distributed": we show that this remains true even when we restrict the number of cycles in the per...
COMBINATORICS
2006
13 years 7 months ago
2006
COMBINATORICS
2006
13 years 7 months ago
2006
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T in the dual graph G such that T and T do not intersect. We show that it is not always poss...
COMBINATORICS
2006
13 years 7 months ago
2006
One way to choose a basis of a matroid at random is to choose an ordering of the ground set uniformly at random and then use the greedy algorithm to find a basis. We investigate t...
COMBINATORICS
2006
13 years 7 months ago
2006
We consider a family of meta-Fibonacci sequences which arise in studying the number of leaves at the largest level in certain infinite sequences of binary trees, restricted compos...
COMBINATORICS
2006
13 years 7 months ago
2006
COMBINATORICS
2006
13 years 7 months ago
2006
Sommerville [10] and Davies [2] classified the spherical triangles that can tile the sphere in an edge-to-edge fashion. Relaxing this condition yields other triangles, which tile ...
COMBINATORICS
2006
13 years 7 months ago
2006
We present an algorithm which decides the shift equivalence problem for Pfinite sequences. A sequence is called P-finite if it satisfies a homogeneous linear recurrence equation w...