Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2309.14664

Conditions for matchability in groups and field extensions II

Mohsen Aliabadi
View original source ↗Read source document ↗Export metadata ↓

Abstract

We present sufficient conditions for the existence of matchings in abelian groups and their linear counterparts. These conditions lead to extensions of existing results in matching theory. Additionally, we classify subsets within abelian groups that cannot be matched. We introduce the concept of Chowla subspaces and formulate and conjecture a linear analogue of a result originally attributed to Y. O. Hamidoune [20] concerning Chowla sets. If proven true, this result would extend matchings in primitive subspaces. Throughout the paper, we emphasize the analogy between matchings in abelian groups and field extensions. We also pose numerous open questions for future research. Our approach relies on classical theorems in group theory, additive number theory and linear algebra. As the title of the paper suggests, this work is the second sequel to a previous paper [5] with a similar theme. This paper is self-contained and can be read independently.

Explore related subjects

math.COmath.RA

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohsen Aliabadi. 2024-03-30. Conditions for matchability in groups and field extensions II. https://arxiv.org/abs/2309.14664

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↗