All finite fields
q (q 2, 3, 4, 5, 7, 9, 13, 25, 121) contain a primitive element for which + 1/ is also primitive. All fields of square order
q2 (q 3, 5) contain an element of order q + 1 for which + 1/ is a primitive element of the subfield
q. These are unconditional versions of general asymptotic results. 相似文献
We obtain upper bounds for mixed exponential sums of the type
where pm is a prime power with m⩾ 2 and X is a multiplicative character (mod pm). If X is primitive or p⫮(a, b) then we obtain |S(χ,f,pm)| ⩽2np2/3 m. If X is of conductor p and p⫮( a, b) then we get the stronger bound |S(χ,f,pm)|⩽npm/2.
This paper is dedicated to Prof. Wang Yuan on the occasion of his 70th birthday. 相似文献
By a prime gap of size , we mean that there are primes and such that the numbers between and are all composite. It is widely believed that infinitely many prime gaps of size exist for all even integers . However, it had not previously been known whether a prime gap of size existed. The objective of this article was to be the first to find a prime gap of size , by using a systematic method that would also apply to finding prime gaps of any size. By this method, we find prime gaps for all even integers from to , and some beyond. What we find are not necessarily the first occurrences of these gaps, but, being examples, they give an upper bound on the first such occurrences. The prime gaps of size listed in this article were first announced on the Number Theory Listing to the World Wide Web on Tuesday, April 8, 1997. Since then, others, including Sol Weintraub and A.O.L. Atkin, have found prime gaps of size with smaller integers, using more ad hoc methods. At the end of the article, related computations to find prime triples of the form , , and their application to divisibility of binomial coefficients by a square will also be discussed.
A set X of boundary points of a (possibly unbounded) convex body KEd illuminating K from within is called primitive if no proper subset of X still illuminates K from within. We prove that for such a primitive set X of an unbounded, convex set KEd (distinct from a cone) one has X=2 if d=2, X6 if d=3, and that there is no upper bound for X if d4. 相似文献
For a finite group G, let Cent(G) denote the set of centralizers of single elements of G and #Cent(G) = |Cent(G)|. G is called an n-centralizer group if #Cent(G) = n, and a primitive n-centralizer group if #Cent(G) = #Cent(G/Z(G)) = n. In this paper, we compute #Cent(G) for some finite groups G and prove that, for any positive integer n 2, 3, there exists a finite group G with #Cent(G) = n, which is a question raised by Belcastro and Sherman [2]. We investigate the structure of finite groups G with #Cent(G) = 6 and prove that, if G is a primitive 6-centralizer group, then G/Z(G) A4, the alternating group on four letters. Also, we prove that, if G/Z(G) A4, then #Cent(G) = 6 or 8, and construct a group G with G/Z(G) A4 and #Cent(G) = 8.This research was in part supported by a grant from IPM.2000 Mathematics Subject Classification: 20D99, 20E07 相似文献
In this paper we prove that the language of all primitive (strongly primitive) words over a nontrivial alphabet can be generated by certain types of Marcus contextual grammars. 相似文献
The parameter l(G) for a primitive digraph G introduced by Lewin is the minimum positive integer k for which there are walks of both lengths k and k + 1 from some vertex u to some vertex v. We obtain upper bounds on l(G) if G is primitive ministrong, or G is just primitive and not necessarily ministrong, or G is primitive symmetric. We also discuss the numbers attainable as l(G).AMS Subject Classification (2000): 05C20, 15A48Partially supported by the National Natural Science Foundation of China (19771040) and the Guangdong Provincial Natural Science Foundation of China (990447). 相似文献
The generalized Kullback-Leibler divergence (K-Ld) in Tsallis statistics [constrained by the additive duality of generalized statistics (dual generalized K-Ld)] is here reconciled with the theory of Bregman divergences for expectations defined by normal averages, within a measure-theoretic framework. Specifically, it is demonstrated that the dual generalized K-Ld is a scaled Bregman divergence. The Pythagorean theorem is derived from the minimum discrimination information principle using the dual generalized K-Ld as the measure of uncertainty, with constraints defined by normal averages. The minimization of the dual generalized K-Ld, with normal averages constraints, is shown to exhibit distinctly unique features. 相似文献
A classification is given of finite graphs that are vertex primitive and 2-arc regular. The classification involves various
new constructions of interesting 2-arc transitive graphs. 相似文献