Geodesic

Sommaire du Fascicule no. 1

Minimal points of a supercritical branching random walk on the lattice $\mathbf N_0^r$, and multitype Galton--Watson branching processes
p. 3-6
Convergence conditions for weighted branching processes
p. 7-23
Matchings up to the permutations which form a Latin rectangle
p. 24-46
A remark on Galton--Watson forests
p. 47-59
On asymptotic expansions in local limit theorems for equiprobable schemes of allocating particles to distinguishable cells
p. 60-69
Limit theorems for the number of nonzero solutions of a~system of random equations over the field~$\mathrm{GF}(2)$
p. 70-81
A local limit theorem for the distribution of a part of the spectrum of a random binary function
p. 82-95
Approximation of optima of integer programs of the packing--covering type
p. 96-106
A~counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope
p. 107-112
Pseudo-geometric graphs of the partial geometries $pG_2(4,t)$
p. 113-134
On the complexity of the realization of a linear function by formulas in finite Boolean bases
p. 135-144
On the complexity of the realization of finite languages by formulas
p. 145-157

Sommaire du Fascicule no. 2

Statistical problems related to the organization of the control of processes of the generation of discrete random sequences
p. 3-24
On the stability radius of a vector problem of linear Boolean programming
p. 25-30
On the time of attaining a maximum by a critical branching process in a random environment and by a stopped random walk
p. 31-50
On recognizing labyrinths by automata
p. 51-65
Crossed homomorphisms of finite algebras with a scheme of binary operators
p. 66-84
On the complexity of the disjunctive normal form of threshold functions
p. 85-92
Probability of correct decoding for a channel with additive normal noise and a binary symmetric channel with a random choice of code words
p. 93-98
On the entropy of hereditary classes of colored graphs
p. 99-102
Functional aspects of the completeness problem for some classes of automaton functions
p. 103-117
Estimates for the complexity of a method for solving the problem of inclusive search
p. 118-139
Linear recursive MDS-codes of dimensions~2 and~3
p. 140-153
On a property of associated representations of the group $\mathrm{GL}(n,k)$
p. 154-159

Sommaire du Fascicule no. 3

Polynomial transformations of linear recurrent sequences over finite commutative rings
p. 3-36
Analysis of the sensitivity of efficient solutions of a vector problem of minimizing linear forms on a set of permutations
p. 37-48
Repetitions of the values of a function of segments of a sequence of independent trials
p. 49-59
Touchard polynomials and their applications
p. 60-71
Refining of the comparison rule for continuants
p. 72-75
Enumeration of the faces of complexes and normalizations of distributive lattices
p. 76-94
Abstract properties of a class of intervals of lattices of closed classes
p. 95-113
On a decomposition of Boolean functions
p. 114-123
Remarks on the fast multiplication of polynomials, and Fourier and Hartley transforms
p. 124-153
On some varieties of abelian quasigroups
p. 154-159

Sommaire du Fascicule no. 4

The parameters of recursive MDS-codes
p. 3-24
Vector invariants of symmetric groups in the case of a field of prime characteristic
p. 25-38
Sojourn times in a finite set of states of Markov branching processes and the probabilities of extinction of a modified Galton--Watson process
p. 39-45
Moving chi-square
p. 46-52
On permutations with cycle lengths from a random set
p. 53-62
On some properties of systems, complete with respect to expressibility, of formulas in the G\"odel--L\"ob provability logic
p. 63-82
On the complexity of the computation of rudimentary predicates
p. 83-98
On the number of rules needed for an automaton grammar to generate a finite language
p. 99-108
On the mean time for computing the values of elementary Boolean functions
p. 109-120
On traversing labyrinths by automata in $n$-dimensional space
p. 121-137
The completeness criterion for systems containing all one-place bounded-determinate functions
p. 138-158