Related papers: Matchings in matroids over abelian groups, II
We formulate and prove matroid analogues of results concerning matchings in groups. A matching in an abelian group $(G,+)$ is a bijection $f:A\to B$ between two finite subsets $A,B$ of $G$ satisfying $a+f(a)\notin A$ for all $a\in A$. A…
A matching from a finite subset $A$ of an abelian group $G$ to another subset $B$ is a bijection $f : A \to B$ such that $af(a) \notin A$ for all $a \in A$. The study of matchings began in the 1990s and was motivated by a conjecture of E.…
This paper develops matroidal analogues of classical results on matchings in abelian groups. By embedding matroid ground sets in an abelian group, we introduce base matchings between matroid bases, recover the group-theoretic setting in the…
In this paper, we formulate and prove linear analogues of results concerning matchings in groups. A matching in a group G is a bijection f between two finite subsets A,B of G with the property, motivated by old questions on symmetric…
A matching from a finite subset $A$ of an abelian group to another subset $B$ is a bijection $f:A\rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely determined by its multiplicity…
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…
A matching in a group G is a bijection f from a subset A to a subset B in G such that af(a) does not belong to A for all a in A. The group G is said to have the matching property if, for any finite subsets A,B in G of same cardinality with…
The origins of the notion of matchings in groups spawn from a linear algebra problem proposed by E. K. Wakeford [24] which was tackled in 1996 [10]. In this paper, we first discuss unmatchable subsets in abelian groups. Then we formulate…
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…
A matching from a finite subset $A\subset\mathbb{Z}^n$ to another subset $B\subset\mathbb{Z}^n$ is a bijection $f : A \rightarrow B$ with the property that $a+f(a)$ never lies in $A$. A matching is called acyclic if it is uniquely…
Deltoids provide a natural framework for studying defective (partial) matchings in abelian groups, and we develop both structure and existence results in this setting. Given finite subsets $A$ and $B$ of an abelian group $G$, a matching is…
Consider a matroid $M$ whose ground set is equipped with a labeling to an abelian group. A basis of $M$ is called $F$-avoiding if the sum of the labels of its elements is not in a forbidden label set $F$. H\"orsch, Imolay, Mizutani, Oki,…
In this paper we prove a sufficient condition for the existence of matchings in arbitrary groups and its linear analogue, which lead to some generalizations of the existing results in the theory of matchings in groups and central extensions…
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group $G$, non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided.…
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…
In a finite abelian group $G$, define an additive matching to be a collection of triples $(x_i, y_i, z_i)$ such that $x_i + y_j + z_k = 0$ if and only if $i = j = k$. In the case that $G = \mathbb{F}_2^n$, Kleinberg, building on work of…
The property of balance (in the sense of Feder and Mihail) is investigated in the context of paving matroids. The following examples are exhibited: (a) a class of ``sparse'' paving matroids that are balanced, but at the same time rich…
In this paper, we define locally matchable subsets of a group which is derived from the concept of matchings in groups and used as a tool to give alternative proofs for existing results in matching theory. We also give the linear analogue…
With every matching in a graph we associate a group called the matching group. We study this group using the theory of non-positively curved cubed complexes. Our approach is formulated in terms of so-called gliding systems.
The theory of matroids or combinatorial geometries originated in linear algebra and graph theory, and has deep connections with many other areas, including field theory, matching theory, submodular optimization, Lie combinatorics, and total…