Parcourir par

  • Revues
  • Séminaires
  • Livres
  • Congrès
  • Sources

Geodesic


    Parcourir par

    • Revues
    • Séminaires
    • Livres
    • Congrès
    • Sources
Diskretnaya Matematika
Tome 17 (2005)
no. 2
Précédent Suivant

Volume 17 (2005) no. 2

Sommaire


Calculation of moments of combinatorial statistics of symmetrically dependent random variables
A. M. Zubkov ; D. V. Shuvaev
p. 3-18

A power divergence test in the problem of sample homogeneity for a large number of outcomes and trials
A. P. Baranov ; Yu. A. Baranov
p. 19-48

Random sequences of the form
I. A. Kruglov
p. 49-55

The Poisson approximation for the number of matches of values of a discrete function from chains
A. M. Shoitov
p. 56-69

Limit theorems on sizes of trees in a random unlabelled forest
Yu. L. Pavlov
p. 70-86

A theorem on the probabilities of large deviations for decomposable statistics that do not satisfy Cram\'er's condition
A. V. Kolodzei
p. 87-94

An upper bound for the number of functions satisfying the strict avalanche criterion
K. N. Pankov
p. 95-101

Adjustment experiments for automata with variable logic of behavior
A. E. Kirnasov
p. 102-116

Equational closure
S. S. Marchenkov
p. 117-126

Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank~3
N. A. Peryazev ; I. K. Sharankhaev
p. 127-138

On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\,\vee,\neg\}$
A. A. Voronenko
p. 139-143

On generalisations of the notion of semirecursiveness
A. N. Degtev
p. 144-149

On stable and unstable trees
V. A. Kolmykov
p. 150-152

Touchard $C$-polynomials and polynomials quasi-orthogonal to them
O. V. Kuz'min ; O. V. Leonova
p. 153-159
  • À propos
  • Contact
  • Mentions légales
  • Politique de confidentialité