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.     

Calculating the Isotropic Subspace of a Symmetric Quasi-Definite Matrix

Solutions to the sesquilinear matrix equation X*DX + AX + X*B + C = 0, where all matrices are of size n × n, are put in correspondence with n-dimensional neutral (or isotropic) subspaces of the associated matrix M of order 2n. A way of constructing such subspaces is proposed for when M is a symmetric quasi-definite matrix of the (n, n) type.     

Non-Hermitian matrices of even order and neutral subspaces of half the dimension

Consider the sesquilinearmatrix equation X*DX + AX + X*B + C = 0, where all the matrices are square and have the same order n. With this equation, we associate a block matrix M of double order 2n. The solvability of the above equation turns out to be related to the existence of n-dimensional neutral subspaces for the matrix M. We indicate sufficiently general conditions ensuring the existence of such subspaces.     

Finite configurations in sparse sets

Let E ? ?ⁿ be a closed set of Hausdorff dimension α. For m > n, let{B₁, …, B_k} be n × (m ? n) matrices. We prove that if the system of matrices B_j is non-degenerate in a suitable sense, α is sufficiently close to n, and if E supports a probability measure obeying appropriate dimensionality and Fourier decay conditions, then for a range of m depending on n and k, the set E contains a translate of a non-trivial k-point configuration {B₁y, …, B_ky}. As a consequence, we are able to establish existence of certain geometric configurations in Salem sets (such as parallelograms in ?ⁿ and isosceles right triangles in ?²). This can be viewed as a multidimensional analogue of the result of [25] on 3-term arithmetic progressions in subsets of ?.     

Numerical Solution of a Semilinear Matrix Equation of the Stein Type in the Normal Case

It is known that the solution of the semilinear matrix equation X ? AX*B = C can be reduced to solving the classical Stein equation. The normal case means that the coefficients on the left-hand side of the resulting equation are normal matrices. A technique for solving the original semilinear equation in the normal case is proposed. For equations of the order n = 3000, this allows us to cut the time of computation almost in half, compared toMatlab’s library function dlyap, which solves Stein equations in the Matlab package.     

A Mayer–Vietoris Formula for Persistent Homology with an Application to Shape Recognition in the Presence of Occlusions

In algebraic topology it is well known that, using the Mayer–Vietoris sequence, the homology of a space X can be studied by splitting X into subspaces A and B and computing the homology of A, B, and A∩B. A natural question is: To what extent does persistent homology benefit from a similar property? In this paper we show that persistent homology has a Mayer–Vietoris sequence that is generally not exact but only of order 2. However, we obtain a Mayer–Vietoris formula involving the ranks of the persistent homology groups of X, A, B, and A∩B plus three extra terms. This implies that persistent homological features of A and B can be found either as persistent homological features of X or of A∩B. As an application of this result, we show that persistence diagrams are able to recognize an occluded shape by showing a common subset of points.     

Accurate solutions of <Emphasis Type="Italic">M</Emphasis>-matrix Sylvester equations

This paper is concerned with a relative perturbation theory and its entrywise relatively accurate numerical solutions of an M-matrix Sylvester equation AX + XB = C by which we mean both A and B have positive diagonal entries and nonpositive off-diagonal entries and \({P=I_m \otimes A+B^{\rm T} \otimes I_n}\) is a nonsingular M-matrix, and C is entrywise nonnegative. It is proved that small relative perturbations to the entries of A, B, and C introduce small relative errors to the entries of the solution X. Thus the smaller entries of X do not suffer bigger relative errors than its larger entries, unlikely the existing perturbation theory for (general) Sylvester equations. We then discuss some minor but crucial implementation changes to three existing numerical methods so that they can be used to compute X as accurately as the input data deserve.     

X-quasinormal subgroups

Considering two subgroups A and B of a group G and ? ≠ X ? G, we say that A is X-permutable with B if AB ^x = B ^x A for some element x ∈ X. We use this concept to give new characterizations of the classes of solvable, supersolvable, and nilpotent finite groups.     

On semiconjugate rational functions

We investigate semiconjugate rational functions, that is rational functions A, B related by the functional equation \({A \circ X = X \circ B}\), where X is a rational function. We show that if A and B is a pair of such functions, then either A can be obtained from B by a certain iterative process, or A and B can be described in terms of orbifolds of non-negative Euler characteristic on the Riemann sphere.     

Removable Singularities of Solutions of the Minimal Surface Equation

Suppose that G is a bounded domain in ? ⁿ (n ? 2), E ≠ G is a relatively closed set in G, and 0 < α < 1. We prove that E is removable for solutions of the minimal surface equation in the class C ^1,α(G)_loc if and only if the (n ? 1 + α)-dimensional Hausdorff measure of E is zero.     

An analysis of the matrix equation <Emphasis Type="Italic">AX + X̄B = C</Emphasis>

The matrix equation AX + X?B = C, where X?B is obtained by the entry-wise conjugation of X, is examined. On the basis of analogy with the Sylvester matrix equation, special cases are distinguished where the former equation corresponds to normal and self-adjoint Sylvester equations. Efficient numerical algorithms are proposed for these special cases.     

Remarks on Ramanujam-Kawamata-Viehweg Vanishing Theorem

In this article we prove a general result on a nef vector bundle E on a projective manifold X of dimension n depending on the vector space H^n,n(X,E): It is also shown that H^n,n(X,E) = 0 for an indecomposable nef rank 2 vector bundles E on some specific type of n dimensional projective manifold X. The same vanishing shown to hold for indecomposable nef and big rank 2 vector bundles on any variety with trivial canonical bundle.     

Commutators of trace zero matrices over principal ideal rings

We prove that for every trace zero square matrix A of size at least 3 over a principal ideal ring R, there exist trace zero matrices X, Y over R such that XY ? YX = A. Moreover, we show that X can be taken to be regular mod every maximal ideal of R. This strengthens our earlier result that A is a commutator of two matrices (not necessarily of trace zero), and in addition, the present proof is simpler than the earlier one.     

Geometry and inequalities of geometric mean

We study some geometric properties associated with the t-geometric means A ?_tB:= A^1/2(A^?1/2BA^?1/2)^tA^1/2 of two n × n positive definite matrices A and B. Some geodesical convexity results with respect to the Riemannian structure of the n × n positive definite matrices are obtained. Several norm inequalities with geometric mean are obtained. In particular, we generalize a recent result of Audenaert (2015). Numerical counterexamples are given for some inequality questions. A conjecture on the geometric mean inequality regarding m pairs of positive definite matrices is posted.     

On the product of relatively weakly almost Lindelöf subsets

The purpose of this note is to show that there exist two Tychonoff spaces X, Y, a subset A of X and a subset B of Y such that A is weakly almost Lindelöf in X and B is weakly almost Lindelöf in Y, but A × B is not weakly almost Lindelöf in X × Y.     

Parametric AE-solution sets to the parametric linear systems with multiple right-hand sides and parametric matrix equation A(p)X = B(p)

In this paper, the parametric matrix equation A(p)X = B(p) whose elements are linear functions of uncertain parameters varying within intervals are considered. In this matrix equation A(p) and B(p) are known m-by-m and m-by-n matrices respectively, and X is the m-by-n unknown matrix. We discuss the so-called AE-solution sets for such systems and give some analytical characterizations for the AE-solution sets and a sufficient condition under which these solution sets are bounded. We then propose a modification of Krawczyk operator for parametric systems which causes reduction of the computational complexity of obtaining an outer estimation for the parametric united solution set, considerably. Then we give a generalization of the Bauer-Skeel and the Hansen-Bliek-Rohn bounds for enclosing the parametric united solution set which also enables us to reduce the computational complexity, significantly. Also some numerical approaches based on Gaussian elimination and Gauss-Seidel methods to find outer estimations for the parametric united solution set are given. Finally, some numerical experiments are given to illustrate the performance of the proposed methods.     

Globally convergent Jacobi methods for positive definite matrix pairs

The paper derives and investigates the Jacobi methods for the generalized eigenvalue problem A x = λ B x, where A is a symmetric and B is a symmetric positive definite matrix. The methods first “normalize” B to have the unit diagonal and then maintain that property during the iterative process. The global convergence is proved for all such methods. That result is obtained for the large class of generalized serial strategies from Hari and Begovi? Kova? (Trans. Numer. Anal. (ETNA) 47, 107–147, 2017). Preliminary numerical tests confirm a high relative accuracy of some of those methods, provided that both matrices are positive definite and the spectral condition numbers of Δ _A AΔ _A and Δ _B BΔ _B are small, for some nonsingular diagonal matrices Δ _A and Δ _B .     

Solvability of finite groups

H is called an ? _p -embedded subgroup of G, if there exists a p-nilpotent subgroup B of G such that H _p ∈ Syl _p (B) and B is ? _p -supplemented in G. In this paper, by considering prime divisor 3, 5, or 7, we use ? _p -embedded property of primary subgroups to investigate the solvability of finite groups. The main result is follows. Let E be a normal subgroup of G, and let P be a Sylow 5-subgroup of E. Suppose that 1 < d ? |P| and d divides |P|. If every subgroup H of P with |H| = d is ?₅-embedded in G, then every composition factor of E satisfies one of the following conditions: (1) I/C is cyclic of order 5, (2) I/C is 5′-group, (3) I/C ? A₅.     

Elliptic function of level 4

The article is devoted to the theory of elliptic functions of level n. An elliptic function of level n determines a Hirzebruch genus called an elliptic genus of level n. Elliptic functions of level n are also of interest because they are solutions of the Hirzebruch functional equations. The elliptic function of level 2 is the Jacobi elliptic sine function, which determines the famous Ochanine–Witten genus. It is the exponential of the universal formal group of the form F(u, v) = (u² ? v²)/(uB(v) ? vB(u)), B(0) = 1. The elliptic function of level 3 is the exponential of the universal formal group of the form F(u, v) = (u²A(v) ? v²A(u))/(uA(v)² ? vA(u)²), A(0) = 1, A″(0) = 0. In the present study we show that the elliptic function of level 4 is the exponential of the universal formal group of the form F(u, v) = (u²A(v) ? v²A(u))/(uB(v) ? vB(u)), where A(0) = B(0) = 1 and for B′(0) = A″(0) = 0, A′(0) = A₁, and B″(0) = 2B₂ the following relation holds: (2B(u) + 3A₁u)² = 4A(u)³ ? (3A₁² ? 8B₂)u²A(u)². To prove this result, we express the elliptic function of level 4 in terms of the Weierstrass elliptic functions.