Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2512.12942

Decomposition theorems for unmatchable pairs in groups and field extensions

Mohsen Aliabadi·Jozsef Losonczy
View original source ↗Read source document ↗Export metadata ↓

Abstract

A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of matroids. Earlier approaches have produced numerous criteria for matchability and unmatchability, but have offered little structural insight. In this paper, we develop parallel structure theorems which characterize unmatchable pairs in both abelian groups and field extensions. Our framework reveals analogous obstructions to matchability: nearly periodic decompositions of sets in the group setting correspond to decompositions of subspaces involving translates of a subfield in the linear setting. This perspective not only recovers previously known results, but also leads to new matching criteria and guarantees the existence of nontrivial unmatchable pairs.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohsen Aliabadi, Jozsef Losonczy. 2026-07-08. Decomposition theorems for unmatchable pairs in groups and field extensions. https://arxiv.org/abs/2512.12942

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↗