Results and questions on matchings in abelian groups and vector subspaces of fields
From MaRDI portal
Publication:2667904
Abstract: A matching from a finite subset of an abelian group to another subset is a bijection with the property that never lies in . A matching is called acyclic if it is uniquely determined by its multiplicity function. Motivated by a question of E. K. Wakeford on canonical forms for symmetric tensors, the study of matchings and acyclic matchings in abelian groups was initiated by C. K. Fan and J. Losonczy in [16, 26], and was later generalized to the context of vector subspaces in a field extension [13, 1]. We discuss the acyclic matching and weak acyclic matching properties and we provide results on the existence of acyclic matchings in finite cyclic groups. As for field extensions, we completely classify field extensions with the linear acyclic matching property. The analogy between matchings in abelian groups and in field extensions is highlighted throughout the paper and numerous open questions are presented for further inquiry.
Recommendations
Cites work
- scientific article; zbMATH DE number 3458807 (Why is no real title available?)
- scientific article; zbMATH DE number 3279238 (Why is no real title available?)
- scientific article; zbMATH DE number 3099436 (Why is no real title available?)
- Acyclic matchings
- An inequality for determinants with real entries
- Counting Certain Pairings in Arbitrary Groups
- Matching subspaces in a field extension.
- Matchings and canonical forms for symmetric tensors
- Matchings in arbitrary groups.
- Matrix factorizations of determinants and permanents
- On local matching property in groups and vector space
- On matchable subsets in abelian groups and their linear analogues
- On matching property for groups and field extensions
- On matchings in groups
- On the number of matchings in regular graphs
- On the representation of fields as finite unions of subfields
- Proof of the van der Waerden conjecture regarding the permanent of a doubly stochastic matrix
- Rectification principles in additive number theory
- Results and open problems in matchings in regular graphs
- Sidon sets in groups and induced subgraphs of Cayley graphs
- Statistical Mechanics of Dimers on a Plane Lattice
- The maximum number of perfect matchings in graphs with a given degree sequence
- The rectifiability threshold in abelian groups
- The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
- Upper bounds for permanents of $\left( {0,\,1} \right)$-matrices
- Über die Dichte der Primzahlen \(p\), für die eine vorgegebene ganzrationale Zahl \(a\neq 0\) von gerader bzw. ungerader Ordnung \(\mod p\) ist
Cited in
(9)- Matchings in arbitrary groups.
- Matchings in matroids over abelian groups
- On matching property for groups and field extensions
- Acyclicity for groups and vector spaces
- Conditions for matchability in groups and field extensions
- On matchable subsets in abelian groups and their linear analogues
- Matching subspaces in a field extension.
- On maximal and minimal linear matching property
- Bounds for matchings in nonabelian groups
This page was built for publication: Results and questions on matchings in abelian groups and vector subspaces of fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2667904)