相关论文: Algorithm for generating orthogonal matrices with …
We develop a hierarchical matrix construction algorithm using matrix-vector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorithm uses $\mathcal{O}(\log n)$ applications of the matrix on…
Let $\mathbb{K}$ be an algebraically closed field of characteristic zero and $\mathbb{K}[x,y]$ the polynomial ring. The group $\text{SL}_{2}\left(\mathbb{K}[x,y]\right)$ of all matrices with determinant equal to $1$ over $\mathbb{K}[x,y]$…
We present a method to explicitly compute a complete set of orthogonal primitive idempotents in a simple component with Schur index 1 of a rational group algebra $\mathbb{Q}G$ for $G$ a finite generalized strongly monomial group. For the…
We study the orthogonal quantum groups satisfying the ``easiness'' assumption axiomatized in our previous paper, with the construction of some new examples, and with some partial classification results. The conjectural conclusion is that…
We give a generators and relations presentation for the full monoidal subcategory of representations of the quantum orthogonal group generated by the quantum exterior powers of the defining representation.
Matrices over the ring of formal power series are considered. Normal forms with respect to various sub-groups of the two-sided transformations are constructed. The construction is based on the special property of the action: it induces a…
Composed ensembles of random unitary matrices are defined via products of matrices, each pertaining to a given canonical circular ensemble of Dyson. We investigate statistical properties of spectra of some composed ensembles and demonstrate…
We provide an algorithm that, given any order $O$ in a quaternion algebra over a global field, computes representatives of all right equivalence classes of right $O$-ideals, including the non-invertible ones. The theory is developed for a…
In this paper we have considered a finite unitary matrix group with exact elements being unknown and only approximate elements available. Such a group becomes inconsistent with its own multiplication table. We found simple correction…
The structure of the coincidence symmetry group of an arbitrary $n$-dimensional lattice in the $n$-dimensional Euclidean space is considered by describing a set of generators. Particular attention is given to the coincidence isometry…
We study the collection of group structures that can be realized as a group of rational points on an elliptic curve over a finite field (such groups are well known to be of rank at most two). We also study various subsets of this collection…
Factoring out the spin $1$ subalgebra of a $ W $ algebra leads to a new $ W $ structure which can be seen either as a rational finitely generated $ W $ algebra or as a polynomial non-linear $ W_\infty$ realization.
Multiple orthogonal polynomials are traditionally studied because of their connections to number theory and approximation theory. In recent years they were found to be connected to certain models in random matrix theory. In this paper we…
Orthogonal polynomials and multiple orthogonal polynomials are interesting special functions because there is a beautiful theory for them, with many examples and useful applications in mathematical physics, numerical analysis, statistics…
Matrices of the irreducible representations of double crystallographic point groups O, Td, Ox{1,I} and Tdx{1,I} are derived. The characteristic polynomials (spinor bases) up to the sixth power are obtained. The method for the derivation of…
The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups…
We derive explicit isomorphisms between certain congruence subgroups of the Siegel modular group, the Hermitian modular group over an arbitrary imaginary-quadratic number field and the modular group over the Hurwitz quaternions of degree 2…
We present a uniform methodology for computing with finitely generated matrix groups over any infinite field. As one application, we completely solve the problem of deciding finiteness in this class of groups. We also present an algorithm…
Equiangular Algorithm generates a set of equiangular normalized vectors with given angle {\theta} using a set of linearly independence vectors in a real inner product space, which span the same subspaces. The outcome of EA on column vectors…
We explore in this paper some orthogonal polynomials which are naturally associated to certain families of coherent states, often referred to as nonlinear coherent states in the quantum optics literature. Some examples turn out to be known…