Related papers: Wilson's and Wolstenholme's Theorems
The paper gives a unified and simple proof of both theorems and Cousin's theorem.
A form of Williamson's product theorem which applies to Williamson matrices of even order is presented.
We give direct and inverse theorems for the weighted approximation of functions with endpoint singularities by combinations of Bernstein operators.
Stirling's formula is a powerful asymptotic approximation of the factorial function. Many well-known proofs of this formula are grounded in integral calculus. In this paper, we present an alternative proof of Stirling's formula using only…
I present a simple, elementary proof of Morley's theorem, highlighting the naturalness of this theorem.
We establish a Wiman-Valiron theory for a polynomial series based on the Wilson operator $\mathcal{D}_\mathrm{W}$. For an entire function $f$ of order smaller than $\frac13$, this theory includes (i) an estimate which shows that $f$ behaves…
In this paper we give an additive representation of the factorial, which can be proven by a simple quick analytical argument. We also present some generalizations, which are linked, on the one hand to an arithmetical theorem proven by Euler…
We observe that Whitehead's lemma is an immediate consequence of Stallings folds.
In this paper, we establish a residue theorem for Malcev-Neumann series that requires few constraints, and includes previously known combinatorial residue theorems as special cases. Our residue theorem identifies the residues of two formal…
Let $p$ be a prime, and let $k,n,m,n_0$ and $m_0$ be nonnegative integers such that $k\ge 1$, and $_0$ and $m_0$ are both less than $p$. K. Davis and W. Webb established that for a prime $p\ge 5$ the following variation of Lucas' Theorem…
We present an elementary, self-contained proof of Grothendieck's inequality that unifies the real and complex cases and yields both the Krivine and Haagerup bounds, the current best-known explicit bounds for the real and complex…
We present a self-contained elementary and detailed exposition of Mertens' own proof of his theorem on the divergence of the series of the reciprocals of the primes and compare it with the modern proofs. His proof contains explicit…
We develop a theory of formal multivariate polynomials over commutative rings by treating them as ring terms. Our main result is that two ring terms are s-equivalent (when expanded they yield the same standard polynomial) iff they are…
In 1853 Sylvester stated and proved an elegant formula that expresses the polynomial subresultants in terms of the roots of the input polynomials. Sylvester's formula was also recently proved by Lascoux and Pragacz by using multi-Schur…
This paper presents very simple and easy integration-free proofs in the context of Weierstrass's theory of functions, of the Maximum and Minimum Modulus Principles and Gutzmer-Parseval Inequalities for polynomials and for functions…
A simple proof for the Shannon coding theorem, using only the Markov inequality, is presented. The technique is useful for didactic purposes, since it does not require many preliminaries and the information density and mutual information…
The purpose of this paper is to prove the First and Second Fundamental Theorems of invariant theory for the complex special linear supergroup and discuss the superalgebra of invariants, via the super Plucker relations.
We present an elementary combinatorial proof of the celebrated Friendship theorem. The proof involves looking at independent sets and constructing a bound on their size which forces a contradiction.
In a recent paper [3], Bakalov and Milanov proved that the total descendant potential of a simple singularity satisfies the W-constraints, which come from the W-algebra of the lattice vertex algebra associated to the root lattice of this…
This note is purely expository. The statement of the Gauss theorem on the constructibility of regular polygons by means of compass and ruler is simple and well-known. However, its proofs given in most textbooks rely upon much unmotivated…