Related papers: On codes in the projective linear group $PGL(2,q)$
The power graph $\Gamma_G$ of a finite group $G$ is the graph with the vertex set $G$, where two distinct elements are adjacent if one is a power of the other. An $L(2, 1)$-labeling of a graph $\Gamma$ is an assignment of labels from…
For integer $k\geq2$ and prime power $q$, the algebraic bipartite graph $D(k,q)$ proposed by Lazebnik and Ustimenko (1995) is meaningful not only in extremal graph theory but also in coding theory and cryptography. This graph is…
If $G$ is a finite group and $k =q>2$ or $k=q+1$ for a prime power $q$ then, for infinitely many integers $v$, there is a $2$-$(v,k,1)$-design ${\bf D}$ for which ${\rm Aut} {\bf D}\cong G$.
We give a conjectural presentation of the infinitely generated group PGL(2,Q) with an infinite list of relators.
We consider $q$-ary (linear and nonlinear) block codes with exactly two distances: $d$ and $d+\delta$. Several combinatorial constructions of optimal such codes are given. In the linear (but not necessary projective) case, we prove that…
A 2-covering for a finite group $G$ is a set of proper subgroups of $G$ such that every pair of elements of $G$ is contained in at least one subgroup in the set. The minimal number of subgroups needed to 2-cover a group $G$ is called the…
Let $m$ be a positive integer such that $p$ does not divide $m$ where $p$ is prime. In this paper we find the number of conjugacy classes of completely reducible cyclic subgroups in GL$(2, q)$ of order $m$, where $q$ is a power of $p$.
The spectrum $\omega(G)$ of a finite group $G$ is the set of element orders of $G$. If $\Omega$ is a non-empty subset of the set of natural numbers, $h(\Omega)$ stands for the number of isomorphism classes of finite groups $G$ with…
We compute the characters of real irreducible representations of SL(2,q), the special linear group on q letters, for an odd prime $q$. Moreover, we give the dimensions of these irreducible representations under the actions of cyclic…
In this paper we consider two pointsets in $\mathrm{PG}(2,q^n)$ arising from a linear set $L$ of rank $n$ contained in a line of $\mathrm{PG}(2,q^n)$: the first one is a linear blocking set of R\'edei type, the second one extends the…
In this paper we consider the restriction of a unitary irreducible representation of type $A_{\mathfrak q}(\lambda)$ of $GL(4,{\mathbb R})$ to reductive subgroups $H$ which are the fixpoint sets of an involution. We obtain a formula for the…
Let Cl1(1,3) and Cl2(1,3) be the subsets of elements of the Clifford algebra Cl(1,3) of ranks 1 and 2 respectively. Recently it was proved that the subset Cl2(p,q)+iCl1(p,q) of the complex Clifford algebra can be considered as a Lie…
For $q = p^n$ with $p$ an odd prime, the projective linear group $PGL(2,q)$ can be seen as the stabilizer of a conic $O$ in a projective plane $\pi = PG(2,q)$. In that setting, involutions of $PGL(2,q)$ correspond bijectively to points of…
We outline a proof of the categorical geometric Langlands conjecture for GL(2), as formulated in reference [AG], modulo a number of more tractable statements that we call Quasi-Theorems.
This paper studies {\em strong blocking sets} in the $N$-dimensional finite projective space $\mathrm{PG}(N,q)$. We first show that certain unions of blocking sets cannot form strong blocking sets, which leads to a new lower bound on the…
We show that with high probability the random graph $G_{n, 1/2}$ has an induced subgraph of linear size, all of whose degrees are congruent to $r\pmod q$ for any fixed $r$ and $q\geq 2$. More generally, the same is true for any fixed…
Let $V:=(\mathbb{F}_q)^d$ be a $d$-dimensional vector space over the field $\mathbb{F}_q$ of order $q$. Fix positive integers $e_1,e_2$ satisfying $e_1+e_2=d$. Motivated by analysing a fundamental algorithm in computational group theory for…
We describe the classification of ranked definably quasi-Frobenius groups of odd type : dihedral configurations are isomorphic to PGL(2, K) for K an algebraically closed field of characteristic other than two; Frobenius groups are spilt and…
Given a finite group $G$, let $\pi(G)$ denote the set of all primes that divide the order of $G$. For a prime $r \in \pi(G)$, we define $r$-singular elements as those elements of $G$ whose order is divisible by $r$. Denote by $S_r(G)$ the…
Let $D$ be a digraph and let $\lambda(D)$ denote the number of vertices in a longest path of $D$. For a pair of vertex-disjoint induced subdigraphs $A$ and $B$ of $D$, we say that $(A,B)$ is a partition of $D$ if $V(A)\cup V(B)=V(D).$ The…