Related papers: Random endomorphisms of spherical reflection group…

We prove sharp limit theorems on random walks on graphs with values in finite groups. We then apply these results (together with some elementary algebraic geometry, number theory, and representation theory) to finite quotients of lattices…

For bounded pseudoconvex domains with finite type we give a precise description of the automorphism group: if an orbit of the automorphism group accumulates on at least two different points of the boundary, then the automorphism group has…

We show that for a finite group $G$, the commuting probability of $G$ can be explicitly bounded from below in a nontrivial way by a function in the maximum fraction of elements inverted resp. squared by an automorphism of $G$. Using these…

Let $\mathbf{k}$ be an algebraically closed field. Recently, K. Erdmann classified the symmetric $\mathbf{k}$-algebras $\Lambda$ of finite representation type such that every non-projective module $M$ has period dividing four. The goal of…

We formulate and investigate a statistical inverse problem of a random tomographic nature, where a probability density function on $\mathbb{R}^3$ is to be recovered from observation of finitely many of its two-dimensional projections in…

For an elliptic curve $E$ over a finite field we define the point sequence $(P_n)$ recursively by $P_n=\vartheta (P_{n-1})=\vartheta ^n(P_0)$ with an endomorphism $\vartheta \in\mathrm{End}(E)$ and with some initial point $P_0$ on $E$. We…

The random walk to be considered takes place in the d- spherical dual of the group U(n + 1), for a fixed finite dimensional irreducible representation d of U(n). The transition matrix comes from the three term recursion relation satisfied…

Light scattering in random media is usually considered within the framework of the three-dimensional Anderson universality class, with modifications for the vector nature of electromagnetic waves. We propose that the linear dispersiveness…

In this paper we describe the automorphism groups of the endomorphism semigroups of free Burnside groups $B(m,n)$ for odd exponents $n\ge1003$. We prove, that the groups $Aut(End(B(m,n)))$ and $Aut(B(m,n))$ are isomorphic. In particular, if…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

We design a probabilistic algorithm for computing endomorphism rings of ordinary elliptic curves defined over finite fields that we prove has a subexponential runtime in the size of the base field, assuming solely the generalized Riemann…

Erd\H{o}s and R\'{e}nyi showed the paradoxical result that there is a unique (and highly symmetric) countably infinite random graph. This graph, and its automorphism group, form the subject of the present survey.

We study algebra endomorphisms and derivations of some localized down-up algebras $\A$. First, we determine all the algebra endomorphisms of $\A$ under some conditions on $r$ and $s$. We show that each algebra endomorphism of $\A$ is an…

Geometric properties of $N$ random points distributed independently and uniformly on the unit sphere $\mathbb{S}^{d}\subset\mathbb{R}^{d+1}$ with respect to surface area measure are obtained and several related conjectures are posed. In…

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

We relate the endomorphism rings of certain $D$-elliptic sheaves of finite characteristic to hereditary orders in central division algebras over function fields.

This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…

Consider n unit intervals, say [1,2], [3,4], ..., [2n-1,2n]. Identify their endpoints in pairs at random, with all (2n-1)!! = (2n-1) (2n-3) ... 3 1 pairings being equally likely. The result is a collection of cycles of various lengths, and…

Let $\psi$ be a permutation of a finite set $X$. We define $\lambda(\psi)$ to be the largest fraction of elements of $X$ lying on a single cycle of $\psi$. For a finite group $G$, we define $\lambda(G)$ to be the maximum among the values…