Results 31 to 40 of about 249,840 (369)

Characteristic polynomials of complex random matrix models [PDF]

open access: yes, 2002
We calculate the expectation value of an arbitrary product of characteristic polynomials of complex random matrices and their hermitian conjugates. Using the technique of orthogonal polynomials in the complex plane our result can be written in terms of
Akemann, G   +3 more
core   +1 more source

Asymptotics for Stieltjes polynomials, Padé-type approximants, and Gauss-Kronrod quadrature [PDF]

open access: yes, 2002
23 pages, 1 figure.-- MSC1991 codes: Primary: 41A21, 42C05; Secondary: 30E10.MR#: MR1894475 (2002m:41021)Zbl#: Zbl 1020.41019We study the asymptotic properties of Stieltjes polynomials outside the support of the measure as well as the asymptotic ...
López Lagomasino, Guillermo   +11 more
core   +1 more source

Skew-orthogonal Laguerre polynomials for chiral real asymmetric random matrices [PDF]

open access: yes, 2010
We apply the method of skew-orthogonal polynomials (SOP) in the complex plane to asymmetric random matrices with real elements, belonging to two different classes. Explicit integral representations valid for arbitrary weight functions are derived for the
Akemann, G   +10 more
core   +1 more source

Polynomial Collocation Methods Based on Successive Integration Technique for Solving Neutral Delay Differential Equations

open access: yesRatio Mathematica, 2023
This paper presents a new approach of using polynomials such as Hermite, Bernoulli, Chebyshev, Fibonacci and Bessel to solve neutral delay differential equations. The proposed method is based on the truncated polynomial expansion of the function together
Kayelvizhi C., Emimal Kanaga Pushpam A.
doaj   +1 more source

Algorithmic polynomials [PDF]

open access: yesProceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018
The approximate degree of a Boolean function $f(x_{1},x_{2},\ldots,x_{n})$ is the minimum degree of a real polynomial that approximates $f$ pointwise within $1/3$. Upper bounds on approximate degree have a variety of applications in learning theory, differential privacy, and algorithm design in general.
openaire   +4 more sources

Multivariate Jacobi and Laguerre polynomials, infinite-dimensional extensions, and their probabilistic connections with multivariate Hahn and Meixner polynomials [PDF]

open access: yes, 2011
Multivariate versions of classical orthogonal polynomials such as Jacobi, Hahn, Laguerre, Meixner are reviewed and their connection explored by adopting a probabilistic approach.
Robert C. Griffiths   +3 more
core   +1 more source

Recent Research in Polynomials [PDF]

open access: yes, 2023
Polynomials are incredibly useful mathematical tools that have a wide array of applications. This book provides a comprehensive overview of polynomials and recent developments in the field. It includes ten chapters that address such topics as polynomials-

core   +1 more source

Self-reciprocal polynomials and coterm polynomials [PDF]

open access: yesDesigns, Codes and Cryptography, 2017
We classify all self-reciprocal polynomials arising from reversed Dickson polynomials over $\mathbb{Z}$ and $\mathbb{F}_p$, where $p$ is prime. As a consequence, we also obtain coterm polynomials arising from reversed Dickson polynomials.
openaire   +3 more sources

The degree and the order of polynomials in the ring R [F1A] [PDF]

open access: yesSongklanakarin Journal of Science and Technology (SJST), 2007
In this research, we generalize some properties of the degree and the order of polynomials in the ring R[x].
Ronnason Chinram
doaj  

On Values of Cyclotomic Polynomials. V [PDF]

open access: yes, 2003
In this paper, we present three results on cyclotomic polynomials. First, we present results about factorization of cyclotomic polynomials over arbitrary fields K.
Motose, Kaoru, Kaoru Motose
core   +1 more source

Home - About - Disclaimer - Privacy