نتایج جستجو برای: order polynomials

تعداد نتایج: 940394  

2009
Richard P. Stanley

We study a family of polynomials whose values express degrees of Schubert varieties in the generalized complex flag manifold G/B. The polynomials are given by weighted sums over saturated chains in the Bruhat order. We derive several explicit formulas for these polynomials, and investigate their relations with Schubert polynomials, harmonic polynomials, Demazure characters, and generalized Litt...

2016
Mourad E.H. ISMAIL Ruiming ZHANG

We introduce a class of orthogonal polynomials in two variables which generalizes the disc polynomials and the 2-D Hermite polynomials. We identify certain interesting members of this class including a one variable generalization of the 2-D Hermite polynomials and a two variable extension of the Zernike or disc polynomials. We also give q-analogues of all these extensions. In each case in addit...

2017
FENG QI F. QI

In the paper, the author introduces the notions “multi-order logarithmic numbers” and “multi-order logarithmic polynomials”, establishes an explicit formula, an identity, and two recurrence relations by virtue of the Faà di Bruno formula and two identities of the Bell polynomials of the second kind in terms of the Stirling numbers of the first and second kinds, and constructs some determinantal...

Journal: :Physical review. E, Statistical, nonlinear, and soft matter physics 2011
Sergio Arianos Anna Carbone Christian Türk

In this work, higher-order moving average polynomials are defined by straightforward generalization of the standard moving average. The self-similarity of the polynomials is analyzed for fractional Brownian series and quantified in terms of the Hurst exponent H by using the detrending moving average method. We prove that the exponent H of the fractional Brownian series and of the detrending mov...

2006
Johann A. Makowsky

We outline a general theory of graph polynomials which covers all the examples we found in the vast literature, in particular, the chromatic polynomial, various generalizations of the Tutte polynomial, matching polynomials, interlace polynomials, and the cover polynomial of digraphs. We introduce the class of (hyper)graph polynomials definable in second order logic, and outline a research progr...

2014
Ian J. Kelly Francis M. Boland

This paper investigates an implication of the clustering, on the complex plane, of the roots of transfer function polynomials obtained from acoustic responses. These polynomials can be the high order transfer functions obtained from room impulse responses or the relatively lower order ones obtained from head related impulse responses. This clustering behavior is explained using results from the...

2000
Dimitar K. Dimitrov André Ronveaux

It is well-known and easy to see that the zeros of both the associated polynomial and the derivative of an orthogonal polynomial pn(x) interlace with the zeros of pn(x) itself. The natural question of how these zeros interlace is under discussion. We give a sufficient condition for the mutual location of k-th, 1 ≤ k ≤ n − 1, zeros of the associated polynomial and the derivative of an orthogonal...

Journal: :CoRR 2010
Xiao-Shan Gao Wei Li Chun-Ming Yuan

In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension d and order h with a generic differential hypersurface of order s is shown to be an irreducible variety of dimension d − 1 and order h + s. As a consequence, the dimension conjecture for generic differential polynomials is proved. Based on...

2010
Xiao-Shan Gao Wei Li Chun-Ming Yuan

In this paper, an intersection theory for generic differential polynomials is presented. The intersection of an irreducible differential variety of dimension d and order h with a generic differential hypersurface of order s is shown to be an irreducible variety of dimension d − 1 and order h + s. As a consequence, the dimension conjecture for generic differential polynomials is proved. Based on...

2018
Taekyun Kim Dae San Kim Gwan-Woo Jang Jongkyum Kwon

The problem of counting derangements was initiated by Pierre Rémond de Montmort in 1708 (see Carlitz in Fibonacci Q. 16(3):255-258, 1978, Clarke and Sved in Math. Mag. 66(5):299-303, 1993, Kim, Kim and Kwon in Adv. Stud. Contemp. Math. (Kyungshang) 28(1):1-11 2018. A derangement is a permutation that has no fixed points, and the derangement number [Formula: see text] is the number of fixed-poin...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید