中文
相关论文

相关论文: Pairs of lattice paths and positive trigonometric …

200 篇论文

By applying Schmidt's lattice method, we prove results on simultaneous Diophantine approximation modulo 1 for systems of polynomials in a single prime variable provided that certain local conditions are met.

数论 · 数学 2013-09-10 Thai Hoang Le , Craig V. Spencer

It is known that the Ehrhart polynomials of cross-polytopes, as well as of pyramids over them, have positive coefficients. We give a combinatorial proof of this fact by showing that a scaled version of the Ehrhart polynomials are generating…

组合数学 · 数学 2025-12-10 Krishna Menon , Emil Verkama

The linearization coefficients for a set of orthogonal polynomials are given explicitly as a weighted sum of combinatorial objects. Positivity theorems of Askey and Szwarc are corollaries of these expansions.

经典分析与常微分方程 · 数学 2008-02-03 Anne de Médicis , Dennis W. Stanton

The Gaussian polynomial in variable $q$ is defined as the $q$-analog of the binomial coefficient. In addition to remarkable implications of these polynomials to abstract algebra, matrix theory and quantum computing, there is also a…

组合数学 · 数学 2017-12-21 Ivica Martinjak , Ivana Zubac

The Boros-Moll polynomials arise in the evaluation of a quartic integral. The original double summation formula does not imply the fact that the coefficients of these polynomials are positive. Boros and Moll proved the positivity by using…

组合数学 · 数学 2008-10-06 William Y. C. Chen , Sabrina X. M. Pang , Ellen X. Y. Qu

We introduce a family of rings of symmetric functions depending on an infinite sequence of parameters. A distinguished basis of such a ring is comprised by analogues of the Schur functions. The corresponding structure coefficients are…

代数几何 · 数学 2009-06-03 A. I. Molev

Using elementary methods, we establish old and new relations between binomial coefficients, Fibonacci numbers, Lucas numbers, and more.

数论 · 数学 2023-10-17 Greg Dresden , Yike Li

Binomial formulas for Schur polynomials and Jack polynomials were studied by Lascoux in 1978, and Kaneko, Okounkov--Olshanski and Lassalle in the 1990s. We prove that the associated binomial coefficients are monotone and derive some…

组合数学 · 数学 2025-08-11 Hong Chen , Siddhartha Sahi

The $q$-binomial coefficients $\qbinom{n}{m}=\prod_{i=1}^m(1-q^{n-m+i})/(1-q^i)$, for integers $0\le m\le n$, are known to be polynomials with non-negative integer coefficients. This readily follows from the $q$-binomial theorem, or the…

数论 · 数学 2011-03-01 S. Ole Warnaar , Wadim Zudilin

In this paper we study the factors of some alternating sums of products of binomial and q-binomial coefficients. We prove that for all positive integers n_1,...,n_m, n_{m+1}=n_1, and 0\leq j\leq m-1, {n_1+n_{m}\brack…

数论 · 数学 2015-06-26 Victor J. W. Guo , Frederic Jouhet , Jiang Zeng

In this paper, a single sum formula for the linearization coefficients of the Bessel polynomials is given. In three special cases this formula reduces indeed to either Atia and Zeng's formula (Ramanujan Journal, Doi…

经典分析与常微分方程 · 数学 2015-03-13 Mohamed Jalel Atia

We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…

高能物理 - 格点 · 物理学 2008-11-26 A. Gonzalez-Arroyo

Boelen et al. (2010) deduced a $q$-discrete Painlev\'e equation satisfied by the recurrence coefficients of orthogonal polynomials and conjectured that the equation had a unique positive solution. We prove their conjecture and discuss…

经典分析与常微分方程 · 数学 2021-10-18 Tomas Lasic Latimer

We compute an analogue of Pascal's triangle enriched in bilinear forms over a finite field. This gives an arithmetically meaningful count of the ways to choose $j$ ring homomorphisms into an algebraic closure from an \'etale extension of…

数论 · 数学 2026-01-12 Chongyao Chen , Kirsten Wickelgren

Binomial coefficients have been used for centuries in a variety of fields and have accumulated numerous definitions. In this paper, we introduce a new way of defining binomial coefficients as repeated sums of ones. A multitude of binomial…

综合数学 · 数学 2021-09-10 Roudy El Haddad

In addition to extending some facts from field coefficients to commutative ring coefficients for Leavitt path algebras with new shorter proofs, we also prove some results that are new even for field coefficients. In particular, we show that…

环与代数 · 数学 2023-09-26 Ayten Koç , Murad Özaydın

In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart…

组合数学 · 数学 2019-12-24 Sam Hopkins , Alexander Postnikov

We establish necessary and sufficient conditions for a polynomial to be divisible by a cyclotomic polynomials and derive new formulas involving Ramanujan sums as an application of our results. Additionally, we provide new insights into the…

数论 · 数学 2025-08-06 Laura De Carli , Maurizio Laporta

This paper investigates coefficients of cyclotomic polynomials theoretically and experimentally. We prove the following result. {{\em If $n=p_1\ldots p_k$ where $p_i$ are odd primes and $p_1<p_2<\ldots<p_r<p_1+p_2<p_{r+1}<\ldots<p_t$ with…

数论 · 数学 2019-02-14 Marcin Mazur , Bogdan V. Petrenko

We solve two problems regarding the enumeration of lattice paths in $\mathbb{Z}^2$ with steps $(1,1)$ and $(1,-1)$ with respect to the major index, defined as the sum of the positions of the valleys, and to the number of certain crossings.…

组合数学 · 数学 2021-12-14 Sergi Elizalde