Cyclotomic numbers and primitive idempotents in the ring GF(q)[x]/(x−1)

Let q be an odd prime power and p be an odd prime with gcd(p,q)=1. Let order of q modulo p be f, and q^f=1+pλ. Here expressions for all the primitive idempotents in the ring R_pⁿ=GF(q)[x]/(x^pn−1), for any positive integer n, are obtained in terms of cyclotomic numbers, provided p does not divide λ if n2. The dimension, generating polynomials and minimum distances of minimal cyclic codes of length pⁿ over GF(q) are also discussed.     

The Primitive Idempotents of a Cyclic Group Algebra

Explicit expressions are obtained for the 2n + 1 primitive idempotents in FG, the semisimple group algebra of the cyclic group G of order pⁿ (p an odd prime, n ≥ 1) over the finite field F of prime power order q, when q has order φ(pⁿ)/2 modulo pⁿ.AMS Mathematical Subject Classification (2000): 20C05, 94B05, 12E20, 16S34.     

Incidence properties of cosets in loops

We study incidence properties among cosets of infinite loops, with emphasis on well‐structured varieties such as antiautomorphic loops and Bol loops. While cosets in groups are either disjoint or identical, we find that the incidence structure in general loops can be much richer. Every symmetric design, for example, can be realized as a canonical collection of cosets of a infinite loop. We show that in the variety of antiautomorphic loops the poset formed by set inclusion among intersections of left cosets is isomorphic to that formed by right cosets. We present an algorithm that, given a infinite Bol loop S, can in some cases determine whether |S| divides |Q| for all infinite Bol loops Q with S?Q, and even whether there is a selection of left cosets of S that partitions Q. This method results in a positive confirmation of Lagrange's Theorem for Bol loops for a few new cases of subloops. Finally, we show that in a left automorphic Moufang loop Q (in particular, in a commutative Moufang loop Q), two left cosets of S?Qare either disjoint or they intersect in a set whose cardinality equals that of some subloop of S.     

Matrices over a commutative ring as sums of three idempotents or three involutions

Motivated by Hirano-Tominaga’s work on rings for which every element is a sum of two idempotents and by de Seguins Pazzis’s results on decomposing every matrix over a field of positive characteristic as a sum of idempotent matrices, we address decomposing every matrix over a commutative ring as a sum of three idempotent matrices and, respectively, as a sum of three involutive matrices.     

Cyclotomic matrices and hypergeometric functions over finite fields

With the help of hypergeometric functions over finite fields, we study some arithmetic properties of cyclotomic matrices involving characters and binary quadratic forms over finite fields. Also, we confirm some related conjectures posed by Zhi-Wei Sun.     

Primitive idempotents of irreducible cyclic codes and self-dual cyclic codes over Galois rings

Let $R$ be the Galois ring $GR(p^k,s)$ of characteristic $p^k$ and cardinality $p^{sk}$. Firstly, we give all primitive idempotent generators of irreducible cyclic codes of length $n$ over $R$, and a $p$-adic integer ring with $gcd(p,n)=1$. Secondly, we obtain all primitive idempotents of all irreducible cyclic codes of length $r{l}^m$ over $R$, where $r,l,$ and $t$ are three primes with $2?l$, $r|(q^t?1)$, $l^v\parallel (q^t?1)$ and $gcd(rl,q(q?1))=1$. Finally, as applications, weight distributions of all irreducible cyclic codes for $t=2$ and generator polynomials of self-dual cyclic codes of length $l^m$ and $r{l}^m$ over $R$ are given.     

Perfect difference systems of sets and Jacobi sums

A perfect (v,{k_i∣1≤i≤s},ρ) difference system of sets (DSS) is a collection of s disjoint k_i-subsets D_i, 1≤i≤s, of any finite abelian group G of order v such that every non-identity element of G appears exactly ρ times in the multiset {a−b∣a∈D_i,b∈D_j,1≤i≠j≤s}. In this paper, we give a necessary and sufficient condition in terms of Jacobi sums for a collection {D_i∣1≤i≤s} defined in a finite field F_q of order q=ef+1 to be a perfect (q,{k_i∣1≤i≤s},ρ)-DSS, where each D_i is a union of cyclotomic cosets of index e (and the zero 0∈F_q). Also, we give numerical results for the cases e=2,3, and 4.     

Corrigenda to ``New primitive whose degree is a Mersenne exponent,' and some new primitive pentanomials

We report an error in our previous paper [#!K1!#], where we announced that we listed all the primitive trinomials over of degree 859433, but there is a bug in the sieve. We missed the primitive trinomial and its reciprocal, as pointed out by Richard Brent et al. We also report some new primitive pentanomials.

     

Gaps in the base set of primitive nonpowerful sign patterns

For a primitive nonpowerful square sign pattern A, the base of A, denoted by l(A), is the least positive integer l such that every entry of A ^l is #. In this article, we consider the base set of the primitive nonpowerful sign pattern matrices. Some useful results about the bases for the sign pattern matrices are presented there. Some special sign pattern matrices with given bases are characterized and more ‘gaps’ in the base set are shown.     

A class of primitive substitutions and scrambled sets

Consider the subshifts induced by constant-length primitive substitutions on two symbols. By investigating the equivalent version for the existence of Li-Yorke scrambled sets and by proving the non-existence of Schweizer-Smítal scrambled sets, we completely reveal for this class of subshifts the chaotic behaviors possibly occurring in the sense of Li-Yorke and Schweizer-Smítal.     

素数及其原根的构造方法研究

本给出了ｍ为素数且ａ为模ｍ的一个原根的充要条件,证明了Ｌｕｃａｓ定理中用于构造素数的ａ就是模ｍ的原根,推出了奇素数模ｍ的原根为平方非剩余等结论,为选择ａ和ｍ－１的素因数使在指定范围内产生较多素数提供了依据。中还给出了ｍ为奇素数时,ａ为模ｍ的一个平方非剩余而非原根的充要条件,得出了求模为奇素数的全部原根的一种简便方法。     

The kth upper and lower bases of primitive nonpowerful minimally strong signed digraphs

In this article, we study the kth upper and lower bases of primitive nonpowerful minimally strong signed digraphs. A bound on the kth upper bases for primitive nonpowerful minimally strong signed digraphs is obtained, and the equality case of the bound is characterized. For the kth lower bases, we obtain some bounds. For some cases, the bounds are best possible and the extremal signed digraphs are characterized. We also show that there exist ‘gaps’ in both the kth upper base set and the kth lower base set of primitive nonpowerful minimally strong signed digraphs.     

A fast algorithm for testing reducibility of trinomials mod 2 and some new primitive trinomials of degree 3021377

The standard algorithm for testing reducibility of a trinomial of prime degree over requires bits of memory. We describe a new algorithm which requires only bits of memory and significantly fewer memory references and bit-operations than the standard algorithm.

If is a Mersenne prime, then an irreducible trinomial of degree is necessarily primitive. We give primitive trinomials for the Mersenne exponents , , and . The results for extend and correct some computations of Kumada et al. The two results for are primitive trinomials of the highest known degree.