232 search results - page 38 / 47 » jct 2006 |
JCT
2010
14 years 10 months ago
2010
We present a partial generalization to Schubert calculus on flag varieties of the classical Littlewood-Richardson rule, in its version based on Sch¨utzenberger’s jeu de taquin....
JCT
2007
14 years 11 months ago
2007
An induced subgraph is called homogeneous if it is either a clique or an independent set. Let hom(G) denote the size of the largest homogeneous subgraph of a graph G. In this shor...
115
click to vote
JCT
2006
14 years 12 months ago
2006
Abstract. We introduce "matroid parse trees" which, using only a limited amount of information at each node, can build up the vector representations of matroids of bounde...
103
click to vote
JCT
2006
14 years 12 months ago
2006
We show that a near resolvable 2-(2k + 1, k, k - 1) design exists if and only if a conference matrix of order 2k + 2 does. A known result on conference matrices then allows us to ...
JCT
2006
14 years 12 months ago
2006
In 2002, De Loera, Peterson and Su proved the following conjecture of Atanassov: let T be a triangulation of a d-dimensional polytope P with n vertices v1, v2, . . . , vn; label t...