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

Many models for chaotic systems consist of joining two integrable systems with incompatible constants of motion. The quantum counterparts of such models have a propagator which factorizes into two integrable parts. Each part can be…

In this paper, we present a method for calculation of spin groups elements for known pseudo-orthogonal group elements with respect to the corresponding two-sheeted coverings. We present our results using the Clifford algebra formalism in…

We introduce a new constructive recognition algorithm for finite special linear groups in their natural representation. Given a group $G$ generated by a set of $d\times d$ matrices over a finite field $\mathbb{F}_q$, known to be isomorphic…

We translate the concept of succession rule and the ECO method into matrix notation, introducing the concept of a production matrix. This allows us to combine our method with other enumeration techniques using matrices, such as the method…

Discrete orthogonal matrices have several applications in information technology, such as in coding and cryptography. It is often challenging to generate discrete orthogonal matrices. A common approach widely in use is to discretize…

The algebra of invariants of d-tuples of n x n skew-symmetric matrices under the action of the orthogonal group by simultaneous conjugation is considered over an infinite field of characteristic different from two. For n=3 and d>0 a minimal…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

We review known real forms of the quantum orthogonal groups SO_q(N). New *-conjugations are then introduced and we contruct all real forms of quantum orthogonal groups. We thus give an RTT formulation of the *-conjugations on SO_q(N) that…

We discuss how to generate random unitary matrices from the classical compact groups U(N), O(N) and USp(N) with probability distributions given by the respective invariant measures. The algorithm is straightforward to implement using…

The goal of this paper is to demonstrate the use of techniques from hyperbolic geometry to compute generating sets of certain subgroups of $SL^+(2,\mathbb{C})$; specifically, $SO^+(Q,\mathbb{Z})$ for $Q$ some integral quadratic form of…

The quantum commutations $RTT=TTR$ and the orthogonal (symplectic) conditions for the inhomogeneous multiparametric $q$-groups of the $B_n,C_n,D_n$ type are found in terms of the $R$-matrix of $B_{n+1},C_{n+1},D_{n+1}$. A consistent Hopf…

The coordinate ring $\mathcal{O}_{\mathbf{q}}(\mathbb{K}^n)$ of quantum affine space is the $\mathbb{K}$-algebra presented by generators $x_1,\cdots ,x_n$ and relations $x_ix_j=q_{ij}x_jx_i$ for all $i,j$. We construct simple…

We consider the set of $n\times n$ matrices with rational entries having numerator and denominator of size at most $H$ and obtain upper and lower bounds on the number of such matrices of a given rank and then apply them to count such…

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…

An algorithm is proposed to convert arbitrary unitary matrix to a sequence of $X$ gates and fully controlled $R_y, R_z$ and $R_1$ gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations…

We examine a class of embeddings based on structured random matrices with orthogonal rows which can be applied in many machine learning applications including dimensionality reduction and kernel approximation. For both the…

Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…

The famous pancake theorem states that for every finite set $X$ in the plane, there exist two orthogonal lines that divide $X$ into four equal parts. We propose an algorithm whose running time is linear in the number of points in $X$ and…

Let $\g$ be a complex orthogonal or symplectic Lie algebra and $\g'\subset \g$ the Lie subalgebra of rank $\rk \g'=\rk \g-1$ of the same type. We give an explicit construction of generators of the Mickelsson algebra $Z_q(\g,\g')$ in terms…

We note that a rational $3$-tangle diagram is obtained from a combination of four generators. There is an algorithm to distinguish two rational $3$-tangle diagrams up to isotopy. However, there is no perfect classification about rational…