Geodesic

Sommaire du Fascicule no. 1

Random polynomials over a~finite field
p. 3-24
Random permutations with cycle lengths in a~given finite set
p. 25-37
The Kloss convergence principle for products of random variables with values in a~compact group and distributions determined by a~Markov chain
p. 38-51
On enumeration of labelled connected graphs by the number of cutpoints
p. 52-63
On random 2-adjacent 0/1-polyhedra
p. 64-69
The intersection number of complete $r$-partite graphs
p. 70-79
Skew Laurent series rings and the maximum condition on right annihilators
p. 80-86
On Mazurov triples of the sporadic group~$B$ and Hamiltonian cycles of the Cayley graph
p. 87-93
Classification of indecomposable Abelian $(v,5)$-groups
p. 94-108
On complexity of linear operators on the class of circuits of depth~2
p. 109-119
On complexity of realisation of a~class of almost symmetric functions by formulas of depth~3
p. 120-130
On complexity of the anti-unification problem
p. 131-144
A block algorithm of Lanczos type for solving sparse systems of linear equations
p. 145-150
Some characteristics of dependencies in discrete random sequences
p. 151-158

Sommaire du Fascicule no. 2

The relationship between the level of affinity and cryptographic parameters of Boolean functions
p. 3-14
Testing numbers of the form $N=2kp_1^{m_1}p_2^{m_2}\cdots p_n^{m_n}-1$ for primality
p. 15-24
Theorems on the nonexistence of consistent sequences of criteria in some discrete problems
p. 25-31
On approximation with given accuracy of functions of $k$-valued logic by polynomials
p. 32-45
On the complexity of decoding Boolean cube splitting into cube faces
p. 46-62
Malcev rings
p. 63-81
On the complexity of construction of complete and complete bipartite graphs
p. 82-99
Minimality and deadlockness of multitape automata
p. 100-121
Parallel embeddings of octahedral polyhedra
p. 122-159

Sommaire du Fascicule no. 3

Random graphs of Internet type and the generalised allocation scheme
p. 3-18
Finite probabilistic structures
p. 19-27
Consistency and an algorithm recognising inconsistency of realisations of a~system of random discrete equations with two-valued unknowns
p. 28-39
Limit distributions of the number of absent chains of identical outcomes
p. 40-46
A simple upper bound for the number of spanning trees of regular graphs
p. 47-50
The fundamental difference between depth and delay
p. 51-72
Asymptotic bounds for the affinity level for almost all Boolean functions
p. 73-79
The closure operator with the equality predicate branching on the set of partial Boolean functions
p. 80-88
Dynamic databases with optimal in order time complexity
p. 89-100
A solution of the power conjugacy problem for words in the Coxeter groups of extra large type
p. 101-110
Local factorisations of nonlocal Fitting classes
p. 111-118
On start states of an automaton model of lung in pure environment
p. 119-135
The order of communication complexity of PIR-protocols
p. 136-146
Provable security of digital signatures in the tamper-proof device model
p. 147-159

Sommaire du Fascicule no. 4

On stability of a~vector combinatorial problem with MINMIN criteria
p. 3-7
On design of circuits of logarithmic depth for inversion in finite fields
p. 8-28
On the realisation of Boolean functions by informational graphs
p. 29-41
On ranks, Green classes, and the theory of determinants of Boolean matrices
p. 42-60
Finite generability of some groups of recursive permutations
p. 61-78
Independent systems of generators and the Hopf property for unary algebras
p. 79-84
A lower bound for the affinity level for almost all Boolean functions
p. 85-88
Homomorphisms of shift registers into linear automata
p. 89-101
Estimates of the number of occurrences of vectors on cycles of linear recurring sequences over a~finite field
p. 102-112
On the asymptotic behaviour of the probability of existence of equivalent tuples with nontrivial structure in a~random sequence
p. 113-119
Limit distributions of the number of vectors satisfying a~linear relation
p. 120-135
Characteristics of random systems of linear equations over a~finite field
p. 136-146
Estimates of the complexity of approximation of continuous functions in some classes of determinate functions with delay
p. 147-156
Letter to the editors