Related papers: On the Index of Diffie-Hellman Mapping
Let $A$ be the ring of elements in an algebraic function field $K$ over a finite field $F_q$ which are integral outside a fixed place $\infty$. In an earlier paper we have shown that the Drinfeld modular group $G=GL_2(A)$ has automorphisms…
A circulant graph is a Cayley graph of a finite cyclic group. The Weisfeiler-Leman-dimension of a circulant graph $X$ with respect to the class of all circulant graphs is the smallest positive integer~$m$ such that the $m$-dimensional…
Let K be the field of fractions of a Henselian discrete valuation ring O_K. Let X_K/K be a smooth proper geometrically connected scheme admitting a regular model X/O_K. We show that the index \delta(X_K/K) of X_K/K can be explicitly…
For an epimorphism pi of the free group F_n onto a finite group G write Gamma(G,pi) for the group of all automorphisms f of F_n for which pi*f = pi. This is called the standard congruence subgroup of Aut(F_n) associated to G and pi. In the…
For a finite non cyclic group $G$, let $\gamma(G)$ be the smallest integer $k$ such that $G$ contains $k$ proper subgroups $H_1,\dots,H_k$ with the property that every element of $G$ is contained in $H_i^g$ for some $i \in \{1,\dots,k\}$…
Let $M$ be the circle or a compact interval, and let $\alpha=k+\tau\ge1$ be a real number such that $k=\lfloor \alpha\rfloor$. We write $\mathrm{Diff}_+^{\alpha}(M)$ for the group of $C^k$ diffeomorphisms of $M$ whose $k^{th}$ derivatives…
Let $G$ be an unicyclic graph of order $n$ and let $Q_G(x)= det(xI-Q(G))={matrix} \sum_{i=1}^n (-1)^i \varphi_i x^{n-i}{matrix}$ be the characteristic polynomial of the signless Laplacian matrix of a graph $G$. We give some transformations…
For a group $G,$ the generating graph of $G,$ denoted by $\Gamma(G).$ We define $Q_n=\langle x,y: x^{2n}=y^4=1, x^n=y^2,y^{-1}xy=x^{-1}\rangle,$ the dicyclic group of order $4n.$ This paper primarily delves into exploring the graph…
Let $\Gamma$ be a group acting on a set $X$. The distinguishing number for this action of $\Gamma$ on $X$, denoted by $D_{\Gamma}(X)$, is the smallest natural number $k$ such that the elements of $X$ can be labeled with $k$ labels so that…
We say that a $d$-regular graph is a $\gamma$-expander if for every not too large set of vertices $S$, there are at least $\gamma d |S|$ edges leaving $S$, and we say that a graph $G$ is $\gamma$-far from bipartite if at least $\gamma e(G)$…
We construct for $d\geq 2$ and $\epsilon>0$ a $d$-generated $p$-group $\Gamma$, which in an asymptotic sense behaves almost like a $d$-generated free pro-$p$-group. We show that a subgroup of index $p^n$ needs $(d-\epsilon)p^n$ generators,…
We prove that for every digraph $D$ and every choice of positive integers $k$, $\ell$ there exists a digraph $D^*$ with girth at least $\ell$ together with a surjective acyclic homomorphism $\psi\colon D^*\to D$ such that: (i) for every…
A distinguishing index of a (di)graph is the minimum number of colours in an edge (or arc) colouring such that the identity is the only automorphism that preserves that colouring. We investigate the minimum and maximum value of the…
Let $\Sigma$ denote a closed surface with constant mean curvature in $\mathbb{G}^3$, a 3-dimensional Lie group equipped with a bi-invariant metric. For such surfaces, there is a harmonic Gauss map which maps values to the unit sphere within…
In 1985, Mader conjectured the existence of a function $f$ such that every digraph with minimum out-degree at least $f(k)$ contains a subdivision of the transitive tournament of order $k$. This conjecture is still completely open, as the…
A dominating set in a graph $G$ is a subset of vertices $D$ such that every vertex in $V\setminus D$ is a neighbor of some vertex of $D$. The domination number of $G$ is the minimum size of a dominating set of $G$ and it is denoted by…
A vertex set $D$ of a graph $G$ is said to be a dominating set if every vertex of $V(G)\setminus D$ is adjacent to at least a vertex in $D$, and the domination number $\gamma(G)$ ($\gamma$, for short) is the minimum cardinality of all…
Let $\Gamma$ denote a distance-regular graph with diameter $D \ge 3$. Assume $\Gamma$ has classical parameters $(D,b,\alpha,\beta)$ with $b < -1$. Let $X$ denote the vertex set of $\Gamma$ and let $A \in MX$ denote the adjacency matrix of…
The $\gamma$-graph of a graph $G$ is the graph whose vertices are labelled by the minimum dominating sets of $G$, in which two vertices are adjacent when their corresponding minimum dominating sets (each of size $\gamma(G)$) intersect in a…
An invariant random subgroup of the countable group {\Gamma} is a random subgroup of {\Gamma} whose distribution is invariant under conjugation by all elements of {\Gamma}. We prove that for a nonamenable invariant random subgroup H, the…