Search

It is shown that an approach earlier used by the author for classification of closed simply connected 6-manifolds (reduction to the problem of calculating certain bordism groups) can also be applied for easily obtaining the results by Barden (1965) on classification of closed simply connected 5-manifolds. Bibliography: 11 titles.

Congruences mod p for a prime p and partial products of the numbers 1,…, p − 1 are obtained. Bibliography: 2 titles.

This paper is a survey of results on countable families with natural degree spectra. These results were obtained by a modification of the methodology proposed by Wechner, who first found a family of sets with the spectrum consisting precisely of nonzero Turing degrees. Based on this method, many researchers obtained examples of families with other natural spectra. In addition, in this paper we extend these results and present new examples of natural spectra. In particular, we construct a family of finite sets with the spectrum consisting of exactly non-K-trivial degrees and also we find new sufficient conditions on $$ {\Delta}_2^0 $$ -degree a, which guarantees that the class {x : x ≰ a} is the degree spectrum of some family. Finally, we give a survey of our recent results on the degree spectra of α-families, where α is an arbitrary computable ordinal.

A dynamical system $$ {\displaystyle \begin{array}{ll}{u}_{tt}-\Delta u-\nabla 1\mathrm{n}\;\rho \cdot \nabla u=0& in\kern0.6em {\mathrm{\mathbb{R}}}_{+}^3\times \left(0,T\right),\\ {}{\left.u\right|}_{t=0}={\left.{u}_t\right|}_{t=0}=0& in\kern0.6em \overline{{\mathrm{\mathbb{R}}}_{+}^3},\\ {}{\left.{u}_z\right|}_{z=0}=f& for\kern0.36em 0\le t\le T,\end{array}} $$ is under consideration, where ρ = ρ(x, y, z) is a smooth positive function; f = f(x, y, t) is a boundary control; u = uf (x, y, z, t) is a solution. With the system one associates a response operator R : f ↦ uf|z = 0. The inverse problem is to recover the function ρ via the response operator. A short representation of the local version of the BC-method, which recovers ρ via the data given on a part of the boundary, is provided. If ρ is constant, the forward problem is solved in explicit form. In the paper, the corresponding representations for the solutions and response operator are derived. A way to use them for testing the BC-algorithm, which solves the inverse problem, is outlined. The goal of the paper is to extend the circle of the BC-method users, who are interested in numerical realization of methods for solving inverse problems.

In this paper, the structure of relative disposition of 3-vertex cutsets in a 3-connected graph is studied. All such cutsets are divided into structural units – complexes of flowers, of cuts, of single cutsets, and trivial complexes. The decomposition of the graph by a complex of each type is described in detail. It is proved that for any two complexes C1 and C2 of a 3-connected graph G there is a unique part of the decomposition of G by C1 that contains C2. The relative disposition of complexes is described with the help of a hypertree T (G) – a hypergraph any cycle of which is a subset of a certain hyperedge. It is also proved that each nonempty part of the decomposition of G by the set of all of its 3-vertex cutsets is either a part of the decomposition of G by one of the complexes or corresponds to a hyperedge of T (G). This paper can be considered as a continuation of studies begun in the joint paper by D. V. Karpov and A. V. Pastor “On the structure of a 3-connected graph,” published in 2011. Bibliography: 10 titles.

The word maps $$ \tilde{w}:\kern0.5em {\mathrm{GL}}_m{(D)}^{2k}\to {\mathrm{GL}}_n(D) $$ and $$ \tilde{w}:\kern0.5em {D}^{\ast 2k}\to {D}^{\ast } $$ for a word $$ w=\prod \limits_{i=1}^k\left[{x}_i,{y}_i\right], $$ where D is a division algebra over a field K, are considered. It is proved that if $$ \tilde{w}\left({D}^{\ast 2k}\right)=\left[{D}^{\ast },{D}^{\ast}\right], $$ then $$ \tilde{w}\left({\mathrm{GL}}_n(D)\right)\supset {E}_n(D)\backslash Z\left({E}_n(D)\right), $$ where En(D) is the subgroup of GLn(D), generated by transvections, and Z(En(D)) is its center. Furthermore if, in addition, n > 2, then $$ \tilde{w}\left({E}_n(D)\right)\supset {E}_n(D)\backslash Z\left({E}_n(D)\right). $$ The proof of the result is based on an analog of the “Gauss decomposition with prescribed semisimple part” (introduced and studied in two papers of the second author with collaborators) in the case of the group GLn(D), which is also considered in the present paper.

The paper analyzes the product of m regular permutation groups G1· . . . · Gm, where m ≥ 2 is a natural number. Each of the regular permutation groups is a subgroup of the symmetric permutation group S(Ω) of degree |Ω| for the set Ω. M. M. Glukhov proved that for k = 2 and m = 2, 2-transitivity of the product G1· G2 is equivalent to the absence of zeros in the corresponding square matrix with the number of rows and columns equal to |Ω| − 1. Also M. M. Glukhov has given necessary conditions of 2-transitivity of such a product of regular permutation groups. In this paper, we consider the general case for any natural m and k such that m ≥ 2 and k ≥ 2. It is proved that k-transitivity of the product of regular permutation groups G1· . . . · Gm is equivalent to the absence of zeros in the square matrix with the number of rows and columns equal to (|Ω| − 1)!/(|Ω| − k)!. We obtain correlation between the number of arcs corresponding to this matrix and a natural number l such that the product (PsQt)l is 2-transitive, where P,Q ⊆ S(Ω) are some regular permutation groups and the permutation st is an (|Ω| − 1)-cycle. We provide an example of the building of AES ciphers such that their round transformations are k-transitive on a number of rounds.

A 3-connected graph G is said to be critical if for any vertex υ ∈ V (G) the graph G − υ is not 3-connected. Entringer and Slater proved that any critical 3-connected graph contains at least two vertices of degree 3. In this paper, a classification of critical 3-connected graphs with two vertices of degree 3 is given in the case where these vertices are adjacent. The case of nonadjacent vertices of degree 3 will be studied in the second part of the paper, which will be published later.

Let rk(n) denote the number of lattice points on a k-dimensional sphere of radius $$ \sqrt{n} $$ . The generating function $$ {\zeta}_k(s)=\sum \limits_{n=1}^{\infty }{r}_k(n){n}^{-s},\kern0.5em k\ge 2, $$ is Epstein’s zeta function. The paper considers the Riesz mean of the type $$ {D}_{\rho}\left(x;{\zeta}_3\right)=\frac{1}{\Gamma \left(\rho +1\right)}\sum \limits_{n\le x}{\left(x-n\right)}^{\rho }{r}_3(n), $$ where ρ > 0; the error term Δρ(x; ζ3) is defined by $$ {D}_{\rho}\left(x;{\zeta}_3\right)=\frac{\uppi^{3/2}{x}^{\rho +3/2}}{\Gamma \left(\rho +5/2\right)}+\frac{x^{\rho }}{\Gamma \left(\rho +1\right)}{\zeta}_3(0)+{\Delta}_{\rho}\left(x;{\zeta}_3\right). $$ K. Chandrasekharan and R. Narasimhan (1962, MR25#3911) proved that $$ {\Delta}_{\rho}\left(x;{\zeta}_3\right)=\Big\{{\displaystyle \begin{array}{ll}O\Big({x}^{1/2+\rho /2\Big)}& \left(\rho >1\right),\\ {}{\Omega}_{\pm}\left({x}^{1/2+\rho /2}\right)& \left(\rho \ge 0\right).\end{array}} $$ In the present paper, it is proved that $$ {\Delta}_{\rho}\left(x;{\zeta}_3\right)=\Big\{{\displaystyle \begin{array}{ll}O\left(x\log x\right)& \left(\rho =1\right),\\ {}O\left({x}^{2/3+\rho /3+\varepsilon}\right)& \left(1/2

In a joint work with S. Bianchini [8] (see also [6, 7]), we proved a quadratic interaction estimate for the system of conservation laws $$ \left\{\begin{array}{l}{u}_t+f{(u)}_x=0,\\ {}u\left(t=0\right)={u}_0(x),\end{array}\right. $$ where u : [0, ∞) × ℝ → ℝn, f : ℝn → ℝn is strictly hyperbolic, and Tot.Var.(u0) ≪ 1. For a wavefront solution in which only two wavefronts at a time interact, such an estimate can be written in the form $$ \sum \limits_{t_j\;\mathrm{interaction}\ \mathrm{time}}\frac{\left|\sigma \left({\alpha}_j\right)-\sigma \left({\alpha}_j^{\prime}\right)\right|\left|{\alpha}_j\right|\left|{\alpha}_j^{\prime}\right|}{\left|{\alpha}_j\right|+\left|{\alpha}_j^{\prime}\right|}\le C(f)\mathrm{Tot}.\mathrm{Var}.{\left({u}_0\right)}^2, $$ where αj and $$ {\alpha}_j^{\prime } $$ are the wavefronts interacting at the interaction time tj, σ(·) is the speed, |·| denotes the strength, and C(f) is a constant depending only on f (see [8, Theorem 1.1] or Theorem 3.1 in the present paper for a more general form). The aim of this paper is to provide the reader with a proof for such a quadratic estimate in a simplified setting, in which: • all the main ideas of the construction are presented; • all the technicalities of the proof in the general setting [8] are avoided.

We study properties of sets having the minimum length (one-dimensional Hausdorff measure) in the class of closed connected sets Σ ⊂ ℝ2 satisfying the inequality max yϵM dist (y, Σ) ≤ r for a given compact set M ⊂ ℝ2 and given r > 0. Such sets play the role of the shortest possible pipelines arriving at a distance at most r to every point of M where M is the set of customers of the pipeline. In this paper, it is announced that every maximum distance minimizer is a union of finitely many curves having one-sided tangent lines at every point. This shows that a maximum distance minimizer is isotopic to a finite Steiner tree even for a “bad” compact set M, which distinguishes it from a solution of the Steiner problem (an example of a Steiner tree with infinitely many branching points can be found in a paper by Paolini, Stepanov, and Teplitskaya). Moreover, the angle between these lines at each point of a maximum distance minimizer is at least 2π/3. Also, we classify the behavior of a minimizer Σ in a neighborhood of any point of Σ. In fact, all the results are proved for a more general class of local minimizers.

The paper considers the category ( $$ \mathcal{T} $$ , S, X) consisting of mappings S : $$ \mathcal{T} $$ −→ $$ \mathcal{T} $$ of spaces $$ \mathcal{T} $$ with distinguished subsets X ⊂ $$ \mathcal{T} $$ . Let rX (i, x0) be the distribution function of points of an S-orbit x0, x1 = S(x0), . . . , xi−1 = Si−1(x0) getting into X, and let δX (i, x0) be the deviation defined by the equation rX (i, x0) = aX i + δX (i, x0), where aX i is the average value. If δX (i, x0) = O(1), then such sets X are called bounded remainder sets. In the paper, bounded remainder sets X are constructed in the following cases: (1) the space $$ \mathcal{T} $$ is the circle, torus, or the Klein bottle; (2) the map S is a rotation of the circle, a shift or an exchange mapping of the torus; (3) X is a fixed subset X ⊂ $$ \mathcal{T} $$ or a sequence of subsets depending on the iteration number i = 0, 1, 2, . . .. Bibliography: 27 titles.

It is known that the monoid wreath product of any two semigroup varieties that are atoms in the lattice of all semigroup varieties may have a finite as well as an infinite lattice of subvarieties. If this lattice is finite, then as a rule it has at most eleven elements. This was proved in a paper of the author in 2007. The exclusion is the monoid wreath product Sl w N 2 of the variety of semilattices and the variety of semigroups with zero multiplication. The number of elements of the lattice L(Sl w N 2) of subvarieties of Sl w N 2 is still unknown. In our paper, we show that the lattice L(Sl w N 2) contains no less than 33 elements. In addition, we give some exponential upper bound of the cardinality of this lattice.

This paper is devoted to the study of groups from the category M of R-power groups. We examine problems on the commutation of the tensor completion with basic group operations and on the exactness of the tensor completion. Moreover, we introduce the notion of a variety and obtain a description of abelian varieties and some results on nilpotent varieties of A-groups. We prove the hypothesis on irreducible coordinate groups of algebraic sets for the nilpotent R-groups of nilpotency class 2, where R is a Euclidean ring. We state that the analog to the Lyndon result for the free groups (see [10]) holds in this case, whereas the analog to the Myasnikov–Kharlampovich result fails.The paper is dedicated to partial R-power groups which are embeddable to their A-tensor completions. The free R-groups and free R-products are described with usual group-theoretical free constructions.

The present paper is devoted to graph-links with many components and consists of two parts. In the first part of the paper we classify vertices of a labeled graph according to the component they belong to. Using this classification, we construct an invariant of graph-links. This invariant shows that the labeled second Bouchet graph generates a nonrealizable graph-link. In the second part of the work we introduce the notion of an oriented graph-link. We define a writhe number for the oriented graph-link and we get an invariant of oriented graph-links, the Jones polynomial, by normalizing the Kauffman bracket with the writhe number.

This paper deals with an extremal problem concerning hypergraph colorings. Let k be an integer. The problem is to find the value m k (n) equal to the minimum number of edges in an n-uniform hypergraph not admitting two-colorings of the vertex set such that every edge of the hypergraph contains at least k vertices of each color. In this paper, we obtain upper bounds of m k (n) for small k and n, the exact value of m 4(8), and a lower bound for m 3(7).

UDC 512.5 In this paper, the normalizer N (σ) of the elementary net group E(σ) associated with a nonsplit maximal torus T (d) in the general linear group GL(n, k) over a field k of odd characteristic is computed. The nonsplit maximal torus T = T (d) is determined by the radical extension k( n √ d) of degree n of the ground field k (minisotropic torus). Bibliography: 18 titles. The problem of describing the overgroups of a split maximal torus in linear groups and in Chevalley groups is virtually solved. The fundamental contribution to the solution of this problem was made by the Leningrad–Petersburg algebraic school (Z. I. Borevich, N. A. Vavilov, and their pupils; for example, see [1, 2, 4–6]). The description of overgroups of a nonsplit torus is a significantly less investigated area. At the present time, a complete description of overgroups of a nonsplit torus has been obtained only for some special fields such as finite or local fields. For finite fields, this was carried out in papers by W. Kantor and G. Seitz (see [15, 17, 18]). Important results on overgroups of a nonsplit torus for local and global fields have been obtained by V. P. Platonov [16]. The case of the field of real numbers has been considered in [14]. For arbitrary fields, the study of overgroups of a nonsplit torus has been conducted in papers [3, 7–13]. The present paper is devoted to an investigation of intermediate subgroups of the general linear group that contain the nonsplit maximal torus related to a radical extension K = k( n √ d) of the ground field k, d ∈ k. The elementary net groups E(σ) associated with the torus T = T (d) and their normalizer N (σ) (which is an overgroup of the nonsplit torus) in the general linear group G =G L( n, k) are of primary importance in studies of the intermediate subgroups mentioned above (see [7–11]). In the present paper, we calculate the normalizer N (σ) of the elementary net group E(σ) associated with a nonsplit maximal torus T (d) in the general linear group GL(n, k )o ver afi eld k of odd characteristic. Moreover, the nonsplit maximal torus T = T (d) is determined by the radical degree-n extension k( n √ d) of the ground field k (minisotropic torus).

The paper considers upper bounds for the infinity norm of the inverse for matrices in two subclasses of the class of (nonsingular) H-matrices, both of which contain the class of Nekrasov matrices. The first one has been introduced recently and consists of the so-called S-Nekrasov matrices. For S-Nekrasov matrices, the known bounds are improved. The second subclass consists of the socalled QN- (quasi-Nekrasov) matrices, which are defined in the present paper. For QN-matrices, an upper bound on the infinity norm of the inverses is established. It is shown that in application to Nekrasov matrices the new bounds are generally better than the known ones. Bibliography: 15 titles.

Let $X,X_1,\ldots,X_n$ be independent identically distributed random variables. The paper deals with the question about the behavior of the concentration function of the random variable $\sum\limits_{k=1}^{n}X_k a_k$ according to the arithmetic structure of vectors $a_k$. Recently, the interest to this question has increased significantly due to the study of distributions of eigenvalues of random matrices. In this paper we formulate and prove multidimensional generalizations of the results Eliseeva and Zaitsev (2012). They are also the refinements of the results of Friedland and Sodin (2007) and Rudelson and Vershynin (2009)., Comment: 13 pages