Related papers: Matchings in matroids over abelian groups

For a countable abelian group $G$ we investigate generic properties of the space of all invariant metrics on $G$. We prove that for every such an unbounded group $G$, i.e. group which has elements of arbitrarily high order, there is a dense…

For any field $\mathbb{F}$ and all torison-free group $\mathbb{G}$, we prove that if $ab = 0$ for some non-zero $a, b \in \mathbb{F}[\mathbb{G}]$ such that $|supp(a)|$ $= 3$ and $a = 1 + \alpha_{1}g_{1} + \alpha_{2}g_{2}$, then $g_{1},…

Given a finite abelian group $G$ and elements $x, y \in G$, we prove that there exists $\phi \in \text{Aut}(G)$ such that $\phi(x) = y$ if and only if $G/\langle x \rangle \cong G/\langle y \rangle$. This result leads to our development of…

At present, practical application and theoretical discussion of rough sets are two hot problems in computer science. The core concepts of rough set theory are upper and lower approximation operators based on equivalence relations. Matroid,…

By definition, admissible matrix groups are those that give rise to a wavelet-type inversion formula. This paper investigates necessary and sufficient admissibility conditions for abelian matrix groups. We start out by deriving a block…

Let $G = (G,+)$ be a compact connected abelian group, and let $\mu_G$ denote its probability Haar measure. A theorem of Kneser (generalising previous results of Macbeath and Raikov) establishes the bound $$ \mu_G(A + B) \geq \min(…

Motivated by work in graph theory, we define the fixing number for a matroid. We give upper and lower bounds for fixing numbers for a general matroid in terms of the size and maximum orbit size (under the action of the matroid automorphism…

We prove a conjecture due to Baumgaertel and Lledo according to which for every compact group G one has Z(G)^ \cong C(G), where the `chain group' C(G) is the free abelian group (written multiplicatively) generated by the set G^ of…

An abelian lattice-ordered group, or abelian $\ell$-group, is an abelian group equipped with a compatible lattice ordering. In this paper, we introduce two multi-sorted extensions of abelian lattice-ordered groups inspired by the zero-set…

In this paper, we present a reciprocity on finite abelian groups involving zero-sum sequences. Let $G$ and $H$ be finite abelian groups with $(|G|,|H|)=1$. For any positive integer $m$, let $\mathsf M(G,m)$ denote the set of all zero-sum…

Let F_n be the free group of rank n and let Aut^+(F_n) be its special automorphism group. For an epimorphism pi : F_n -> G of the free group F_n onto a finite group G we call Gamma^+(G,pi) = {f in Aut^+(F_n) | pi*f = pi} the standard…

In 2012, Zilber used model-theoretic techniques to show that a curve of high genus over an algebraically closed field is determined by its Jacobian (viewed only as an abstract group with a distinguished subset for an image of the curve). In…

We consider two decision problems in infinite groups. The first problem is Subgroup Intersection: given two finitely generated subgroups $\langle \mathcal{G} \rangle, \langle \mathcal{H} \rangle$ of a group $G$, decide whether the…

The Greene-Magnanti theorem states that if $ M $ is a finite matroid, $ B_0 $ and $ B_1 $ are bases and $ B_0=\bigcup_{i=1}^{n} X_i $ is a partition, then there is a partition $ B_1=\bigcup_{i=1}^{n}Y_i $ such that $ (B_0 \setminus X_i)…

The power graph $P(G)$ of a finite group $G$ is the undirected simple graph with vertex set $G$, where two elements are adjacent if one is a power of the other. In this paper, the matching numbers of power graphs of finite groups are…

In this paper, we establish a one-to-one correspondence between the set of biclosed sets in an irreducible root system of type $A_n$ and the set of quasitrivial semigroup structures on a set with $n+1$ elements. Building on this…

Aharoni and Ziv conjectured that if $ M $ and $ N $ are finitary matroids on $ E $, then a certain ``Hall-like'' condition is sufficient to guarantee the existence of an $ M $-independent spanning set of $ N $. We show that their condition…

A matroid is a machine capturing linearity of mathematical objects and producing combinatorial structures. Matroid structure arises everywhere since linearity is a ubiquitous concept. One natural way to obtain matroids is by considering…

We classify up to isomorphism all gradings by an arbitrary group $G$ on the Lie algebras of zero-trace upper block-triangular matrices over an algebraically closed field of characteristic $0$. It turns out that the support of such a grading…

We explore novel connections between antimatroids and matchings in bipartite graphs. In particular, we prove that a combinatorial structure induced by stable matchings or maximum-weight matchings is an antimatroid. Moreover, we demonstrate…