Artikel
Lizenziert
Nicht lizenziert
Erfordert eine Authentifizierung
Limit distributions of the number of vectors satisfying a linear relation
-
V. I. Kruglov
Veröffentlicht/Copyright:
15. Dezember 2008
Abstract
Let X1, …, XT be independent random elements uniformly distributed on a finite Abelian group G. In this paper, we give conditions under which the number of ordered sets (i1, …, ik) of pairwise distinct numbers in {1, …, T} such that a1Xi1 + … + akXik = 0 where a1, …, ak are fixed integers has the Poisson limit distribution as T → ∞ and the group G varies with T. We give an example of a sequence of groups G for which the limit distribution of the number of ordered sets is the compound Poisson distribution.
Received: 2007-12-26
Published Online: 2008-12-15
Published in Print: 2008-December
© de Gruyter 2008
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Sie haben derzeit keinen Zugang zu diesem Inhalt.
Artikel in diesem Heft
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
Artikel in diesem Heft
- Random graphs of Internet type and the generalised allocation scheme
- Limit distributions of the number of vectors satisfying a linear relation
- On design of circuits of logarithmic depth for inversion in finite fields
- The order of communication complexity of PIR-protocols
- On start states of an automaton model of lung in pure environment
- A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
- Asymptotic bounds for the affinity level for almost all Boolean functions
- A lower bound for the affinity level for almost all Boolean functions
