Abstract. Two methods to approximate infinitely divisible random fields are presented. The methods are based on approximating the kernel function in the spectral representation of such fields, leading to numerical integration of the respective integrals. Error bounds for the approximation error are derived and the approximations are used to simulate certain classes of infinitely divisible rando...

The use of divisible load scheduling theory is proposed to model and design grid systems such as those arising in large physics experiments. Current divisible load theory is summarized. A typical application, the STAR experiment at RHIC is discussed. This includes a sample calculation based on existing infrastructure numbers.

We introduce two new infinite families of APN functions, one on fields of order 22k for k not divisible by 2, and the other on fields of order 23k for k not divisible by 3. The polynomials in the first family have between three and k+ 2 terms, the second family’s polynomials have three terms. © 2007 Elsevier Inc. All rights reserved.

Subspace codes, i.e., subset of a finite-field Grassmannian, are applied in random linear network coding. Here we give improved upper bounds based on the Johnson bound and a connection to divisible codes, which is presented in a purely geometrical way. This complements a recent approach for upper bounds on the maximum size of partial spreads based on projective qr-divisible codes.

Many different divisible designs are already known. Some of them possess remarkable automorphism groups, so called dual translation groups. The existence of such an automorphism group enables us to characterize its associated divisible design as being isomorphic to a substructure of a finite affine space. AMS Classification: 05B05, 05B30, 20B25, 51N10

☆ Genicot is grateful to the Development Research Gro warm hospitality during the writing of a first draft of thi the Canadian Institute for Advanced Research for financial assistancewas appreciated.We thank Patrick Francois, Elia comments, as well as seminar participants at Bocconi Un Population Research Center, the World Bank DECRG and I ⁎ Correspondence to: Vancouver School of Economics an ⁎...

In this paper we continue the investigation into the group of algebras with uniformly distributed invariants, U(k’), and its relation to the Schur subgroup S(K), undertaken in [6, 71. We maintain the notation of [6, 71. In the first section we investigate U(K) for a real quadratic field K. We calculate generators of U(K) explicitly. In the second section we investigate U(K) for other real field...

Let d be a positive integer. A graph G is called d-divisible if d divides the degree of each vertex of G. G is called nowhere d-divisible if no degree of a vertex of G is divisible by d. For a graph H, gcd(H) denotes the greatest common divisor of the degrees of the vertices of H. The H-packing number of G is the maximum number of pairwise edge disjoint copies of H in G. The H-covering number o...

H. Kharaghani, in "Arrays for orthogonal designs", J. Combin. Designs, 8 (2000), 166-173, showed how to use amicable sets of matrices to construct orthogonal designs in orders divisible by eight. We show how amicable orthogonal designs can be used to make amicable sets and so obtain infinite families of orthogonal designs in six variables in orders divisible by eight.