arXiv subjects
Publications and source records attributed to Andrew V. Sills.
In 1986, composer Wendy Carlos introduced three unusual musical scales she called alpha, beta and gamma, equal temperament-inspired scales that de-emphasize the octave as the primary interval in favor of the major and minor thirds and the perfect fifth. A derivation of the alpha, beta, and gamma scales due to David Benson is generalized to produce many Carlos-type scales.
Any power series with unit constant term can be factored into an infinite product of the form $\prod_{n\geq 1} (1-q^n)^{-a_n}$. We give direct formulas for the exponents $a_n$ in terms of the coefficients of the power series, and vice versa, as sums over partitions. As examples, we prove identities for certain partition enumeration functions. Finally, we note $q$-analogues of our enumeration formulas.
George Andrews [\emph{Bull. Amer. Math. Soc.}, 2007, 561--573] introduced the idea of a \emph{signed partiton} of an integer; similar to an ordinary integer partitions, but where some of the parts could be negative. Further, Andrews reinterpreted the classical Göllnitz--Gordon partition identities in terms of signed partitions. In the present work, we provide interpretations of the sum sides of Rogers--Ramanujan type identities, including a new signed partition interpretation of the Göllnitz--Gordon identities, different from that of Andrews. Both analytic and bijective proofs are presented.
Many classical $q$-series identities, such as the Rogers--Ramanujan identities, yield combinatorial interpretations in terms of integer partitions. Here we consider algebraically manipulating some of the classical $q$-series to yield natural combinatorial interpretations in terms of overpartitions. Bijective proofs are supplied as well.
A refinement of the multinomial distribution is presented where the number of inversions in the sequence of outcomes is tallied. This refinement of the multinomial distribution is its joint distribution with the number of inversions in the accompanying experiment. An application of this additional information is described in which the number of inversions acts as a proxy measure of homogeneity (or lack thereof) in the sequence of outcomes.
In the literature, derivations of exact null distributions of rank-sum statistics is often avoided in cases where one or more ties exist in the data. By deriving the null distribution in the no-ties case with the aid of classical $q$-series results of Euler and Rothe, we demonstrate how a natural generalization of the method may be employed to derive exact null distributions even when one or more ties are present in the data. It is suggested that this method could be implemented in a computer algebra system, or even a more primitive computer language, so that the normal approximation need not be employed in the case of small sample sizes, when it is less likely to be very accurate. Several algorithms for determining exact distributions of the rank-sum statistic (possibly with ties) have been given in the literature (see Streitberg and Röhmel (1986) and Marx et al. (2016)), but none seem as simple as the procedure discussed here which amounts to multiplying out a certain polynomial, extracting coefficients, and finally dividing by a binomal coefficient.
We detail the mathematical formulation of the line of "functional quantizer" modules developed by the Mathematics and Music Lab (MML) at Michigan Technological University, for the VCV Rack software modular synthesizer platform, which allow synthesizer players to tune oscillators to new musical scales based on mathematical functions. For example, we describe the recently-released MML Logarithmic Quantizer (LOG QNT) module that tunes synthesizer oscillators to the non-Pythagorean musical scale introduced by indie band The Apples in Stereo.
Lucy Slater used Bailey's $_6ψ_6$ summation formula to derive the Bailey pairs she used to construct her famous list of 130 identities of the Rogers-Ramanujan type. In the present paper we apply the same techniques to Chu's $_{10}ψ_{10}$ generalization of Bailey's formula to produce quite general Bailey pairs. Slater's Bailey pairs are then recovered as special limiting cases of these more general pairs. In re-examining Slater's work, we find that her Bailey pairs are, for the most part, special cases of more general Bailey pairs containing one or more free parameters. Further, we also find new general Bailey pairs (containing one or more free parameters) which are also implied by the $_6ψ_6$ summation formula. Slater used the Jacobi triple product identity (sometimes coupled with the quintuple product identity) to derive her infinite products. Here we also use other summation formulae (including special cases of the $_6ψ_6$ summation formula and Jackson's $_6ϕ_5$ summation formula) to derive some of our infinite products. We use the new Bailey pairs, and/or the summation methods mentioned above, to give new proofs of some general series-product identities due to Ramanujan, Andrews and others. We also derive a new general series-product identity, one which may be regarded as a partner to one of the Ramanujan identities. We also find new transformation formulae between basic hypergeometric series, new identities of Rogers-Ramanujan type, and new false theta series identities. Some of these latter are a kind of "hybrid" in that one side of the identity consists a basic hypergeometric series, while the other side is formed from a theta product multiplied by a false theta series. This type of identity appears to be new.
What follows is a lightly edited version of the author's unpublished master's essay, submitted in partial fulfillment of the requirements of the degree of Master of Arts at the Pennsylvania State University, dated June 1994, written under the supervision of Professor George E. Andrews. It was retyped by the author on November 23, 2022. Obvious typographical errors in the original were corrected without comment; hopefully not too many new errors were introduced during the retyping. Explanatory text added by the author in 2022 is notated by \emph{Remark added in 2022}. After the initial posting on the arXiv on November 29, 2022, the author received email from Wadim Zudilin and George Andrews, pointing out some typos and making some interesting comments. These comments have been incorporated in this revised submission to the arXiv. The bibliography in this version is more extensive than that of the original.
Following Cayley, MacMahon, and Sylvester, define a non-unitary partition to be an integer partition with no part equal to one, and let $ν(n)$ denote the number of non-unitary partitions of size $n$. In a 2021 paper, the sixth author proved a formula to compute $p(n)$ by enumerating only non-unitary partitions of size $n$, and recorded a number of conjectures regarding the growth of $ν(n)$ as $n\to \infty$. Here we refine and prove some of these conjectures. For example, we prove $p(n) \sim ν(n)\sqrt{n/ζ(2)}$ as $n\to \infty$, and give Ramanujan-like congruences between $p(n)$ and $ν(n)$ such as $p(5n)\equiv ν(5n)\ (\operatorname{mod} 5)$.
We use sums over integer compositions analogous to generating functions in partition theory, to express certain partition enumeration functions as sums over compositions into parts that are $k$-gonal numbers; our proofs employ Ramanujan's theta functions. We explore applications to lacunary $q$-series, and to a new class of composition-theoretic Dirichlet series.
Let $d_S$ denote the arithmetic density of a subset $S \subseteq \mathbb N$. We derive a power series in $q\in \mathbb C$, $|q|<1$, with coëfficients related to integer partitions and integer compositions, that yields $1/d_S$ in the limit as $q\to 1$ radially.
A case is made that researchers are interested in studying processes. Often the inferences they are interested in making are about the process and its associated population. On other occasions, a researcher may be interested in making an inference about the collection of individuals the process has generated. We will call the statistical methods employed by the researcher to make such inferences about the process/population ``estimation methods.'' The statistical methods used in making an inference about the collection of individuals generated we call ``prediction methods.'' Methods for obtaining interval estimates of a parameter and prediction intervals for a statistic are given. The analytical and enumerative methods discussed in Deming (1953) are simply estimation and prediction methods, respectively.
A generalization of the law of total covariance is presented and proved.
In this article we study the "norm" of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of current research by both authors. We survey known results and give new results related to this all-but-overlooked object, which, it turns out, plays a comparable role in partition theory to the size, length, and other standard partition statistics.
$q$-analogs of special functions, including hypergeometric functions, play a central role in mathematics and have numerous applications in physics. In the theory of probability, $q$-analogs of various probability distributions have been introduced over the years, including the binomial distribution. Here, I propose a new refinement of the binomial distribution by way of the quantum binomial theorem (also known as the the noncommutative $q$-binomial theorem), where the $q$ is a formal variable in which information related to the sequence of successes and failures in the underlying binomial experiment is encoded in its exponent.
The derivation of the Hardy-Ramanujan-Rademacher formula for the number of partitions of $n$ is reviewed. Next, the steps for finding analogous formulas for certain restricted classes of partitions or overpartiitons is examined, bearing in mind how these calculations can be automated in a CAS. Finally, a number of new formulas of this type which were conjectured with the aid of \emph{Mathematica} are presented along with results of a test for their numerical accuracy.
Two closely related discrete probability distributions are introduced. In each case the support is a set of vectors in $\mathbb{R}^n$ obtained from the partitions of the fixed positive integer $n$. These distributions arise naturally when considering equally-likely random permutations on the set of $n$ letters. For one of the distributions, the expectation vector and covariance matrix is derived. For the other distribution, conjectures for several elements of the expectation vector are provided.