Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Publication

Proof of a conjecture by Gazeau et al. using the Gould-Hopper polynomials

Olivier Lévêque
2013
Journal Articles

Abstract

We provide here some probabilistic interpretations of the generalized binomial distributions proposed by Gazeau et al. ["Generating functions for generalized binomial distributions," J. Math. Phys. 53, 103304 (2012)]. In the second part, we prove the "strong conjecture" expressed by Gazeau et al. about the coefficients of the Taylor expansion of the exponential of a polynomial. The proof relies mainly on properties of the Gould-Hopper polynomials. (C) 2013 AIP Publishing LLC.

Official source

Olivier Lévêque
2013
Journal Articles

Abstract

Official source

Related concepts (32)

Conjecture

In mathematics, a conjecture is a conclusion or a proposition that is proffered on a tentative basis without proof. Some conjectures, such as the Riemann hypothesis (still a conjecture) or Fermat's Last Theorem (a conjecture until proven in 1995 by Andrew Wiles), have shaped much of mathematical history as new areas of mathematics are developed in order to prove them. Formal mathematics is based on provable truth.

Pólya conjecture

In number theory, the Pólya conjecture (or Pólya's conjecture) stated that "most" (i.e., 50% or more) of the natural numbers less than any given number have an odd number of prime factors. The conjecture was set forth by the Hungarian mathematician George Pólya in 1919, and proved false in 1958 by C. Brian Haselgrove. Though mathematicians typically refer to this statement as the Pólya conjecture, Pólya never actually conjectured that the statement was true; rather, he showed that the truth of the statement would imply the Riemann hypothesis.

Constructive proof

In mathematics, a constructive proof is a method of proof that demonstrates the existence of a mathematical object by creating or providing a method for creating the object. This is in contrast to a non-constructive proof (also known as an existence proof or pure existence theorem), which proves the existence of a particular kind of object without providing an example. For avoiding confusion with the stronger concept that follows, such a constructive proof is sometimes called an effective proof.

Related publications (30)

Proof of a conjecture by Gazeau et al. using the Gould-Hopper polynomials

Graph Chatbot

SC-TPTP: An Extension of the TPTP Derivation Format for Sequent-Based Calculus

Orthologic with Axioms

Non-planarity of Markoff graphs mod p