Related papers: Codes Associated with Special Linear Groups and Po…

It is well known that the proportion of pairs of elements of $\operatorname{SL}(n,q)$ which generate the group tends to $1$ as $q^n\to \infty$. This was proved by Kantor and Lubotzky using the classification of finite simple groups. We give…

We consider the periods of the linear congruential and the power generators modulo $n$ and, for fixed choices of initial parameters, give lower bounds that hold for ``most'' $n$ when $n$ ranges over three different sets: the set of primes,…

This paper shows that a simple algorithm produces the {\em all-prefixes-LCSs-graph} in $O(mn)$ time for two input sequences of size $m$ and $n$. Given any prefix $p$ of the first input sequence and any prefix $q$ of the second input…

In the paper, we establish a new estimate for Kloosterman sum over primes with respect to an arbitrary modulus $q$. This estimate together with some recent results of the second author are applied to the problem of solvability of the…

We complete the classification of the finite special linear groups $\SL_n(q)$ which are $(2,3)$-generated, i.e., which are generated by an involution and an element of order $3$. This also gives the classification of the finite simple…

We prove upper bounds for sums of Kloosterman sums against general arithmetic weight functions. In particular, we obtain power cancellation in sums of Kloosterman sums over arithmetic progressions, which is of square-root strength in any…

We propose a superspace formulation for conformal $(p,q)$ supergravity in two dimensions as a gauge theory of the superconformal group $\mathsf{OSp}_0 (p|2; {\mathbb R} ) \times \mathsf{OSp}_0 (q|2; {\mathbb R} )$ with a flat connection.…

Linear codes with a few weights can be applied to secrete sharing, authentication codes, association schemes and strongly regular graphs. For an odd prime power $q$, we construct a class of three-weight $\F_q$-linear codes from quadratic…

The intricated combinatorial structure and the non-compactness of the Lorentz group have always made the computation of $SL(2,\mathbb{C})$ EPRL spin foam transition amplitudes a very hard and resource demanding task. With \texttt{sl2cfoam}…

We compute moments of $L$-functions associated to the polynomial family of Artin--Schreier covers over $\mathbb{F}_q$, where $q$ is a power of a prime $p>2$, when the size of the finite field is fixed and the genus of the family goes to…

We establish asymptotic formulae for general joint moments of characteristic polynomials and their higher-order derivatives associated with matrices drawn randomly from the groups $\mathrm{USp}(2N)$ and $\mathrm{SO}(2N)$ in the limit as…

Let $f(n)$ be a multiplicative function satisfying $|f(n)|\leq 1$, $q$ $(\leq N^2)$ be a positive integer and $a$ be an integer with $(a,\,q)=1$. In this paper, we shall prove that $$\sum_{\substack{n\leq N\\ (n,\,q)=1}}f(n)e({a\bar{n}\over…

Cohesive powers of computable structures can be viewed as effective ultraproducts over effectively indecomposable sets called cohesive sets. We investigate the isomorphism types of cohesive powers $\Pi _{C}% \mathcal{L}$ for familiar…

In this paper, the formulas of some exponential sums over finite field, related to the Coulter's polynomial, are settled based on the Coulter's theorems on Weil sums, which may have potential application in the construction of linear codes…

In 2011, W. Lang derived a novel, explicit formula for the sum of powers of integers $S_k(n) = 1^k + 2^k + \cdots + n^k$ involving simultaneously the Stirling numbers of the first and second kind. In this note, we first recall and then…

For integer $k \geq 1$, let $S_k(n)$ denote the sum of the $k$th powers of the first $n$ positive integers. In this paper, we derive a new formula expressing $2^{2k}$ times $S_{2k}(n)$ as a sum of $k$ terms involving the numbers in the…

Let $q$ be a nontrivial odd prime power, and let $n \ge 2$ be a natural number with $(n,q) \ne (2,3)$. We characterize the groups $PSL_n(q)$ and $PSU_n(q)$ by their $2$-fusion systems. This contributes to a programme of Aschbacher aiming at…

We obtain an asymptotic formula with a power-saving error term for counting the integer points $(a,b,c,d)$ in an expanding box $[-X,X]^4$ that satisfy the determinant equation $x_1x_2-x_3x_4=r$ for $r \neq 0$ with two of entries to be…

Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…

In this paper, we develop a new method for finding all perfect powers which can be expressed as the sum of two rational S-units, where S is a finite set of primes. Our approach is based upon the modularity of Galois representations and, for…