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

Let $n$ be a squarefree positive odd integer. We will show that there exist infinitely many imaginary quadratic number fields with discriminant divisible by $n$ and-at the same time-having an element of order $n$ in the class group. We then…

For a particular set of Boltzmann weights and a particular boundary condition for the six vertex model in statistical mechanics, we compute explicitly the partition function and show it to be equal to a factorial Schur function, giving a…

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using automata and a package for manipulating them. We illustrate our technique by solving, purely mechanically, an open problem of Currie…

The two squares theorem of Fermat is a gem in number theory, with a spectacular one-sentence "proof from the Book". Here is a formalisation of this proof, with an interpretation using windmill patterns. The theory behind involves…

In this paper, we derive the quadratic formula as a consequence of constructively proving the existence of standard and factored forms for general form real quadratic functions. Emphasis is put on connections to graphing of corresponding…

Let $\theta > 11/20$. We prove that every sufficiently large odd integer $n$ can be written as a sum of three primes $n = p_1 + p_2 + p_3$ with $|p_i - n/3| \leq n^{\theta}$ for $i\in\{1,2,3\}$.

We settle an old question about the existence of certain "sums-of-squares" formulas over a field F (which are the simplest examples of composition formulas for quadratic forms). A classical theorem says that if such a formula exists over a…

This note provides conditions under which the union of three well-founded binary relations is also well-founded.

There exist several theorems which state that when a matroid is representable over distinct fields F_1,...,F_k, it is also representable over other fields. We prove a theorem, the Lift Theorem, that implies many of these results. First,…

We solve an elementary number theory problem on sums of fractional parts, using methods from group theory. We apply our result to deduce the finiteness of certain monodromy representations.

In the paper, the occurrence of zeros and ones in the binary expansion of the primes is studied. In particular the statement in the title is established. The proof is unconditional.

A necessary and sufficient condition for an element of an algebra (in the sense of Universal Algebra) to be in the dominion of a subalgebra is given, in terms of transferable sets. This criterion is then used to formulate a more wieldy…

Consider factorizations into transpositions of an n-cycle in the symmetric group S_n. To every such factorization we assign a monomial in variables w_{ij} that retains the transpositions used, but forgets their order. Summing over all…

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Type III methods were introduced by SAS to address difficulties in dummy-variable models for effects of multiple factors and covariates. They are widely used in practice; they are the default method in several statistical computing…

A new formula is derived that generalises an earlier result for the infinite integral over three spherical Bessel functions. The analytical result involves a finite sum over associated Legendre functions, $P_l^m(x)$, of degree $l$ and order…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

Necessary and sufficient conditions are obtained under which the numerator of the partial derivative of a rational function holomorphic in open upper poly-halfplane is the sum of squares of polynomials.

We adapt (over $\mathbb{F}_2$) the general notions of multiplicative function, Dirichlet convolution and Inverse. We get some interesting results, namely necessary conditions for an odd binary polynomial to be perfect. Note that we are…

We introduce and study arithmetic polygons. We show that these arithmetic polygons are connected to triples of square pyramidal numbers. For every odd $N\geq3$, we prove that there is at least one arithmetic polygon with $N$ sides. We also…