Related papers: An Elementary Proof That Symplectic Matrices Have …
We give a bound on the number of isolated, essential singularities of determinantal quartic surfaces in 3-space. We also provide examples of different configurations of real singularities on quartic surfaces with a definite Hermitian…
We show that with any finite partially ordered set one can associate a matrix whose determinant factors nicely. As corollaries, we obtain a number of results in the literature about GCD matrices and their relatives. Our main theorem is…
Let either $GL(E)\times SO(F)$ or $GL(E)\times Sp(F)$ act naturally on the space of matrices $E\otimes F$. There are only finitely many orbits, and the orbit closures are orthogonal and symplectic generalizations of determinantal varieties,…
A new class of structured matrices is presented and a closed form formula for their determinant is established. This formula has strong connections with the one for Vandermonde matrices.
The determinantal complexity of a polynomial $P \in \mathbb{F}[x_1, \ldots, x_n]$ over a field $\mathbb{F}$ is the dimension of the smallest matrix $M$ whose entries are affine functions in $\mathbb{F}[x_1, \ldots, x_n]$ such that $P =…
We give some necessary conditions for the existence of a symplectic resolution for quotient singularities. The McKay correspondence is also worked out for these resolutions.
Symplectic eigenvalues are conventionally defined for symmetric positive-definite matrices via Williamson's diagonal form. Many properties of standard eigenvalues, including the trace minimization theorem, are extended to the case of…
A real symmetric matrix $M$ is completely positive semidefinite if it admits a Gram representation by (Hermitian) positive semidefinite matrices of any size $d$. The smallest such $d$ is called the (complex) completely positive semidefinite…
We determine the probability that a random n x n symmetric matrix over {1, 2, ... , m} has determinant divisible by m.
The present work studies deeply quadratic symplectic Lie superalgebras, obtaining, in particular, that they are all nilpotent. Consequently, we provide classifications in low dimensions and identify the double extensions that maintain…
Given a matrix with partitions of its rows and columns and entries from a field, we give the necessary and sufficient conditions that it has a non--singular submatrix with certain number of rows from each row partition and certain number of…
The symmetry properties of the dynamical matrix are well described in multiple classic textbooks. This short paper revisits the issue to demonstrate alternative form of dynamical matrix which explicitly shows its symmetry and reality in…
An important theorem in Gaussian quantum information tells us that we can diagonalise the covariance matrix of any Gaussian state via a symplectic transformation. Whilst the diagonal form is easy to find, the process for finding the…
Given $2n \times 2n$ real symmetric positive semidefinite matrix $A$ with symplectic kernel, there exists a real $2n \times 2n$ \emph{symplectic matrix} $M$ such that $M^TAM= D \oplus D$, where $D$ is an $n \times n$ non-negative diagonal…
Frames provide redundant, stable representations of data which have important applications in signal processing. We introduce a connection between symplectic geometry and frame theory and show that many important classes of frames have…
We consider a symmetric matrix, the entries of which depend linearly on some parameters. The domains of the parameters are compact real intervals. We investigate the problem of checking whether for each (or some) setting of the parameters,…
We deploy algebraic complexity theoretic techniques for constructing symmetric determinantal representations of for00504925mulas and weakly skew circuits. Our representations produce matrices of much smaller dimensions than those given in…
We show that certain determinantal functions of multiple matrices, when summed over the symmetries of the cube, decompose into functions of the original matrices. These are shown to be true in complete generality; that is, no properties of…
We introduce the notion of the symplectic characteristic polynomial of an endomorphism of a symplectic vector space. This is a polynomial in two variables and can be considered as a generalization of the characteristic polynomial of the…
We prove, under some generic assumptions, that the semiclassical spectrum modulo O(h^2) of a one dimensional pseudodifferential operator completely determines the symplectic geometry of the underlying classical system. In particular, the…