Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


2005, Volume 17, Issue 2  


Calculation of moments of combinatorial statistics of symmetrically dependent random variables
A. M. Zubkov, D. V. Shuvaev
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
19–48
Random sequences of the form $X_{t+1}=a_t X_t+b_t$ modulo $n$ with dependent coefficients $a_t$, $b_t$
I. A. Kruglov
49–55
The Poisson approximation for the number of matches of values of a discrete function from chains
A. M. Shoitov
56–69
Limit theorems on sizes of trees in a random unlabelled forest
Yu. L. Pavlov
70–86
A theorem on the probabilities of large deviations for decomposable statistics that do not satisfy Cramér's condition
A. V. Kolodzei
87–94
An upper bound for the number of functions satisfying the strict avalanche criterion
K. N. Pankov
95–101
Adjustment experiments for automata with variable logic of behavior
A. E. Kirnasov
102–116
Equational closure
S. S. Marchenkov
117–126
Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank 3
N. A. Peryazev, I. K. Sharankhaev
127–138
On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\&,\vee,\neg\}$
A. A. Voronenko
139–143
On generalisations of the notion of semirecursiveness
A. N. Degtev
144–149
On stable and unstable trees
V. A. Kolmykov
150–152
Touchard $C$-polynomials and polynomials quasi-orthogonal to them
O. V. Kuz'min, O. V. Leonova
153–159
Дискретная математика
 
  Contact us:
 Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025