Related papers: The Ongoing Binomial Revolution
Loeb showed that a natural extension of the usual binomial coefficient to negative (integer) entries continues to satisfy many of the fundamental properties. In particular, he gave a uniform binomial theorem as well as a combinatorial…
In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…
Since Leibniz algebras were introduced by Loday as a generalization of Lie algebras, there has been a lot of interest in which results of the latter extend to the former. Cyclic algebras, those generated by one element, are a useful tool…
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.
Binomial Theorem for (N+n)^r is described with non-commuting variables N and n.
In this paper, we introduced the theory of the sieve function transformation. Using the principle of sieve function transformation, we improved sieve method, and obtained the difference range of similar sieve function values. For this, we…
By using definition of Golden derivative, corresponding Golden exponential function and Fibonomial coefficients, we introduce generating functions for Bernoulli-Fibonacci polynomials and related numbers. Properties of these polynomials and…
We present a characterization of the completeness of the field of real numbers in the form of a \emph{collection of several equivalent statements} borrowed from algebra, real analysis, general topology, and non-standard analysis. We also…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
A class theorem is presented and proved: the complex Fourier transforms of a certain class of exponential functions have all their zeros on the real line. A class of basis functions is first considered, and the class is then extended via…
We introduce a small change in the definition of the Fourier series so that we can guarantee the coincidence with the given function at the endpoints of the interval even if the function does not assume the same value at the endpoints. This…
Numerical nonlinear algebra is a computational paradigm that uses numerical analysis to study polynomial equations. Its origins were methods to solve systems of polynomial equations based on the classical theorem of B\'ezout. This was…
We prove an important property of the binomial transform: it converts multiplication by the discrete variable into a certain difference operator. We also consider the case of dividing by the discrete variable. The properties presented here…
Polynomial sequences $p_n(x)$ of binomial type are a principal tool in the umbral calculus of enumerative combinatorics. We express $p_n(x)$ as a \emph{path integral} in the ``phase space'' $\Space{N}{} \times {[-\pi,\pi]}$. The Hamiltonian…
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
In a series of publications in the early 1990s, L D Nel set up a study of non-normable topological vector spaces based on methods in category theory. One of the important results showed that the classical operations of derivative and…
The paper contains a combinatorial theorem (the sequence of Newton polygons of a reccurent sequence of polynomials is quasi-linear) and two applications of it in classical and quantum topology, namely in the behavior of the $A$-polynomial…
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…
The operational calculus associated with Hermite numbers has been shown to be an effective tool for simplifying the study of special functions. Within this context, Hermite polynomials have been viewed as Newton binomials, with the…
Bayesian inference gets its name from *Bayes's theorem*, expressing posterior probabilities for hypotheses about a data generating process as the (normalized) product of prior probabilities and a likelihood function. But Bayesian inference…