English
Related papers

Related papers: Combinatorial rules for three bases of polynomials

200 papers

The Schinzel Hypothesis is a celebrated conjecture in number theory linking polynomial values and prime numbers. In the same vein we investigate the common divisors of values $P_1(n),\ldots, P_s(n)$ of several polynomials. We deduce this…

Number Theory · Mathematics 2020-05-04 Arnaud Bodin , Pierre Dèbes , Salah Najib

We present a positivity conjecture for the coefficients of the development of Jack polynomials in terms of power sums. This extends Stanley's ex-conjecture about normalized characters of the symmetric group. We prove this conjecture for…

Combinatorics · Mathematics 2008-07-22 Michel Lassalle

A combinatorial theory for type $R_I$ orthogonal polynomials is given. The ingredients include weighted generalized Motzkin paths, moments, continued fractions, determinants, and histories. Several explicit examples in the Askey scheme are…

Combinatorics · Mathematics 2022-10-04 Jang Soo Kim , Dennis Stanton

In the present work, we investigate real numbers whose sequence of partial quotients enjoys some combinatorial properties involving the notion of palindrome. We provide three new transendence criteria, that apply to a broad class of…

Number Theory · Mathematics 2012-05-07 Boris Adamczewski , Yann Bugeaud

In this paper we introduce three combinatorial models for symmetrized poly-Bernoulli numbers. Based on our models we derive generalizations of some identities for poly-Bernoulli numbers. Finally, we set open questions and directions of…

Combinatorics · Mathematics 2020-07-28 Beáta Bényi , Toshiki Matsusaka

Since the theorems of Schur and van der Waerden, numerous partition regularity results have been proved for linear equations, but progress has been scarce for non-linear ones, the hardest case being equations in three variables. We prove…

Combinatorics · Mathematics 2014-03-07 Nikos Frantzikinakis , Bernard Host

We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…

Combinatorics · Mathematics 2017-01-18 Terence Tao , Tamar Ziegler

We establish a new simple explicit description of combinatorial wall-crossing for the rational Cherednik algebra applied to the trivial representation. In this way we recover a theorem of P. Dimakis and G. Yue. We also present two…

Combinatorics · Mathematics 2021-06-09 Galyna Dobrovolska

The paper [GLZ] "L-functions of Carlitz modules, resultantal varieties and rooted binary trees" is devoted to a description of some resultantal varieties related to L-functions of Carlitz modules. It contains a conjecture that some of these…

Number Theory · Mathematics 2025-01-20 Stefan Ehbauer , Aleksandr Grishkov , Dmitry Logachev

Following an idea of Rowland we give a conjectural way to generate increasing sequences of primes using algorithms involving the gcd. These algorithms seem not so useless for searching primes since it appears we found sometime primes much…

Number Theory · Mathematics 2015-03-17 Benoit Cloitre

We state a kind of Euclidian division theorem: given a polynomial P(x) and a divisor d of the degree of P, there exist polynomials h(x),Q(x),R(x) such that P(x) = h(Q(x)) +R(x), with deg h=d. Under some conditions h,Q,R are unique, and Q is…

Algebraic Geometry · Mathematics 2009-10-12 Arnaud Bodin

A multivariable hypergeometric-type formula for raising operators of the Macdonald polynomials is conjectured. It is proved that this agrees with Jing and Jozefiak's expression for the two-row Macdonald polynomials, and also with Lassalle…

Quantum Algebra · Mathematics 2009-11-11 Jun'ichi Shiraishi

Most integers are composite and most univariate polynomials over a finite field are reducible. The Prime Number Theorem and a classical result of Gau{\ss} count the remaining ones, approximately and exactly. For polynomials in two or more…

Commutative Algebra · Mathematics 2014-07-14 Joachim von zur Gathen , Konstantin Ziegler

We establish the conjecture of Reiner and Yong for an explicit combinatorial formula for the expansion of a Grothendieck polynomial into the basis of Lascoux polynomials. This expansion is a subtle refinement of its symmetric function…

Combinatorics · Mathematics 2021-06-29 Mark Shimozono , Tianyi Yu

A new application of polytope theory to Lie theory is presented. Exponential sums of convex lattice polytopes are applied to the characters of irreducible representations of simple Lie algebras. The Brion formula is used to write a polytope…

Mathematical Physics · Physics 2007-05-23 M. A. Walton

We introduce the new combinatorial approach of plethystic type of tableaux, as a method to understand coefficients of Schur functions appearing in plethysms $s_\nu[h_\lambda]$ and $s_{\nu}[e_{\lambda}]$, for any partitions $\lambda$ and…

Combinatorics · Mathematics 2022-09-30 Florence Maas-Gariépy , Étienne Tétreault

Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…

Commutative Algebra · Mathematics 2016-09-15 Christian Eder , Gerhard Pfister , Adrian Popescu

Conrey, Farmer, Keating, Rubinstein and Snaith have given a recipe that conjecturally produces, among others, the full moment polynomial for the Riemann zeta function. The leading term of this polynomial is given as a product of a factor…

Number Theory · Mathematics 2012-04-25 Paul-Olivier Dehaye

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…

Logic · Mathematics 2015-01-15 Boris Zilber

In this work we develop the theory of Gr\"obner bases for modules over the ring of univariate linearized polynomials with coefficients from a finite field.

Symbolic Computation · Computer Science 2014-06-19 Margreta Kuijper , Anna-Lena Trautmann