Binomial Canonical Decompositions of Binomial Ideals

In this article, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special decomposition is obtained from a cellular decomposition which is also defined in a canonical way and does not depend on the field.     

Functional canonical analysis for square integrable stochastic processes

We study the extension of canonical correlation from pairs of random vectors to the case where a data sample consists of pairs of square integrable stochastic processes. Basic questions concerning the definition and existence of functional canonical correlation are addressed and sufficient criteria for the existence of functional canonical correlation are presented. Various properties of functional canonical analysis are discussed. We consider a canonical decomposition, in which the original processes are approximated by means of their canonical components.     

Quasi-isometries preserve the geometric decomposition of Haken manifolds

We prove quasi-isometry invariance of the canonical decomposition for fundamental groups of Haken 3-manifolds with zero Euler characteristic. We show that groups quasi-isometric to Haken manifold groups with nontrivial canonical decomposition are finite extensions of Haken orbifold groups. As a by-product we describe all 2-dimensional quasi-flats in the universal covers of non-geometric Haken manifolds. Oblatum 27-III-1996 & 5-IX-1996     

A Schur decomposition for Hamiltonian matrices

A Schur-type decomposition for Hamiltonian matrices is given that relies on unitary symplectic similarity transformations. These transformations preserve the Hamiltonian structure and are numerically stable, making them ideal for analysis and computation. Using this decomposition and a special singular-value decomposition for unitary symplectic matrices, a canonical reduction of the algebraic Riccati equation is obtained which sheds light on the sensitivity of the nonnegative definite solution. After presenting some real decompositions for real Hamiltonian matrices, we look into the possibility of an orthogonal symplectic version of the QR algorithm suitable for Hamiltonian matrices. A finite-step initial reduction to a Hessenberg-type canonical form is presented. However, no extension of the Francis implicit-shift technique was found, and reasons for the difficulty are given.     

复向量空间的分解与复线性变换的Jordan标准形*

本文引入表征复线性变换结构的新对象。这些新对象给出复向量空间关于复线性变换分解的新结果且给出构造Jordan标准形的所有Jordan基。因而,它们能够直接导致着名的Jordan定理及空间的第三分解定理,且能给出对Jordan形精致微妙结构的新的深刻洞察。后者表明,复线性变换的Jordan标准形是一种在双重任意选择下具有不变性的结构。     

The Symplectic Monoid

In this paper, we describe explicitly the symplectic monoid ? and its Renner monoid ? using elementary methods. We refine the Bruhat–Renner decomposition of ? and analyze in detail the length function on ?. We then show that every element of ? has a unique canonical form decomposition, which is an analogue of the canonical form of elements in Chevalley groups. We also compute the order of ? over a finite field, and as a consequence we obtain a new combinatorial identity.     

用奇异值分解方法计算具有重特征值矩阵的特征矢量

若当(Jordan)形是矩阵在相似条件下的一个标准形,在代数理论及其工程应用中都具有十分重要的意义．针对具有重特征值的矩阵,提出了一种运用奇异值分解方法计算它的特征矢量及若当形的算法．大量数值例子的计算结果表明,该算法在求解具有重特征值的矩阵的特征矢量及若当形上效果良好,优于商用软件MATLAB和MATHEMATICA．     

四元数矩阵的奇异值分解及其应用

In this paper, a constructive proof of singular value decomposition of quaternion matrix is given by using the complex representation and companion vector of quaternion matrix and the computational method is described. As an application of the singular value decomposition, the CS decomposition is proved and the canonical angles on subspaces of Q^n is studied.     

Structure and Rigidity in (Gromov) Hyperbolic Groups and Discrete Groups in Rank 1 Lie Groups II

We borrow the Jaco-Shalen-Johannson notion of characteristic sub-manifold from 3-dimensional topology to study cyclic splittings of torsion-free (Gromov) hyperbolic groups and finitely generated discrete groups in rank 1 Lie groups. Our JSJ canonical decomposition is a fundamental object for studying the dynamics of individual automorphisms and the automorphism group of a torsion-free hyperbolic group and a key tool in our approach to the isomorphism problem for these groups [S3]. For discrete groups in rank 1 Lie groups, the JSJ canonical decomposition serves as a basic object for understanding the geometry of the space of discrete faithful representations and allows a natural generalization of the Teichmüller modular group and the Riemann moduli space for these discrete groups. Submitted: September 1996, revised version: April 1997     

Factorization of matrices of quaternions

We review known factorization results for quaternion matrices. Specifically, we derive the Jordan canonical form, polar decomposition, singular value decomposition, and QR factorization. We prove that there is a Schur factorization for commuting matrices, and from this derive the spectral theorem. We do not consider algorithms, but do point to some of the numerical literature.     

矩阵方程AXB=C最小二乘D反对称解

首先将对称矩阵推广到D反对称矩阵,然后研究了方程AXB=C的D反对称最小二乘解,利用矩阵对的广义奇异分解、标准相关分解及子空间上的投影定理,得到了最小二乘解的通式．     

Means on dyadic symmetrie sets and polar decompositions

In this paper we develop the theory of the geometric mean and the spectral mean on dyadic symmetric sets, an algebraic generalization of symmetric spaces of noncompact type, and apply them to obtain decomposition theorems of involutive systems. In particular we show for involutive dyadic symmetric sets: every involutive dyadic symmetric set admits a canonical polar decomposition with factors the geometric and spectral means.     

Structure of the Hessian matrix and an economical implementation of Newton’s method in the problem of canonical approximation of tensors

A tensor given by its canonical decomposition is approximated by another tensor (again, in the canonical decomposition) of fixed lower rank. For this problem, the structure of the Hessian matrix of the objective function is analyzed. It is shown that all the auxiliary matrices needed for constructing the quadratic model can be calculated so that the computational effort is a quadratic function of the tensor dimensionality (rather than a cubic function as in earlier publications). An economical version of the trust region Newton method is proposed in which the structure of the Hessian matrix is efficiently used for multiplying this matrix by vectors and for scaling the trust region. At each step, the subproblem of minimizing the quadratic model in the trust region is solved using the preconditioned conjugate gradient method, which is terminated if a negative curvature direction is detected for the Hessian matrix.     

On the successive supersymmetric rank‐1 decomposition of higher‐order supersymmetric tensors

In this paper, a successive supersymmetric rank‐1 decomposition of a real higher‐order supersymmetric tensor is considered. To obtain such a decomposition, we design a greedy method based on iteratively computing the best supersymmetric rank‐1 approximation of the residual tensors. We further show that a supersymmetric canonical decomposition could be obtained when the method is applied to an orthogonally diagonalizable supersymmetric tensor, and in particular, when the order is 2, this method generates the eigenvalue decomposition for symmetric matrices. Details of the algorithm designed and the numerical results are reported in this paper. Copyright © 2007 John Wiley & Sons, Ltd.     

Epstein–Penner Decompositions and Thrice Punctured Spheres in Hyperbolic 3-Manifolds

Let M be a cusped hyperbolic 3-manifold containing an incompressible thrice punctured sphere S. Suppose that M is not the Whitehead link complement. We prove that a certain arc on S is isotopic to an edge of a Euclidean decomposition of M. By using the above result, we relate alternating knot diagrams and the canonical decompositions. Let K be an alternating hyperbolic knot. On a reduced alternating knot diagram of K, if we replace one of the crossings with a large number of half twists, the polar axis of the crossing is isotopic to an edge of the canonical decomposition for the resulting knot.     

Canonical Forms for Symmetric and Regular Structures

Matrices associated with symmetric and regular structures can be arranged into certain block patterns known as Canonical forms. Using such forms, the decomposition of structural matrices into block diagonal forms, is considerably simplified. In this paper the main canonical forms are reviewed; and symmetric/regular structural configurations that can be explained with such forms are investigated. The invariant subspaces are formulated and the closed form solutions for the block-diagonalized stiffness matrices are provided in each case. Utility and robustness of the canonical forms in the analysis of structures exhibiting decomposable matrix patterns are demonstrated by numerous examples. Furthermore, a numerical method is proposed to extend the computational advantages of the matrix canonical forms to other nonconforming regular structures.     

Abel群的一些分解定理的推广(Ⅲ)

从主理想整环上有界模分解的Prüfer-Baer定理出发,研究(无限维)向量空间的代数的线性变换的几个基本问题,得到了如下结果:设V是域F上的(无限维)向量空间,A是V上的一个代数的线性变换,则有(1)若任何与A可交换的线性变换均与线性变换B可交换,则B=f(A),其中f是F上的多项式.进而线性变换B也是代数的.(2) V中存在一组基,使A在这组基下的矩阵是有理标准型(经典标准型)矩阵.当F是代数闭域时,经典标准型矩阵即为若当标准型矩阵.(3)当F是代数闭域时,A存在相应的Jordan-Chevalley分解.进一步,该结论在完全域上仍成立.这些研究推广了有限维向量空间上线性变换的相关结果.     

Probabilistic inference with noisy-threshold models based on a CP tensor decomposition

The specification of conditional probability tables (CPTs) is a difficult task in the construction of probabilistic graphical models. Several types of canonical models have been proposed to ease that difficulty. Noisy-threshold models generalize the two most popular canonical models: the noisy-or and the noisy-and. When using the standard inference techniques the inference complexity is exponential with respect to the number of parents of a variable. More efficient inference techniques can be employed for CPTs that take a special form. CPTs can be viewed as tensors. Tensors can be decomposed into linear combinations of rank-one tensors, where a rank-one tensor is an outer product of vectors. Such decomposition is referred to as Canonical Polyadic (CP) or CANDECOMP-PARAFAC (CP) decomposition. The tensor decomposition offers a compact representation of CPTs which can be efficiently utilized in probabilistic inference. In this paper we propose a CP decomposition of tensors corresponding to CPTs of threshold functions, exactly ℓ-out-of-k functions, and their noisy counterparts. We prove results about the symmetric rank of these tensors in the real and complex domains. The proofs are constructive and provide methods for CP decomposition of these tensors. An analytical and experimental comparison with the parent-divorcing method (which also has a polynomial complexity) shows superiority of the CP decomposition-based method. The experiments were performed on subnetworks of the well-known QMRT-DT network generalized by replacing noisy-or by noisy-threshold models.     

On the strong cell decomposition property for weakly o‐minimal structures

We consider a class of weakly o‐minimal structures admitting an o‐minimal style cell decomposition, for which one can construct certain canonical o‐minimal extension. The paper contains several fundamental facts concerning the structures in question. Among other things, it is proved that the strong cell decomposition property is preserved under elementary equivalences. We also investigate fiberwise properties (of definable sets and definable functions), definable equivalence relations, and conditions implying elimination of imaginaries.     

Decompositions of positive self-dual boolean functions

A coterie, which is used to realize mutual exclusion in distributed systems, is a family C of subsets such that any pair of subsets in C has at least one element in common, and such that no subset in C contains any other subset in C. Associate with a family of subsets C a positive Boolean function f_c such that f_c(x) = 1 if the Boolean vector x is equal to or greater than the characteristic vector of some subset in C, and 0 otherwise. It is known that C is a coterie if and only if f_c is dual-minor, and is a non-dominated (ND) coterie if and only if f_c is self-dual. We study in this paper the decomposition of a positive self-dual function into smaller positive self-dual functions, as it explains how to represent and how to construct the corresponding ND coterie. A key step is how to decompose a positive dual-minor function f into a conjunction of positive self-dual functions f₁,f₂,…, f_k. In addition to the general condition for this decomposition, we clarify the condition for the decomposition into two functions f₁, and f₂, and introduce the concept of canonical decomposition. Then we present an algorithm that determines a minimal canonical decomposition, and a very simple algorithm that usually gives a decomposition close to minimal. The decomposition of a general self-dual function is also discussed.