On Automorphic Tuples of Elements in Computable Models

A criterion is obtained for existence of two isomorphic but not hyperarithmetically isomorphic tuples in a hyperarithmetical model. This criterion is used to show that such a situation occurs in the models of well-known classes.Original Russian Text Copyright © 2005 Goncharov S. S., Harizanov V. S., Knight J. F., Morozov A. S., Romina A. V.The first four authors are supported by the Binational Grant NSF DMS-0075899; the first and fourth authors are partially supported by the Russian Foundation for Basic Research (Grant 02-01-00953) and the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2112.03.1).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 523–532, May–June, 2005.     

On Recognition by Spectrum of Finite Simple Linear Groups over Fields of Characteristic 2

A finite group G is said to be recognizable by spectrum, i.e., by the set of element orders, if every finite group H having the same spectrum as G is isomorphic to G. We prove that the simple linear groups L _n (2^k) are recognizable by spectrum for n = 2^m ≥ 32.Original Russian Text Copyright © 2005 Vasil’ev A. V. and Grechkoseeva M. A.The authors were supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program “ Development of the Scientific Potential of Higher School” of the Ministry for Education of the Russian Federation (Grant 8294), the Program “Universities of Russia” (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 749–758, July–August, 2005.     

The Degree Spectra of Definable Relations on Boolean Algebras

We study some questions concerning the structure of the spectra of the sets of atoms and atomless elements in a computable Boolean algebra. We prove that if the spectrum of the set of atoms contains a 1-low degree then it contains a computable degree. We show also that in a computable Boolean algebra of characteristic (1, 1, 0) whose set of atoms is computable the spectrum of the atomless ideal consists of all Π ₀ ² degrees.Original Russian Text Copyright © 2005 Semukhin P. M.The author was supported by the Russian Foundation for Basic Research (Grant 02-01-00593), the Leading Scientific Schools of the Russian Federation (Grant NSh-2112.2003.1), and the Program “Universities of Russia” (Grant UR.04.01.013).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 928–941, July–August, 2005.     

Integral Representations in Linearly Convex Polyhedra

We introduce the notion of mixed Levian (Levi determinant) of a system of k Hermitian and k linear forms. In terms of these Levians we obtain an integral formula for holomorphic functions in linearly convex polyhedra.Original Russian Text Copyright © 2005 Krivokolesko V. P. and Tsikh A. K.The first author was supported by a grant of the President of the Russian Federation and the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-1212.2003.1); the second author was supported by the Ministry for Education of the Russian Federation (St. Petersburg, Grant 02-1-138).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 579–593, May–June, 2005.     

On Differential Equations with Retarded Argument

We study the limit properties of solutions to one class of systems of differential equations as the number of equations and some parameters tend to infinity. We establish a close connection between solutions to these systems and differential equations with retarded argument. Our convergence theorems provide a new method for approximation of solutions to nonlinear differential equations with retarded argument.Original Russian Text Copyright © 2005 Demidenko G. V. and Likhoshvai V. A.The authors were supported by the Russian Foundation for Basic Research (Grants 03-01-00328, 03-04-48506, 03-04-48829, 03-07-96833, 04-01-00458, 05-04-49068, and 05-07-90274), the Integration Grant of the Siberian Branch of the Russian Academy of Sciences (No. 119 and 148), the Program Development of the Scientific Potential of Higher School of the Ministry for Education of the Russian Federation (Grant 8273), and NSF:FIBR (Grant EF-0330786).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 538–552, May–June, 2005.     

An Estimate for the <Emphasis Type="Italic">n</Emphasis>th Minimal Error of Linear Algorithms for One Problem in a Normed Vector Space

We find an estimate for the nth minimal error of linear algorithms for some problem defined in a finite-dimensional space with values in an arbitrary normed vector space.Original Russian Text Copyright © 2005 Sidorov S. P.The author was supported by the Russian Foundation for Basic Research (Grant 04-01-00060), the State Maintenance Programs for the Leading Scientific Schools of the Russian Federation (Grant 1295.2003.1), and the Program Universities of Russia (Grant 04.01.374).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 673–678, May–June, 2005.     

Factorization Representations in the Boundary Crossing Problems for Random Walks on a Markov Chain

Let τ be some stopping time for a random walk S _n defined on transitions of a finite Markov chain and let τ(t) be the first passage time across the level t which occurs after τ. We prove a theorem that establishes a connection between the dual Laplace-Stieltjes transforms of the joint distributions of (τ, S _τ) and (τ(t), S _τ(t)). This result applies to the study of the number of crossings of a strip by sample paths of a random walk.Original Russian Text Copyright © 2005 Lotov V. I. and Orlova N. G.The authors were partially supported by the Russian Foundation for Basic Research (Grant 05-01-00810) and the Grant Council of the President of the Russian Federation (Grant NSh-2139.2003.1).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 833–840, July–August, 2005.     

Root Decomposition of the Ternary Malcev Algebra <Emphasis Type="Italic">M</Emphasis><Subscript>8</Subscript>

A root decomposition is constructed of the simple eight-dimensional ternary Malcev algebra M ₈. In result, M ₈ is equipped with a structure of a Z ₃-graded ternary algebra.Original Russian Text Copyright © 2005 Pozhidaev A. P.The author was supported by the Russian Science Support Foundation and partially by the Russian Foundation for Basic Research (Grant 05-01-00230).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 901–906, July–August, 2005.     

Effective Solution of the Carleman Problem for Some Groups of Divergent Type

We consider a Fuchsian group of the first kind containing only hyperbolic transformations. We obtain an effective solution (explicit in terms of transformations of the group) to the Carleman boundary value problem on a fundamental polygon where the inverse shift is induced by the generating transformations of the group.Original Russian Text Copyright © 2005 Aksent’eva E. P. and Garif’yanov F. N.The authors were supported by the Russian Foundation for Basic Research (Grant 02-01-00914).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 723–733, July–August, 2005.     

About the Admissible Predicates on Admissible Sets

We study the admissible predicates, i.e., the predicates having the property that their addition to the signature of an admissible set preserves the property “to be an admissible set.” We show that the family of these predicates is much wider than the family of Δ-predicates. We also construct a family of admissible predicates of cardinality 2^ω such that the addition of an arbitrary pair of predicates of this family to the signature of an admissible set violates the admissibility of the latter as well as other examples of families of admissible predicates.Original Russian Text Copyright © 2005 Morozov A. S.The author was supported by the International Russian-German Program (Grant RFRB-DFG 01-01-04003), the Russian Science Support Foundation, and the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant 2112.2003.1).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 841–850, July–August, 2005.     

On the Cauchy Principal Value of the Khenkin-Ramirez Singular Integral in Strictly Pseudoconvex Domains of ℂ <Superscript>n</Superscript>

We show that in the multidimensional case (unlike the complex plane) the Cauchy principal value of the Khenkin-Ramirez singular integral in strictly pseudoconvex domains is equal to the limit value of this integral inside the domain.Original Russian Text Copyright © 2005 Kytmanov A. M. and Myslivets S. G.The first author was supported by a grant of the President of the Russian Federation and the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-1212.2003.1); the second author was supported by the Krasnoyarsk Region Science Foundation (Grant 12F0063C).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 625–633, May–June, 2005.     

Korn’s Inequalities for Junctions of Elastic Bodies with Thin Plates

We prove the anisotropic Korn inequalities for an elastic junction of a massive body with thin plates clamped along parts of the lateral surfaces. The distribution of the weight factors in the norms under consideration depends essentially on the disposition of the plates, the way they are clamped to the body, and their relative rigidity (as compared with the body).Original Russian Text Copyright © 2005 Nazarov S. A.The author was supported by the Russian Foundation for Basic Research (Grant 03-01-00835).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 876–889, July–August, 2005.     

On the Best Approximation Properties of <Emphasis Type="Italic">C</Emphasis><Superscript>∞</Superscript>-Smooth Functions on an Interval of the Real Axis (to the Phenomenon of Unsaturated Numerical Methods)

In 1975 K. I. Babenko announced his discovery of conceptually new unsaturated numerical methods. They are distinguished by the absence of the principal error term, which results in their ability to adjust automatically to all natural correctness classes of problems (the phenomenon of unsaturated numerical methods). We show that the phenomenon of unsaturation of a numerical method on an interval is a consequence, although exceptionally subtle, of the well-developed theory of polynomial approximation to continuous functions. By the way, K. I. Babenko always insisted on that.Original Russian Text Copyright © 2005 Belykh V. N.The author was partially supported by the Russian Foundation for Basic Research (Grant 05-01-00250) and the program Contemporary Problems in Mathematics of the Division of Mathematical Sciences of the Russian Academy of Sciences.__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 483–499, May–June, 2005.     

On Connection Between the Structure of a Finite Group and the Properties of Its Prime Graph

It is shown that the condition of nonadjacency of 2 and at least one odd prime in the Gruenberg-Kegel graph of a finite group G under some natural additional conditions suffices to describe the structure of G; in particular, to prove that G has a unique nonabelian composition factor. Applications of this result to the problem of recognition of finite groups by spectrum are also considered.Original Russian Text Copyright © 2005 Vasilev A. V.The author was supported by the Russian Foundation for Basic Research (Grant 05-01-00797), the State Maintenance Program for the Leading Scientific Schools of the Russian Federation (Grant NSh-2069.2003.1), the Program Development of the Scientific Potential of Higher School of the Ministry for Education of the Russian Federation (Grant 8294), the Program Universities of Russia (Grant UR.04.01.202), and a grant of the Presidium of the Siberian Branch of the Russian Academy of Sciences (No. 86-197).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 3, pp. 511–522, May–June, 2005.     

Asymptotic Integration of Parabolic Problems with Large High-Frequency Summands

We develop the averaging method theory for parabolic problems with rapidly oscillating summands some of which are large, i.e., proportional to the square root of the frequency of oscillations. In this case the corresponding averaged problems do not coincide in general with those obtained by the traditional averaging, i.e., by formally averaging the summands of the initial problem (since the principal term of the asymptotic expansion of a solution to the latter problem is not in general a solution to the so-obtained problem). In this article we consider the question of time periodic solutions to the first boundary value problem for a semilinear parabolic equation of an arbitrary order 2k whose nonlinear terms, including the large, depend on the derivatives of the unknown up to the order k-1. We construct the averaged problem and the formal asymptotic expansion of a solution. When the large summands depend on the unknown rather than its derivatives we justify the averaging method and the complete asymptotic expansion of a solution.Original Russian Text Copyright © 2005 Levenshtam V. B.The author was supported by the Russian Foundation for Basic Research (Grant 01-01-00678) and the Program “ Universities of Russia” (UR.04.01.029).__________Translated from Sibirskii Matematicheskii Zhurnal, Vol. 46, No. 4, pp. 805–821, July–August, 2005.