Williamson’s theorem states that for any $2n \times 2n$ real positive definite matrix A, there exists a $2n \times 2n$ real symplectic matrix S such that $S^TAS=D \oplus D$, where D is an $n\times n$ diagonal matrix with positive diagonal entries known as the symplectic eigenvalues of A. Let H be any $2n \times 2n$ real symmetric matrix such that the perturbed matrix $A+H$ is also positive definite. In this paper, we show that any symplectic matrix $\tilde {S}$ diagonalizing $A+H$ in Williamson’s theorem is of the form $\tilde {S}=S Q+\mathcal {O}(\|H\|)$, where Q is a $2n \times 2n$ real symplectic as well as orthogonal matrix. Moreover, Q is in symplectic block diagonal form with the block sizes given by twice the multiplicities of the symplectic eigenvalues of A. Consequently, we show that $\tilde {S}$ and S can be chosen so that $\|\tilde {S}-S\|=\mathcal {O}(\|H\|)$. Our results hold even if A has repeated symplectic eigenvalues. This generalizes the stability result of symplectic matrices for non-repeated symplectic eigenvalues given by Idel, Gaona, and Wolf [Linear Algebra Appl., 525:45–58, 2017].

The celebrated Erdős–Ko–Rado (EKR) theorem for Paley graphs of square order states that all maximum cliques are canonical in the sense that each maximum clique arises from the subfield construction. Recently, Asgarli and Yip extended this result to Peisert graphs and other Cayley graphs which are Peisert-type graphs with nice algebraic properties on the connection set. On the other hand, there are Peisert-type graphs for which the EKR theorem fails to hold. In this article, we show that the EKR theorem of Paley graphs extends to almost all pseudo-Paley graphs of Peisert-type. Furthermore, we establish the stability results of the same flavor.

The existence of isometric embedding of $S_q^m$ into $S_p^n$, where $1\leq p\neq q\leq \infty$ and $m,n\geq 2$, has been recently studied in [6]. In this article, we extend the study of isometric embeddability beyond the above-mentioned range of $p$ and $q$. More precisely, we show that there is no isometric embedding of the commutative quasi-Banach space $\ell _q^m(\mathbb {R})$ into $\ell _p^n(\mathbb {R})$, where $(q,p)\in (0,\infty )\times (0,1)$ and $p\neq q$. As non-commutative quasi-Banach spaces, we show that there is no isometric embedding of $S_q^m$ into $S_p^n$, where $(q,p)\in (0,2)\setminus \{1\}\times (0,1)$ $\cup \, \{1\}\times (0,1)\setminus \left \{\!\frac {1}{n}:n\in \mathbb {N}\right \}$ $\cup \, \{\infty \}\times (0,1)\setminus \left \{\!\frac {1}{n}:n\in \mathbb {N}\right \}$ and $p\neq q$. Moreover, in some restrictive cases, we also show that there is no isometric embedding of $S_q^m$ into $S_p^n$, where $(q,p)\in [2, \infty )\times (0,1)$. A new tool in our paper is the non-commutative Clarkson's inequality for Schatten class operators. Other tools involved are the Kato–Rellich theorem and multiple operator integrals in perturbation theory, followed by intricate computations involving power-series analysis.

As an extension of Sylvester’s matrix, a tridiagonal matrix is investigated by determining both left and right eigenvectors. Orthogonality relations between left and right eigenvectors are derived. Two determinants of the matrices constructed by the left and right eigenvectors are evaluated in closed form.

In 2005, N. Nikolski proved among other things that for any $r\in (0,1)$ and any $K\geq 1$ , the condition number $CN(T)=\Vert T\Vert \cdot \Vert T^{-1}\Vert $ of any invertible n-dimensional complex Banach space operators T satisfying the Kreiss condition, with spectrum contained in $\left \{ r\leq |z|<1\right \}$ , satisfies the inequality $CN(T)\leq CK(T)\Vert T \Vert n/r^{n}$ where $K(T)$ denotes the Kreiss constant of T and $C>0$ is an absolute constant. He also proved that for $r\ll 1/n,$ the latter bound is asymptotically sharp as $n\rightarrow \infty $ . In this note, we prove that this bound is actually achieved by a family of explicit $n\times n$ Toeplitz matrices with arbitrary singleton spectrum $\{\lambda \}\subset \mathbb {D}\setminus \{0\}$ and uniformly bounded Kreiss constant. Independently, we exhibit a sequence of Jordan blocks with Kreiss constants tending to $\infty $ showing that Nikolski’s inequality is still asymptotically sharp as K and n go to $\infty $ .

Let $M_{\langle \mathbf {u},\mathbf {v},\mathbf {w}\rangle }\in \mathbb C^{\mathbf {u}\mathbf {v}}{\mathord { \otimes } } \mathbb C^{\mathbf {v}\mathbf {w}}{\mathord { \otimes } } \mathbb C^{\mathbf {w}\mathbf {u}}$ denote the matrix multiplication tensor (and write $M_{\langle \mathbf {n} \rangle }=M_{\langle \mathbf {n},\mathbf {n},\mathbf {n}\rangle }$ ), and let $\operatorname {det}_3\in (\mathbb C^9)^{{\mathord { \otimes } } 3}$ denote the determinant polynomial considered as a tensor. For a tensor T, let $\underline {\mathbf {R}}(T)$ denote its border rank. We (i) give the first hand-checkable algebraic proof that $\underline {\mathbf {R}}(M_{\langle 2\rangle })=7$ , (ii) prove $\underline {\mathbf {R}}(M_{\langle 223\rangle })=10$ and $\underline {\mathbf {R}}(M_{\langle 233\rangle })=14$ , where previously the only nontrivial matrix multiplication tensor whose border rank had been determined was $M_{\langle 2\rangle }$ , (iii) prove $\underline {\mathbf {R}}( M_{\langle 3\rangle })\geq 17$ , (iv) prove $\underline {\mathbf {R}}(\operatorname {det}_3)=17$ , improving the previous lower bound of $12$ , (v) prove $\underline {\mathbf {R}}(M_{\langle 2\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1.32\mathbf {n}$ for all $\mathbf {n}\geq 25$ , where previously only $\underline {\mathbf {R}}(M_{\langle 2\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1$ was known, as well as lower bounds for $4\leq \mathbf {n}\leq 25$ , and (vi) prove $\underline {\mathbf {R}}(M_{\langle 3\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+1.6\mathbf {n}$ for all $\mathbf {n} \ge 18$ , where previously only $\underline {\mathbf {R}}(M_{\langle 3\mathbf {n}\mathbf {n}\rangle })\geq \mathbf {n}^2+2$ was known. The last two results are significant for two reasons: (i) they are essentially the first nontrivial lower bounds for tensors in an “unbalanced” ambient space and (ii) they demonstrate that the methods we use (border apolarity) may be applied to sequences of tensors.

The methods used to obtain the results are new and “nonnatural” in the sense of Razborov and Rudich, in that the results are obtained via an algorithm that cannot be effectively applied to generic tensors. We utilize a new technique, called border apolarity developed by Buczyńska and Buczyński in the general context of toric varieties. We apply this technique to develop an algorithm that, given a tensor T and an integer r, in a finite number of steps, either outputs that there is no border rank r decomposition for T or produces a list of all normalized ideals which could potentially result from a border rank decomposition. The algorithm is effectively implementable when T has a large symmetry group, in which case it outputs potential decompositions in a natural normal form. The algorithm is based on algebraic geometry and representation theory.

Large deviations of the largest and smallest eigenvalues of $\mathbf{X}\mathbf{X}^\top/n$ are studied in this note, where $\mathbf{X}_{p\times n}$ is a $p\times n$ random matrix with independent and identically distributed (i.i.d.) sub-Gaussian entries. The assumption imposed on the dimension size p and the sample size n is $p=p(n)\rightarrow\infty$ with $p(n)={\mathrm{o}}(n)$ . This study generalizes one result obtained in [3].

Kruskal’s theorem states that a sum of product tensors constitutes a unique tensor rank decomposition if the so-called k-ranks of the product tensors are large. We prove a ‘splitting theorem’ for sets of product tensors, in which the k-rank condition of Kruskal’s theorem is weakened to the standard notion of rank, and the conclusion of uniqueness is relaxed to the statement that the set of product tensors splits (i.e., is disconnected as a matroid). Our splitting theorem implies a generalization of Kruskal’s theorem. While several extensions of Kruskal’s theorem are already present in the literature, all of these use Kruskal’s original permutation lemma and hence still cannot certify uniqueness when the k-ranks are below a certain threshold. Our generalization uses a completely new proof technique, contains many of these extensions and can certify uniqueness below this threshold. We obtain several other useful results on tensor decompositions as consequences of our splitting theorem. We prove sharp lower bounds on tensor rank and Waring rank, which extend Sylvester’s matrix rank inequality to tensors. We also prove novel uniqueness results for nonrank tensor decompositions.

We develop a method based on the Burau matrix to detect conditions on the linking numbers of braid strands. Our main application is to iterated exchanged braids. Unless the braid permutation fixes both braid edge strands, we establish under some fairly generic conditions on the linking numbers a ‘subsymmetry’ property; in particular at most two such braids can be mutually conjugate. As an addition, we prove that the Burau kernel is contained in the commutator subgroup of the pure braid group. We discuss also some properties of the Burau image.

We first establish a lower bound on the size and spectral radius of a graph G to guarantee that G contains a fractional perfect matching. Then, we determine an upper bound on the distance spectral radius of a graph G to ensure that G has a fractional perfect matching. Furthermore, we construct some extremal graphs to show all the bounds are best possible.

We introduce a family of norms on the $n \times n$ complex matrices. These norms arise from a probabilistic framework, and their construction and validation involve probability theory, partition combinatorics, and trace polynomials in noncommuting variables. As a consequence, we obtain a generalization of Hunter’s positivity theorem for the complete homogeneous symmetric polynomials.

We prove that for a discrete determinantal process the BK inequality occurs for increasing events generated by simple points. We also give some elementary but nonetheless appealing relationships between a discrete determinantal process and the well-known CS decomposition.

We introduce a notion of barycenter of a probability measure related to the symmetric mean of a collection of non-negative real numbers. Our definition is inspired by the work of Halász and Székely, who in 1976 proved a law of large numbers for symmetric means. We study the analytic properties of this Halász–Székely barycenter. We establish fundamental inequalities that relate the symmetric mean of a list of non-negative real numbers with the barycenter of the measure uniformly supported on these points. As consequence, we go on to establish an ergodic theorem stating that the symmetric means of a sequence of dynamical observations converge to the Halász–Székely barycenter of the corresponding distribution.

A $D_{\infty }$-topological Markov chain is a topological Markov chain provided with an action of the infinite dihedral group $D_{\infty }$. It is defined by two zero-one square matrices A and J satisfying $AJ=JA^{\textsf {T}}$ and $J^2=I$. A flip signature is obtained from symmetric bilinear forms with respect to J on the eventual kernel of A. We modify Williams’ decomposition theorem to prove the flip signature is a $D_{\infty }$-conjugacy invariant. We introduce natural $D_{\infty }$-actions on Ashley’s eight-by-eight and the full two-shift. The flip signatures show that Ashley’s eight-by-eight and the full two-shift equipped with the natural $D_{\infty }$-actions are not $D_{\infty }$-conjugate. We also discuss the notion of $D_{\infty }$-shift equivalence and the Lind zeta function.

In this paper, we study the images of multilinear graded polynomials on the graded algebra of upper triangular matrices $UT_n$ . For positive integers $q\leq n$ , we classify these images on $UT_{n}$ endowed with a particular elementary ${\mathbb {Z}}_{q}$ -grading. As a consequence, we obtain the images of multilinear graded polynomials on $UT_{n}$ with the natural ${\mathbb {Z}}_{n}$ -grading. We apply this classification in order to give a new condition for a multilinear polynomial in terms of graded identities so that to obtain the traceless matrices in its image on the full matrix algebra. We also describe the images of multilinear polynomials on the graded algebras $UT_{2}$ and $UT_{3}$ , for arbitrary gradings. We finish the paper by proving a similar result for the graded Jordan algebra $UJ_{2}$ , and also for $UJ_{3}$ endowed with the natural elementary ${\mathbb {Z}}_{3}$ -grading.

For a not-necessarily commutative ring $R$ we define an abelian group $W(R;M)$ of Witt vectors with coefficients in an $R$-bimodule $M$. These groups generalize the usual big Witt vectors of commutative rings and we prove that they have analogous formal properties and structure. One main result is that $W(R) := W(R;R)$ is Morita invariant in $R$. For an $R$-linear endomorphism $f$ of a finitely generated projective $R$-module we define a characteristic element $\chi _f \in W(R)$. This element is a non-commutative analogue of the classical characteristic polynomial and we show that it has similar properties. The assignment $f \mapsto \chi _f$ induces an isomorphism between a suitable completion of cyclic $K$-theory $K_0^{\mathrm {cyc}}(R)$ and $W(R)$.

Every transitive family of subspaces of a vector space of finite dimension $n\ge 2$ over a field $\mathbb {F}$ contains a subfamily which is transitive but has no proper transitive subfamily. Such a subfamily is called minimally transitive. Each has at most $n^2-n+1$ elements. On ${{\mathbb {C}}}^n, n\ge 3$ , a minimally transitive family of subspaces has at least four elements and a minimally transitive family of one-dimensional subspaces has $\tau $ elements where $n+1\le \tau \le 2n-2$ . We show how a minimally transitive family of one-dimensional subspaces arises when it consists of the subspaces spanned by the standard basis vectors together with those spanned by $0$ – $1$ vectors. On a space of dimension four, the set of nontrivial elements of a medial subspace lattice has five elements if it is minimally transitive. On spaces of dimension $12$ or more, the set of nontrivial elements of a medial subspace lattice can have six or more elements and be minimally transitive.

We study the classical Hermite–Hadamard inequality in the matrix setting. This leads to a number of interesting matrix inequalities such as the Schatten p-norm estimates

$$ \begin{align*}\left(\|A^q\|_p^p + \|B^q\|_p^p\right)^{1/p} \le \|(xA+(1-x)B)^q\|_p+ \|((1-x)A+xB)^q\|_p, \end{align*} $$

$n\times n$

$A,B$

$0<q,x<1$

$X^*X+Y^*Y=XX^*+YY^*=I$

$$ \begin{align*}(X^*AX+Y^*BY)\oplus (Y^*AY+X^*BX) =\frac{1}{2n}\sum_{k=1}^{2n} U_k (A\oplus B)U_k^*, \end{align*} $$

$2n\times 2n$

$U_k$

Let $F$ be an infinite field of positive characteristic $p > 2$ and let $G$ be a group. In this paper, we study the graded identities satisfied by an associative algebra equipped with an elementary $G$-grading. Let $E$ be the infinite-dimensional Grassmann algebra. For every $a$, $b\in \mathbb {N}$, we provide a basis for the graded polynomial identities, up to graded monomial identities, for the verbally prime algebras $M_{a,b}(E)$, as well as their tensor products, with their elementary gradings. Moreover, we give an alternative proof of the fact that the tensor product $M_{a,b}(E)\otimes M_{r,s}(E)$ and $M_{ar+bs,as+br}(E)$ are $F$-algebras which are not PI equivalent. Actually, we prove that the $T_{G}$-ideal of the former algebra is contained in the $T$-ideal of the latter. Furthermore, the inclusion is proper. Recall that it is well known that these algebras satisfy the same multilinear identities and hence in characteristic 0 they are PI equivalent.

Motivated by considerations of the quadratic orthogonal bisectional curvature, we address the question of when a weighted graph (with possibly negative weights) has nonnegative Dirichlet energy.