Related papers: The Genius Conjectures (via Bell Polynomials)

We study a generalization of the classical Pentagonal Number Theorem and its applications. We derive new identities for certain infinite series, recurrence relations and convolution sums for certain restricted partitions and divisor sums.…

In this paper we use probabilistic methods to derive some results on the generalized Bernoulli and generalized Euler polynomials. Our approach is based on the properties of Appell polynomials associated with uniformly distributed and…

We derive an expression for the generalized Bernoulli numbers in terms of the Bernoulli numbers involving the (exponential) complete Bell polynomials.

We consider here a particular quadratic equation linking two elements of a C-Algebra. By analysing powers of the unknowns, it appears a double sequence of polynomials related to classical Bernoulli polynomials. We get the generating…

The main purpose of this article is to study higher power mean values of generalized quadratic Gauss sums using estimates for character sums, analytic method and algebraic geometric methods. In this article, we prove two conjectures which…

The Schinzel hypothesis is a famous conjectural statement about primes in value sets of polynomials, which generalizes the Dirichlet theorem about primes in an arithmetic progression. We consider the situation that the ring of integers is…

A conjecture of Hopkins (2018) posits that for certain high-dimensional hypothesis testing problems, no polynomial-time algorithm can outperform so-called "simple statistics", which are low-degree polynomials in the data. This conjecture…

Recently Andrews and Bachraoui proved identities relating certain restricted partitions into distinct even parts with restricted 4-regular partitions by the theory of basic hypergeometric series. They also posed a question regarding…

While the twin prime conjecture is still famously open, it holds true in the setting of finite fields: There are infinitely many pairs of monic irreducible polynomials over $\mathbb{F}_q$ that differ by a fixed constant, for each $q \geq…

This paper will primarily present a method of proving generating function identities for partitions from linked partition ideals. The method we introduce is built on a conjecture by George Andrews and that those generating functions satisfy…

In this note, we propose a simple-looking but broad conjecture about star-algebras over the field of real numbers. The conjecture enables many matrix decompositions to be represented by star-algebras and star-ideals. This paper is written…

Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…

We introduce the Farrell-Jones Conjecture with coefficients in an additive category with G-action. This is a variant of the Farrell-Jones Conjecture about the algebraic K- or L-Theory of a group ring RG. It allows to treat twisted group…

We associate to a semisimple complex Lie algebra $\mathfrak{g}$ a sequence of polynomials $P_{\ell,\mathfrak{g}}(x)\in\mathbb{Q}[x]$ in $r$ variables, where $r$ is the rank of $\mathfrak{g}$ and $\ell=0,1,2,\ldots $. The polynomials…

By generalizing Frobenius' polynomial method to good partition algebra, we will develop new character theories for a finite group $G$. A uniform defining equations are derived for these kinds of character theories. The new character…

Using the description of hypermaps with matchings, Goulden and Jackson have given an expression of the generating series of rooted bipartite maps in terms of the zonal polynomials. We generalize this approach to the case of constellations…

The Bell inequality is derived under the assumption of three physical data sets, random or deterministic. The data sets represent a laboratory realization of the three probability based variables used by Bell. For physical data as can be…

In this article, we discuss some classical problems in combinatorics which can be solved by exploiting analogues between graph theory and the theory of manifolds. One well-known example is the McMullen conjecture, which was settled twenty…

There are several versions of Bell's inequalities, proved in different contexts, using different sets of assumptions. The discussions of their experimental violation often disregard some required assumptions and use loose formulations of…

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…