The purpose of this paper is to present a general method to compute recursively the probability mass function of the discrete stable, discrete Linnik and discrete Mittag-Le­ er distribution. The recursive computation method is based on the representation of these distributions as compound distributions and on the Panjer algorithm (see Panjer (1981), Klugman et al. (1998) or Rolski et al. (1999)...

We study [2m−1, 2m]-binary linear codes whose weights lie between w0 and 2m−w0, where w0 takes the highest possible value. Primitive cyclic codes with two zeros whose dual satisfies this property actually correspond to almost bent power functions and to pairs of maximum-length sequences with preferred crosscorrelation. We prove that, for odd m, these codes are completely characterized by their ...

Pseudo-Relevance Feedback (PRF) assumes that the topranking n documents of the initial retrieval are relevant and extracts expansion terms from them. In this work, we introduce the notion of pseudo-irrelevant documents, i.e. high-scoring documents outside of top n that are highly unlikely to be relevant. We show how pseudo-irrelevant documents can be used to extract better expansion terms from ...

— In this paper we give a characterization of primitive recursive functions ƒ : N~* N{r^0, s>0) and define a Hierarchy of classes b^O) of these functions by a syntactic measure ofeomplexity. The behavior ofthe classes J^a+b^ respect to different operators is also analyzed. The classes J^ + b coincide with the ones ofCleavé's hierarchy for a^2,b^0 and give a refinement of the Meyer-Ri...

A class of permutations Π is called closed if π ⊂ σ ∈ Π implies π ∈ Π, where the relation ⊂ is the natural containment of permutations. Let Πn be the set of all permutations of 1, 2, . . . , n belonging to Π. We investigate the counting functions n 7→ |Πn| of closed classes. Our main result says that if |Πn| < 2n−1 for at least one n ≥ 1, then there is a unique k ≥ 1 such that Fn,k ≤ |Πn| ≤ Fn,...

We give a precise characterization of parameter free n and n induction schemata, I ? n and I ? n , in terms of reeection principles. This allows us to show that I ? n+1 is conservative over I ? n w.r.t. boolean combinations of n+1 sentences, for n 1. In particular, we give a positive answer to a question by R. Kaye, whether the provably recursive functions of I ? 2 are exactly the primitive rec...

We determine the number ω(G) of orbits on the (finite) group G under the action of Aut(G) for G ∈ {PSL(2, q),SL(2, q),PSL(3, 3),Sz(2)}, covering all of the minimal simple groups as well as all of the simple Zassenhaus groups. This leads to recursive formulae on the one hand, and to the equation ω(Sz(q)) = ω(PSL(2, q)) + 2 on the other. MSC 20E32, 20F28, 20G40, 20-04

The method of partitionable sets for constructing large sets of t-designs have now been used for nearly a decade. The method has resulted in some powerful recursive constructions and also existence results especially for large sets of prime sizes. Perhaps the main feature of the approach is its simplicity. In this paper, we describe the approach and show how it is employed to obtain some of the...

We study conditions on a C∗-dynamical system (A,G,α) under which induction of primitive ideals (resp. irreducible representations) from stabilizers for the action of G on the primitive ideal space Prim(A) give primitive ideals (resp. irreducible representations) of the crossed product A⋊α G. The results build on earlier results of Sauvageot [17] and others, and will correct a (possibly overly o...

In biomechanical studies inverse-dynamic models are often used to predict muscle forces. The distribution of those forces among the muscles is often calculated by optimising a cost function, assuming that movements are controlled in an optimal manner. Unfortunately the quantity optimised in real life is unknown and only assumptions can be made. Many different cost functions have been proposed (...