Related papers: Gram-Schmidt-Vaserstein generators for odd sized e…
This paper presents a new algorithm for generating random inverse-Wishart matrices that directly generates the Cholesky factor of the matrix without computing the factorization. Whenever parameterized in terms of a precision matrix…
We construct an explicit set of generators for the finite W-algebras associated to nilpotent matrices in the symplectic or orthogonal Lie algebras whose Jordan blocks are all of the same size. We use these generators to show that such…
The sister of Eisenstein-Picard modular group was described in [8]. In this paper we give a similar definition of the sister of the Euclidean-Picard modular group and find its generators by using a geometric method.
For an integer $M\geq 2$ and a finite group $G$, an element $\alpha\in G$ is called an $M$-th power if it satisfies $A^M=\alpha$ for some $A\in G$. In this article, we will deal with the case when $G$ is finite symplectic or orthogonal…
An explicit form of the generators of quantum and ordinary semisimple algebras for an arbitrary finite-dimensional representation is found. The generators corresponding to the simple roots are obtained in terms of a solution of a system of…
In this paper we describe some properties of the generalized Gram-Schmidt procedure (GGSP) for generating Parseval frames which was first introduced by Casazza and Kutyniok [A generalization of Gram-Schmidt orthogonalization generating all…
We demonstrate quantum algorithms to implement pseudo-random operators that closely reproduce statistical properties of random matrices from the three universal classes: unitary, symmetric, and symplectic. Modified versions of the…
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…
Over a field of characteristic 0, the algebra of invariants of several $n\times n$ matrices under simultaneous conjugation by $GL_n$ is generated by traces of products of generic matrices. In this paper we have found, in terms of…
Two families of symplectic methods specially designed for second-order time-dependent linear systems are presented. Both are obtained from the Magnus expansion of the corresponding first-order equation, but otherwise they differ in…
This paper introduces the concept of a generating set for stochastic matrices -- a subset of matrices whose repeated composition generates the entire set. Understanding such generating sets requires specifying the "indivisible elements" and…
The algebra of symmetric functions contains several interesting families of symmetric functions indexed by integer partitions or skew partitions. Given a sequence $\{u_n\}$ of symmetric functions taken from one of these families such that…
We present a method for computing the Hilbert series of the algebra of invariants of the complex symplectic and orthogonal groups acting on graded noncommutative algebras with homogeneous components which are polynomial modules of the…
A characterization of finitely generated shift-invariant subspaces is given when generators are g-minimal. An algorithm is given for the determination of the coefficients in the well known representation of the Fourier transform of an…
Various specifiable combinatorial structures, with d extensive parameters, can be exactly sampled both by the recursive method, with linear arithmetic complexity if a heavy preprocessing is performed, or by the Boltzmann method, with…
A parametrization, given by the Euler angles, of Hermitian matrix generators of even and odd-degenerate Clifford algebras is constructed by means of the Kronecker product of a parametrized version of Pauli matrices and by the identification…
Given a numerical semigroup $S$ and a positive integer $d$, the fraction $\frac{S}{d}=\{ x \in \mathbb{N} \ | \ dx \in S\}$ is again a numerical semigroup. In this paper we determine a generating set for $\frac{S}{d}$ in terms of the…
In addition to rather complicated general methods it is interesting and valuable to develop fast efficient methods for calculating generators of power integral bases in special types of number fields. We consider sextic fields containing a…
We build generalizations of the Grassmann algebras from a few simple assumptions which are that they are graded, maximally symmetric and contain an ordinary Grassmann algebra as a subalgebra. These algebras are graded by Z_{n}^{3} and…
We introduce a class of finite dimensional nonlinear superalgebras $L = L_{\bar{0}} + L_{\bar{1}}$ providing gradings of $L_{\bar{0}} = gl(n) \simeq sl(n) + gl(1)$. Odd generators close by anticommutation on polynomials (of degree $>1$) in…