Related papers: Matroids from gain graphs over quotient groups

Given a strict partial order $\Delta$ on a set $\Lambda$ and an arbitrary ring $R$ with $1\neq 0$, the corresponding McLain group $M(\Delta)$ has been studied in depth. We construct a larger family of McLain groups $G(\Delta)$, where…

In recent years enormous progress has been made in perturbative quantum field theory by applying methods of algebraic geometry to parametric Feynman integrals for scalar theories. The transition to gauge theories is complicated not only by…

In this paper we define a way to get a bounded invertible automaton starting from a finite graph. It turns out that the corresponding automaton group is regular weakly branch over its commutator subgroup, contains a free semigroup on two…

We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…

Consider a matroid equipped with a labeling of its ground set to an abelian group. We define the label of a subset of the ground set as the sum of the labels of its elements. We study a collection of problems on finding bases and common…

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…

Let $P$ be a finitely generated cancellative abelian monoid. A $P$-graph $\Lambda$ is a natural generalization of a higher rank graph. A pullback of $\Lambda$ is constructed by pulling it back over a given monoid morphism to $P$, while a…

We give an analog of Frobenius' theorem about the factorization of the group determinant on the group algebra of finite abelian groups and we extend it into dihedral groups and generalized quaternion groups. Furthermore, we describe the…

An $S_k$-set in a group $\Gamma$ is a set $A\subseteq\Gamma$ such that $\alpha_1\cdots\alpha_k=\beta_1\cdots\beta_k$ with $\alpha_i,\beta_i\in A$ implies $(\alpha_1,\ldots,\alpha_k)=(\beta_1,\ldots,\beta_k)$. An $S_k'$-set is a set such…

Consider a collection of points in the plane and the sets of slopes or directions of the lines between pairs of points. It is known that the algebraic matroid on the set of direction constraints between the points is equivalent to the…

In this paper we construct all strongly regular graphs, with at most 600 vertices, admitting a transitive action of the orthogonal group $O^+(6,2)$ or $O^-(6,2)$. Consequently, we prove the existence of strongly regular graphs with…

Let $\phi \colon \Gamma_2 \rightarrow \Gamma_1$ be a harmonic morphism of connected graphs. We show that an arithmetical structure on $\Gamma_1$ can be pulled back via $\phi$ to an arithmetical structure on $\Gamma_2$. We then show that…

Let $G$ be a finite group and, for a given complex character $\chi$ of $G$, let ${\mathbb{Q}}(\chi)$ denote the field extension of ${\mathbb{Q}}$ obtained by adjoining all the values $\chi(g)$, for $g\in G$. The group $G$ is called…

Let $G_\Gamma$ be a graph product over a finite simplicial graph $\Gamma$, and let $K_\Gamma$ denote the kernel of the canonical homomorphism from $G_\Gamma$ to the direct product of its vertex groups. It is known that, up to isomorphism,…

Homogeneous matroids are characterized by the property that strength equals fractional arboricity, and arise in the study of base modulus [22]. For graphic matroids, Cunningham [9] provided efficient algorithms for calculating graph…

Frame matroids and lifted-graphic matroids are two distinct minor-closed classes of matroids, each of which generalises the class of graphic matroids. The class of quasi-graphic matroids, recently introduced by Geelen, Gerards, and Whittle,…

Graph theoretical ideas are highly utilized by computer science fields especially data mining. In this field, a data structure can be designed in the form of tree. Covering is a widely used form of data representation in data mining and…

We introduce ring theoretic constructions that are similar to the construction of wreath product of groups. In particular, for a given graph $\Gamma=(V,E)$ and an associate algebra $A,$ we construct an algebra $B=A\, wr\, L(\Gamma)$ with…

Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance…

A graph $G(V,E)$ is $\Gamma$-harmonious when there is an injection $f$ from $V$ to an Abelian group $\Gamma$ such that the induced edge labels defined as $w(xy)=f(x)+f(y)$ form a bijection from $E$ to $\Gamma$. We study $\Gamma$-harmonious…