Vol 60, No 3 (2019)
- Year: 2019
- Articles: 16
- URL: https://journals.rcsi.science/0037-4466/issue/view/10505
Article
Finite Homomorphic Images of Groups of Finite Rank
Abstract
Let π be a finite set of primes. We prove that each soluble group of finite rank contains a finite index subgroup whose every finite homomorphic π-image is nilpotent. A similar assertion is proved for a finitely generated group of finite rank. These statements are obtained as a consequence of the following result of the article: Each soluble pro-π-group of finite rank has an open normal pronilpotent subgroup.
On Decidability of List Structures
Abstract
The paper studies computability-theoretic complexity of various structures that are based on the list data type. The list structure over a structure S consists of the two sorts of elements: The first sort is atoms from S, and the second sort is finite linear lists of atoms. The signature of the list structure contains the signature of S, the empty list nil, and the binary operation of appending an atom to a list. The enriched list structure over S is obtained by enriching the signature with additional functions and relations: obtaining a head of a list, getting a tail of a list, “an atom x occurs in a list Y,” and “a list X is an initial segment of a list Y.” We prove that the first-order theory of the enriched list structure over (ω, +), i.e. the monoid of naturals under addition, is computably isomorphic to the first-order arithmetic. In particular, this implies that the transformation of a structure S into the enriched list structure over S does not always preserve the decidability of first-order theories. We show that the list structure over S can be presented by a finite word automaton if and only if S is finite.
On σ-Embedded and σ-n-Embedded Subgroups of Finite Groups
Abstract
Let G be a finite group, and let σ = {σi | i ∈ I} be a partition of the set of all primes ℙ and σ(G) = {σi | σi ∩ π(G) ≠ ∅}. A set ℋ of subgroups of G is said to be a complete Hall σ-set of G if each nonidentity member of ℋ is a Hall σi-subgroup of G and ℋ has exactly one Hall σi-subgroup of G for every σi ∈ σ (G). A subgroup H of G is said to be σ-permutable in G if G possesses a complete Hall σ-set ℋ such that HAx = AxH for all A ∈ ℋ and x ∈ G. A subgroup H of G is said to be σ-n-embedded in G if there exists a normal subgroup T of G such that HT = HG and H ∩ T ≤ HσG, where HσG is the subgroup of H generated by all those subgroups of H that are σ-permutable in G. A subgroup H of G is said to be σ-embedded in G if there exists a σ-permutable subgroup T of G such that HT = HσG and H ∩ T ≤ HσG, where HσG is the intersection of all σ-permutable subgroups of G containing H. We study the structure of finite groups under the condition that some given subgroups of G are σ-embedded and σ-n-embedded. In particular, we give the conditions for a normal subgroup of G to be hypercyclically embedded.
Low Faces of Restricted Degree in 3-Polytopes
Abstract
The degree of a vertex or face in a 3-polytope is the number of incident edges. A k-face is one of degree k, a k−-face has degree at most k. The height of a face is the maximum degree of its incident vertices; and the height of a 3-polytope, h, is the minimum height of its faces. A face is pyramidal if it is either a 4-face incident with three 3-vertices or a 3-face incident with two vertices of degree at most 4. If pyramidal faces are allowed, then h can be arbitrarily large; and so we assume the absence of pyramidal faces in what follows. In 1940, Lebesgue proved that each quadrangulated 3-polytope has a face f with h(f) ≤ 11. In 1995, this bound was lowered by Avgustinovich and Borodin to 10. Recently, we improved it to the sharp bound 8. For plane triangulation without 4-vertices, Borodin (1992), confirming the Kotzig conjecture of 1979, proved that h ≤ 20, which bound is sharp. Later, Borodin proved that h ≤ 20 for all triangulated 3-polytopes. In 1996, Horňák and Jendrol’ proved for arbitrarily polytopes that h ≤ 23. Recently, we obtained the sharp bounds h ≤ 10 for triangle-free polytopes and h ≤ 20 for arbitrary polytopes. Later, Borodin, Bykov, and Ivanova refined the latter result by proving that any polytope has a 10−-face of height at most 20, where 10 and 20 are sharp. Also, we proved that any polytope has a 5−-face of height at most 30, where 30 is sharp and improves the upper bound of 39 obtained by Horňák and Jendrol’ (1996). In this paper we prove that every polytope has a 6−-face of height at most 22, where 6 and 22 are best possible. Since there is a construction in which every face of degree from 6 to 9 has height 22, we now know everything concerning the maximum heights of restricted-degree faces in 3-polytopes.
An Exact Inequality of Jackson-Chernykh Type for Spline Approximations of Periodic Functions
Abstract
We establish the inequality with exact constant for spline approximations of periodic functions which is similar to the Jackson-Chernykh inequality for approximations by trigonometric polynomials. We study the question of the least step in the obtained inequality.
On the Solvability of Some Dynamic Poroelastic Problems
Abstract
We consider the direct problems for poroelasticity equations. In the low-frequency approximation we prove existence and uniqueness theorems for the solution to a certain mixed problem. In the high-frequency approximation we establish the uniqueness of a weak solution to the mixed problem and its continuous dependence on the data in the cases of bounded and unbounded temporal intervals and for however many spatial variables.
To the Spectral Theory of Partially Ordered Sets
Abstract
We suggest an approach to advance the spectral theory of posets. The validity of the Hofmann-Mislove Theorem is established for posets and a characterization is obtained of the sober topological spaces as spectra of posets with topology. Also we describe the essential completions of topological spaces in terms of spectra of posets with topology. Apart from that, some sufficient conditions are found for two extensions of a topological space to be homeomorphic.
Partial Decidable Presentations in Hyperarithmetic
Abstract
We study the problem of the existence of decidable and positive \(\Pi_1^1\)- and \(\Sigma_1^1\)-numberings of the families of \(\Pi_1^1\)- and \(\Sigma_1^1\)-cones with respect to inclusion. Some laws are found that reflect the presence of decidable computable \(\Pi_1^1\)- and \(\Sigma_1^1\)-numberings of these families in dependence on the analytical complexity of the set defining a cone.
Multianisotropic Integral Operators Defined by Regular Equations
Abstract
The article continues the authors’ previous research, where they are proved the well-posed solvability of regular equations in ℝn and the Dirichlet problem in \(\mathbb{R}_+^n\). We define a scale of weighted spaces in which the regular operators are correctly solvable. Approximate solutions to the corresponding Dirichlet problem are constructed with the use of integral operators.
Decompositions of Dual Automorphism Invariant Modules over Semiperfect Rings
Abstract
A module M is called dual automorphism invariant if whenever X1 and X2 are small submodules of M, then each epimorphism f : M/X1 → M/X2 lifts to an endomorphism g of M. A module M is said to be d-square free (dual square free) if whenever some factor module of M is isomorphic to N2 for a module N then N = 0. We show that each dual automorphism invariant module over a semiperfect ring which is a small epimorphic image of a projective lifting module is a direct sum of cyclic indecomposable d-square free modules. Moreover, we prove that for each module M over a semiperfect ring which is a small epimorphic image of a projective lifting module (e.g., M is a finitely generated module), M is dual automorphism invariant iff M is pseudoprojective. Also, we give the necessary and sufficient conditions for a dual automorphism invariant module over a right perfect ring to be quasiprojective.
The Partial Clone of Linear Tree Languages
Abstract
A term, also called a tree, is said to be linear, if each variable occurs in the term only once. The linear terms and sets of linear terms, the so-called linear tree languages, play some role in automata theory and in the theory of formal languages in connection with recognizability. We define a partial superposition operation on sets of linear trees of a given type τ and study the properties of some many-sorted partial clones that have sets of linear trees as elements and partial superposition operations as fundamental operations. The endomorphisms of those algebras correspond to nondeterministic linear hypersubstitutions.
Lie-Admissible Algebras Associated with Dynamical Systems
Abstract
We introduce the general structures of Lie-admissible algebras in the spaces of Gâteaux differentiable operators and establish their connection with the symmetries of operator equations and the mechanics of infinite-dimensional systems.
The Discrete Wiener-Hopf Equation with Probability Kernel of Oscillating Type
Abstract
We prove the existence of a solution to the discrete inhomogeneous Wiener-Hopf equation whose kernel is an arithmetic probability distribution generating an oscillating random walk. Asymptotic properties of the solution are established depending on the properties of the inhomogeneous term of the equation and its kernel.
Isomorphisms of Lattices of Subalgebras of Semifields of Positive Continuous Functions
Abstract
We consider the lattice of subalgebras of a semifield U(X) of positive continuous functions on an arbitrary topological space X and its sublattice of subalgebras with unity. We prove that each isomorphism of the lattices of subalgebras with unity of semifields U(X) and U(Y) is induced by a unique isomorphism of the semifields. The same result holds for lattices of all subalgebras excluding the case of the double-point Tychonoff extension of spaces.
Approximation Properties of Repeated de la Vallée-Poussin Means for Piecewise Smooth Functions
Abstract
Basing on Fourier’s trigonometric sums and the classical de la Vallée-Poussin means, we introduce the repeated de la Vallée-Poussin means. Under study are the approximation properties of the repeated means for piecewise smooth functions. We prove that the repeated means achieve the rate of approximation for the discontinuous piecewise smooth functions which is one or two order higher than the classical de la Vallée-Poussin means and the partial Fourier sums respectively.