相关论文: Algorithm for generating orthogonal matrices with …

Hadamard matrices are square $n\times n$ matrices whose entries are ones and minus ones and whose rows are orthogonal to each other with respect to the standard scalar product in $\Bbb R^n$. Each Hadamard matrix can be transformed to a…

A recursion formula is derived which allows to evaluate invariant integrals over the orthogonal group O(N), where the integrand is an arbitrary finite monomial in the matrix elements of the group. The value of such an integral is…

For the family of the orthogonal quantum matrix algebras we investigate the structure of their characteristic subalgebras -- special commutative subalgebras, which for the subfamily of the reflection equation algebras appear to be central.…

In the early part of the paper, various geometrical formulas are derived. Then, at some point in the paper, the concept of a Pythagorean rational is introduced. A Pythagorean rational is a rational number which is the ratio of two integers…

In this article, we construct a generating set of rational invariants for the action of the orthogonal group $\text{O}(n)$ on the space $\mathbb{R}[x_1,\dots,x_n]_{2d}$ of real homogeneous polynomials of even degree $2d$. This generalizes a…

For a fixed dimension $N$ we compute the generating function of the numbers $t_N(n)$ (respectively $\bar{t}_N(n)$) of $PGL_{N+1}(k)$-orbits of rational $n$-sets (respectively rational $n$-multisets) of the projective space $\mathb{P}^N$…

For the rational group algebra $\mathbb{Q}G$ of a finite group $G$, we provide an effective method to compute a complete set of matrix units and, in particular, primitive orthogonal idempotents in a simple component of $\mathbb{Q}G$, which…

We consider the groups of regular circulant matrices over finite fields and integer residue class rings. In both cases we present a formula for the order of these groups. We also make a first step towards finding the algebraic structure of…

Constructive algorithms, requiring no more than $2\times 2$ matrix manipulations, are provided for finding the entries of the positive definite factor in the polar decomposition of matrices in sixteen groups preserving a bilinear form in…

Orthogonal matrices which are linear combinations of permutation matrices have attracted enormous attention in quantum information and computation. In this paper, we provide a complete parametric characterization of all complex, real and…

Let $n$ be a positive integer and $\mathcal M$ a set of rational $n \times n$-matrices such that $\mathcal M$ generates a finite multiplicative semigroup. We show that any matrix in the semigroup is a product of matrices in $\mathcal M$…

The metohod of ortogonal rotations introduced in the previous papers of the author is used for construction of the explicit form the generators of the simple roots for quantum (and ussual) semisimple algebras. All calculations are presented…

We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.

We formulate the unitary rational orbifold conformal field theories in the algebraic quantum field theory framework. Under general conditions, we show that the orbifold of a given unitary rational conformal field theories generates a…

This note describes a technique for generating large non-singular matrices with blocks of full rank. Our motivation to construct such matrices arises in the white-box implementation of cryptographic algorithms with S-boxes.

We provide a new tableau model from which one can easily deduce the characters of finite-dimensional irreducible polynomial representations of the special orthogonal group $SO_n(\mathbb{C})$. This model originates from the representation…

We establish that standard arithmetic subgroups of a special orthogonal group ${\rm SO}(1,n)$ are conjugacy separable. As an application we deduce this property for unit groups of certain integer group rings. We also prove that finite…

In the present paper we derive complicated families of orthogonal polynomials in one variable from scratch using the known ones as building blocks. We recall the basics of operational formalism and introduce the notations we use throughout…

We provide an algorithm to compute generators of the orthogonal group of the discriminant group associated to an integral quadratic lattice over the integers. We give a closed formula for its order.

In this paper we use an elementary approach by using numerical semigroups (specifically, those with two generators) to give a formula for the number of integral points inside a right-angled triangle with rational vertices. This is the basic…