中文
相关论文

相关论文: $q$-Eulerian polynomials and polynomials with only…

200 篇论文

We prove characterizations of Appell polynomials by means of symmetric property. For these polynomials, we establish a simple linear expression in terms of Bernoulli and Euler polynomials. As applications, we give interesting examples. In…

数论 · 数学 2021-03-01 Abdelmejid Bayad , Takao Komatsu

Recently, Araci-Acikgoz-Sen derived some interesting identities on weighted q-Euler polynomials and higher-order q-Euler polynomials from the applications of umbral calculus (See [1]). In this paper, we develop the new method of q-umbral…

数论 · 数学 2013-07-01 Dae San Kim , Taekyun Kim

Lower bounds are given for the number of non-real zeros of a second order linear differential polynomial with constant coefficients in a real entire function with finitely many non-real zeros.

复变函数 · 数学 2007-07-24 J K Langley

We find a $q$-analog of the following symmetrical identity involving binomial coefficients $\binom{n}{m}$ and Eulerian numbers $A_{n,m}$, due to Chung, Graham and Knuth [{\it J. Comb.}, {\bf 1} (2010), 29--38]: {equation*} \sum_{k\geq…

组合数学 · 数学 2012-04-02 Guoniu Han , Zhicong Lin , Jiang Zeng

In this paper, we study the degenerate Eulerian polynomials and numbers and give some new and interesting identities associated with several special numbers and polynomials.

数论 · 数学 2017-05-04 Taekyun Kim , Dae san kim

By the symmetric properties of Drichlet's type multiple q-l-function, we establish various identities concerning the generalized higher-order q-Euler polynomials. Furthermore, we give some interesting relationship between the power sums and…

数论 · 数学 2013-12-31 Dae San Kim , Taekyun Kim

In this paper we consider the computational complexity of the following problem. Let $f$ be a Boolean polynomial. What value of $f$, 0 or 1, is taken more frequently? The problem is solved in polynomial time for polynomials of degrees 1,2.…

计算复杂性 · 计算机科学 2007-05-23 M. N. Vyalyi

The main purpose of this paper is to introduce and investigate a new class of generalized Bernoulli polynomials and Euler polynomials based on the q-integers. The q-analogues of well-known formulas are derived. The q-analogue of the…

经典分析与常微分方程 · 数学 2012-02-01 Nazim I. Mahmudov

We use Grothendieck's dessins d'enfant to show that if $P$ and $Q$ are two real polynomials, any real function of the form $x^\alpha(1-x)^{\beta} P - Q$, has at most $\deg P +\deg Q + 2$ roots in the interval $]0,~1[$. As a consequence, we…

代数几何 · 数学 2024-09-04 Boulos El Hilany , Sébastien Tavenas

We study polynomials with no zeros on the unit ball in complex Euclidean space with a view toward characterizing when a rational function is bounded on the ball. We give a complete local description of such polynomials in two variables near…

复变函数 · 数学 2026-02-25 Greg Knese , James Eldred Pascoe , Alan Sola

In this paper we present some classes of real self-reciprocal polynomials with at most two zeros outside the unit circle which are connected with a Chebyshev quasi-orthogonal polynomials of order one. We investigated the distribution,…

经典分析与常微分方程 · 数学 2017-09-12 Vanessa Botta

Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…

数论 · 数学 2019-05-30 Shuichi Otake , Tony Shaska

Univariate polynomial root-finding is both classical and important for modern computing. Frequently one seeks just the real roots of a polynomial with real coefficients. They can be approximated at a low computational cost if the polynomial…

数值分析 · 数学 2014-07-01 Victor Y. Pan

In this paper, we study relations among several types of Eulerian polynomials from a combinatorial viewpoint. We establish an identity between the restricted Eulerian polynomials of types $A$ and $B$. As an application, we present a…

组合数学 · 数学 2026-03-04 Zhong-Xue Zhang

The aim of this paper is twofold. Firstly, we investigate a finite sum involving the generalized falling factorial polynomials, in some special cases of which we express it in terms of the degenerate Stirling numbers of the second kind, the…

数论 · 数学 2023-01-11 Taekyun Kim , Dae San Kim

A classical result of Erdos and Turan states that if a monic polynomial has small size on the unit circle and its constant coefficient is not too small, then its zeros cluster near the unit circle and become equidistributed in angle. Using…

经典分析与常微分方程 · 数学 2018-02-20 K. Soundararajan

In this paper we consider monic polynomials such that their coefficients coincide with their zeros. These polynomials were first introduced by S. Ulam. We combine methods of algebraic geometry and dynamical systems to prove several results.…

经典分析与常微分方程 · 数学 2018-06-19 Oksana Bihun , Damiano Fulghesu

In this research announcement we present a new q-analog of a classical formula for the exponential generating function of the Eulerian polynomials. The Eulerian polynomials enumerate permutations according to their number of descents or…

组合数学 · 数学 2007-05-23 John Shareshian , Michelle L. Wachs

Polynomials whose zeros are symmetric either to the real line or to the unit circle are very important in mathematics and physics. We can classify them into three main classes: the self-conjugate polynomials, whose zeros are symmetric to…

复变函数 · 数学 2019-04-04 R. S. Vieira

Kopparty and Wang studied in [3] the relation between the roots of a univariate polhynomial over GF(q) and the zero-nonzero pattern of its coefficients. We generalize their results to polynomials in more variables.

数论 · 数学 2014-10-06 Olav Geil