Related papers: Word maps have large image

Let H\subset\GL(V) be a connected complex reductive group where V is a finite-dimensional complex vector space. Let v\in V and let G=\{g\in\GL(V)\mid gHv = Hv\}. Following Ra\"is we say that the orbit Hv is \emph{characteristic for H} if…

The power graph $\mathcal{P}(G)$ is a graph with group elements as vertex set and two elements are adjacent if one is a power of the other. The order supergraph $\mathcal{S}(G)$ of the power graph $\mathcal{P}(G)$ is a graph with vertex set…

Given a faithful finite-dimensional representation $V$ of a finite group $G$ over any field $\mathbb{F}$, we show that any irreducible ${\mathbb{F}}G$-module $W$ appears, as a submodule or a quotient, in $\mathrm{Sym}^m(V)$ for some integer…

Let F : W --> V be a dominant rational map between quasi-projective varieties of the same dimension. We give two proofs that h_V(F(P)) >> h_W(P) for all points P in a nonempty Zariski open subset of W. For dominant rational maps F : P^n -->…

Counting dominating sets in a graph $G$ is closely related to the neighborhood complex of $G$. We exploit this relation to prove that the number of dominating sets $d(G)$ of a graph is determined by the number of complete bipartite…

The (proper) power graph of a group is a graph whose vertex set is the set of all (nontrivial) elements of the group and two distinct vertices are adjacent if one is a power of the other. Various kinds of planarity of (proper) power graphs…

Let S be a finite set of words over an alphabet Sigma. The set S is said to be complete if every word w over the alphabet Sigma is a factor of some element of S*, i.e. w belongs to Fact(S*). Otherwise if S is not complete, we are interested…

Let $F_k$ be the free group on $k$ generators, and let $H\le J\le \F_k$ be subgroups of finite rank. We present a new elementary algorithm to determine whether $H$ is a free factor of $J$. In particular, this algorithm can determine whether…

An element $g$ of a group is called reversible if it is conjugate in the group to its inverse. An element is an involution if it is equal to its inverse. This paper is about factoring elements as products of reversibles in the group…

A set $S\subseteq V$ is a dominating set of $G$ if every vertex in $V - S$ is adjacent to at least one vertex in $S$. The domination number $\gamma(G)$ of $G$ equals the minimum cardinality of a dominating set $S$ in $G$; we say that such a…

The power graph $\mathcal{P}(G)$ of a finite group $G$ is the graph whose vertex set is $G$, and two elements in $G$ are adjacent if one of them is a power of the other. The purpose of this paper is twofold. First, we find the complexity of…

Suppose that $\Gamma$ is a non-empty connected graph, $\mathfrak{G}$ is the fundamental group of a graph of groups over $\Gamma$, and $\mathcal{C}$ is a root class of groups (the last means that $\mathcal{C}$ contains non-trivial groups and…

A numerical semigroup is a sub-semigroup of the natural numbers that has a finite complement. Some of the key properties of a numerical semigroup are its Frobenius number F, genus g and type t. It is known that for any numerical semigroup…

Let $G$ be a finite group, $\pi(G)$ be the set of prime divisors dividing the order of $G$ and $\pi_e(G)$ (spectrum) denote the set of element orders of $G$. We define $w_o(G)$ = $|\pi(G)|$ the width of order of $G$ and $w_s(G)$ =…

There are various results in the literature which are part of the general philosophy that a finite group for which a certain parameter (for example, the number of conjugacy classes or the maximum number of elements inverted, squared or…

Suppose that G is a nontrivial torsion-free group and w is a word over the alphabet G\cup\{x_1^{\pm1},...,x_n^{\pm1}\}. It is proved that for n\ge2 the group \~G=<G,x_1,x_2,...,x_n | w=1> always contains a nonabelian free subgroup. For n=1…

We introduce the Hermitian-invariant group $\Gamma_f$ of a proper rational map $f$ between the unit ball in complex Euclidean space and a generalized ball in a space of typically higher dimension. We use properties of the groups to define…

In this work, we explore the following question: If two words in a finitely generated free group have identical images as word maps on every finite group, must they be endomorphic to each other? In this regard, we introduce weak profinite…

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Assume that $G$ is a finite group. For every $a, b \in\mathbb N,$ we define a graph $\Gamma_{a,b}(G)$ whose vertices correspond to the elements of $G^a\cup G^b$ and in which two tuples $(x_1,\dots,x_a)$ and $(y_1,\dots,y_b)$ are adjacent if…