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

Given a non-empty genus in $n$ dimensions with determinant $d$, we give a randomized algorithm that outputs a quadratic form from this genus. The time complexity of the algorithm is poly$(n,\log d)$; assuming Generalized Riemann Hypothesis…

We show that a formalism proposed by Creutz to evaluate Grassmann integrals provides an algorithm of complexity $O(2^n n^3)$ to compute the generating function for the sum of the permanental minors of a matrix of order $n$. This algorithm…

We obtain a presentation of Schur algebras (and q-Schur algebras) by generators and relations which is compatible with the usual presentation of the enveloping algebra (quantized enveloping algebra) corresponding to the Lie algebra gl(n) of…

We consider three families of groups: the Bianchi groups SL(2,O) where O is the ring of integers of an imaginary, quadratic field; the groups SL*(2,O) where O is a *-order of a definite, rational quaternion algebra with an orthogonal…

We study fundamental groups of non compact Riemannian manifolds. We find conditions which ensure that the fundamental group is trivial, finite or finitely generated.

This paper has two main parts. In the first part we develop an elementary coordinatization for any nilpotent group $G$ taking exponents in a binomial principal ideal domain (PID) $A$. In case that the additive group $A^+$ of $A$ is finitely…

Conditional distribution is a fundamental quantity for describing the relationship between a response and a predictor. We propose a Wasserstein generative approach to learning a conditional distribution. The proposed approach uses a…

We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…

In this note, we present an analogue for codes in vector spaces with a Rosenbloom-Tsfasman metric of the well-known standard form of generator matrices for codes in spaces with the Hamming metric.

In this article, we introduce a non Gaussian long memory process constructed by the aggregation of independent copies of a fractional L\'evy Ornstein-Uhlenbeck process with random coefficients. Several properties and a limit theorem are…

Algorithms for generating random numbers that follow a gamma distribution with shape parameter less than unity are proposed. Acceptance-rejection algorithms are developed, based on the generalized exponential distribution. The squeeze…

We introduce a theory of probability in $\lambda$-rings designed to efficiently describe random variables valued in multisets of complex numbers, varieties over a field, or other similar enriched settings. A key role is played by the…

For families of orthogonal and symplectic types quantum matrix (QM-) algebras, we derive corresponding versions of the Cayley-Hamilton theorem. For a wider family of Birman-Murakami-Wenzl type QM-algebras, we investigate a structure of its…

A construction that generates Williamson matrices of order $2n$ from Williamson matrices of odd order $n$ is presented. The construction is completely constructive and only uses three simple sequence operations.

The girth of a finitely generated group G is the supremum of the girth of Cayley graphs for G over all finite generating sets. Let G be a finitely generated subgroup of the mapping class group Mod(S), where S is a compact orientable…

For any order of growth $f(n)=o(\log n)$ we construct a finitely-generated group $G$ and a set of generators $S$ such that the Cayley graph of $G$ with respect to $S$ supports a harmonic function with growth $f$ but does not support any…

We propose a simple one sided Monte-Carlo algorithm to distinguish, to any given degree of certainty, between certain symplectic and orthogonal groups over fields of odd order. The algorithm does not use an order oracle and works in…

We discuss the group theory relevant to the ground-state baryons in large N_c QCD. For very large representation, the group generators become classical variables. We find the form of the classical generators for the completely symmetric N…

We show that the infinitesimal generator of the symmetric simple exclusion process, recast as a quantum spin-1/2 ferromagnetic Heisenberg model, can be solved by elementary techniques on the complete, complete bipartite, and related…

Let $K/k$ be a finite extension of a global field. Such an extension can be generated over $k$ by a single element. The aim of this article is to prove the existence of a "small" generator in the function field case. This answers the…