Related papers: Counting maps from a surface to a graph
We consider the function $f(g)$ that assigns to an orientable surface $M$ of genus $g$ the maximal number of free commuting independent involutions on $M$. We show that the surface of minimal genus $g$ with $f(g)=n$ is a real moment-angle…
We study a structure of the group of unitriangular automorphisms of a free associative algebra and a polynomial algebra and prove that this group is a semi direct product of abelian groups. Using this decomposition we describe a structure…
The prime graph of a finite group $G$ is the labelled graph $\Gamma(G)$ with vertices the prime divisors of $|G|$ and edges the pairs $\{p,q\}$ for which $G$ contains an element of order $pq$. A group $G$ is recognisable by its prime graph…
We prove that every group ring of a non-abelian locally free group which is the union of an ascending sequence of free groups is primitive. In particular, every group ring of a countable non-abelian locally free group is primitive. In…
Let G be a group and S a subset of G that generates G. For each x in G define the length l_S(x) of x relative to S to be the minimal k such that x is a product of k elements of S. The supremum of the values l_S(x), x \in G, is called the…
An element w in the free group on r letters defines a map f from G^r to G for each group G. In this note, we show that whenever w is non-trivial and G is a semisimple algebraic group, f is dominant. When G is a finite simple group, the…
We introduce a general class of combinatorial objects, which we call \emph{multi-complexes}, which simultaneously generalizes graphs, multigraphs, hypergraphs and simplicial and delta complexes. We introduce a natural algebra of…
A generating pair $x, y$ for a group $G$ is said to be \textbf{\textit{symmetric}} if there exists an automorphism $\varphi_{x,y}$ of $G$ inverting both $x$ and $y$, that is, $x^{\varphi_{x,y}}=x^{-1}$ and $y^{\varphi_{x,y}}=y^{-1}$.…
Let $X$ be a (projective, geometrically irreducible, nonsingular) algebraic curve of genus $g \ge 2$ defined over an algebraically closed field $K$ of odd characteristic $p$. Let $Aut(X)$ be the group of all automorphisms of $X$ which fix…
Let F_n = <x_1,...,x_n> denote the free group with generators {x_1,...,x_n}. Nielsen and Magnus described generators for the kernel of the canonical epimorphism from the automorphism group of F_n to the general linear group over the…
For given graph $H$, the independence number $\alpha(H)$ of $H$, is the size of the maximum independent set of $V(H)$. Finding the maximum independent set in a graph is a NP-hard problem. Another version of the independence number is…
A group, $\fl{H}$, of automorphisms of a totally disconnected locally compact group, $G$, is flat if there is a compact open $U\leq G$ such that the index $[\alpha(U):U\cap \alpha(U)]$ is mininimized for every $\alpha\in\fl{H}$. The…
Let $G$ be the semidirect product $\Gamma \rtimes F_2$ where $\Gamma$ is either the free group $F_n$, $n > 1$ or the fundamental group $S_g$ of a closed surface of genus $g > 1$. We prove that $G$ is incoherent, solving two problems posed…
The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…
The bondage number b(G) of a graph G is the smallest number of edges of G whose removal from G results in a graph having the domination number larger than that of G. We show that, for a graph G having the maximum vertex degree $\Delta(G)$…
Let $F_n$ be the free group on $n$ generators and $\Gamma_g$ the surface group of genus $g$. We consider two particular generating sets: the set of all primitive elements in $F_n$ and the set of all simple loops in $\Gamma_g$. We give a…
The independence polynomial $I(G;x)$ of a graph $G$ is $I(G;x)=\sum_{k=1}^{\alpha(G)} s_k x^k$, where $s_k$ is the number of independent sets in $G$ of size $k$. The decycling number of a graph $G$, denoted $\phi(G)$, is the minimum size of…
We study the problem of counting the number of homomorphisms from an input graph $G$ to a fixed (quantum) graph $\bar{H}$ in any finite field of prime order $\mathbb{Z}_p$. The subproblem with graph $H$ was introduced by Faben and Jerrum…
Let $\Gamma_g$ be the fundamental group of a closed orientable surface of genus $g\geqslant 2$. The outer automorphism group $\mathrm{Out}(\Gamma_g)$ naturally acts on the character variety $\mathcal{X}(\Gamma_g,G)$ for any Lie group $G$.…
Given a formation $\mathfrak F$, we consider the graph whose vertices are the elements of $G$ and where two vertices $g,h\in G$ are adjacent if and only if $\langle g,h \rangle \notin\mathfrak F$. We are interested in the two following…