Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2606.12725

On partially matchable subspaces in a field extension

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

Abstract

We develop a theory of partial matchings between finite-dimensional subspaces $A,B$ in a field extension $K \subsetneq L$, providing structural, quantitative, and extremal results for their deficiency. Our main results include (1) a characterization of those pairs $(A,B)$ that are partially matchable up to a specified defect, (2) a decomposition theorem for pairs $(A,B)$ having positive deficiency, (3) an existence criterion for pairs having a prescribed dimension and satisfying a deficiency bound, and (4) a formula for the maximum attainable deficiency at each dimension, assuming $1 \notin B$ and the extension has a proper nontrivial intermediate field of finite $K$-dimension. We use these results to recover and extend various parts of this area of matching theory. Our approach blends algebraic techniques with tools from matroidal transversal theory, and utilizes a linearized version of the $e$-transform from additive number theory.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mohsen Aliabadi, Jozsef Losonczy. 2026-08-27. On partially matchable subspaces in a field extension. https://arxiv.org/abs/2606.12725

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↗