Related papers: The Genius Conjectures (via Bell Polynomials)
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
A beautiful conjecture of Erd\H{o}s-Simonovits and Sidorenko states that if H is a bipartite graph, then the random graph with edge density p has in expectation asymptotically the minimum number of copies of H over all graphs of the same…
For the set of graphs with a given degree sequence, consisting of any number of $2's$ and $1's$, and its subset of bipartite graphs, we characterize the optimal graphs who maximize and minimize the number of $m$-matchings. We find the…
We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…
In this paper we present a systematic way to describe exceptional Jacobi polynomials via two partitions. We give the construction of these polynomials and restate the known aspects of these polynomials in terms of their partitions. The aim…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
In this paper, we introduce a new class of polynomials, called probabilistic q-Bernstein polynomials, alongside their generating function. Assuming Y is a random variable satisfying moment conditions, we use the generating function of these…
The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…
The primes or prime polynomials (over finite fields) are supposed to be distributed `irregularly' , despite nice asymptotic or average behavior. We provide some conjectures/guesses/hypotheses with `evidence' of surprising symmetries in…
It has recently been found that Bell scenarios are only a small subclass of interesting setups for studying the non-classical features of quantum theory within spacetime. We find that it is possible to talk about classical correlations,…
Goulden and Jackson (1996) introduced, using Jack symmetric functions, some multivariate generating series $\psi(x, y, z; 1, 1+\beta)$ with an additional parameter $\beta$ that may be interpreted as a continuous deformation of the rooted…
In this note, by the umbra calculus method, the Sun and Zagier's congruences involving the Bell numbers and the derangement numbers are generalized to the polynomial cases. Some special congruences are also provided.
Binomial ideals are special polynomial ideals with many algorithmically and theoretically nice properties. We discuss the problem of deciding if a given polynomial ideal is binomial. While the methods are general, our main motivation and…
Stanley introduces polynomials which help evaluate symmetric group characters and conjectures that the coefficients of the polynomials are positive. Stanley later gives a conjectured combinatorial interpretation for the coefficients of the…
We connect two important conjectures in the theory of knot polynomials. The first one is the property Al_R(q) = Al_{[1]}(q^{|R|}) for all single hook Young diagrams R, which is known to hold for all knots. The second conjecture claims that…
We raise some questions about graph polynomials, highlighting concepts and phenomena that may merit consideration in the development of a general theory. Our questions are mainly of three types: When do graph polynomials have reduction…
The statistics behind Bell's inequality is demonstrated to allow a Kolmogorovian (i.e. classical) model of probabilities that recovers the quantum covariance.
In this paper, we show that the r-Stirling numbers of both kinds, the r-Whitney numbers of both kinds, the r-Lah numbers and the r-Whitney-Lah numbers form particular cases of family of polynomials forming a generalization of the partial…
By using the Rodriguez-Villegas-Mortenson supercongruences, we prove four supercongruences on sums involving binomial coefficients, which were originally conjectured by Sun. We also confirm a related conjecture of Guo on integer-valued…
Conjectures involving infinite families of restricted partition congruences can be difficult to verify for a number of individual cases, even with a computer. We demonstrate how the machinery of Radu's algorithm may be modified and employed…