492 search results - page 53 / 99 » combinatorics 2006 |
COMBINATORICS
2006
14 years 9 months ago
2006
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
COMBINATORICS
2006
14 years 9 months ago
2006
We determine the circular chromatic index of flower snarks, by showing that c(F3) = 7/2, c(F5) = 17/5 and c(Fk) = 10/3 for every odd integer k 7, where Fk denotes the flower snar...
COMBINATORICS
2006
14 years 9 months ago
2006
We show that the Grothendieck bialgebra of the semi-tower of partition lattice algebras is isomorphic to the graded dual of the bialgebra of symmetric functions in noncommutative ...
COMBINATORICS
2006
14 years 9 months ago
2006
We introduce a new statistic on linear and circular r-mino arrangements which leads to interesting polynomial generalizations of the r-Fibonacci and r-Lucas sequences. By studying...
COMBINATORICS
2006
14 years 9 months ago
2006
![Characterization of [1, k]-Bar Visibility Trees](https://www.sciweavers.org/files/imagecache/thumbnail/imagecache/characterization_of_1_k_bar_visibility_trees_COMBINATORICS_2006.jpg "Characterization of [1, k]-Bar Visibility Trees")
A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if th...