Search arXivSearch

arXiv · 1806.04279

A new structure for difference matrices over abelian $p$-groups

Abstract

A difference matrix over a group is a discrete structure that is intimately related to many other combinatorial designs, including mutually orthogonal Latin squares, orthogonal arrays, and transversal designs. Interest in constructing difference matrices over $2$-groups has been renewed by the recent discovery that these matrices can be used to construct large linking systems of difference sets, which in turn provide examples of systems of linked symmetric designs and association schemes. We survey the main constructive and nonexistence results for difference matrices, beginning with a classical construction based on the properties of a finite field. We then introduce the concept of a contracted difference matrix, which generates a much larger difference matrix. We show that several of the main constructive results for difference matrices over abelian $p$-groups can be substantially simplified and extended using contracted difference matrices. In particular, we obtain new linking systems of difference sets of size $7$ in infinite families of abelian $2$-groups, whereas previously the largest known size was $3$.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Koen van Greevenbroek, Jonathan Jedwab. 2018-11-29. A new structure for difference matrices over abelian $p$-groups. https://doi.org/10.1515/9783110642094-006

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

KEEP EXPLORING

Related papers

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

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