Principal minors of complex symmetric and skew matrices

The singular values of principal submatrices of complex symmetric and skew matrices are examined.     

Reduced arithmetically Gorenstein schemes and simplicial polytopes with maximal Betti numbers

An SI-sequence is a finite sequence of positive integers which is symmetric, unimodal and satisfies a certain growth condition. These are known to correspond precisely to the possible Hilbert functions of graded Artinian Gorenstein algebras with the weak Lefschetz property, a property shared by a nonempty open set of the family of all graded Artinian Gorenstein algebras having a fixed Hilbert function that is an SI sequence. Starting with an arbitrary SI-sequence, we construct a reduced, arithmetically Gorenstein configuration G of linear varieties of arbitrary dimension whose Artinian reduction has the given SI-sequence as Hilbert function and has the weak Lefschetz property. Furthermore, we show that G has maximal graded Betti numbers among all arithmetically Gorenstein subschemes of projective space whose Artinian reduction has the weak Lefschetz property and the given Hilbert function. As an application we show that over a field of characteristic zero every set of simplicial polytopes with fixed h-vector contains a polytope with maximal graded Betti numbers.     

A simplicial complex of 2-stack sortable permutations

For each n, we construct a simplicial complex whose k-dimensional faces are in one-to-one correspondence with 2-stack sortable permutations of length n having k ascents.     

A min-max theorem for complex symmetric matrices

We optimize the form Re x^tTx to obtain the singular values of a complex symmetric matrix T. We prove that for ,

     

A twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix

This paper presents an O(n²) method based on the twisted factorization for computing the Takagi vectors of an n‐by‐n complex symmetric tridiagonal matrix with known singular values. Since the singular values can be obtained in O(n²) flops, the total cost of symmetric singular value decomposition or the Takagi factorization is O(n²) flops. An analysis shows the accuracy and orthogonality of Takagi vectors. Also, techniques for a practical implementation of our method are proposed. Our preliminary numerical experiments have verified our analysis and demonstrated that the twisted factorization method is much more efficient than the implicit QR method, divide‐and‐conquer method and Matlab singular value decomposition subroutine with comparable accuracy. Copyright © 2009 John Wiley & Sons, Ltd.     

The zeta function of a simplicial complex

Given a simplicial complex δ on vertices {1, …,n} and a fieldF we consider the subvariety of projective (n−1)-space overF consisting of points whose homogeneous coordinates have support in δ. We give a simple rational expression for the zeta function of this singular projective variety overF _q and show a close connection with the Betti numbers of the corresponding variety over ℂ. This connection is particularly simple in the case when Δ is Cohen-Macaulay.     

De Rham theory of a simplicial complex

VINITI. Translated from Funktsional'nyi Analiz i Ego Prilozheniya, Vol. 26, No. 1, pp. 27–34, January–March, 1992.     

A COCR method for solving complex symmetric linear systems

The Conjugate Orthogonal Conjugate Gradient (COCG) method has been recognized as an attractive Lanczos-type Krylov subspace method for solving complex symmetric linear systems; however, it sometimes shows irregular convergence behavior in practical applications. In the present paper, we propose a Conjugate A$A$-Orthogonal Conjugate Residual (COCR) method, which can be regarded as an extension of the Conjugate Residual (CR) method. Numerical examples show that COCR often gives smoother convergence behavior than COCG.     

The facet ideal of a simplicial complex

 To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By generalizing the notion of a tree from graphs to simplicial complexes, we show that ideals associated to trees satisfy sliding depth condition, and therefore have normal and Cohen-Macaulay Rees rings. We also discuss connections with the theory of Stanley-Reisner rings. Received: 7 January 2002 / Revised version: 6 May 2002     

Vanishing conditions for the simplicial volume of compact complex varieties

Gromov has defined a notion of simplicial volume: it is a topological invariant for compact manifolds which is closely related to the fundamental group. We investigate here the relevance of this notion in the realm of complex varieties.

     

Upper bounds for the number of facets of a simplicial complex

Here we study the maximal dimension of the annihilator ideals
of artinian graded rings with a given Hilbert function, where is the polynomial ring in the variables over a field with each , is a graded ideal of , and is the graded maximal ideal of . As an application to combinatorics, we introduce the notion of -facets and obtain some informations on the number of -facets of simplicial complexes with a given -vector.

     

A parameter shift-splitting iterative method for complex symmetric linear systems

Recently, Chen and Ma [Journal of Computational and Applied Mathematics, 344(2018): 691-700] constructed the generalized shift-splitting (GSS) preconditioner, and gave the corresponding theoretical analysis and numerical experiments. In this paper, based on the generalized shift-splitting (GSS) preconditioner, we generalize their algorithms and further study the parameter shift-splitting (PSS) preconditioner for complex symmetric linear systems. Moreover, by similar theoretical analysis, we obtain that the parameter shift-splitting iterative method is unconditionally convergent. In finally, one example is provided to confirm the effectiveness.     

A new block preconditioner for complex symmetric indefinite linear systems

Using the equivalent block two-by-two real linear systems and relaxing technique, we establish a new block preconditioner for a class of complex symmetric indefinite linear systems. The new preconditioner is much closer to the original block two-by-two coefficient matrix than the Hermitian and skew-Hermitian splitting (HSS) preconditioner. We analyze the spectral properties of the new preconditioned matrix, discuss the eigenvalue distribution and derive an upper bound for the degree of its minimal polynomial. Finally, some numerical examples are provided to show the effectiveness and robustness of our proposed preconditioner.     

Gorenstein algebras, symmetric matrices, self-linked ideals, and symbolic powers

Inspired by recent work in the theory of central projections onto hypersurfaces, we characterize self-linked perfect ideals of grade as those with a Hilbert-Burch matrix that has a maximal symmetric subblock. We also prove that every Gorenstein perfect algebra of grade can be presented, as a module, by a symmetric matrix. Both results are derived from the same elementary lemma about symmetrizing a matrix that has, modulo a nonzerodivisor, a symmetric syzygy matrix. In addition, we establish a correspondence, roughly speaking, between Gorenstein perfect algebras of grade that are birational onto their image, on the one hand, and self-linked perfect ideals of grade that have one of the self-linking elements contained in the second symbolic power, on the other hand. Finally, we provide another characterization of these ideals in terms of their symbolic Rees algebras, and we prove a criterion for these algebras to be normal.

     

A Bass Formula for Gorenstein Injective Dimension

In this article a generalized version of the Bass formula is proved for finitely generated modules of finite Gorenstein injective dimension over a commutative Noetherian ring.     

A simplicial homology algorithm for Lipschitz optimisation

The simplicial homology global optimisation (SHGO) algorithm is a general purpose global optimisation algorithm based on applications of simplicial integral homology and combinatorial topology. SHGO approximates the homology groups of a complex built on a hypersurface homeomorphic to a complex on the objective function. This provides both approximations of locally convex subdomains in the search space through Sperner’s lemma and a useful visual tool for characterising and efficiently solving higher dimensional black and grey box optimisation problems. This complex is built up using sampling points within the feasible search space as vertices. The algorithm is specialised in finding all the local minima of an objective function with expensive function evaluations efficiently which is especially suitable to applications such as energy landscape exploration. SHGO was initially developed as an improvement on the topographical global optimisation (TGO) method. It is proven that the SHGO algorithm will always outperform TGO on function evaluations if the objective function is Lipschitz smooth. In this paper SHGO is applied to non-convex problems with linear and box constraints with bounds placed on the variables. Numerical experiments on linearly constrained test problems show that SHGO gives competitive results compared to TGO and the recently developed Lc-DISIMPL algorithm as well as the PSwarm, LGO and DIRECT-L1 algorithms. Furthermore SHGO is compared with the TGO, basinhopping (BH) and differential evolution (DE) global optimisation algorithms over a large selection of black-box problems with bounds placed on the variables from the SciPy benchmarking test suite. A Python implementation of the SHGO and TGO algorithms published under a MIT license can be found from https://bitbucket.org/upiamcompthermo/shgo/.