Results 81 to 90 of about 249,840 (369)
Asymptotics of orthogonal polynomials inside the unit circle and Szegö-Padé approximants [PDF]
, 2001 11 pages, no figures.-- MSC2000 codes: 42C05, 41A21.MR#: MR1858277 (2002h:42043)Zbl#: Zbl 1009.42016We study the asymptotic behavior of orthogonal polynomials inside the unit circle for a subclass of measures that satisfy Szegö's condition.
López Lagomasino, Guillermo +5 more
core +1 more source
A General Approach to Error Analysis for Roots of Polynomial Equations
AppliedMathWe study equations with real polynomials of arbitrary degree, such that each coefficient has a small, individual error; this may originate, for example, from imperfect measuring.
Imme van den Berg +1 more
doaj +1 more source
On the Characteristic Polynomial of Linearized Polynomials
CoRRLet $k$ be a finite field, and $L$ be a $q$-linearized polynomial defined over $k$ of $q$-degree $r$ ($L=\sum^r_{i=0}a_iZ^{q^i}$, with $a_i\in k$). This paper provides an algorithm to compute a characteristic polynomial of $L$ over a large extension field $\mathbb F_{q^n}\supseteq k$.
Luca Bastioni +2 more
openaire +2 more sources
Bi‐ and Mono‐Allelic RFC1 Expansion in a North American Cohort With Idiopathic Axonal Neuropathy
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective RFC1 biallelic repeat expansion is increasingly recognized as a cause of chronic idiopathic axonal polyneuropathy (CIAP), but it remains challenging to know who to test. This study aims to determine the prevalence of biallelic and monoallelic RFC1 expansions and their corresponding neuropathy phenotypes in CIAP patients and identify ...
Amro M. Stino +25 more
wiley +1 more source
Research on the method of fast inverse realisation of Vandermonde matrix based on FPGA
The Journal of Engineering, 2019 With the rapid development of science and technology, the operation and calculation in synthetic aperture radar (SAR) imaging systems require high throughput, and the system has high requirement for real-time performance.
Lei Chen, Liang Chen, BingY Li
doaj +1 more source
IS THE JONES POLYNOMIAL OF A KNOT REALLY A POLYNOMIAL? [PDF]
Journal of Knot Theory and Its Ramifications, 2006 The Jones polynomial of a knot in 3-space is a Laurent polynomial in q, with integer coefficients. Many people have pondered why this is so, and what a proper generalization of the Jones polynomial for knots in other closed 3-manifolds is. Our paper centers around this question.
Garoufalidis, Stavros, Lê, Thang Tq
openaire +3 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Building on our prior Behavioral Risk Factor Surveillance System analysis identifying adults aged 18–39 as the primary driver of the national increase in self‐reported cognitive disability, we examined factors associated with this rise using 2013–2024 U.S. BRFSS data. Methods We analyzed U.S.
Adam de Havenon +9 more
wiley +1 more source
On orthogonal polynomials and related discrete integrable systems [PDF]
, 2006 Orthogonal polynomials arise in many areas of mathematics and have been the subject of interest by many mathematicians. In recent years this interest has often arisen from outside the orthogonal polynomial community after their connection with ...
Spicer, Paul Edward
core
q-Differential equations for q-classical polynomials and q-Jacobi-Stirling numbers [PDF]
, 2016 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 operator having the
Zeng, Jiang +5 more
core +1 more source
CryptographyClassical approaches to cryptography exhibit several limitations when applied to scenarios involving more than two users. The One-Time User Key (OTUK) meta-cryptographic model addresses these limitations by enabling multi-user encryption that is flexible,
Alessandro Caniglia +4 more
doaj +1 more source