Geodesic

Sommaire du Fascicule no. 1

Hidden channels and information security in computer systems
p. 3-9
The number of $q$-ary words with restrictions on the length of a maximal series
p. 10-19
On the radii of stability, quasistability and steadiness of a vector trajectory problem of lexicographic optimization
p. 20-27
Transitivity-preserving operators on relations
p. 28-45
Lower bounds for the complexity of systems of vectors of $k$-valued logic
p. 46-62
A lower bound for the complexity of inclusive search in the class of tree-like circuits
p. 63-72
On the maximal $t$-packing of a complete multipartite graph
p. 73-81
Asymptotics of the permanents of some $(0,1)$-matrices
p. 82-86
The total vertex separation number and the profile of graphs
p. 87-94
On the uniqueness of the moment problem in the class of $q$-distributions
p. 95-110
The emergence of a giant tree in a random forest
p. 111-126
On combinatorial functions related to the B\"urman--Lagrange series. Quasi-orthogonality relations
p. 127-140
Limit theorems for a moderately subcritical branching process in a random environment
p. 141-157

Sommaire du Fascicule no. 2

Recursive MDS-codes and recursively differentiable quasigroups
p. 3-29
Random graphs and grammars on graphs
p. 30-44
Inequalities for the number of high-probability outcomes of a multinomial scheme
p. 45-51
Multivariate chi-square distribution for a nonhomogeneous multinomial scheme
p. 52-61
On the number of solutions of the Diophantine equation of Frobenius
p. 62-71
Locally $GQ(3,5)$-graphs and geometries with short lines
p. 72-86
On discrete sublinear and superlinear operators
p. 87-100
Fast enumeration of combinatorial objects
p. 101-119
On strongly essential systems of functions in $P_k$
p. 120-127
On Slupecki classes for deterministic functions
p. 128-136
Construction in $P_k$ of maximal classes that do not have finite bases
p. 137-159

Sommaire du Fascicule no. 3

On the strong stability of a vector trajectory problem of lexicographic optimization
p. 3-9
$A$-closed classes of many-valued logic that contain constants
p. 10-26
On the complexity of the computation of systems of monomials with restrictions on the powers of the variables
p. 27-34
On the asymptotics of the logarithm of the number of threshold functions of $K$-valued logic
p. 35-56
Finiteness of the set of automaton Post bases with a decidable completeness problem
p. 57-63
A polynomial algorithm for recognizing the membership of a function of $k$-valued logic realized by a polynomial in precomplete classes of self-dual functions
p. 64-72
Combinatorics of the interaction on plane lattices
p. 73-83
The nondensity function and generalized Ramsey numbers
p. 84-99
The structure of optimal trajectories of a discrete deterministic scheme with discounting
p. 100-114
Large deviations for sums of lattice random variables under the Cramer condition
p. 115-130
A functional limit theorem for the logarithm of a moderately subcritical branching process in a random environment
p. 131-147
On asymptotic expansions of Stirling numbers of the first and second kinds
p. 148-159

Sommaire du Fascicule no. 4

The Berlekamp--Massey algorithm over finite rings, modules and bimodules
p. 3-34
Simplified justification of the probabilistic Miller--Rabin test for primality
p. 35-38
Generalized continued fractions
p. 39-60
Asymptotics of multi-index axial transportation polytopes
p. 61-81
The shrinking-and-expanding method for the graph enumeration
p. 82-87
Discrete optimal filtering
p. 88-103
Criteria for testing hypotheses from a sample of a distribution with random parameters
p. 104-118
Approximation of abstract semantics by formal models of programs
p. 119-141