Geodesic

Sommaire du Fascicule no. 1

The method of Newton sums in problems of combinatorial optimization
p. 3-15
The edge independence number and the covering number for regular graphs
p. 16-25
Conditions for regularity of finite autonomous automata
p. 26-30
Superpositions of automata and linear spaces connected with them
p. 31-42
An asymptotic formula for the number of self-inverse labeled oriented graphs
p. 43-49
Extremal ideals of the lattice of multisets for symmetric functionals
p. 50-58
Optimal trajectories of a~dynamic programming scheme and extremal degrees of nonnegative matrices
p. 59-71
Universal labyrinth traps for finite sets of automata
p. 72-79
Self-correction for buffer switching circuits
p. 80-86
Representation of dictionary predicates from the arithmetical hierarchy
p. 87-93
Solution of systems of automaton equations
p. 69-79
Almost optimal trees for computing logic functions
p. 104-112
Embeddedness of partitions, distributions and weighings
p. 433-454
An optimal search for extrema of convex functions on lattices
p. 45-58
Lower bounds on computation time
p. 391-403
Upper bounds for the capacity of discrete communication channels
p. 155-157

Sommaire du Fascicule no. 2

Systems of equations of the antiprefix property in words
p. 11-24
On dictionary colorings and some perfect graphs
p. 25-44
Approximation properties of discrete Fourier sums
p. 33-44
Functional approximations in the theory of lower bounds for circuit complexity
p. 45-59
On the circle method
p. 455-467
Traversing finite labyrinths by systems of automata
p. 71-81
Graphs with a~matroid number that does not exceed~2
p. 82-88
Some conditional distributions for random graphs
p. 89-96
Randomized decomposable statistics in a~scheme of independent allocation of particles into cells
p. 97-111
Completeness modulo an ideal in functional systems of program type
p. 112-120
The relative complexities of two types of two-dimensional circuits made of functional elements
p. 121-126
The error of gradient extrema of the strongly convex function of a~discrete argument
p. 127-137
The probability distribution of the permanent of a~random Boolean matrix
p. 138-144
Multidimensional local theorems on large deviations in an equiprobable allocation scheme
p. 145-149
Self-correcting schemes of functional elements for a~linear function
p. 150-154
Fast correlation decoding of some subsets of words of the first-order Reed--Muller code
p. 155-158

Sommaire du Fascicule no. 3

An algorithm for solving an $m$-dimensional knapsack problem with random coefficients
p. 3-9
Construction of a~truncated tree of variants for a~general problem of scheduling theory
p. 10-20
Transformations of Latin squares
p. 21-28
Uniform id-decomposition of Boolean functions
p. 29-41
Completeness with given accuracy in function systems of program type
p. 42-49
Complexity of self-correcting algorithms for two search problems
p. 50-55
Dichotomous graphs with maximal girth
p. 56-64
Sums of subpermanents of linear hulls of permutation matrices
p. 65-80
The feedback operation and a~class of group automata
p. 81-89
Complexity of some problems on hereditary classes of graphs
p. 90-96
A~zero-one law for many-sorted first-order predicate logic
p. 97-101
Construction of minimal realizations of hypergraphs
p. 102-114
An estimate for the incomplete sum of multiplicative characters of polynomials
p. 115-119
Determinability of finitely generated abelian groups by the lattice of subgroups invariant under an involutive automorphism
p. 120-127
Questions of completeness for finitely generated function systems $\langle P_{k,E_2}\widetilde\Omega\rangle$ and $\langle P_{k,E_2},\widehat\Omega\rangle$
p. 128-136
On the number of cycles in a~random nonequiprobable graph
p. 109-128
Regular languages with polynomial growth in the number of words
p. 285-292
Comparisons modulo a~prime for the number of $(0,1)$-matrices
p. 153-157
Seminar for algebra and mathematical logic dedicated to the memory of V.~D.~Belousov
V.~B.~Kudryavtsev, A.~S.~Podkolzin, A.~A.~Bolotov

Sommaire du Fascicule no. 4

A~finite system of axioms for the model companion of the theory of all multitrees
p. 3-10
On conditions realizing the partitioning of the parameter domain in a~Chebyshev extremal problem
p. 11-17
Closed classes in $k$-valued logic with an operation of branching by predicates
p. 18-25
The complexity of the approximate calculation of real numbers by means of schemes and formulas in various rational bases
p. 259-283
On the nonexistence of even 4-critical graphs of order~12
p. 47-59
A~lower bound on the register complexity of the computation of terms
p. 60-62
Upper bounds on exponents of pseudosymmetric graphs
p. 293-303
Construction of the minimal enclosing parallelogram
p. 72-81
On the structure of random oriented graphs with distinguished edges
p. 225-234
Estimates for functionals of a~density constructed from discretized observations
p. 92-96
Embeddings of graphs in a~surface and the theory of flow graphs
p. 97-115
Problems of completeness for finitely generated functional systems $\langle P_{k,2},\widetilde\Omega\rangle$ and $\langle P_{k,2},\widehat\Omega\rangle$
p. 116-124
All-Union conference dedicated to the 70th anniversary of S.~Kh.~Sirazhdinov