Small Ball Probabilities of Fractional Brownian Sheets via Fractional Integration Operators

We investigate the small ball problem for d-dimensional fractional Brownian sheets by functional analytic methods. For this reason we show that integration operators of Riemann–Liouville and Weyl type are very close in the sense of their approximation properties, i.e., the Kolmogorov and entropy numbers of their difference tend to zero exponentially. This allows us to carry over properties of the Weyl operator to the Riemann–Liouville one, leading to sharp small ball estimates for some fractional Brownian sheets. In particular, we extend Talagrand's estimate for the 2-dimensional Brownian sheet to the fractional case. When passing from dimension 1 to dimension d2, we use a quite general estimate for the Kolmogorov numbers of the tensor products of linear operators.     

Generalized One-Sided Laws for the Larger Observations of a Triangular Array

Consider independent and identically distributed random variables {X,X _nj , 1jn,n1} with density f(x)=px ^–p–1 I(x1), where p>0. We show that there exist unusual generalized Laws of the Iterated Logarithm involving the larger order statistics from our array.     

Metric entropy of convex hulls in type spaces--The critical case

Given a precompact subset of a type Banach space , where , we prove that for every and all

holds, where is the absolutely convex hull of and denotes the dyadic entropy number. With this inequality we show in particular that for given and with for all the inequality holds true for all . We also prove that this estimate is asymptotically optimal whenever has no better type than . For this answers a question raised by Carl, Kyrezi, and Pajor which has been solved up to now only for the Hilbert space case by F. Gao.

     

Explicit bounds and heuristics on class numbers in hyperelliptic function fields

In this paper, we provide tight estimates for the divisor class number of hyperelliptic function fields. We extend the existing methods to any hyperelliptic function field and improve the previous bounds by a factor proportional to with the help of new results. We thus obtain a faster method of computing regulators and class numbers. Furthermore, we provide experimental data and heuristics on the distribution of the class number within the bounds on the class number. These heuristics are based on recent results by Katz and Sarnak. Our numerical results and the heuristics imply that our approximation is in general far better than the bounds suggest.

     

Some computations on the spectra of Pisot and Salem numbers

Properties of Pisot numbers have long been of interest. One line of questioning, initiated by Erdos, Joó and Komornik in 1990, is the determination of for Pisot numbers , where

Although the quantity is known for some Pisot numbers , there has been no general method for computing . This paper gives such an algorithm. With this algorithm, some properties of and its generalizations are investigated.

A related question concerns the analogy of , denoted , where the coefficients are restricted to ; in particular, for which non-Pisot numbers is nonzero? This paper finds an infinite class of Salem numbers where .

     

Repunit R49081 is a probable prime

The Repunit R is a probable prime. In order to prove primality R49080 must be approximately 33.3% factored. The status of this factorization is included.

     

关于多指标变量大数律尾概率级数的完全收敛性

本文对ｉｄ多指标随机变量序列｛Ｘｋ;ｋ∈Ｎｄ｝（ｄ≥２）的部分和Ｓｎ＝∑ｋ≤ｎＸｋ及Ｈ（ｔ）↑＋∞,（ｔ→＋∞）,提出并讨论了Порохоров的３个问题（ｄ≥２）,并讨论了多指标随机变量和的完全收敛性．     

A Strong Law for Mixing Random Variables

A sharp almost sure bound is derived for limit points of average sum of weakly dependent random variables, which ensures strong laws of large numbers for and -mixing random variables, without assumptions on rate of tending to zero of and -mixing parameters _n and _n.     

Some rapidly converging series for

For a natural number , the author derives several families of series representations for the Riemann Zeta function . Each of these series representing converges remarkably rapidly with its general term having the order estimate:

Relevant connections of the results presented here with many other known series representations for are also pointed out.

     

The number of primes is finite

For a positive integer let and let . The number of primes of the form is finite, because if , then is divisible by . The heuristic argument is given by which there exists a prime such that for all large ; a computer check however shows that this prime has to be greater than . The conjecture that the numbers are squarefree is not true because .