Related papers: An Elementary Proof That Symplectic Matrices Have …

Often in mathematics it is useful to summarize a multivariate phenomenon with a single number and in fact, the determinant -- which is represented by det -- is one of the simplest cases. In fact, this number it is defined only for square…

Given a $2k$-dimensional symplectic space $(Z,F)$ in $N$ variables, $1 < 2k \leq N$, over a global field $K$, we prove the existence of a symplectic basis for $(Z,F)$ of bounded height. This can be viewed as a version of Siegel's lemma for…

A hermitian matrix can be parametrized by a set consisting of its determinant and the eigenvalues of its submatrices. We established a group of equations which connect these variables with the mixing parameters of diagonalization. These…

V.I. Kopeiko proved that over a euclidean ring, the symplectic group defined with respect to the standard skew-symmetric matrix is same as the elementary symplectic group. Here we generalise the result of Kopeiko for a symplectic group…

This is the first installment of an exposition of an ACL2 formalization of elementary linear algebra, focusing on aspects of the subject that apply to matrices over an arbitrary commutative ring with identity, in anticipation of a future…

The study of positive-definite matrices has focused on Hermitian matrices, that is, square matrices with complex (or real) entries that are equal to their own conjugate transposes. In the classical setting, positive-definite matrices enjoy…

We discuss some examples in which symplectic monodromy (provably or conjecturally) splits off the symplectic mapping class group, hoping to illustrate different techniques and inputs to the arguments. Along the way we formulate several open…

We prove that every holomorphic symplectic matrix can be factorized as a product of holomorphic unitriangular matrices with respect to the symplectic form $ \left[\begin{array}{ccc} 0 & L_n \\ -L_n & 0\end{array}\right]$ where $L$ is the $n…

We prove that $\det A\leq 6^\frac{n}{6}$ whenever $A\in\{0,1\}^{n\times n}$ contains at most $2n$ ones. We also prove an upper bound on the determinant of matrices with the $k$-consecutive ones property, a generalisation of the consecutive…

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

Symplectic tracking of beam particles using point magnets is achieved using a reference orbit made of circular arcs and straight lines that join smoothly with each other. For this choice of the reference orbit, results are given for the…

Here we consider the image of the principal minor map of symmetric matrices over an arbitrary unique factorization domain $R$. By exploiting a connection with symmetric determinantal representations, we characterize the image of the…

Let $\{a_k\}$ be a sequence of real numbers defined by an $m$th order linear homogenous recurrence relation. In this paper we obtain a determinant formula for the circulant matrix $A=circ(a_1, a_2, \cdots, a_n)$, providing a generalization…

We prove a strengthened form of a conjecture of Sun on a determinant attached to a binary quadratic form. Let $n>3$ and let $c,d\in\Z$. If $n$ is composite, then \[ \det\big[(i^2+cij+dj^2)^{n-2}\big]_{0\leq i,j\leq n-1}\equiv 0\pmod {n^2}…

We answer the natural question: when are a regular Poisson structure along with a complex structure transverse to its symplectic leaves induced by generalized complex structure? The leafwise symplectic form and transverse complex structure…

We prove that given four arbitrary quaternion numbers of norm 1 there always exists a $2\times 2$ symplectic matrix for which those numbers are left eigenvalues. The proof is constructive. An application to the LS category of Lie groups is…

In the past, empirical evidence has been presented that Hilbert series of symplectic quotients of unitary representations obey a certain universal system of infinitely many constraints. Formal series with this property have been called…

We give a new combinatorial explanation for well-known relations between determinants and traces of matrix powers. Such relations can be used to obtain polynomial-time and poly-logarithmic space algorithms for the determinant. Our new…

The set of real matrices of upper-bounded rank is a real algebraic variety called the real generic determinantal variety. An explicit description of the tangent cone to that variety is given in Theorem 3.2 of Schneider and Uschmajew [SIAM…

Subsets of a matrix algebra over a field that are invariant under conjugation and contain the linear span of each two of their commuting elements are described. They obviously include the subsets of diagonalizable and nilpotent matrices. In…