Related papers: Gram-Schmidt-Vaserstein generators for odd sized e…

We give a bijection between meanders and special sorts of Gauss diagrams which aroused from the Thurston generators of braid groups. It allows us to give an algorithm to construct such diagrams and to code meanders by matrices which are…

In this paper a generalization of the Gram-Schmidt Algorithm is presented. Actually we provide an algorithm to construct a set of equiangular vectors with a given angle $\theta\in(0,\arccos(\frac{-1}{n-1}))$ using a set of input independent…

The dominant theme of this thesis is the construction of matrix representations of finite solvable groups using a suitable system of generators. For a finite solvable group $G$ of order $N = p_{1}p_{2}\dots p_{n}$, where $p_{i}$'s are…

Odd symplectic Grassmannians are a generalization of symplectic Grassmannians to odd-dimensional spaces. Here we compute the classical and quantum cohomology of the odd symplectic Grassmannian of lines. Although these varieties are non…

We propose a superfast method for constructing orthogonal matrices $M\in\mathcal{O}(n,q)$ in finite fields $GF(q)$. It can be used to construct $n\times n$ orthogonal matrices in $Z_p$ with very high values of $n$ and $p$, and also…

We obtain a generator system of the algebra of $\mathrm{GL}(V)$-invariant differential forms on $\mathrm{End}_{\bf k} (V)$. The proof uses the Weyl-Schur reciprocity.

Generalizing Krieger's finite generation theorem, we give conditions for an ergodic system to be generated by a pair of partitions, each required to be measurable with respect to a given sub-algebra, and also required to have a fixed size.

Given an integer $M\geq 2$, we deploy the generating function techniques to compute the number of $M$-th roots of identity in some of the well-known finite groups of Lie type, more precisely for finite general linear groups, symplectic…

Score-based Generative Models (SGMs) approximate a data distribution by perturbing it with Gaussian noise and subsequently denoising it via a learned reverse diffusion process. These models excel at modeling complex data distributions and…

Let I be a finite partially ordered set and let (Sym({\Delta}i),{\Delta}i)i be a sequence of symmetric groups indexed by I. Construct the generalised wreath product (F, {\Delta}) on this sequence of permutation groups. We determine the…

This paper had no abstract originally. A second-order symplectic integration algorithm for guiding center motion is presented. The algorithm is based on the Poincar\'e (mid-point) generating function.

Parametrized and random unitary (or orthogonal) $n$-qubit circuits play a central role in quantum information. As such, one could naturally assume that circuits implementing symplectic transformations would attract similar attention.…

The divergence-like operator on an odd symplectic superspace which acts invariantly on a specially chosen odd vector field is considered. This operator is used to construct an odd invariant semidensity in a geometrically clear way. The…

We define the odd symplectic grassmannians and flag manifolds, which are smooth projective varieties equipped with an action of the odd symplectic group and generalizing the usual symplectic grassmannians and flag manifolds. Contrary to the…

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…

We prove that for a number field $F$, the distribution of the points of a set $\Sigma \subset \mathbb{A}_F^n$ with a purely exponential parametrization, for example a set of matrices boundedly generated by semi-simple (diagonalizable)…

We study the problem of finding generators for the fundamental group G of a space of the following sort: one removes a family of complex hyperplanes from n dimensional complex vector space, or n dimensional complex hyperbolic space, or the…

Hashimoto and Ueda determined the weights of generators of the graded ring of modular forms on the Cayley half-space of degree two. In this paper we describe explicit generators. We show that the graded ring can be generated by Eisenstein…

We derive the limiting matrix kernels for the the Gaussian Orthogonal and Symplectic ensembles scaled at the edge, with proofs of convergence in the operator norms that assure convergence of the determinants.

This paper explores the problem of generative modeling, aiming to simulate diverse examples from an unknown distribution based on observed examples. While recent studies have focused on quantifying the statistical precision of popular…