Related papers: Classification of Ramification Systems for Symmetr…
Let G be a finite group of order n and V an irreducible representation over the complex numbers of dimension d. For some nonnegative number e, we have n=d(d+e). If e is small, then the character of V has unusually large degree. We fix e and…
The normaliser problem takes as input subgroups $G$ and $H$ of the symmetric group $S_n$, and asks one to compute $N_G(H)$. The fastest known algorithm for this problem is simply exponential, whilst more efficient algorithms are known for…
I calculate characters of certain representations of loop groups based on non simply connected Lie groups. This gives a generalization of the Kac-Weyl character formula.
We estimate, in a number field, the number of elements and the maximal number of linearly independent elements, with prescribed bounds on their valuations. As a by-product, we obtain new bounds for the successive minima of ideal lattices.…
We provide a recursive construction of all the semi-Heyting algebras that can be defined on a chain with $n$ elements. This construction allows us to count them easily. We also compare the formula for the number of semi-Heyting chains thus…
In this paper we consider symmetric powers representation and exterior powers representation of finite groups, which generated by the representation which has finite dimension over the complex field. We calculate the multiplicity of…
We classify all the surfaces with p_g = q = 0 which admit an unramified covering which is isomorphic to a product of curves. Beyond the trivial case \PP^1 x \PP^1 we find 17 families which we explicitly describe. We reduce the problem to a…
There is strong evidence for the belief that `almost all' finite semigroups, whether we consider multiplication operations on a fixed set or their isomorphism classes, are nilpotent of index 3 (3-nilpotent for short). The only known method…
A collection C of subgroups of a finite group G can give rise to three different standard formulas for the cohomology of G in terms of either: the subgroups in C; or their centralizers; or their normalizers. We give a short but systematic…
We exhibit a 6-element semigroup that has no finite identity basis but nevertheless generates a variety whose finite membership problem admits a polynomial algorithm.
We count the number of irreducible polynomials in several variables of a given degree over a finite field. The results are expressed in terms of a generating series, an exact formula and an asymptotic approximation. We also consider the…
We construct a family of $S_n$ modules indexed by $c\in\{1,\dots,n\}$ with the property that upon restriction to $S_{n-1}$ they recover the classical parking function representation of Haiman. The construction of these modules relies on an…
In \cite{Oh22}, the second author defined a complex of groups decomposition of the fundamental group of a finitely generated 2-dimensional special group, called an \emph{intersection complex}, which is a quasi-isometry invariant. In this…
We study the problem of determining the isomorphism classes of the virtually cyclic subgroups of the n-string braid groups B_n(S^2) of the 2-sphere S^2. If n is odd, or if n is even and sufficiently large, we obtain the complete…
We use generating functions over group rings to count polynomials over finite fields with the first few coefficients prescribed and a factorization pattern prescribed. In particular, we obtain different exact formulas for the number of…
We generalize the character formulas for multiplicities of irreducible constituents from group theory to semigroup theory using Rota's theory of M\"obius inversion. The technique works for a large class of semigroups including: inverse…
We define a reflective numerical semigroup of genus $g$ as a numerical semigroup that has a certain reflective symmetry when viewed within $\mathbb{Z}$ as an array with $g$ columns. Equivalently, a reflective numerical semigroup has one gap…
Let $\chi$ be an irreducible character of a group $G.$ We denote the sum of the codegrees of the irreducible characters of $G$ by $S_c(G)=\sum_{\chi\in {\rm Irr}(G)}{\rm cod}(\chi).$ We consider the question if $S_c(G)\leq S_c(C_n)$ is true…
We give a formula for the character of the representation of the symmetric group $S_n$ on each isotypic component of the cohomology of the set of regular elements of a maximal torus of $SL_n$, with respect to the action of the centre.
We present the generating function for the numbers of isomorphism classes of coverings of the two-dimensional sphere by the genus $g$ compact oriented surface not ramified outside of a given set of $m+1$ points in the target, fixed…