Related papers: The Power Word Problem in Graph Products

The tensor product of two graphs, $G$ and $H$, has a vertex set $V(G)\times V(H)$ and an edge between $(u,v)$ and $(u',v')$ iff both $u u' \in E(G)$ and $v v' \in E(H)$. Let $A(G)$ denote the limit of the independence ratios of tensor…

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

The power graph $\mathcal{P}(G)$ of a group $G$ is the graph whose vertex set is $G$, having an edge between two distinct vertices if one is the power of the other. The directed power graph $\vec{\mathcal{P}}(G)$ of a group $G$ is the…

We generalize the notion of a graph automatic group introduced by Kharlampovich, Khoussainov and Miasnikov (arXiv:1107.3645) by replacing the regular languages in their definition with more powerful language classes. For a fixed language…

We consider the group isomorphism problem: given two finite groups G and H specified by their multiplication tables, decide if G cong H. For several decades, the n^(log_p n + O(1)) generator-enumeration bound (where p is the smallest prime…

This article studies the complexity of the word problem in groups of automorphisms of subshifts. We show in particular that for any Turing degree, there exists a subshift whose automorphism group contains a subgroup whose word problem has…

We prove that the topological full group $[[X]]$ of a two-sided full shift $X = \Sigma^{\mathbb{Z}}$ contains every right-angled Artin group (also called a graph group). More generally, we show that the family of subgroups with "linear…

This paper focuses on the study of the order of power series that are linear combinations of a given finite set of power series. The order of a formal power series, known as $\textrm{ord}(f)$, is defined as the minimum exponent of $x$ that…

Itzkowitz's problem asks whether every topological group $G$ has equal left and right uniform structures provided that bounded left uniformly continuous real-valued function on $G$ are right uniformly continuous. This paper provides a…

Deep neural networks have revolutionized many machine learning tasks in power systems, ranging from pattern recognition to signal processing. The data in these tasks is typically represented in Euclidean domains. Nevertheless, there is an…

We deal with first-order definability in the substructure ordering $(\mathcal{D}; \sqsubseteq)$ of finite directed graphs. In two papers, the author has already investigated the first-order language of the embeddability ordering $(…

Various classes of Graph Neural Networks (GNN) have been proposed and shown to be successful in a wide range of applications with graph structured data. In this paper, we propose a theoretical framework able to compare the expressive power…

In the paper we consider images of finite simple projective special linear and unitary groups under power words. In particular, we show that if $G\simeq \PSL_n^\varepsilon (q)$, then for every power words of type $x^M$ there exist constant…

William W. Boone and Graham Higman proved that a finitely generated group has soluble word problem if and only if it can be embedded in a simple group that can be embedded in a finitely presented group. We prove the exact analogue for…

It was shown by Lubotzky in 2014 that automorphism invariant subsets of finite simple groups which contain identity are always word images. In this article, we study word maps on finite nilpotent groups and show that for arbitrary finite…

We obtain new explicit pseudorandom generators for several computational models involving groups. Our main results are as follows: 1. We consider read-once group-products over a finite group $G$, i.e., tests of the form $\prod_{i=1}^n…

The conjugacy problem for a finitely generated group $G$ is the two-variable problem of deciding for an arbitrary pair $(u,v)$ of elements of $G$, whether or not $u$ is conjugate to $v$ in $G$. We construct examples of finitely generated,…

By now, we have a product theorem in every finite simple group $G$ of Lie type, with the strength of the bound depending only in the rank of $G$. Such theorems have numerous consequences: bounds on the diameters of Cayley graphs, spectral…

In this paper we study several closely related fundamental problems for words and matrices. First, we introduce the Identity Correspondence Problem (ICP): whether a finite set of pairs of words (over a group alphabet) can generate an…

For a finite group $G$ with a normal subgroup $H$, the normal subgroup based power graph of $G$, denoted by $\Gamma_H(G)$ whose vertex set $V(\Gamma_H(G))=(G\setminus H)\bigcup \{e\}$ and two vertices $a$ and $b$ are edge connected if…