Geodesic

Sommaire du Fascicule no. 1

Probabilities of extinction of subcritical multitype branching processes that are bounded from below
p. 3-11
On the asymptotics of moments of the number of nonappearing $s$-chains
p. 12-29
A branching process with migration in a random environment
p. 30-42
Decomposable statistics and stopping times in a scheme of sampling without replacement
p. 43-58
Estimates for the probability of the coincidence of the frequency vectors of outcomes of independent multinomial schemes
p. 59-70
Minimal extensions with simple multiplication for an algebra of second-order matrices
p. 71-82
Codes on fiber products of hyperelliptic curves
p. 83-94
A criterion for the uniformity of the distribution of the sum of independent random variables on a primary cyclic group
p. 95-102
Approximate models of permutation automata
p. 103-122
On traversing labyrinths by automata that leave nonerasable marks
p. 123-133
Characterization of some extremal graphs with a diameter at most three
p. 134-146
On the minimal packing of a tree with fixed vertices
p. 147-152
Andrei Mikhailovich Zubkov (on the occasion of his fiftieth birthday)
p. 153-154
Fourth International Petrozavodsk Conference
p. 155-156

Sommaire du Fascicule no. 2

Code and design
p. 3-11
Closed classes in many-valued logic that contain the class of polynomials
p. 12-23
The structure of the lattice of closed classes of polynomials
p. 24-39
A lower bound for the complexity of the realization of a Boolean function by two-layer switching circuits on a plane integral lattice
p. 40-52
On the complexity and depth of circuits realizing partial Boolean functions
p. 53-58
On the functional decomposability of Boolean threshold functions
p. 59-73
On the completeness of systems of finite automata
p. 74-78
On some properties of algebras with simple multiplication that contain associative subalgebra
p. 79-90
Realization of hypergraphs by trees of minimal diameter
p. 91-97
An analogue of the Whitney theorem for edge graphs of multigraphs, and edge multigraphs
p. 98-105
On minimal universal graphs for hereditary classes
p. 106-115
On regressive enumerations
p. 116-119
Limit theorems for the number of empty cells
p. 120-130
A conditional limit theorem with a random number of summands
p. 131-138
$\Sigma TC$-generated languages and relative equivalence problems
p. 139-160

Sommaire du Fascicule no. 3

On transformations of a set of words in a finite alphabet that do not propagate distortions
p. 3-19
Probability distributions on a linear vector space over a Galois field and on sets of permutations
p. 20-35
Stratified products of hyperelliptic curves, and geometric Goppa codes
p. 36-42
On a randomized approach to the construction of tests for the equiprobability of outcomes of a multinomial scheme
p. 43-51
A new limit theorem for a critical branching process in a random environment
p. 52-67
Probabilities of large deviations of the sums of lattice random vectors when the original distribution has heavy tails
p. 68-81
On the existence of a majority committee
p. 82-95
Polynomial algorithms for computing the permanents of some matrices
p. 96-100
Extensions of $\mathrm{GQ}(4,2)$, the description of hyperovals
p. 101-116
The automaton permutation group $AS_n$ generated by elements of infinite order
p. 117-124
$S$-classification of functions of many-valued logic
p. 125-152
Pareto-optimality conditions in discrete vector optimization problems
p. 153-160

Sommaire du Fascicule no. 4

Bent functions on a finite abelian group
p. 3-20
On domains completely specifying Boolean functions
p. 21-23
On the complexity of recognizing the completeness of sets of Boolean functions realized by Zhegalkin polynomials
p. 24-31
On the number of deadlock tests for closings of block circuits of parity counters
p. 32-49
On closed classes of polynomials over finite fields
p. 50-62
The action of the automorphism group of a finite graded partially ordered set on levels
p. 63-72
Classes of oriented graded graphs with polynomially solvable cardinality Steiner problem
p. 73-85
The total vertex separation number of a graph
p. 86-91
On a form of coloring of graph edges into prescribed colors
p. 92-93
A new equilibrium in cyclic games on graphs
p. 94-99
Critical branching processes in random environment: the probability of extinction at a given moment
p. 100-126
The sequential chi-square test based on $s$-tuples of states of a Markov chain
p. 127-136
Decomposable statistics in the scheme of allocating distinguishable and indistinguishable particles to distinguishable cells
p. 137-149
Limit distributions for the number of vertices in layers of a random forest
p. 150-157