Geodesic

Sommaire du Fascicule no. 1

Complexity of multiplication in some group algebras
p. 3-17
Convergence in distribution of random mappings of finite sets to branching processes
p. 18-21
On some $\chi^2$-type statistics that depend functionally on estimators of unknown parameters
p. 22-34
On a conditional invariance principle for a critical Galton--Watson branching process
p. 35-49
Approximation of the moments of arbitrary integer orders of generalized factorial powers
p. 50-67
Externally periodic automata
p. 68-72
Homomorphisms of binary shift registers
p. 73-88
On the number of product-free sets in groups of even order
p. 89-101
On multivalued transformations of finite sets of binary distributions with rational probabilities
p. 102-128
Synthesis of easily testable circuits in the basis $\{\,\vee,\bar{\vphantom{x}}\,\}$ under single-type constant faults at the outputs of elements
p. 129-140
Optimization in Boolean-valued networks
p. 141-146
A probabilistic algorithm for finding the term rank of a nonnegative matrix
p. 147-156

Sommaire du Fascicule no. 2

Calculation of moments of combinatorial statistics of symmetrically dependent random variables
p. 3-18
A power divergence test in the problem of sample homogeneity for a large number of outcomes and trials
p. 19-48
Random sequences of the form
p. 49-55
The Poisson approximation for the number of matches of values of a discrete function from chains
p. 56-69
Limit theorems on sizes of trees in a random unlabelled forest
p. 70-86
A theorem on the probabilities of large deviations for decomposable statistics that do not satisfy Cram\'er's condition
p. 87-94
An upper bound for the number of functions satisfying the strict avalanche criterion
p. 95-101
Adjustment experiments for automata with variable logic of behavior
p. 102-116
Equational closure
p. 117-126
Criteria for Boolean functions to be repetition-free in pre-elementary bases of rank~3
p. 127-138
On the length of a checking sequence for repetition-free functions in the basis $\{0,1,\,\vee,\neg\}$
p. 139-143
On generalisations of the notion of semirecursiveness
p. 144-149
On stable and unstable trees
p. 150-152
Touchard $C$-polynomials and polynomials quasi-orthogonal to them
p. 153-159

Sommaire du Fascicule no. 3

Yu.\,I.~Maksimov (February 12, 1934--January 8, 2005)
p. 3-4
The probability distribution of sums of elements on disjoint parts of a random permutation
p. 5-11
Conditions for the limit distribution equiprobability in a linear autoregression scheme with random control on a finite group
p. 12-18
Bounds for the probability of a dense embedding of one discrete sequence into another
p. 19-27
Distribution of extreme terms in an ordered series in a scheme for allocating particles by groups of random size
p. 28-44
On the complexity of the computation of differentials and gradients
p. 45-67
Periodically externally hereditary permutation automata
p. 68-79
An upper bound for the complexity of polynomial normal forms of Boolean functions
p. 80-88
The use of a hidden Markov field for the steganalysis of images
p. 89-104
On the number of independent sets in damaged Cayley graphs
p. 105-108
On an isomorphism of quasigroups
p. 109-111
Partitioning a $k$-connected graph
p. 112-122
Solution of the generalized conjugacy problem for words in Coxeter groups of large type
p. 123-145
$p$-matroids
p. 146-160

Sommaire du Fascicule no. 4

K.\,A.~Rybnikov (August 18, 1913--August 8, 2004)
p. 3-6
A new class of nonlinear quinary codes
p. 7-17
Extensions of information protocols based on mappings of finite sets
p. 18-28
On the property of decomposability of functions of $k$-valued logic related to summation of $n$-dependent random variables in a finite Abelian group
p. 29-39
On the distribution of the $m$th maximal cycle lengths of random $A$-permutations
p. 40-58
The law of large numbers for permanents of random matrices
p. 59-71
Generation of uniform distribution robust to nonequiprobability of the initial digits
p. 72-80
On cardinality of some subclasses of monotone functions
p. 81-97
On the affinity level of Boolean functions
p. 98-107
On minimal $\pi$-circuits of closing contacts for symmetric functions with threshold~2
p. 108-110
The representability of a Boolean function by a repetition-free formula can be verified by a circuit of linear complexity
p. 111-115
On the complexity of the computation of a pair of monomials in two variables
p. 116-142
A~generalisation of quadratic residue codes to the case of cubic and biquadratic residues
p. 143-149
The choice of optimisation criterion in the uniform assignment problem
p. 150-157