Related papers: Minor summation formula and a proof of Stanley's o…
David Little developed a combinatorial algorithm to study the Schur-positivity of Stanley symmetric functions and the Lascoux-Sch\"{u}tzenberger tree. We generalize this algorithm to affine Stanley symmetric functions.
In a recent work Friedlander studied the problem of how large consecutive prime gaps should be in order that the sum of the reciprocals should be divergent. Supposing a very deep Hypothesis, a generalization of the Hardy--Littlewood prime…
The work in this paper is to initiate a theory of testing monomials in multivariate polynomials. The central question is to ask whether a polynomial represented by certain economically compact structure has a multilinear monomial in its…
Some Open Problems Concerning Orthogonal Polynomials.
In this short article, we present a solution to one of the probability puzzles that Daniel Litt, a mathematician at the University of Toronto, posted on his X account earlier this year. The main goal of this note is to show how some of the…
We derive a closed form for the generalized Bernoulli polynomial of order $n$ in terms of Bell polynomials and Stirling numbers of the second kind using the Fa\`a di Bruno's formula.
A sequence of rational numbers as a generalization of the sequence of Bernoulli numbers is introduced. Sums of products involving the terms of this generalized sequence are then obtained using an application of the Fa\`a di Bruno's formula.…
We consider certain subfamilies, of the family of univalent functions in the open unit disk, defined by means of sufficient coefficient conditions for univalency. This article is devoted to studying the problem of the well-known conjecture…
This paper collects polynomial Diophantine equations that are simple to state but apparently difficult to solve.
We report on a general purpose method for the scalar Stefan problem inspired by the standard boundary updating method used in several existence proofs. By suitably modifying it we can solve numerically any kind of Stefan problem. We present…
We study the distribution of partial sums of Rademacher random multiplicative functions $(f(n))_n$ evaluated at polynomial arguments. We show that for a polynomial $P\in \mathbb Z[x]$ that is a product of at least two distinct linear…
This paper contains the proof of Macdonald's duality and evaluation conjectures, the definition of the difference Fourier transform, the recurrence theorem generalizing Pieri rules, and the action of GL(2,Z) on the Macdonald polynomials at…
This paper is second in a series of three papers; the first of which is "Summation Formulas, from Poisson and Voronoi to the Present" (math.NT/0304187), and the third of which is "Automorphic Distributions, L-functions, and Voronoi…
The purpose of this note is to explain that the combinatorial local log-concavity conjecture introduced by Gross, Mansour, Tucker and Wang (Eur. J. Comb. 52, 207-222, 2016) in fact follows from a result of Stanley (Eur. J. Comb. 32 (6),…
Alfeld and Schumaker provide a formula for the dimension of the space of piecewise polynomial functions, called splines, of degree $d$ and smoothness $r$ on a generic triangulation of a planar simplicial complex $\Delta$, for $d \geq 3r+1$.…
Over 300 sequences and many unsolved problems and conjectures related to them are presented herein together with theorems corollaries, formulae, examples, mathematical criteria, etc. (about integer sequences, numbers, quotients, residues,…
We present an explicit difference operator diagonalized by the Macdonald polynomials associated with an (arbitrary) admissible pair of irreducible reduced crystallographic root systems. By the duality symmetry, this gives rise to an…
Random constraint satisfaction problems (CSPs) such as random $3$-SAT are conjectured to be computationally intractable. The average case hardness of random $3$-SAT and other CSPs has broad and far-reaching implications on problems in…
In this paper, we define Tribonacci-Lucas polynomials and present Tribonacci-Lucas numbers and polynomials as a binomial sum. Then, we introduce incomplete Tribonacci-Lucas numbers and polynomials. In addition we derive recurrence…
We give an elementary proof of the development of Macdonald polynomials in terms of "modified complete" and elementary symmetric functions.