Sciweavers

365 search results - page 8 / 73
» On the combinatorics of Galois numbers
Sort
View
ANTS
2004
Springer
93views Algorithms» more  ANTS 2004»
15 years 5 months ago
Nonic 3-adic Fields
We compute all nonic extensions of Q3 and find that there are 795 of them up to isomorphism. We describe how to compute the associated Galois group of such a field, and also the ...
John W. Jones, David P. Roberts
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
14 years 11 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
COMBINATORICS
2002
62views more  COMBINATORICS 2002»
14 years 11 months ago
New Lower Bounds for Heilbronn Numbers
The n-th Heilbronn number, Hn, is the largest value such that n points can be placed in the unit square in such a way that all possible triangles defined by any three of the point...
Francesc Comellas, J. Luis A. Yebra
COMBINATORICS
2002
76views more  COMBINATORICS 2002»
14 years 11 months ago
On the Number of Distributive Lattices
We investigate the numbers dk of all (isomorphism classes of) distributive lattices with k elements, or, equivalently, of (unlabeled) posets with k antichains. Closely related and...
Marcel Erné, Jobst Heitzig, Jürgen Rei...
COMBINATORICS
2000
71views more  COMBINATORICS 2000»
14 years 11 months ago
Diagonal Checker-jumping and Eulerian Numbers for Color-signed Permutations
Abstract. We introduce color-signed permutations to obtain a very explicit combinatorial interpretation of the q-Eulerian identities of Brenti and some generalizations. In particul...
Niklas Eriksen, Henrik Eriksson, Kimmo Eriksson