Related papers: Unipotent Generators for Arithmetic Groups
Motivated by the classical ideas of generating functions for orthogonal polynomials, we initiate a new line of investigation on "generating operators" for a family of differential operators between two manifolds. We prove a novel formula of…
To the best of our knowledge, there is no explicit, constructive description of the generating set for the unit group $A(G)^\times$ of the Burnside ring associated with a finite group $G$. We resolve this long-standing open question,…
In this paper, we formulate the notion of split elements of a unipotent class in a connected reductive group $G$. Generalized Green functions of $G$ can be computed by using Lusztig's algorithm, if split elements exist for any unipotent…
Irrespective of whether n is prime, prime power with exponent >1, or composite, the group U_n of units of Z_n can sometimes be obtained as the direct product of cyclic groups generated by x, x+k and x+2k, for x, k in Z_n. Indeed, for many…
Explicit generators are given for the ring of invariant polynomials under the coadjoint representation of certain inhomogeneous groups.
This paper studies effective separability for subgroups of finitely generated nilpotent groups and more broadly effective subgroup separability of finitely generated nilpotent groups. We provide upper and lower bounds that are polynomial…
Let S=Sym(\Omega) be the group of all permutations of an infinite set \Omega. Extending an argument of Macpherson and Neumann, it is shown that if U is a generating set for S as a group, respectively as a monoid, then there exists a…
In this paper, we introduce a method computing the primitive decomposition of idempotents of any semisimple finite group algebra based on its matrix representations and Wedderburn decomposition. Particularly, we use this method to calculate…
We discuss the problem of calculating generators of power integral bases in sextic fields, especially focusing on the case of sextic fields with real quadratic subfields. Our main purpose is to describe an efficient algorithm for…
We construct natural symbolic representations of intrinsically ergodic, but not necessarily expansive, principal algebraic actions of countably infinite amenable groups and use these representations to find explicit generating partitions…
We prove a rigidity theorem for morphisms from products of open subschemes of the projective line into solvable groups not containing a copy of $\Ga$ (for example, wound unipotent groups). As a consequence, we deduce several structural…
The aim of this paper is to study the pro-algebraic fundamental group of a compact Kaehler manifold. Following work by Simpson, the structure of this group's pro-reductive quotient is already well understood. We show that Hodge-theoretic…
This paper is purely expository. We present short elementary proofs of * the Gauss Theorem on constructibility of regular polygons; * the existence of a cubic equation unsolvable in real radicals; * the existence of a quintic equation…
Arithmetic groups are groups of matrices with integral entries. We shall first discuss their origin in number theory (Gauss, Minkowski) and their role in the "reduction theory of quadratic forms". Then we shall describe these groups by…
We prove two approximations of the open problem of whether the adjoint group of a non-nilpotent nil ring can be finitely generated: We show that the adjoint group of a non-nilpotent Jacobson radical cannot be boundedly generated, and on the…
We give two explicit sets of generators of the group of invertible regular functions over QQ on the modular curve Y1(N). The first set of generators is very surprising. It is essentially the set of defining equations of Y1(k) for k <= N/2…
A finite group $G$ is called *uniformly generated*, if whenever there is a (strictly ascending) chain of subgroups $1<\langle x_1\rangle<\langle x_1,x_2\rangle <\cdots<\langle x_1,x_2,\dots,x_d\rangle=G$, then $d$ is the minimal number of…
A group obtained from a nontrivial group by adding one generator and one relator which is a proper power of a word in which the exponent-sum of the additional generator is one contains the free square of the initial group and almost always…
Originally motivated by algebraic invariant theory, we present an algorithm to enumerate integer vectors modulo the action of a permutation group. This problem generalizes the generation of unlabeled graph up to an isomorphism. In this…
Suppose $G$ is a real reductive group. The determination of the irreducible unitary representations of $G$ is one of the major unsolved problem in representation theory. There is evidence to suggest that every irreducible unitary…