Supported by the National Natural Science Foundation of China(11861071).
In this paper,we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i≥2.This extends two results given by Shyr and Tsai in 1998 at the same time.
Supported by the National Natural Science Foundation of China(11071272,11101087);the Postdoctoral Science Foundation of China(2013M531785);the Natural Science Foundation of Fujian Province(2013J05006);the Foundation of Fuzhou University(2012-XQ-30)
Let Gn(C) be the sandwich semigroup of generalized circulant Boolean matrices with the sandwich matrix C and Gc(Jr~) the set of all primitive matrices in Gn(C). In this paper, some necessary and sufficient condi...
Supported by the National Natural Science Foundation of China(11071081)
Let D be a 2-(v, k, 4) symmetric design and G be a flag-transitive point-primitive automorphism group of D with X ≥G ≤Aut(X) where X ≌ PSL2(q).Then D is a 2-(15,8,4) symmetric design with X = PSL2(9) and ...
Supported by the National Natural Science Foundation of China(10471152).
In the author's Ph. D thesis, a non-quasiprimitive graph admitting a quasiprimitive automorphism group isomorphic to J1 was constructed ,where J1 is Janko simple group of order 175560. Is this the only one for J1? I...