中文
相关论文

相关论文: On some polynomials and series of Bloch-Polya Type

200 篇论文

We define the Bernoulli polynomials with a $q$ parameter in terms of $r$-Whitney numbers of the second kind. Some algebraic properties and combinatorial identities of these polynomials are given. Also, we obtain several relations between…

组合数学 · 数学 2018-11-16 F. A. Shiha

The focus of this paper is the study of generalized Fibonacci polynomials and Fibonomial coefficients. The former are polynomials {n} in variables s and t given by {0} = 0, {1} = 1, and {n} = s{n-1}+t{n-2} for n ge 2. The latter are defined…

组合数学 · 数学 2013-07-30 Tewodros Amdeberhan , Xi Chen , Victor H. Moll , Bruce E. Sagan

The moments of the Lucas polynomials and of the Chebyshev polynomials of the first kind are (multiples of) central binomial coefficients and the moments of the Fibonacci polynomials and of the Chebyshev polynomials of the second kind are…

组合数学 · 数学 2013-12-11 Johann Cigler

For the quantum integer [n]_q = 1+q+q^2+... + q^{n-1} there is a natural polynomial multiplication such that [mn]_q = [m]_q \otimes_q [n]_q. This multiplication is given by the functional equation f_{mn}(q) = f_m(q) f_n(q^m), defined on a…

数论 · 数学 2016-12-30 Melvyn B. Nathanson

In the present article, we introduce a $(p,q)$-analogue of the poly-Euler polynomials and numbers by using the $(p,q)$-polylogarithm function. These new sequences are generalizations of the poly-Euler numbers and polynomials. We give…

数论 · 数学 2016-04-14 Takao Komatsu , José L. Ramírez , Víctor F. Sirvent

Let $N=p_1p_2... p_n$ be a product of $n$ distinct primes. Define $P_N(x)$ to be the polynomial $(1-x^N)\prod_{1\leq i<j\leq n}(1-x^{N/(p_ip_j)})/\prod_{i=1}^n (1-x^{N/p_i})$. (When $n=2$, $P_{pq}(x)$ is the $pq$-th cyclotomic polynomial,…

数论 · 数学 2012-09-27 Ricky Ini Liu

We show that there are polynomials $p_N$ of arbitrarily large degree $N$, with coefficients equal to 0 or 1 (Newman polynomials), such that $$ \liminf_{N \to \infty} N \Linf{p_N^2} \bigl / p_N^2(1) < 1, $$ where $\Linf{q}$ denotes the…

数论 · 数学 2008-12-07 Mihail N. Kolountzakis

A monogenic polynomial $f$ is a monic irreducible polynomial with integer coefficients which produces a monogenic number field. For a given prime $q$, using the Chebotarev density theorem, we will show the density of primes $p$, such that…

数论 · 数学 2014-06-17 Mohammad Bardestani

The tensor product of a positive and a negative discrete series representation of the quantum algebra U_q(su(1,1)) decomposes as a direct integral over the principal unitary series representations. Discrete terms can appear, and these terms…

量子代数 · 数学 2007-05-23 Wolter Groenevelt

There exist homogeneous polynomials $f$ with $\mathbb Q$-coefficients that are sums of squares over $\mathbb R$ but not over $\mathbb Q$. The only systematic construction of such polynomials that is known so far uses as its key ingredient…

代数几何 · 数学 2021-01-05 Jose Capco , Claus Scheiderer

For all finite fields of $q$ elements where $q\equiv1\pmod4$ we have constructed permutation polynomials which have order 2 as permutations, and have 3 terms, or 4 terms as polynomials. Explicit formulas for their coefficients are given in…

数论 · 数学 2023-11-28 P Vanchinathan , Anitha G

We examine combinatorial counting functions with two parameters, $n$ and $q$. For fixed $q$, these functions are (quasi-)polynomial in $n$. As $q$ varies, the degree of this polynomial is itself polynomial in $q$, as are the leading…

组合数学 · 数学 2025-07-14 Tristram Bogart , Kevin Woods

In this work we prove a version of the Sylvester-Gallai theorem for quadratic polynomials that takes us one step closer to obtaining a deterministic polynomial time algorithm for testing zeroness of $\Sigma^{[3]}\Pi\Sigma\Pi^{[2]}$…

计算复杂性 · 计算机科学 2020-03-12 Shir Peleg , Amir Shpilka

We introduce, characterise and provide a combinatorial interpretation for the so-called $q$-Jacobi-Stirling numbers. This study is motivated by their key role in the (reciprocal) expansion of any power of a second order $q$-differential…

经典分析与常微分方程 · 数学 2015-07-07 Ana F. Loureiro , Jiang Zeng

This paper mainly studies problems about so called "permutation polynomials modulo $m$", polynomials with integer coefficients that can induce bijections over Z_m={0,...,m-1}. The necessary and sufficient conditions of permutation…

数论 · 数学 2007-05-23 Shujun Li

For any $k\geq 1$, this paper studies the number of polynomials having $k$ irreducible factors (counted with or without multiplicities) in $\mathbf{F}_q[t]$ among different arithmetic progressions. We obtain asymptotic formulas for the…

数论 · 数学 2021-09-23 Lucile Devin , Xianchang Meng

The well-known mathematical instrument for detection common roots for pairs of polynomials and multiple roots of polynomials are resultants and discriminants. For a pair of polynomials $f$ and $g$ their resultant $R(f,g)$ is a function of…

经典分析与常微分方程 · 数学 2024-04-15 Mikhail Chernyavsky , Andrei Lebedev , Yurii Trubnikov

We present combinatorial and analytical results concerning a Sheffer sequence with a generating function of the form $G(x,z)=Q(z)^{x}Q(-z)^{1-x}$, where $Q$ is a quadratic polynomial with real zeros. By using the properties of Riordan…

组合数学 · 数学 2021-03-03 Gi-Sang Cheon , Tamás Forgács , Hana Kim , Khang Tran

This paper is about the product z^q/(1 - z)^(q + 1)(1 + (z/(1 - z)))^p, Euler gives the Talylor-Series and takes a closer look at the coefficient.

历史与综述 · 数学 2012-02-02 Leonhard Euler , Artur Diener , Alexander Aycock

We classify the discriminantly separable polynomials of degree two in each of three variables, defined by a property that all the discriminants as polynomials of two variables are factorized as products of two polynomials of one variable…

动力系统 · 数学 2014-10-02 Vladimir Dragovic , Katarina Kukic