Related papers: The Existence of Minimal Logarithmic Signatures fo…
Let $G$ be a finite simple group. By a theorem of Guralnick and Kantor, $G$ contains a conjugacy class $C$ such that for each non-identity element $x \in G$, there exists $y \in C$ with $G = \langle x,y\rangle$. Building on this deep…
This note presents a formalisation done in Coq of Lucas-Lehmer test and Pocklington certificate for prime numbers. They both are direct consequences of Fermat little theorem. Fermat little theorem is proved using elementary group theory and…
In this short note we prove that the finite non-abelian simple groups PSL(2,q), where q = 5,7, are determined by their posets of classes of isomorphic subgroups. In particular, this disproves the conjecture in the end of [5].
Liebeck, Nikolov, and Shalev conjectured that for every subset A of a finite simple group S with |A|>1, there exist O( log|S| / log|A| ) conjugates of A whose product is S. This paper is a companion to [Lifshitz: Completing the proof of the…
We give results on when a finitely generated group has only indiscrete embeddings in SL(2,C), with particular reference to 3-manifold groups. For instance if we glue two copies of the figure 8 knot along its torus boundary then the…
In this paper, we focus on Oliver's $p$-group conjecture. We use elementary method to prove that Oliver's $p$-group conjecture holds for Sylow $p$-subgroups of unitary groups.
This paper is devoted to establish nontrivial effective lower bounds for the least common multiple of consecutive terms of a sequence ${(u_n)}_{n \in \mathbb{N}}$ whose general term has the form $u_n = r {[n]}_q + u_0$, where $q , r$ are…
This article presents a method for enhancing the encryption algorithm in the MST3 cryptosystem for generalized Suzuki 2-groups. The conventional MST cryptosystem based on Suzuki groups utilizes logarithmic signatures (LS) restricted to the…
We prove that the class of log canonical rational singularities is closed under the basic operations of the minimal model program. We also give some supplementary results on the minimal model program for log canonical surfaces.
Partial spread is important in finite geometry and can be used to construct linear codes. From the results in (Designs, Codes and Cryptography 90:1-15, 2022) by Xia Li, Qin Yue and Deng Tang, we know that if the number of the elements in a…
The logarithmic Kazhdan-Lusztig correspondence is a conjectural equivalence between braided tensor categories of representations of small quantum groups and representations of certain vertex operator algebras. In this article we prove such…
We develop a theory of motives with compact support for logarithmic schemes over a field. Starting from the notion of finite logarithmic correspondences with compact support, we define the logarithmic motive with compact support analogous…
In this paper we give an elementary proof of the Zariski-Lipman conjecture for log canonical spaces.
A minimal code is a linear code where the only instance that a codeword has its support contained in the support of another codeword is when the codewords are scalar multiples of each other. Ashikhmin and Barg gave a sufficient condition…
We examine the open problem of finding the shortest string that contains each of the n! permutations of n symbols as contiguous substrings (i.e., the shortest superpermutation on n symbols). It has been conjectured that the shortest…
Let $G$ be a finite group, $N(G)$ be the set of conjugacy classes of the group $G$. In the present paper it is proved $G\simeq L$ if $N(G)=N(L)$, where $G$ is a finite group with trivial center and $L$ is a finite simple group of…
We study random walk on topological full groups of subshifts, and show the existence of infinite, finitely generated, simple groups with the Liouville property. Results by Matui and Juschenko-Monod have shown that the derived subgroups of…
Under the assumption of the minimal model theory for projective klt pairs of dimension $n$, we establish the minimal model theory for lc pairs $(X/Z,\Delta)$ such that the log canonical divisor is relatively log abundant and its restriction…
In this article we extend independent results of Lusztig and H\'ezard concerning the existence of irreducible characters of finite reductive groups, (defined in good characteristic and arising from simple algebraic groups), satisfying a…
Letting $L_{n}(N, u)$ denote a polylogarithm ladder of weight $n$ and index $N$ with $u$ as an algebraic number, there is a rich history surrounding how mathematical objects of this form can be constructed for a given weight or index. This…