Related papers: Modular Functions and the Monstrous Exponents

We define a modular function which is a generalization of the elliptic modular lambda function. We show this function and the modular invariant function generate the modular function field with respect to the principal congruence subgroup.…

We investigate the relation between the generating functions of the highest weight vectors of the Monster module and the McKay-Thompson series.

In this tutorial, exponentiation and factorization (decomposition) formulas are derived and discussed for common matrix operators that arise in studies of classical dynamics, linear and nonlinear optics, and special relativity. To…

Given a group G denote with exp(G) its exponent, which is the least common multiple of the order of its elements. In this paper we solve the problem of finding the finite simple groups having a proper subgroup with the same exponent. For…

We develop a new setting for the exponential principle in the context of multisort species, where indecomposable objects are generated intrinsically instead of being given in advance. Our approach uses the language of functors and natural…

Let $G$ be a finite group of Lie type and $\ell$ be a prime which is not equal to the defining characteristic of $G$. In this note we discuss some open problems concerning the $\ell$-modular irreducible representations of $G$. We also…

We state a conjecture on the reduction modulo the defining characteristic of a unipotent representation of a finite reductive group.

We determine the space of 1-point correlation functions associated with the Moonshine module: they are precisely those modular forms of non-negative integral weight which are holomorphic in the upper half plane, have a pole of order at most…

We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…

Two distinct systems of commutative complex numbers in 6 dimensions of the polar and planar types of the form u=x_0+h_1x_1+h_2x_2+h_3x_3+h_4x_4+h_5x_5 are described in this work, where the variables x_0, x_1, x_2, x_3, x_4, x_5 are real…

We describe a generalization of the concept of a pc presentation that applies to groups with a nontrivial solvable radical. Such a representation can be much more efficient in terms of memory use and even of arithmetic, than permuattion and…

In the previous paper, we proposed a practical method of constructing explicitly representation groups $R(G)$ for finite groups $G$, and apply it to certain typical finite groups $G$ with Schur multiplier $M(G)$ containing prime number 3.…

Let $ \Bbb V = \coprod_{h = 0}^{\infty} \Bbb V_h$ be the graded monster module of the monster simple group $\Bbb M$ and let $\chi_k$ be an irreducible representation of $\Bbb M$. The generating function of $c_{hk}$ (the multiplicity of…

In this note, we are interested in the *-version of various special functions. Noting that many special functions are defined by integrals involving the exponential functions, we define *-special functions by similar integral formula…

We prove simple theorems concerning the maximal order of a large class of multiplicative functions. As an application, we determine the maximal orders of certain functions of the type $\sigma_A(n)= \sum_{d\in A(n)} d$, where A(n) is a…

A method of constructing specific polynomial representations $f(x)$ over the finite field $\mathbb{F}_p$ of the square roots function modulo a prime $p = 2^kn + 1$, $n$ odd, is presented. The formulas for the cases $k = 2$, $3$ and $4$ are…

We construct the first examples of an algorithmically complex finitely presented residually finite groups and first examples of finitely presented residually finite groups with arbitrarily large (recursive) Dehn function and depth function.…

Building on the results of Craig, van Ittersum, and Ono, we provide a refined understanding of MacMahon's partition functions and their variants, including their quasi-modular properties and new prime-detecting expressions.

We consider polynomial equations, or systems of polynomial equations, with integer coefficients, modulo prime numbers $p$. We offer an elementary approach based on a counting method. The outcome is a weak form of the Lang-Weil lower bound…

We prove a recursive formula for the exterior and symmetric powers of modules for a cyclic 2-group. This makes computation straightforward. Previously, a complete description was only known for cyclic groups of prime order.