Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · math/0403006

Critical sets in the elementary abelian 2- and 3- groups

Richard Bean
View original source ↗Read source document ↗Export metadata ↓

Abstract

In 1998, Khodkar showed that the minimal critical set in the Latin square corresponding to the elementary abelian 2-group of order 16 is of size at most 124. Since the paper was published, improved methods for solving integer programming problems have been developed. Here we give an example of a critical set of size 121 in this Latin square, found through such methods. We also give a new upper bound on the size of critical sets of minimal size for the elementary abelian 2-group of order $2^n$: $4^{n}-3^{n}+4-2^{n}-2^{n-2}$. We speculate about possible lower bounds for this value, given some other results for the elementary abelian 2-groups of orders 32 and 64. An example of a critical set of size 29 in the Latin square corresponding to the elementary abelian 3-group of order 9 is given, and it is shown that any such critical set must be of size at least 24, improving the bound of 21 given by Donovan, Cooper, Nott and Seberry.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Richard Bean. 2004-02-28. Critical sets in the elementary abelian 2- and 3- groups. https://arxiv.org/abs/math/0403006

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗