Search

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.

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

sp-Groups form an interesting and informative class of Abelian mixed groups. In this paper, we systematically study self-small sp-groups of finite rank and their endomorphism rings.

The following general variant of deterministic “Hats” game is analyzed. Several sages wearing colored hats occupy the vertices of a graph, the kth sage can have hats of one of h(k) colors. Each sage tries to guess the color of his own hat merely on the basis of observing the hats of his neighbors without exchanging any information. A predetermined guessing strategy is winning if it guarantees at least one correct individual guess for every assignment of colors. For complete graphs and cycles, the problem of describing the function h(k) for which the sages win is solved in the present paper. A “theory of constructors,” i.e., a collection of theorems demonstrating how one can construct new graphs for which the sages win is developed. A new game “Rook check ” equivalent to the Hats game on a 4-cycle is introduced and completely analyzed.

The goal of the paper is to study vertices of degree 6 of minimal and contraction critical 6-connected graph, i.e., a 6-connected graph that looses 6-connectivity both upon removal and upon contraction of any edge. It is proved that if x and z are adjacent vertices of degree 6, then x and z have at least 4 common neighbors. In addition, a detailed description of the neighborhood of the set {x, z} is given. An infinite series of examples of minimal and contraction critical 6-connected graphs for which the fraction of vertices of degree 6 equals $$ \frac{11}{17} $$ is constructed.

In order to provide a new, more computation-friendly, construction of the stable motivic category SH(k), V. Voevodsyky laid the foundation of delooping motivic spaces. G. Garkusha and I. Panin based on joint works with A. Ananievsky, A. Neshitov, and A. Druzhinin made that project a reality. In particular, G. Garkusha and I. Panin proved that for an infinite perfect field k and any k-smooth scheme X, the canonical morphism of motivic spaces $$ {C}_{\ast } Fr(X)\to {\Omega}_{{\mathrm{\mathbb{P}}}^1}^{\infty }{\sum}_{{\mathrm{\mathbb{P}}}^1}^{\infty}\left({X}_{+}\right) $$ is a Nisnevich locally group-completion. In the present paper, a generalization of that theorem is established to the case of smooth open pairs (X,U), where X is a k-smooth scheme and U is its open subscheme intersecting each component of X in a nonempty subscheme. It is claimed that in this case the motivic space C*Fr((X,U)) is a Nisnevich locally connected, and the motivic space morphism $$ {C}_{\ast } Fr\left(\left(X,U\right)\right)\to {\Omega}_{{\mathrm{\mathbb{P}}}^1}^{\infty }{\sum}_{{\mathrm{\mathbb{P}}}^1}^{\infty}\left(X/U\right) $$ is Nisnevich locally weak equivalence. Moreover, it is proved that if the codimension of S = X−U in each component of X is greater than r ≥ 0, then the simplicial sheaf C*Fr((X,U)) is locally r-connected.

A perfect cuboid is a rectangular parallelepiped in which the lengths of all edges, the lengths of all face diagonals, and also the lengths of spatial diagonals are integers. No such cuboid has yet been found, but their nonexistence has also not been proved. The problem of a perfect cuboid is among unsolved mathematical problems. The problem has a natural S3-symmetry connected to permutations of edges of the cuboid and the corresponding permutations of face diagonals. In this paper, we give a survey of author’s results and results of J. R. Ramsden on using the S3 symmetry for the reduction and analysis of the Diophantine equations for a perfect cuboid.

In this paper, we present new properties of the space L1(M, τ) of integrable (with respect to the trace τ ) operators affiliated to a semifinite von Neumann algebra M. For self-adjoint τ-measurable operators A and B, we find sufficient conditions of the τ -integrability of the operator λI −AB and the real-valuedness of the trace τ (λI − AB), where λ ∈ ℝ. Under these conditions, [A,B] = AB − BA ∈ L1(M, τ) and τ ([A,B]) = 0. For τ -measurable operators A and B = B2, we find conditions that are sufficient for the validity of the relation τ ([A,B]) = 0. For an isometry U ∈ M and a nonnegative τ -measurable operator A, we prove that U − A ∈ L1(M, τ) if and only if I − A, I − U ∈ L1(M, τ). For a τ -measurable operator A, we present estimates of the trace of the autocommutator [A∗,A]. Let self-adjoint τ -measurable operators X ≥ 0 and Y be such that [X1/2, YX1/2] ∈ L1(M, τ). Then τ ([X1/2, YX1/2]) = it, where t ∈ ℝ and t = 0 for XY ∈ L1(M, τ).

Let R be any associative ring with 1, let n ≥ 3, and let A,B be two-sided ideals of R. In the present paper, we show that the mixed commutator subgroup [E(n,R,A),E(n,R,B)] is generated as a group by the elements of the two following forms: 1) zij(ab, c) and zij (ba, c), 2) [tij(a), tji(b)], where 1 ≤ i ≠ j ≤ n, a ∈ A, b ∈ B, c ∈ R. Moreover, for the second type of generators, it suffices to fix one pair of indices (i, j). This result is both stronger and more general than the previous results by Roozbeh Hazrat and the authors. In particular, it implies that for all associative rings one has the equality [E(n,R,A),E(n,R,B)] = [E(n,A),E(n,B)], and many further corollaries can be derived for rings subject to commutativity conditions. Bibliography: 36 titles.

In this paper, we examine the value m(n, r) in the Erdős–Hajnal problem. Using various methods, we obtain the estimate 27 ≤ m(3) ≤ 35.

Let SF be the set of continuous bounded selections from the set-valued mapping F : T → 2H with nonempty convex closed values; here T is a paracompact Hausdorff topological space, and H is a Hilbert space. In this paper, we obtain a criterion for the existence of a 1-Lipschitz selection from the metric projection onto the set SF in C(T, H).

Double occurrence words play an important part in genetics in describing epigenetic genome rearrangements. A useful geometric representation for double occurrence words is provided by the so-called assembly graphs. The paper investigates properties of the incidence matrices that correspond to the assembly graphs. An explicit matrix characterization of the simple assembly graphs of a given structure and a series of constructions, using these graphs and important for genetic investigations, are provided.

The paper considers the so-called P-Nekrasov and {P1, P2}-Nekrasov matrices, defined in terms of permutation matrices P, P1, P2, which generalize the well-known notion of Nekrasov matrices. For such matrices A, available upper bounds on ‖A−1‖∞ are recalled, and new upper bounds for the P-Nekrasov and {P1, P2}-Nekrasov matrices are suggested. It is shown that the latter bound generally improves the earlier bounds, as well as the bound for the inverse of a P-Nekrasov matrix and the classical bound for the inverse of a strictly diagonally dominant matrix. Bibliography: 12 titles.

The paper introduces new classes of nonsingular matrices, which contain some known subclasses of the class of nonsingular H-matrices, such as the Nekrasov, Q-Nekrasov, {P1, P2}-Nekrasov, and DZ matrices. For matrices in the classes introduced, upper bounds for ‖A−1‖∞ are derived (in a unified manner) and shown to improve the known bounds for matrices from the corresponding subclasses of the nonsingular H-matrices. Bibliography: 20 titles.

In this paper, it is proved that for λ > 1, an additive map that strongly preserves the set of λ-scrambling matrices over the Boolean semiring B is a bijection. The general form of such a map over any antinegative commutative semiring with identity and without zero divisors is characterized. Bibliography: 20 titles.

The paper suggests a modified version of the ℒ-algorithm for constructing an infinite sequence of integral solutions of dual systems $$ \mathcal{S} $$ and $$ {\mathcal{S}}^{\ast } $$ of linear inequalities in d + 1 variables consisting of k⊥ and k*⊥ inequalities, respectively, where k⊥ + k*⊥ = d + 1. Solutions are obtained from two recurrence relations of order d + 1. Approximation in the inequality systems $$ \mathcal{S} $$ and $$ {\mathcal{S}}^{\ast } $$ is effected with the Diophantine exponents $$ \frac{d+1-{k}^{\perp }}{k^{\perp }}-\upvarrho $$ and $$ \frac{d+1-{k}^{\ast \perp }}{k^{\ast \perp }}-\upvarrho $$ , respectively, where the deviation ϱ > 0 can be made arbitrarily small by appropriately choosing the recurrence relations. The ℒ-algorithm is based on a method for localizing units in algebraic number fields.

This paper is a review of results on the structure of homogeneous ind-varieties G/P of the ind-groups G = GL∞(ℂ), SL∞(ℂ), SO∞(ℂ), and Sp∞(ℂ), subject to the condition that G/P is the inductive limit of compact homogeneous spaces Gn/Pn. In this case, the subgroup P ⊂ G is a splitting parabolic subgroup of G and the ind-variety G/P admits a “flag realization.” Instead of ordinary flags, one considers generalized flags that are, in general, infinite chains $$ \mathcal{C} $$ of subspaces in the natural representation V of G satisfying a certain condition; roughly speaking, for each nonzero vector 𝜐 of V , there exist the largest space in $$ \mathcal{C} $$ , which does not contain 𝜐, and the smallest space in $$ \mathcal{C} $$ , which contains v. We start with a review of the construction of ind-varieties of generalized flags and then show that these ind-varieties are homogeneous ind-spaces of the form G/P for splitting parabolic ind-subgroups P ⊂ G. Also, we briefly review the characterization of more general, i.e., nonsplitting, parabolic ind-subgroups in terms of generalized flags. In the special case of the ind-grassmannian X, we give a purely algebraic-geometric construction of X. Further topics discussed are the Bott–Borel–Weil theorem for ind-varieties of generalized flags, finite-rank vector bundles on ind-varieties of generalized flags, the theory of Schubert decomposition of G/P for arbitrary splitting parabolic ind-subgroups P ⊂ G, as well as the orbits of real forms on G/P for G = SL∞(ℂ).

This paper is a review of results on multiple flag varieties, i.e., varieties of the form G/P1×· · ·×G/Pr. We provide a classification of multiple flag varieties of complexity 0 and 1 and results on the combinatorics and geometry of B-orbits and their closures in double cominuscule flag varieties. We also discuss questions of finiteness for the number of G-orbits and existence of an open G-orbits on a multiple flag variety.

Let $G$ be a finite group, $N(G)$ be the set of conjugacy classes of the group $G$. In the present paper it is proved $G\simeq L$ if $N(G)=N(L)$, where $G$ is a finite group with trivial center and $L$ is a finite simple group of exceptional Lie type or Tits group.

Let G be a simply connected Chevalley group over an infinite field K, and let $$ \tilde{w} $$ : Gn → G be a word map that corresponds to a nontrivial word w. In 2015, it has been proved that if w = w1w2w3w4 is the product of four words in independent variables, then every noncentral element of G is contained in the image of $$ \tilde{w} $$. A similar result for a word w = w1w2w3, which is the product of three independent words, was obtained in 2019 under the condition that the group G is not of type B2 or G2. In the present paper, it is proved that for a group of type B2 or G2, all elements of the large Bruhat cell B nw0B are contained in the image of the word map $$ \tilde{w} $$, where w = w1w2w3 is the product of three independent words. For a group G of type Ar, Cr, or G2 (respectively, for a group of type Ar) or a group over a perfect field K (respectively, over a perfect field K the characteristic of which is not a bad prime for G) with dim K ≤ 1 (here, dim K is the cohomological dimension of K), it is proved that all split regular semisimple elements (respectively, all regular unipotent elements) of G are contained in the image of $$ \tilde{w} $$, where w = w1w2 is the product of two independent words. Also, for any isotropic (but not necessary split) simple algebraic group G over a field K of characteristic zero, it is shown that for a word map $$ \tilde{w} $$ : G(K)n → G(K), where w = w1w2 is a product of two independent words, all unipotent elements are contained in Im $$ \tilde{w} $$.

In this paper, nontrivial upper bounds on the chromatic numbers of the spaces $$ {\mathrm{\mathbb{R}}}_p^n=\left({\mathrm{\mathbb{R}}}^n, lp\right) $$ with forbidden monochromatic sets are proved. In the case of a forbidden rectangular parallelepiped or a regular simplex, explicit exponential lower bounds on the chromatic numbers are obtained. Exact values of the chromatic numbers of the spaces $$ {\mathrm{\mathbb{R}}}_p^n $$ with a forbidden regular simplex in the case p = ∞ are found. Bibliography: 39 titles.

Some approximative characteristics of classes of periodic functions of many variables $$ {L}_{\beta, p}^{\psi }, $$ 1 < p < 1, in a uniform metric are investigated. The first part of the paper is devoted to the construction of estimates of the best orthogonal trigonometric approximations of the mentioned classes in the space L∞. In the second part, we have established the ordinal estimates of the orthoprojective widths of the classes $$ {L}_{\beta, p}^{\psi }, $$ 1 < p < 1, in the same space, as well as the estimates of another approximative characteristic which is close, in a definite meaning, to the orthoprojective width.

In the present note, which is a marginalia to the previous papers by Roozbeh Hazrat, Alexei Stepanov, Zuhong Zhang, and the author, I observe that for any ideals A,B≤R of a commutative ring R and all n ≥ 3 the birelative standard commutator formula also holds in the unrelativized form, as [E(n,A),GL(n,B)] = [E(n,A),E(n,B)] and discuss some obvious corollaries thereof.

A set of additive subgroups σ = (σij), 1 ≤ i, j ≤ n, of a field (or ring) K is called a net of order n over K if σirσrj ⊆ σij for all values of the indices i, r, j. The same system, but without diagonal, is called an elementary net. A full or elementary net σ = (σij) is said to be irreducible if all the additive subgroups σij are different from zero. An elementary net σ is closed if the subgroup E(σ) does not contain new elementary transvections. The present paper is related to a question posed by Y. N. Nuzhin in connection with V. M. Levchuk’s question No. 15.46 from the Kourovka notebook about the admissibility (closure) of elementary net (carpet) σ = (σij) over a field K. Let J be an arbitrary subset of {1, . . . , n}, n ≥ 3, and the cardinality m of J satisfies the condition 2 ≤ m ≤ n − 1. Let R be a commutative integral domain (non-field) with identity, and let K be the quotient field of R. An example of a net σ = (σij) of order n over K, for which the group E(σ) ∩ 〈tij(K) : i, j ∈ J〉 is not contained in the group 〈tij(σij) : i, j ∈ J〉, is constructed.

The paper presents new nonsingularity conditions for n ×n matrices, which involve a subset S of the index set {1, . . ., n} and take into consideration the matrix sparsity pattern. It is shown that the matrices satisfying these conditions form a subclass of the class of nonsingular $$ \mathcal{H} $$ -matrices, which contains some known matrix classes such as the class of doubly strictly diagonally dominant (DSDD) matrices and the class of Dashnic–Zusmanovich type (DZT) matrices. The nonsingularity conditions established are used to obtain the corresponding eigenvalue inclusion sets, which, in their turn, are used in deriving new inclusion sets for the singular values of a square matrix, improving some recently suggested ones.

The paper is mainly devoted to studying the so-called Dashnic–Zusmanovich type (DZT) matrices, introduced recently. Interrelations among the DZT matrices and related subclasses of the class of nonsingular $$ \mathcal{H} $$ -matrices, namely, the Dashnic–Zusmanovich (DZ) and S-SDD matrices are considered. Upper bounds for the l∞-norms of the inverses to DZT, DZ, and strictly diagonally dominant (SDD) matrices are obtained. A new eigenvalue inclusion set is provided.

It is shown that every solution of the matrix equation in the title of the paper, where n = 2m, can be transformed by a symmetric permutation of its rows and columns to a direct sum of two triangular Toeplitz matrices of order m.

Let r4(n) denote the number of representations of n as a sum of four squares. The generating function ζ4(s) is Epstein’s zeta function. The paper considers the Riesz mean $$ {D}_{\rho}\left(x;{\zeta}_4\right)=\frac{1}{\Gamma \left(\rho +1\right)}\sum \limits_{n\le x}{\left(x-n\right)}^{\rho }{r}_4(n) $$ for an arbitrary fixed ρ > 0. The error term Δρ(x; ζ4) is defined by $$ {D}_{\rho}\left(x;{\zeta}_4\right)=\frac{\uppi^2{x}^{2+\rho }}{\Gamma \left(\rho +3\right)}+\frac{x^{\rho }}{\Gamma \left(\rho +1\right)}{\zeta}_4(0)+{\Delta}_{\rho}\left(x;{\zeta}_4\right). $$ It is proved that $$ {\Delta}_4\left(x;{\zeta}_4\right)=\Big\{{\displaystyle \begin{array}{ll}O\left({x}^{1/2+\rho +\varepsilon}\right)& \left(1

The paper is devoted to the problem of finding the exact constant $$ {W}_2^{\ast } $$ in the inequality ‖f‖ ≤ K ⋅ ω2(f, 1) for bounded functions f with the property $$ \underset{k}{\overset{k+1}{\int }}f(x) dx=0,\kern0.5em k\in \mathrm{\mathbb{Z}}. $$ Our approach allows us to reduce the known range for the desired constant as well as the set of functions involved in the extremal problem for finding the constant in question. It is shown that $$ {W}_2^{\ast } $$ also turns out to be the exact constant in a related Jackson–Stechkin type inequality.

In this paper, we study generalized soluble groups with restriction on normal closures of cyclic subgroups. A group G is said to have finite Hirsch–Zaitsev rank if G has an ascending series whose factors are either infinite cyclic or periodic and if the number of infinite cyclic factors is finite. It is not hard to see that the number of infinite cyclic factors in each of such series is an invariant of a group G. This invariant is called the Hirsch–Zaitsev rank of G and will be denoted by rhz(G). We study the groups in which the normal closure of every cyclic subgroup has the Hirsch–Zaitsev rank at most b (b is some positive integer). For some natural restrictions we find a function k1(b) such that rhz([G/Tor(G),G/Tor(G)]) ≤ k1(b).

Let A be an involution ring, e1 , . . . , en be a full system of Hermitian idempotents in A, let every ei generate A as a two-sided ideal, and 2 ∈ A∗. In this paper, the normalizers of the groups Ep(2,A) · E(2,A, I) are calculated under natural assumptions on A, where Ep(2,A) denotes the elementary symplectic group, E(2,A, I) stands for the elementary subgroup of level I.

In this paper, we consider the question of determinability of an Abelian group by its automorphism group in the class of completely decomposable torsion-free Abelian groups whose direct summands of rank 1 have idempotent types.

Let Pk(n) be the difference between the number of points of the integer lattice contained in the ball $$ {y}_1^2+\cdots {y}_k^2\le n $$ and the volume of this ball. The paper investigates the asymptotic behavior of the sums $$ \sum_{n\le x}{P}_k(n)\kern0.5em \left(k\ge 4\right),\kern0.5em \sum_{n\le x}{P}_3^2(n),\kern0.5em \sum_{n\le x}{P}_4^2(n)\kern1em as\kern0.5em x\to +\infty . $$

The paper considers the problem on the dimensions of intersections of a subspace in the direct sum of a finite series of finite-dimensional vector spaces with sums of pairs of direct summands, provided that the subspace intersection with each of these direct summands is trivial. The problem naturally splits into finding conditions for the existence and representability of the corresponding matroid. The following theorem is proved: If the ranks of all the unions of a series of blocks satisfying the condition on the ranks of subsets in the matroid are given and the blocks have full rank, then this partial rank function may be extended to a full rank function for all the subsets of the base set (the union of all the blocks). Necessary and sufficient conditions on the dimensions of the direct summands and intersections mentioned above for the corresponding matroid to exist are obtained in the case of five direct summands. Bibliography: 5 titles.

In the paper, the structure of the $$ \mathcal{O} $$ K [G]-module F( $$ \mathfrak{m} $$ M ) is described, where M/L, L/K, and K/ℚ p are finite Galois extensions (p is a fixed prime number), G = Gal(M/L), $$ \mathfrak{m} $$ M is a maximal ideal of the ring of integers $$ \mathcal{O} $$ M, and F is a Lubin–Tate formal group law over the ring $$ \mathcal{O} $$ K for a fixed uniformizer π.

In this paper, we examine the problem on the existence of best approximation elements in functional spaces with nonsymmetric norms and sign-sensitive weights.

In the paper, we consider the complete semigroup of binary relations defined by semilattices of the class Σ3(X, 8). We give a full description of idempotent elements for the case where X is a finite set and Z7 ≠ O and obtain the formulas for the number of idempotent elements of the corresponding semigroup.

A stratification of the manifold of all square matrices is considered. One equivalence class consists of the matrices with the same sets of values of rank(A − λi I)j . The stratification is consistent with a fibration on submanifolds of matrices similar to each other, i.e., with the adjoint orbits fibration. Internal structures of matrices from one equivalence class are very similar; among other factors, their (co)adjoint orbits are birationally symplectomorphic. The Young tableaux technique developed in the paper describes this stratification and the fibration of the strata on (co)adjoint orbits.

The paper contains a survey of results about the possibility of inscribing convex polygons of particular types into a plane convex figure. It is proved that if K is a smooth convex figure, then K is circumscribed either about four different reflection-symmetric, convex, equilateral pentagons or about a regular pentagon. Let S be a family of convex hexagons whose vertices are the vertices of two negatively homothetic equilateral triangles with common center. It is proved that if K is a smooth convex figure, then K is circumscribed either about a hexagon in S or about two pentagons with vertices at the vertices of two hexagons in S. In the latter case, the sixth vertex of one of the hexagons lies outside K, while the sixth vertex of another one lies inside K.

Let L be the Laplace matrix of a weighted digraph. The aim of the paper is to establish a simple way for computing any coefficient of the characteristic polynomial of L as a constant sign sum over the incoming spanning forests. The idea is to express L as the product of generalized (weighted) incidence matrices. It turns out that the minors of them can be studied in terms of the tree-like structure of the digraph. This makes it possible to compute the minors of L.

A graph is k-connected if it has at least k+1 vertices and remains connected after deleting any k−1 vertices. A k-connected graph is said to be minimal if any its subgraph obtained by deleting any edge is not k-connected. W. Mader proved that any minimal k-connected graph with n vertices has at least $$ \frac{\left(k-1\right)n+2k}{2k-1} $$ vertices of degree k. The main result of the present paper is that any minimal k-connected graph with minimal number of vertices of degree k is isomorphic to a graph G k,T , where T is a tree the maximal vertex degree of which is at most k + 1. The graph G k,T is constructed from k disjoint copies of the tree T in the following way. If a is a vertex of T of degree j and a 1 , . . . , a k are the corresponding vertices of the copies of T, then k + 1 − j new vertices of degree k, which are adjacent to {a 1 , . . . , a k }, are added. Bibliography: 10 titles.

A cut of a k-connected graph G is a k-element cutset of it, which contains at least one edge. The tree of cuts of a set , consisting of pairwise independent cuts of a k-connected graph, is defined in the following way. Its vertices are the cuts of the set and the parts of the decomposition of G induced by these cuts. A part A is adjacent to a cut S if and only if A contains all the vertices of S and exactly one end of each edge of S. It is proved that the defined graph is a tree, some properties of which are similar to the corresponding properties of the classic tree of blocks and cutpoints. In the second part of the paper, the tree of cuts is used to study minimal k-connected graphs for k ≤ 5. Bibliography: 11 titles.

In this paper, we obtain a result which implies, in particular, that for a quaternion z ∉ {−1, 1} with |z| = 1, the sum range of the series \( {\displaystyle \sum_n\frac{z^n}{n}} \) is a closed proper subfield of the division ring of quaternions ℍ isometrically isomorphic to the field of complex numbers ℂ.