108 search results - page 11 / 22 » siamdm 2008 |
SIAMDM
2008
13 years 7 months ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
SIAMDM
2008
13 years 7 months ago
2008
Inspired by MacMahon's original proof of his celebrated theorem on the distribution of the major index over permutations, we give a reformulation of his argument in terms of l...
SIAMDM
2008
13 years 7 months ago
2008
We introduce and study adapted list coloring of graphs and hypergraphs. This is a generalization of ordinary list coloring and adapted coloring, and has more applications than thes...
SIAMDM
2008
13 years 7 months ago
2008
We consider the problem of assigning a numerical channel to each transmitter in a large regular array such that multiple levels of interference, which depend on the distance betwe...
SIAMDM
2008
13 years 7 months ago
2008
Based on a computer search, Anne Canteaut conjectured that the exponent 22r +2r + 1 in F26r and the exponent (2r + 1)2 in F24r yield bent monomial functions. These conjectures are ...