Search arXivSearch

arXiv · 2410.22245

Disjoint zero-sum subsets in Abelian groups and its application -- survey

Abstract

We provide a summary of research on disjoint zero-sum subsets in finite Abelian groups, which is a branch of additive group theory and combinatorial number theory. An orthomorphism of a group $Γ$ is defined as a bijection $φ$ $Γ$ such that the mapping $g \mapsto g^{-1}φ(g)$ is also bijective. In 1981, Friedlander, Gordon, and Tannenbaum conjectured that when $Γ$ is Abelian, for any $k \geq 2$ dividing $|Γ| -1$, there exists an orthomorphism of $Γ$ fixing the identity and permuting the remaining elements as products of disjoint $k$-cycles. Using the idea of disjoint-zero sum subset we provide a solution of this conjecture for $k=3$ and $|Γ|\cong 4\pmod{24}$. We also present some applications of zero-sum sets in graph labeling.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Sylwia Cichacz. 2024-10-29. Disjoint zero-sum subsets in Abelian groups and its application -- survey. https://arxiv.org/abs/2410.22245

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