Related papers: Orthosymplectic superoscillator Lax matrices
We define strict and lax orthogonal factorization systems on double categories. These consist of an orthogonal factorization system on arrows and one on double cells that are compatible with each other. Our definitions are motivated by…
We consider the factorization of a rectangular matrix $X $ into a positive linear combination of rank-one factors of the form $u v^\top$, where $u$ and $v$ belongs to certain sets $\mathcal{U}$ and $\mathcal{V}$, that may encode specific…
We show that almost commuting real orthogonal matrices are uniformly close to exactly commuting real orthogonal matrices. We prove the same for symplectic unitary matrices. This is in contrast to the general complex case, where not all…
We describe several methods of constructing R-matrices that are dependent upon many parameters, for example unitary R-matrices and R-matrices whose entries are functions. As an application, we construct examples of R-matrices with…
The finite Pfaff lattice is given by commuting Lax pairs involving a finite matrix L (zero above the first subdiagonal) and a projection onto Sp(N). The lattice admits solutions such that the entries of the matrix L are rational in the time…
We find a recursive algorithm for computing the precise centralizers of the complex orthogonal and symplectic groups, and hence the isotropy groups, with respect to the similarity transformation on the spaces of skew-symmetric and…
To provide tools, especially L-operators, for use in studies of rational Yang-Baxter algebras and quantum integrable models when the Lie algebras so(N) (b_n, d_n) or sp(2n) (c_n) are the invariance algebras of their R matrices, this paper…
Given a superelliptic curve $Y_K : y^n = f(x)$ over a local field $K$, we describe the theoretical background and an implementation of a new algorithm for computing the $\mathcal{O}_K$-lattice of integral differential forms on $Y_K$. We…
This paper introduces lax orthogonal algebraic weak factorisation systems on 2-categories and describes a method of constructing them. This method rests in the notion of simple 2-monad, that is a generalisation of the simple reflections…
Sequences of bivariate orthogonal polynomials written as vector polynomials of increasing size satisfy a couple of three term relations with matrix coefficients. In this work, introducing a time-dependent parameter, we analyse a Lax-type…
We extend the recursion formula for matrix Bessel functions, which we obtained previously, to superspace. It is sufficient to do this for the unitary orthosymplectic supergroup. By direct computations, we show that fairly explicit results…
We descibe a number of dynamical systems that are generalizations of S. Kowalevskaya system and admit the Lax representation.
The Pfaff lattice is an integrable system arising from the SR-group factorization in an analogous way to how the Toda lattice arises from the QR-group factorization. In our recent paper [{\it Intern. Math. Res. Notices}, (2007) rnm120], we…
Correlation functions of the two-dimensional Ising model on the periodic lattice can be expressed in terms of form factors - matrix elements of the spin operator in the basis of common eigenstates of the transfer matrix and translation…
A systematic method of constructing manifestly supersymmetric $1+1$-dimensional KP Lax hierarchies is presented. Closed expressions for the Lax operators in terms of superfield eigenfunctions are obtained. All hierarchy equations being…
Hermitian symplectic spaces provide a natural framework for the extension theory of symmetric operators. Here we show that hermitian symplectic spaces may also be used to describe the solution to the factorisation problem for the scattering…
In this paper we have discussed different possible orthogonalities in matrices, namely orthogonal, quasi-orthogonal, semi-orthogonal and non-orthogonal matrices including completely positive matrices, while giving some of their…
The Riccati equation method is used to establish new oscillation criteria for linear matrix Hamiltonian systems. New approaches allow to extend and completed a result, obtained by S. Kumary and S. Umamaheswaram. The oscillation problem for…
Randomized sampling has recently been demonstrated to be an efficient technique for computing approximate low-rank factorizations of matrices for which fast methods for computing matrix vector products are available. This paper describes an…
We utilise characteristic identities to construct eigenvalue formulae for invariants and reduced matrix elements corresponding to irreducible representations of osp(m|n). In presenting these results, we further develop our programme of…