Related papers: Gram-Schmidt-Vaserstein generators for odd sized e…
In this paper, we study matricial representations of certain finitely presented groups with N-generators of order-2. As an application, we consider a group algebra under our representations. Specifically, we characterize the inverses of all…
We describe a new class of groups of Burnside type, giving a procedure transforming an arbitrary non-free minimal action of the dihedral group on a Cantor set into an orbit-equivalent action of an infinite finitely generated periodic group.…
We present a class of symplectic matrices which transform by similarity given $2n\times 2n$ -dimensional matrix into Bunse-Gerstner form. If the given matrix is skew-Hamiltonian, the transformation gives a solution of an antisymmetric…
In this article, we study connections between components of the Cayley graph $\mathrm{Cay}(G,A)$, where $A$ is an arbitrary subset of a group $G$, and cosets of the subgroup of $G$ generated by $A$. In particular, we show how to construct…
It is well known that the proportion of pairs of elements of $\operatorname{SL}(n,q)$ which generate the group tends to $1$ as $q^n\to \infty$. This was proved by Kantor and Lubotzky using the classification of finite simple groups. We give…
In this article, we study the normal generation of the mapping class group. We first show that a mapping class is a normal generator if its restriction on the invariant subsurface normally generates the (pure) mapping class group of the…
Motivated by the randomized generation of slowly synchronizing automata, we study automata made of permutation letters and a merging letter of rank $ n\!-\!1 $. We present a constructive randomized procedure to generate synchronizing…
We survey several methods of generating large random lambda-terms, focusing on their closed and simply-typed variants. We discuss methods of exact- and approximate-size generation, as well as methods of achieving size-uniform and…
We show how the infinitesimal exchangeable pairs approach to Stein's method combines naturally with the theory of Markov semigroups. We present a multivariate normal approximation theorem for functions of a random variable invariant with…
Correlation functions for matrix ensembles with orthogonal and unitarysymplectic rotation symmetry are more complicated to calculate than in the unitary case. The supersymmetry method and the orthogonal polynomials are two techniques to…
Remarkable work of Kaledin, based on earlier joint work with Bezrukavnikov, has constructed a tilting generator of the category of coherent sheaves on a very general class of symplectic resolutions of singularities. In this paper, we give a…
In this short note we use the notion of power structure over the Grothendieck ring of complex algebraic varieties to study generating series of classes of Hilbert schemes of points on complex orbifolds.
It is a classical problem to compute a minimal set of invariant polynomial generating the invariant ring of a finite group as an algebra. We present here an algorithm for the computation of minimal generating sets in the non-modular case.…
For $G$ a symplectic or orthogonal $p$-adic group (not necessarily split), or an inner form of a general linear $p$-adic group, we compute the endomorphism algebras of some induced projective generators \`a la Bernstein of the category of…
Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…
Randomized methods, such as the randomized SVD (singular value decomposition) and Nystr\"om approximation, are an effective way to compute low-rank approximations of large matrices. Motivated by applications to operator learning, Boull\'e…
We give a finite presentation by generators and relations for the group O_n(Z[1/2]) of n-dimensional orthogonal matrices with entries in Z[1/2]. We then obtain a similar presentation for the group of n-dimensional orthogonal matrices of the…
We construct an explicit set of algebraically independent generators for the center of the universal enveloping algebra of the centralizer of a nilpotent matrix in the Lie algebra gl_N(C). In particular, this gives a new proof of the…
Quadratic harnesses are time-inhomogeneous Markov polynomial processes with linear conditional expectations and quadratic conditional variances with respect to the past-future filtrations. Typically they are determined by five numerical…
We describe a new random greedy algorithm for generating regular graphs of high girth: Let $k\geq 3$ and $c \in (0,1)$ be fixed. Let $n \in \mathbb{N}$ be even and set $g = c \log_{k-1} (n)$. Begin with a Hamilton cycle $G$ on $n$ vertices.…