1215 search results - page 170 / 243 » Combinatorics |
SIAMCOMP
2000
14 years 11 months ago
2000
-fields are a very general class of difference fields that enable one to discover and prove multisum identities arising in combinatorics and special functions. In this article we f...
118
click to vote
COMBINATORICS
1998
14 years 11 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...
112
click to vote
COMBINATORICS
1998
14 years 11 months ago
1998
A bivariate symmetric backwards recursion is of the form d[m, n] = w0(d[m− 1, n]+d[m, n−1])+ω1(d[m−r1, n−s1]+d[m−s1, n−r1])+· · ·+ωk(d[m−rk, n−sk] +d[m−sk, ...
114
click to vote
COMBINATORICS
1998
14 years 11 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 11 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...