145 search results - page 1 / 29 » The Maximum Distinguishing Number of a Group |
89
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
Let G be a group acting faithfully on a set X. The distinguishing number of the action of G on X, denoted DG(X), is the smallest number of colors such that there exists a coloring...
100
Voted
COMBINATORICS
2006
15 years 1 months ago
2006
Let G be a graph. A vertex labeling of G is distinguishing if the only label-preserving automorphism of G is the identity map. The distinguishing number of G, D(G), is the minimum...
101
Voted
APPROX
2004
Springer
15 years 7 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
DCC
2003
IEEE
16 years 1 months ago
2003
IEEE
We show that 40 is the maximum number of points of a cap in AG(4, 4). Up to semi-linear transformations there is only one such 40-cap. Its group of automorphisms is a semidirect p...
129
click to vote
ICML
2007
IEEE
16 years 2 months ago
2007
IEEE
We study the problem of simultaneously estimating several densities where the datasets are organized into overlapping groups, such as a hierarchy. For this problem, we propose a m...