Related papers: Modular Functions and the Monstrous Exponents
Enumerating the extremal submodular functions defined on subsets of a fixed base set has only been done for base sets up to five elements. This paper reports the results of attempting to generate all such functions on a six-element base…
The main object of this paper is to find closed form expressions for finite and infinite sums that are weighted by $\omega(n)$, where $\omega(n)$ is the number of distinct prime factors of $n$. We then derive general convergence criteria…
A difference equation based method of determining two factors of a composite is presented. The feasibility of P-complexity is shown. Presentation of material is non-theoretical; intended to be accessible to a broader audience of non…
In this paper, we prove that for any odd prime larger than 3, the modular group representation associated to the SO$(p)_2$-TQFT can be defined over the ring of integers of a cyclotomic field. We will provide explicit integral bases. In the…
We show interesting relations between extremal partition functions of a family of conformal field theories and dimensions of the irreducible representations of the Fischer-Griess Monster sporadic group. We argue that these relations can be…
This paper presents an analysis of primitive permutation groups of degree $3p$, where $p$ is a prime number, analogous to H. Wielandt's treatment of groups of degree $2p$. It is also intended as an example of the systematic use of…
We develop categorical and number theoretical tools for the classification of super-modular categories. We apply these tools to obtain a partial classification of super-modular categories of rank $8$. In particular we find three distinct…
Compounding submodular monotone (i.e. 2-alternating) set functions on a finite set preserves this property, as shown in 2010. A natural generalization to k-alternating functions was presented in 2018, however hardly readable because of page…
In this paper we study the coefficients of the powers of an ordinary generating function and their properties. A new class of functions based on compositions of an integer $n$ is introduced and is termed composita. We present theorems about…
Recent work by Craig, van Ittersum, and Ono constructs explicit expressions in the partition functions of MacMahon that detect the prime numbers. Furthermore, they define generalizations, the MacMahonesque functions, and prove there are…
We explain a conjecture relating the monster simple group to an algebraic variety that was discovered in a non-monstrous context.
It is shown that traces of mapping classes of finite order may be expressed by Verlinde-like formulae. The 3D topological argument is explained, and the resulting trace identities for modular matrix elements are presented.
The discrete Fourier transform of the greatest common divisor is a multiplicative function, if taken with respect to the same order of the primitive root of unity, which is a well known fact. As such, the transform can be expressed in the…
The prime-counting function $\pi(x)$ which returns the number of primes smaller or equal to a given number is a topic of interest in number theory. An algorithm based on a cyclic group isomorphic to $Z/nZ$, the so-called $Z$-functions, was…
In this short paper we present an elementary proof of the infinitude of primes. Our proof is similar in spirit to Euler's proof that the reciprocals of primes diverges and only uses tools from elementary number theory and calculus. In…
This article starts a computational study of congruences of modular forms and modular Galois representations modulo prime powers. Algorithms are described that compute the maximum integer modulo which two monic coprime integral polynomials…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
In this paper, we study modular transformation properties of a certain class of functions with indefinite quadratic forms.
We prove that, up to adding a complement, every modular representation of a finite group admits a finite resolution by permutation modules.
A system of commutative complex numbers in 5 dimensions of the form u=x_0+h_1x_1+h_2x_2+h_3x_3+h_4x_4 is described in this paper, the variables x_0, x_1, x_2, x_3, x_4 being real numbers. The operations of addition and multiplication of the…