Related papers: An algorithm for computing Schur indices of charac…

We present an efficient quantum algorithm for estimating Gauss sums over finite fields and finite rings. This is a natural problem as the description of a Gauss sum can be done without reference to a black box function. With a reduction…

We describe algorithms to represent and compute groups of Hecke characters. We make use of an id{\`e}lic point of view and obtain the whole family of such characters, including transcendental ones. We also show how to isolate the algebraic…

In math.CO/0109093 the author obtained a formula for the value of an irreducible symmetric group character indexed by a partition of rectangular shape. In the present paper this formula is (conjecturally) generalized to arbitrary shapes.

We present an explicit formula for subregular characters (i.e, irreducible finite-dimensional complex characters of submaximal degree) of the unitriangular group over a finite field of sufficiently large characteristic.

For any finite group $G$ and a positive integer $m$, we define andstudy a Schur ring over the direct power $G^m$, which gives an algebraic interpretation of the partition of $G^m$ obtained by the $m$-dimensional Weisfeiler-Leman algorithm.…

We present a new algorithm to decide finiteness of matrix groups defined over a field of positive characteristic. Together with previous work for groups in zero characteristic, this provides the first complete solution of the finiteness…

In this paper we classify the multiplicity-free skew characters of the symmetric group. Furthermore we show that the Schubert calculus is equivalent to that of skew characters in the following sense: If we decompose the product of two…

Schur's transforms of a polynomial are used to count its roots in the unit disk. These are generalized them by introducing the sequence of symmetric sub-resultants of two polynomials. Although they do have a determinantal definition, we…

Any Schur ring is uniquely determined by a partition of the elements of the group. In this paper we present a general technique for enumerating Schur rings over cyclic groups using traditional Schur rings. We also survey recent efforts to…

We provide algorithms to compute a complete irredundant set of extremely strong Shoda pairs of a finite group $G$ and the set of the primitive central idempotents of the rational group algebra $\mathbb{Q}[G]$ realized by them. These…

In 1911 Schur computed the spin character values of the symmetric group using two important ingredients: the first one later became famously known as the Schur Q-functions and the second one was certain creative construction of the…

We investigate the finite groups $G$ for which $\chi(1)^{2}=|G:Z(\chi)|$ for all characters $\chi \in Irr(G)$ and $|cd(G)|=2$. We obtain some alternate characterizations of these groups and we obtain some information regarding the structure…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

Let $G$ be a finite $p$-group of order $p^n$ and $M(G)$ be its Schur multiplier. It is well known result by Green that $|M(G)|= p^{\frac{1}{2}n(n-1)-t(G)}$ for some $t(G) \geq 0$. In this article we classify non-abelian $p$-groups $G$ of…

We introduce an insertion algorithm on Kohnert's combinatorial model for Demazure characters, generalizing Robinson--Schensted--Knuth insertion on tableaux. Our new insertion yields an explicit, nonnegative formula expressing the product of…

Iwahori-Hecke algebras for the infinite series of complex reflection groups $G(r,p,n)$ were constructed recently in the work of Ariki and Koike, Brou\'e and Malle, and Ariki. In this paper we give Murnaghan-Nakayama type formulas for…

In the first section of this senior thesis the author provides some new efficient algorithms for calculating with finite permutation groups. They cannot be found in the computer algebra system MAGMA, but they can be implemented there. For…

If $G$ is a finite classical group, linear or unitary in any characteristic, and orthogonal in odd characteristic, we give an approximate formula for $\chi(g)$ in which the error term is much smaller than the estimate, when $g\in G$ is an…

We define a graded graph, called the Schur--Weyl graph, which arises naturally when one considers simultaneously the RSK algorithm and the classical duality between representations of the symmetric and general linear groups. As one of the…

For a finite group $G$ and complex character $\chi\in\mathrm{Irr}(G)$ that restricts irreducibly to a normal subgroup $N\vartriangleleft G,$ we prove a theorem about Clifford correspondences between the characters of subgroups of $G$ that…