-Sidon sets

The aim of this paper is to prove that for every , every -Rider set is a -Sidon set for all {\frac p{2-p}}\cdot$"> This gives some positive answers for the union problem of -Sidon sets. We also obtain some results on the behavior of the Fourier coefficient of a measure with spectrum in a -Rider set.

     

On Universal Representation of Random Graphs

It is shown that every probability measure on the interval [0, 1] gives rise to a unique infinite random graph g on vertices {v₁, v₂, . . .} and a sequence of random graphs gn on vertices {v₁, . . . , v_n} such that . In particular, for Bernoulli graphs with stable property Q, can be strengthened to: probability space (, F, P), set of infinite graphs G(Q) , F with property Q such that .AMS Subject Classification: 05C80, 05C62.     

关于拟赋值环的一个刻画

Let R be a commutative ring without nil-factor. In this paper, we discuss the problem of quasi-valuation ring presented in the reference “Wang Shianghaw, On quasi-valuation ring, Northeast People‘s Univ. Natur. Sci. J., (1)(1957), 27-40”,when the quotient field of R is an algebraic number field or an algebraic function field, and we obtain a characterization of quasi-valuation rings.     

Sparse pseudo‐random graphs are Hamiltonian

In this article we study Hamilton cycles in sparse pseudo‐random graphs. We prove that if the second largest absolute value λ of an eigenvalue of a d‐regular graph G on n vertices satisfies and n is large enough, then G is Hamiltonian. We also show how our main result can be used to prove that for every c >0 and large enough n a Cayley graph X (G,S), formed by choosing a set S of c log⁵ n random generators in a group G of order n, is almost surely Hamiltonian. © 2002 Wiley Periodicals, Inc. J Graph Theory 42: 17–33, 2003     

Second-Order Subexponential Behavior of Subordinated Sequences

Suppose that , , and are three discrete probability distributions related by the equation (E): , where denotes the k-fold convolution of In this paper, we investigate the relation between the asymptotic behaviors of and . It turns out that, for wide classes of sequences and , relation (E) implies that , where is the mean of . The main object of this paper is to discuss the rate of convergence in this result. In our main results, we obtain O-estimates and exact asymptotic estimates for the difference .     

The tame kernel of imaginary quadratic fields with class number 2 or 3

This paper presents improved bounds for the norms of exceptional finite places of the group , where is an imaginary quadratic field of class number 2 or 3. As an application we show that .

     

Three point covers with bad reduction

We study Galois covers of the projective line branched at three points with bad reduction to characteristic , under the condition that strictly divides the order of the Galois group. As an application of our results, we prove that the field of moduli of such a cover is at most tamely ramified at .

     

Zeroes of complete polynomial vector fields

We prove that a complete polynomial vector field on has at most one zero, and analyze the possible cases of those with exactly one which is not of Poincaré-Dulac type. We also obtain the possible nonzero first jet singularities of the foliation at infinity and the nongenericity of completeness. Connections with the Jacobian Conjecture are established.

     

The Orders of Related Elements of a Finite Field

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 q ² (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.     

Stochastic processes with sample paths in reproducing kernel Hilbert spaces

A theorem of M. F. Driscoll says that, under certain restrictions, the probability that a given Gaussian process has its sample paths almost surely in a given reproducing kernel Hilbert space (RKHS) is either or . Driscoll also found a necessary and sufficient condition for that probability to be .

Doing away with Driscoll's restrictions, R. Fortet generalized his condition and named it nuclear dominance. He stated a theorem claiming nuclear dominance to be necessary and sufficient for the existence of a process (not necessarily Gaussian) having its sample paths in a given RKHS. This theorem - specifically the necessity of the condition - turns out to be incorrect, as we will show via counterexamples. On the other hand, a weaker sufficient condition is available.

Using Fortet's tools along with some new ones, we correct Fortet's theorem and then find the generalization of Driscoll's result. The key idea is that of a random element in a RKHS whose values are sample paths of a stochastic process. As in Fortet's work, we make almost no assumptions about the reproducing kernels we use, and we demonstrate the extent to which one may dispense with the Gaussian assumption.