Torsion-free modules with UA-rings of endomorphisms

An associative ring R is called a unique addition ring (UA-ring) if its multiplicative semigroup (R, · ) can be equipped with a unique binary operation+ transforming the triple (R, ·, +) to a ring. An R-module A is said to be an End-UA-module if the endomorphism ring End _R (A) of A is a UA-ring. In the paper, the torsion-free End-UA-modules over commutative Dedekind domains are studied. In some classes of Abelian torsion-free groups, the Abelian groups having UA-endomorphism rings are found.     

Polyboxes,Cube Tilings and Rigidity

A non-empty subset A of X=X ₁×???×X _d is a (proper) box if A=A ₁×???×A _d and A _i ?X _i for each i. Suppose that for each pair of boxes A, B and each i, one can only know which of the three states takes place: A _i =B _i , A _i =X _i ?B _i , A _i ?{B _i ,X _i ?B _i }. Let F and G be two systems of disjoint boxes. Can one decide whether ∪F=∪G? In general, the answer is ‘no’, but as is shown in the paper, it is ‘yes’ if both systems consist of pairwise dichotomous boxes. (Boxes A, B are dichotomous if there is i such that A _i =X _i ?B _i .) Several criteria that enable to compare such systems are collected. The paper includes also rigidity results, which say what assumptions have to be imposed on F to ensure that ∪F=∪G implies F=G. As an application, the rigidity conjecture for 2-extremal cube tilings of Lagarias and Shor is verified.     

Block partitions of sequences

Given a sequence A = (a ₁, …, a _n ) of real numbers, a block B of A is either a set B = {a _i , a _i+1, …, a _j } where i ≤ j or the empty set. The size b of a block B is the sum of its elements. We show that when each a _i ∈ [0, 1] and k is a positive integer, there is a partition of A into k blocks B ₁, …, B _k with |b _i ?b _j | ≤ 1 for every i, j. We extend this result in several directions.     

Palindromic widths of nilpotent and wreath products

We prove that the nilpotent product of a set of groups A ₁,…,A _s has finite palindromic width if and only if the palindromic widths of A _i ,i=1,…,s,are finite. We give a new proof that the commutator width of F _n ?K is infinite, where F _n is a free group of rank n≥2 and K is a finite group. This result, combining with a result of Fink [9] gives examples of groups with infinite commutator width but finite palindromic width with respect to some generating set.     

Splitting length of abelian mixed groups of torsion-free rank 1

The splitting length of a mixed Abelian group G is defined as the smallest positive integer n such that \( \mathop \otimes \limits^n G \) splits. The task of determining the splitting length of mixed Abelian groups was formulated by Irwin, Khabbaz, and Rayna. In this paper, a criterion for determining whether \( \mathop \otimes \limits^n G \) splits for countable mixed Abelian groups G of torsion-free rank 1 is found.     

A gradual rank increasing process for matrix completion

The matrix completion problem is easy to state: let A be a given data matrix in which some entries are unknown. Then, it is needed to assign “appropriate values” to these entries. A common way to solve this problem is to compute a rank-k matrix, B _k , that approximates A in a least squares sense. Then, the unknown entries in A attain the values of the corresponding entries in B _k . This raises the question of how to determine a suitable matrix rank. The method proposed in this paper attempts to answer this question. It builds a finite sequence of matrices \(B_{k}, k = 1, 2, \dots \), where B _k is a rank-k matrix that approximates A in a least squares sense. The computational effort is reduced by using B _k-1 as starting point in the computation of B _k . The ability of B _k to serve as substitute for A is measured with two objective functions: a “training” function that measures the distance between the known part of A and the corresponding part of B _k , and a “probe” function that assesses the quality of the imputed entries. Watching the changes in these functions as k increases enables us to find an optimal matrix rank. Numerical experiments illustrate the usefulness of the proposed approach.     

A criterion for the <Emphasis Type="Italic">F</Emphasis> <Subscript> <Emphasis Type="Italic">π</Emphasis> </Subscript>-residuality of free products with amalgamated cyclic subgroup of nilpotent groups of finite ranks

Let G be the free product of nilpotent groups A and B of finite rank with amalgamated cyclic subgroup H, H ≠ A and H ≠ B. Suppose that, for some set π of primes, the groups A and B are residually F_π, where F_π is the class of all finite p-groups. We prove that G is residually F_π if and only if H is F_π-separable in A and B.     

Turán-Type Results for Complete <Emphasis Type="Italic">h</Emphasis>-Partite Graphs in Comparability and Incomparability Graphs

We consider an h-partite version of Dilworth’s theorem with multiple partial orders. Let P be a finite set, and let <₁,...,< _r be partial orders on P. Let G(P, <₁,...,< _r ) be the graph whose vertices are the elements of P, and x, y ∈ P are joined by an edge if x< _i y or y< _i x holds for some 1 ≤ i ≤ r. We show that if the edge density of G(P, <₁, ... , < _r ) is strictly larger than 1 ? 1/(2h ? 2) ^r , then P contains h disjoint sets A ₁, ... , A _h such that A ₁ < _j ... < _j A _h holds for some 1 ≤ j ≤ r, and |A ₁| = ... = |A _h | = Ω(|P|). Also, we show that if the complement of G(P, <) has edge density strictly larger than 1 ? 1/(3h ? 3), then P contains h disjoint sets A ₁, ... , A _h such that the elements of A _i are incomparable with the elements of A _j for 1 ≤ i < j ≤ h, and |A ₁| = ... = |A _h | = |P|^1?o(1). Finally, we prove that if the edge density of the complement of G(P, <₁, <₂) is α, then there are disjoint sets A, B ? P such that any element of A is incomparable with any element of B in both <₁ and <₂, and |A| = |B| > n ^1?γ(α), where γ(α) → 0 as α → 1. We provide a few applications of these results in combinatorial geometry, as well.     

On the nonexistence of solutions of some anisotropic elliptic and backward parabolic inequalities

We study the nonexistence of weak solutions of higher-order elliptic and parabolic inequalities of the following types: \(\sum {_{i = 1}^N\sum\nolimits_{{e_i} \leqslant {\alpha _i} \leqslant {m_i}} {D_{{x_i}}^{{\alpha _i}}\left( {{A_{{\alpha _i}}}\left( {x,u} \right)} \right)} \geqslant f\left( {x,u} \right),} x \in {\mathbb{R}^N}\), and \({u_t} + \sum {_{i = 1}^N\sum\nolimits_{{k_i} \leqslant {\beta _i} \leqslant {n_i}} {D_{{x_i}}^{{\beta _i}}\left( {{B_{{\beta _i}}}\left( {x,t,u} \right)} \right)} > g\left( {x,t,u} \right),\left( {x,t} \right)} \in {\mathbb{R}^N} \times {\mathbb{R}_ + }\), where l _i , m _i , k _i , n _i ∈ N satisfy the condition l _i , k _i > 1 for all i = 1,..., N, and A _αi (x, u), B _βi (x, t, u), f(x, u), and g(x, t, u) are some given Carathéodory functions. Under appropriate conditions on the functions A _αi , B _βi , f, and g, we prove theorems on the nonexistence of solutions of these inequalities.     

Homological Epimorphisms, Compactly Generated t-Structures and Gorenstein-Projective Modules

The aim of this paper is two-fold. Given a recollement (T′, T, T″, i*, i_*, i^!, j_!, j*, j_*), where T′, T, T″ are triangulated categories with small coproducts and T is compactly generated. First, the authors show that the BBD-induction of compactly generated t-structures is compactly generated when i_* preserves compact objects. As a con-sequence, given a ladder (T′, T, T″, T, T′) of height 2, then the certain BBD-induction of compactly generated t-structures is compactly generated. The authors apply them to the recollements induced by homological ring epimorphisms. This is the first part of their work. Given a recollement (D(B-Mod),D(A-Mod),D(C-Mod), i*, i_*, i^!, j_!, j*, j_*) induced by a homological ring epimorphism, the last aim of this work is to show that if A is Gorenstein, _A B has finite projective dimension and j_! restricts to D ^b (C-mod), then this recollement induces an unbounded ladder (B-Gproj,A-Gproj, C-Gproj) of stable categories of finitely generated Gorenstein-projective modules. Some examples are described.     

Minimal logarithmic signatures for classical groups

The minimal logarithmic signature conjecture states that in any finite simple group there are subsets A _i , 1 ≤ i ≤ k such that the size |A _i | of each A _i is a prime or 4 and each element of the group has a unique expression as a product \({\prod_{i=1}^k x_i}\) of elements \({x_i \in A_i}\). The conjecture is known to be true for several families of simple groups. In this paper the conjecture is shown to be true for the groups \({\Omega^-_{2m}(q), \Omega^+_{2m}(q)}\), when q is even, by studying the action on suitable spreads in the corresponding projective spaces. It is also shown that the method can be used for the finite symplectic groups. The construction in fact gives cyclic minimal logarithmic signatures in which each A _i is of the form \({\{y_i^j \ |\ 0 \leq j < |A_i|\}}\) for some element y _i of order ≥ |A _i |.     

Torsion-free constructive nilpotent <Emphasis Type="Italic">R</Emphasis><Subscript><Emphasis Type="Italic">p</Emphasis></Subscript>-groups

We consider a torsion-free nilpotent R _p -group, the p-rank of whose quotient by the commutant is equal to 1 and either the rank of the center by the commutant is infinite or the rank of the group by the commutant is finite. We prove that the group is constructivizable if and only if it is isomorphic to the central extension of some divisible torsion-free constructive abelian group by some torsion-free constructive abelian R _p -group with a computably enumerable basis and a computable system of commutators. We obtain similar criteria for groups of that type as well as divisible groups to be positively defined. We also obtain sufficient conditions for the constructivizability of positively defined groups.     

On a recursive inverse eigenvalue problem

Let s ₁, ..., s _n be arbitrary complex scalars. It is required to construct an n × n normal matrix A such that s _i is an eigenvalue of the leading principal submatrix A _i , i = 1, 2, ..., n. It is shown that, along with the obvious diagonal solution diag(s ₁, ..., s _n ), this problem always admits a much more interesting nondiagonal solution A. As a rule, this solution is a dense matrix; with the diagonal solution, it shares the property that each submatrix A _i is itself a normal matrix, which implies interesting connections between the spectra of the neighboring submatrices A _i and A _{i + 1}.     

Multiple commutator formulas for unitary groups

Let (A,Λ) be a formring such that A is quasi-finite R-algebra (i.e., a direct limit of module finite algebras) with identity. We consider the hyperbolic Bak’s unitary groups GU(2n, A, Λ), n ≥ 3. For a form ideal (I, Γ) of the form ring (A, Λ) we denote by EU(2n, I, Γ) and GU(2n, I, Γ) the relative elementary group and the principal congruence subgroup of level (I, Γ), respectively. Now, let (I _i , Γ _i ), i = 0,...,m, be form ideals of the form ring (A, Λ). The main result of the present paper is the following multiple commutator formula: [EU(2n, I ₀, Γ ₀),GU(2n, I ₁, Γ ₁), GU(2n, I ₂, Γ ₂),..., GU(2n, I _m , Γ _m )] =[EU(2n, I ₀, Γ ₀), EU(2n, I ₁, Γ ₁), EU(2n, I ₂, Γ ₂),..., EU(2n, I _m , Γ _m )], which is a broad generalization of the standard commutator formulas. This result contains all previous results on commutator formulas for classicallike groups over commutative and finite-dimensional rings.     

Two Bilinear (3 × 3)-Matrix Multiplication Algorithms of Complexity 25

As is known, a bilinear algorithm for multiplying 3 × 3 matrices can be constructed by using ordered triples of 3 × 3 matrices A _ρ , B _ρ , C _ρ , \(\rho = \overline {1,r} ,\) where r is the complexity of the algorithm. Algorithms with various symmetries are being extensively studied. This paper presents two algorithms of complexity 25 possessing the following two properties (symmetries): (1) the matricesA₁,B₁, and C1 are identity, (2) if the algorithm involves a tripleA, B, C, then it also involves the triples B, C, A and C, A, B. For example, these properties are inherent in the well-known Strassen algorithm for multiplying 2 × 2 matrices. Many existing (3 × 3)-matrix multiplication algorithms have property (2). Methods for finding new algorithms are proposed. It is shown that the found algorithms are different and new.     

On a question of Sárközy on gaps of product sequences

Motivated by a question of Sárközy, we study the gaps in the product sequence B = A · A = {b ₁ < b ₂ < …} of all products a _i a _j with a _i , a _j ∈ A when A has upper Banach density α > 0. We prove that there are infinitely many gaps b _n+1 ? b _n ? α ^?3 and that for t ≥ 2 there are infinitely many t-gaps b _n+t ? b _n ? t ² α ^?4. Furthermore, we prove that these estimates are best possible.We also discuss a related question about the cardinality of the quotient set A/A = {a _i /a _j , a _i , a _j ∈ A} when A ? {1, …, N} and |A| = αN.     

Note: A conjecture on partitions of groups

We conjecture that every infinite group G can be partitioned into countably many cells \(G = \bigcup\limits_{n \in \omega } {A_n }\) such that cov(A _n A _n ^?1 ) = |G| for each n ∈ ω Here cov(A) = min{|X|: X} ? G, G = X A}. We confirm this conjecture for each group of regular cardinality and for some groups (in particular, Abelian) of an arbitrary cardinality.     

<Emphasis Type="Italic">θ</Emphasis>-Pairs for 2-maximal subgroups of finite groups

Let H, A and B be subgroups of a group G. We call the pair (A, B) a θ-pair for H in G if: (i) \({\langle H, A\rangle=G}\) and B = (A ∩ H) _G ; (ii) if A ₁/B is a proper subgroup of A/B and \({{A_1/B \vartriangleleft G/B}}\), then \({G\neq \langle H, A_1\rangle}\). In this paper, we study the θ-pairs for 2-maximal subgroups of a group, which imply a group to be solvable or supersolvable.     

On a Problem Related to Homomorphism Groups in the Theory of Abelian Groups

In this paper, for any reduced Abelian group A whose torsion-free rank is infinite, we construct a countable set A(A) of Abelian groups connected with the group A in a definite way and such that for any two different groups B and C from the set A(A) the groups B and C are isomorphic but Hom(B,X) ? Hom(C,X) for any Abelian group X. The construction of such a set of Abelian groups is closely connected with Problem 34 from L. Fuchs’ book “Infinite Abelian Groups,” Vol. 1.     

Dn,r is not potentially nilpotent for n ⩾ 4r − 2

An n × n sign pattern A is said to be potentially nilpotent if there exists a nilpotent real matrix B with the same sign pattern as A. Let D_n,r be an n × n sign pattern with 2 ≤ r ≤ n such that the superdiagonal and the (n, n) entries are positive, the (i, 1) (i = 1,..., r) and (i, i ? r + 1) (i = r + 1,..., n) entries are negative, and zeros elsewhere. We prove that for r ≥ 3 and n ≥ 4r ? 2, the sign pattern D_n,r is not potentially nilpotent, and so not spectrally arbitrary.