15254 search results - page 136 / 3051 » A k |
167
click to vote
FFA
2008
15 years 6 months ago
2008
Let k be a finite field with q elements. Let kn be the extension of k with degree n. Let Nn be the kernel of the norm map Nkn/k : k
114
click to vote
DM
2006
15 years 6 months ago
2006
By a very simple argument, we prove that if l, m, n {0, 1, 2, . . . } then l k=0 (-1)m-k l k m - k n 2k k - 2l + m = l k=0 l k 2k n n - l m + n - 3k - l . On the basis of this ide...
155
click to vote
EJC
2006
15 years 6 months ago
2006
An n-lift of a graph K, is a graph with vertex set V (K)
150
click to vote
ENDM
2007
15 years 6 months ago
2007
For a given positive integer k, sr(m, k) denotes the minimal positive integer such that every coloring of [n], n ≥ sr(m, k), that uses each color at most k times, yields a rainb...
161
click to vote
JGT
2007
15 years 6 months ago
2007
It is known that for every integer k ≥ 4, each k-map graph with n vertices has at most kn − 2k edges. Previously, it was open whether this bound is tight or not. We show that ...