492 search results - page 64 / 99 » combinatorics 2006 |
COMBINATORICS
2006
14 years 9 months ago
2006
In this paper we study inversions within restricted fillings of Young tableaux. These restricted fillings are of interest because they describe geometric properties of certain sub...
COMBINATORICS
2006
14 years 9 months ago
2006
In two dimensions, a polyform is a finite set of edge-connected cells on a square, triangular, or hexagonal grid. A layer is the set of grid cells that are vertex-adjacent to the ...
COMBINATORICS
2006
14 years 9 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
COMBINATORICS
2006
14 years 9 months ago
2006
An H-factor of a graph G is a spanning subgraph of G whose connected components are isomorphic to H. Given a properly edge-colored graph G, a rainbow H-subgraph of G is an H-subgr...
COMBINATORICS
2006
14 years 9 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...