On matchable subsets in abelian groups and their linear analogues

From MaRDI portal
Publication:2332379

DOI10.1016/J.LAA.2019.08.007zbMATH Open1426.05174arXiv1808.01376OpenAlexW2968560504WikidataQ127405272 ScholiaQ127405272MaRDI QIDQ2332379FDOQ2332379


Authors: Mohsen Aliabadi, Mano Vikash Janardhanan Edit this on Wikidata


Publication date: 4 November 2019

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: In this paper, we introduce the notions of matching matrices in groups and vector spaces, which lead to some necessary conditions for existence of acyclic matching in abelian groups and its linear analogue. We also study the linear local matching property in field extensions to find a dimension criteria for linear locally matchable bases. Moreover, we define the weakly locally matchable subspaces and we investigate their relations with matchable subspaces. We provide an upper bound for the dimension of primitive subspaces in a separable field extension. We employ MATLAB coding to investigate the existence of acyclic matchings in finite cyclic groups. Finally, a possible research problem on matchings in n-groups is presented. Our tools in this paper mix combinatorics and linear algebra.


Full work available at URL: https://arxiv.org/abs/1808.01376




Recommendations




Cites Work


Cited In (8)





This page was built for publication: On matchable subsets in abelian groups and their linear analogues

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2332379)