Results 101 to 110 of about 146,061 (197)
Discrete Mathematics, 1985 In this paper the Touchard polynomials are correlated with Bell, Rook polynomials and Stirling numbers.
openaire +3 more sources
Hyper-polynomial hierarchies and the polynomial jump
Theoretical Computer Science, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Stephen A. Fenner +3 more
openaire +2 more sources
Polynomial zerofinders based on Szegő polynomials
Journal of Computational and Applied Mathematics, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ammar, G.S. +3 more
openaire +2 more sources
On The Eneström-Kakeya Theorem
Bibechana, 2013 In this paper we present some interesting generalizations of Eneström-Kakeya type results concerning the location of zeros of a polynomial in the complex plane.
A Liman, Tawheeda Rasool, WM Shah
doaj
Sharper upper bounds on maximum modulus for rational functions
Demonstratio MathematicaWe study upper bounds for rational functions r(z)=p(z)w(z) $r\left(z\right)=\frac{p\left(z\right)}{w\left(z\right)}$ , where w(z)=∏j=1n(z−λj),|λj|>1, $w\left(z\right)={\prod }_{j=1}^{n}\left(z-{\lambda }_{j}\right), \vert {\lambda }_{j}\vert { >}1,$ and
Thoudam Ranaranjan +2 more
doaj +1 more source
Asymptotic behavior of orthogonal polynomials primitives [PDF]
, 2001 7 pages, no figures.-- MSC2000 codes: 42C05, 33C25.We study the zero location and the asymptotic behavior of the primitives of the standard orthogonal polynomials with respect to a finite positive Borel measure concentrate on [−1,1].Research of second (H.
Urbina, Wilfredo +2 more
core +1 more source
Sparse complex polynomials and polynomial reducibility
Journal of Computer and System Sciences, 1977 We show that certain problems involving sparse polynomials with integer coefficients are at least as hard as any problem in NP. These problems include determining the degree of the least common multiple of a set of such polynomials, and related problems. The proofs make use of a homomorphism from Boolean expressions over the predicate symbols {P1,…,Pn}
openaire +3 more sources
Uniform And Pointwise Polynomial Inequalities In Regions With Asymptotically Conformal Curve
MANAS: Journal of Engineering, 2018 In this we continue studying the Nikolskii and Bernstein-Walsh type polynomial estimation in the Lebesgue spaces in the bounded and unbounded regions bounded by asymptotically conformal ...
P. Özkartepe
doaj
Bounds on separated pairs of subgraphs, eigenvalues and related polynomials [PDF]
We give a bound on the sizes of two sets of vertices at a given minimum distance (a separated pair of subgraphs) in a graph in terms of polynomials and the spectrum of the graph. We find properties of the polynomial optimizing the bound.
Dam, E.R. van
core
Stable polynomials, Lorentzian polynomials and discrete convexity
, 2019 A multivariate polynomial is stable if it is nonzero whenever all its variables have positive imaginary parts. Lorentzian polynomials generalize homogeneous and stable polynomials.
Branden, Petter
core +1 more source