Generic determinantal schemes and the smoothability of determinantal schemes of codimension 2

The aim of this article is to prove a criterion for projectively Cohen-Macaulay two-codimensional subschemes ofP _k ^N to be smoothable. For curves inP _k ³ this criterion is due to T. Sauer [4]. The considered schemes are determinantal, so we study related generic affine determinantal schemes. We compute their dimension, and under the condition that the dimension is minimal we calculate the codimension of the singular locus.     

The G-biliaison class of symmetric determinantal schemes

We consider a family of schemes, that are defined by minors of a homogeneous symmetric matrix with polynomial entries. We assume that they have maximal possible codimension, given the size of the matrix and of the minors that define them. We show that these schemes are G-bilinked to a linear variety of the same dimension. In particular, they can be obtained from a linear variety by a finite sequence of ascending G-biliaisons on some determinantal schemes. We describe the biliaisons explicitly in the proof of Theorem 2.3. In particular, it follows that these schemes are glicci.     

Dimension of families of determinantal schemes

A scheme of codimension is called standard determinantal if its homogeneous saturated ideal can be generated by the maximal minors of a homogeneous matrix and is said to be good determinantal if it is standard determinantal and a generic complete intersection. Given integers and we denote by (resp. ) the locus of good (resp. standard) determinantal schemes of codimension defined by the maximal minors of a matrix where is a homogeneous polynomial of degree .

In this paper we address the following three fundamental problems: To determine (1) the dimension of (resp. ) in terms of and , (2) whether the closure of is an irreducible component of , and (3) when is generically smooth along . Concerning question (1) we give an upper bound for the dimension of (resp. ) which works for all integers and , and we conjecture that this bound is sharp. The conjecture is proved for , and for under some restriction on and . For questions (2) and (3) we have an affirmative answer for and , and for under certain numerical assumptions.

     

Families of low dimensional determinantal schemes

A scheme X⊂Pⁿ of codimension c is called standard determinantal if its homogeneous saturated ideal can be generated by the t×t minors of a homogeneous t×(t+c−1) matrix (f_ij). Given integers a₀≤a₁≤?≤a_t+c−2 and b₁≤?≤b_t, we denote by the stratum of standard determinantal schemes where f_ij are homogeneous polynomials of degrees a_j−b_i and is the Hilbert scheme (if n−c>0, resp. the postulation Hilbert scheme if n−c=0).Focusing mainly on zero and one dimensional determinantal schemes we determine the codimension of in and we show that is generically smooth along under certain conditions. For zero dimensional schemes (only) we find a counterexample to the conjectured value of appearing in Kleppe and Miró-Roig (2005) [25].     

Finite geometry and the Gale transform

The Gale transform is an involution on sets of points in a projective space. It plays a crucial role in several different subjects, such as algebraic geometry, optimization, coding theory, etc. Sometimes, in the literature, the Gale transform is used implicitly, without mentioning it as such. In the present paper, we give a short account of the algebraic and geometrical implications that the Gale transform has when it is applied to sets of points in finite projective spaces.     

Two theorems on Euclidean distance matrices and Gale transform

We present a characterization of those Euclidean distance matrices (EDMs) D which can be expressed as D=λ(E−C) for some nonnegative scalar λ and some correlation matrix C, where E is the matrix of all ones. This shows that the cones

where is the elliptope (set of correlation matrices) and is the (closed convex) cone of EDMs.

The characterization is given using the Gale transform of the points generating D. We also show that given points , for any scalars λ₁,λ₂,…,λ_n such that

∑_j=1ⁿλ_jp^j=0, ∑_j=1ⁿλ_j=0,

we have

∑_j=1ⁿλ_jpⁱ−p^j2= forall i=1,…,n,

for some scalar independent of i.     

The Dedekind-Mertens formula and determinantal rings

We give a combinatorial proof of the Dedekind-Mertens formula by computing the initial ideal of the content ideal of the product of two generic polynomials. As a side effect we obtain a complete classification of the rank Cohen-Macaulay modules over the determinantal rings .

     

The lifting of determinantal prime ideals

The main results of this paper show that a perfect prime ideal generated by the maximal minors of a matrix has the equality between symbolic and ordinary powers if the ideals generated by the low order minors of the matrix have grade large enough and that any determinantal prime ideal of maximal minors with maximal grade of a matrix of homogenous forms whose 2-minors are homogeneous can be lifted to a prime determinantal ideal having the above equality. The author is partially supported by the National Basic Research Program     

Software for the Gale transform of fewnomial systems and a Descartes rule for fewnomials

We give a Descartes’-like bound on the number of positive solutions to a system of fewnomials that holds when its exponent vectors are not in convex position and a sign condition is satisfied. This was discovered while developing algorithms and software for computing the Gale transform of a fewnomial system, which is our main goal. This software is a component of a package we are developing for Khovanskii-Rolle continuation, which is a numerical algorithm to compute the real solutions to a system of fewnomials.     

The determinantal ideals of extended Hankel matrices

In this paper, we use the tools of Gröbner bases and combinatorial secant varieties to study the determinantal ideals I_t of the extended Hankel matrices. Denote by c-chain a sequence a₁,…,a_k with a_i+c<a_i+1 for all i=1,…,k−1. Using the results of c-chain, we solve the membership problem for the symbolic powers and we compute the primary decomposition of the product I_t1?I_tk of the determinantal ideals. Passing through the initial ideals and algebras we prove that the product I_t1?I_tk has a linear resolution and the multi-homogeneous Rees algebra is defined by a Gröbner basis of quadrics.     

Matrix subspaces and determinantal hypersurfaces

Nonsingular matrix subspaces can be separated into two categories: by being either invertible, or merely possessing invertible elements. The former class was introduced for factoring matrices into the product of two matrices. With the latter, the problem of characterizing the inverses and related nonlinear matrix geometries arises. For the singular elements there is a natural concept of spectrum defined in terms of determinantal hypersurfaces, linking matrix analysis with algebraic geometry. With this, matrix subspaces and the respective Grassmannians are split into equivalence classes. Conditioning of matrix subspaces is addressed.     

Linear codes arising from the Gale transform of distinguished subsets of some projective spaces

Applying the Gale transform on certain linear and non-linear geometrical objects, and studying the orbits under the action of the associated automorphism groups in the higher-dimensional space, we construct some families of cap codes and other structures admitting the same automorphism groups.     

The wavelet transform method applied to a coupled chaotic system with asymmetric coupling schemes

The wavelet transform method originated by Wei et al. (2002) [19] is an effective tool for enhancing the transverse stability of the synchronous manifold of a coupled chaotic system. Much of the theoretical study on this matter is centered on networks that are symmetrically coupled. However, in real applications, the coupling topology of a network is often asymmetric; see Belykh et al. (2006)  [23], [24], Chavez et al. (2005)  [25], Hwang et al. (2005)  [26], Juang et al. (2007)  [17], and Wu (2003)  [13]. In this work, a certain type of asymmetric sparse connection topology for networks of coupled chaotic systems is presented. Moreover, our work here represents the first step in understanding how to actually control the stability of global synchronization from dynamical chaos for asymmetrically connected networks of coupled chaotic systems via the wavelet transform method. In particular, we obtain the following results. First, it is shown that the lower bound for achieving synchrony of the coupled chaotic system with the wavelet transform method is independent of the number of nodes. Second, we demonstrate that the wavelet transform method as applied to networks of coupled chaotic systems is even more effective and controllable for asymmetric coupling schemes as compared to the symmetric cases.     

Arithmetic-Geometric Mean determinantal identity

In this paper, we give a generalization of a determinantal identity posed by Charles R. Johnson about minors of a Toeplitz matrix satisfying a specific matrix identity. These minors are those appear in the Dodgson’s condensation formula.