Related papers: Factorials and Legendre's three-square theorem

A sharp bound is obtained for the number of ways to express the monomial $X^n$ as a product of linear factors over $\mathbb{Z}/p^{\alpha}\mathbb{Z}$. The proof relies on an induction-on-scale procedure which is used to estimate the number…

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

Polynomial processes are defined by the property that conditional expectations of polynomial functions of the process are again polynomials of the same or lower degree. Many fundamental stochastic processes, including affine processes, are…

The product of any finite number of factorial Schur functions can be expanded as a $Z[y]$-linear combination of Schur functions. We give a rule for computing the coefficients in such an expansion which generalizes a specialization of the…

We give some new canonical representations for forms over $\cc$. For example, a general binary quartic form can be written as the square of a quadratic form plus the fourth power of a linear form. A general cubic form in $(x_1,...,x_n)$ can…

Let $V_1,V_2,V_3$ be a triple of even dimensional vector spaces over a number field $F$ equipped with nondegenerate quadratic forms $\mathcal{Q}_1,\mathcal{Q}_2,\mathcal{Q}_3$, respectively. Let \begin{align*} Y \subset \prod_{i=1}V_i…

A short and elementary proof, and a finite-form generalization, are given of Jacobi's formula for the number of ways of writing an integer as a sum of four squares (that implies Lagrange's famous 1777 theorem.)

We say a positive integer is a sum of three nonunit squares if it is a sum of three squares of integers other than one. In this article, we find all integers which are sums of three nonunit squares assuming that the Generalized Riemann…

Let $f_k$ be the $k$-th Fourier coefficient of a function $f$ in terms of the orthonormal Hermite, Laguerre or Jacobi polynomials. We give necessary and sufficient conditions on $f$ for the inequality $\sum_{k}|f_k|^2\theta^k<\infty$ to…

We prove the factorization conjecture for triple-product $p$-adic $L$-functions formulated in a companion article in the special case when two of the (three) factors have complex multiplication.

A four-term recurrence relation for squared spherical Bessel functions is shown to yield closed-form expressions for several types of finite weighted sums of these functions. The resulting sum rules, which may contain an arbitrarily large…

We give a new expression for the number of factorizations of a full cycle into an ordered product of permutations of specified cycle types. This is done through purely algebraic means, extending work of Biane. We deduce from our result a…

We show that the theorem of the three perpendiculars holds in any n-dimensional space form.

The use of operational methods of different nature is shown to be a fairly powerful tool to study different problems regarding the theory of Legendre and Legendre-like polynomials. We show how the use of the well known integral…

We determine primitive solutions to the equation $(x-r)^2 + x^2 + (x+r)^2 = y^n$ for $1 \le r \le 5,000$, making use of a factorization argument and the Primitive Divisors Theorem due to Bilu, Hanrot and Voutier.

Let G be a block matrix function with one diagonal block A being positive definite and the off diagonal blocks complex conjugates of each other. Conditions are obtained for G to be factorable (in particular, with zero partial indices) in…

Linear-time computational techniques have been developed for combining evidence which is available on a number of contending hypotheses. They offer a means of making the computation-intensive calculations involved more efficient in certain…

For a fixed integer $k \ge 0$, consider representations of positive integers as sums of binomial coefficients of the form $\binom{n}{k}$. While exact minimal bounds for the number of required summands are known only in a few low-dimensional…

We present generalisations of Wilson's theorem for double factorials, hyperfactorials, subfactorials and superfactorials.

Necessary and sufficient condition is given for a set $A\subset R^1$ to be a subset of the critical values set for a $C^k$ function $f:R^m \to R^1$.