492 search results - page 90 / 99 » combinatorics 2006 |
100
Voted
COMBINATORICS
1998
14 years 9 months ago
1998
On donnera une formule pour l’op´erateur Hqt 2 avec la propri´et´e que Hqt 2 H(2a1b)[X; q, t] = H(2a+11b)[X; q, t] avec les fonctions sym´etriques Hµ[X; q, t] = λ Kλµ(q,...
COMBINATORICS
1999
14 years 9 months ago
1999
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
103
click to vote
COMBINATORICS
1998
14 years 9 months ago
1998
The aim of this paper is to give a coherent account of the problem of constructing cubic graphs with large girth. There is a well-defined integer µ0(g), the smallest number of v...
MLQ
2002
14 years 9 months ago
2002
A modal logic is called invariant if for all automorphisms of NExt K, () = . An invariant logic is therefore uniquely determined by its surrounding in the lattice. It will be est...
COMBINATORICS
2006
14 years 9 months ago
2006
We associate one or two posets (which we call "semistandard posets") to any given irreducible representation of a rank two semisimple Lie algebra over C. Elsewhere we ha...