相关论文: The General Form Of Cyclic Orthonormal Generators …

Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…

We define standardized constructions of finite fields, and standardized generators of (multiplicative) cyclic subgroups in these fields. The motivation is to provide a substitute for Conway polynomials which can be used by various software…

The stochastic generators of Markov-regular operator cocycles on symmetric Fock space are studied in a variety of cases: positive cocycles, projection cocycles, and partially isometric cocycles. Moreover a class of transformations of…

Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.

The purpose of this paper is to study the cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$. After providing the generator polynomial of cyclic self orthogonal codes over $\mathbb{Z}_{p^m}$, we give the necessary and sufficient condition…

Generators of SO(8) group have been described by using direct product of the Gamma matrices and the Pauli Sigma matrices. We have obtained these generators in terms of generalized split octonion also. These generators have been used to…

We give a canonical form for a complex matrix, whose square is normal, under transformations of unitary similarity as well as a canonical form for a real matrix, whose square is normal, under transformations of orthogonal similarity.

We explicitly construct generators of the rational homotopy groups of the space of stable h-cobordisms of the classifying space of a cyclic group of order n by generalizing a construction of Hatcher. This result will be used in a separate…

In this paper, we study generating functions for the standard orthogonal bases of spherical harmonics and spherical monogenics in R^m. Here spherical monogenics are polynomial solutions of the Dirac equation in R^m. In particular, we obtain…

A group $G$ is called logically cyclic, if it contains an element $s$ such that every element of $G$ can be defined by a first order formula with parameter $s$. The aim of this paper is to investigate the structure of such groups.

In network coding a constant dimension code consists of a set of k-dimensional subspaces of F_q^n. Orbit codes are constant dimension codes which are defined as orbits of a subgroup of the general linear group, acting on the set of all…

We define a normal form for Clifford circuits, and we prove that every Clifford operator has a unique normal form. Moreover, we present a rewrite system by which any Clifford circuit can be reduced to normal form. This yields a presentation…

We give an explicit way of writing down a minimal set of generators for the canonical ideal of a non-degenerate curve, or of a more general smooth projective curve in a toric surface, in terms of its defining Laurent polynomial.

A cyclic $n$-gonal surface is a compact Riemann surface $X$ of genus $g\geq 2$ admitting a cyclic group of conformal automorphisms $C$ of order $n$ such that the quotient space $X/C$ has genus 0. In this paper, we provide an overview of…

We use polyhedral product models to analyse the structure of the commutator subgroup of a right-angled Artin group. In particular, we provide a minimal set of generators for the commutator subgroup, consisting of special iterated…

This paper presents an algorithmic method for generating random orthogonal matrices \(A\) that satisfy the property \(A^t S A = S\), where \(S\) is a fixed real invertible symmetric or skew-symmetric matrix. This method is significant as it…

Special orthogonal matrices with rational elements form the group SO(n,Q), where Q is the field of rational numbers. A theorem describing the structure of an arbitrary matrix from this group is proved. This theorem yields an algorithm for…

We describe a method to compute renormalized coupling constants in a Monte Carlo renormalization group calculation. It can be used, e.g., for lattice spin or gauge models. The basic idea is to simulate a joint system of block spins and…

Let G be a cyclic p-group of order p^n acting by automorphisms on a (non-necessarily commutative) ring R. Suppose there is an element x in R such that (1 + t + ... + t^{p-1})(x) = 1, where t is an element of order p in G. We show how to…

For a cyclic group $a$, define the atom of $a$ as the set of all elements generating $a$. Given any two elements $a,b$ of a finite cyclic group $G$, we study the sumset of the atom of $a$ and the atom of $b$. It is known that such a sumset…