Related papers: Computing an order complete basis for $M^{\infty}(…
In recent work with Raum the authors considered congruences for the ordinary partition function $p(n)$ of the form $p(\ell Q^r n+\beta)\equiv 0\pmod\ell$ where $\ell, Q\geq 5$ are prime and $r\in \{1,2\}$, and proved a number of results…
The main result of the paper is a lower estimate for the moduli of imaginary parts of the poles of a simple partial fraction (i.e. the logarithmic derivative of an algebraic polynomial) under the condition that the…
We determine the poles of the Eisenstein series on a general linear group, induced from two Speh representations, $\Delta(\tau,m_1)|\cdot|^s\times\Delta(\tau,m_2)|\cdot|^{-s}$, $Re(s)\geq 0$, where $\tau$ is an irreducible, unitary,…
Let $B$ be an one-point extension of a finite dimensional $k$-algebra $A$ by a simple $A$-module at a source point $i$. In this paper, we classify the $\tau$-tilting modules over $B$. Moreover, it is shown that there are equations $$|\tilt…
Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…
An M-partition of a positive integer m is a partition with as few parts as possible such that any positive integer less than m has a partition made up of parts taken from that partition of m. This is equivalent to partitioning a weight m so…
Let $FG$ be the group algebra of a finite $p$-group $G$ over a finite field $F$ of characteristic $p$ and $*$ the classical involution of $FG$. The $*$-unitary subgroup of $FG$, denoted by $V_*(FG)$, is defined to be the set of all…
We consider space-saving versions of several important operations on univariate polynomials, namely power series inversion and division, division with remainder, multi-point evaluation, and interpolation. Now-classical results show that…
We identify a class of "semi-modular" forms invariant on special subgroups of $GL_2(\mathbb Z)$, which includes classical modular forms together with complementary classes of functions that are also nice in a specific sense. We define an…
We give upper bounds on the size of the gap between the constant term and the next non-zero Fourier coefficient of an entire modular form of given weight for \Gamma_0(2). Numerical evidence indicates that a sharper bound holds for the…
For a given prime $p$, we study the properties of the $p$-dissection identities of Ramanujan's theta functions $\psi(q)$ and $f(-q)$, respectively. Then as applications, we find many infinite family of congruences modulo 2 for some…
Let $N$ be a positive square-free integer such that the discrete group $\Gamma_{0}(N)^{+}$ has genus one. In a previous article, we constructed canonical generators $x_{N}$ and $y_{N}$ of the holomorphic function field associated to…
Recently, Andrews and Dastidar introduced the partition function $SOME(n)$, defined as the sum of all the odd parts in the partitions of $n$ minus the sum of all the even parts in the partitions of $n$. They derived its generating function…
A second order pole in the scalar kinetic term can lead to a class of inflation models with universal predictions referred to as pole inflation or $\alpha$-attractors. While this kinetic structure is ubiquitous in supergravity effective…
In their 2015 paper, Mertens and Rolen prove that for a certain level 6 "almost holomorphic" modular function $P$, the degree of $P(\tau)$ over $\mathbb{Q}$ for quadratic $\tau$ is as large as expected, settling a conjecture of Bruinier and…
This work will appear as a chapter in a forthcoming volume titled `Topics in Probabilistic Graph Theory'. For a given graph $G$, each partition of the vertices has a modularity score, with higher values indicating that the partition better…
We obtain two new algorithms for partial fraction decompositions; the first is over algebraically closed fields, and the second is over general fields. These algorithms takes $O(M^2)$ time, where $M$ is the degree of the denominator of the…
A standard method for finding a rational number from its values modulo a collection of primes is to determine its value modulo the product of the primes via Chinese remaindering, and then use Farey sequences for rational reconstruction.…
We provide detailed algebra for determining the integrated mean-squared prediction error (IMSPE) of designs of computer experiments, with one factor and one or two points, under the exponential, Gaussian, or either of two Matern correlation…
The Carmichael lambda function $\lambda(n)$ is defined to be the smallest positive integer $m$ such that $a^m$ is congruent to 1 modulo $n,$ for all $a$ and $n$ relatively prime. The function $\lambda_k(n)$ is defined to be the $k$th…