Results 61 to 70 of about 2,413 (304)

Baseline Regional Cholinergic Denervation Predicts Cognitive Trajectories in Moderate Parkinson Disease

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Cognitive decline is a disabling and variable feature of Parkinson disease (PD). While cholinergic system degeneration is linked to cognitive impairments in PD, most prior research reported cross‐sectional associations. We aimed to fill this gap by investigating whether baseline regional cerebral vesicular acetylcholine transporter ...
Taylor Brown   +6 more
wiley   +1 more source

1-Factors and Polynomials

open access: yesEuropean Journal of Combinatorics, 1980
In this paper we give a fuller exposition of a property of 1-factors discussed in [1]. The 1-factors of cubic graphs are found to be enumerated by a graph-function closley related to the chromatic and flow polynomials. The first part of the paper is a short account, with some minor improvements, of the theory of V-functions and φ-functions first set ...
openaire   +2 more sources

Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone   +8 more
wiley   +1 more source

Matrix factorization of multivariate Bernstein polynomials [PDF]

open access: yes, 2015
Ordinary univariate Bernstein polynomials can be represented in matrix form using factor matrices. In this paper we present the definition and basic properties of such factor matrices extended from the univariate case to the general case of arbitrary ...
Dalmo, Rune
core   +1 more source

Additional Recursion Relations, Factorizations, and Diophantine Properties Associated with the Polynomials of the Askey Scheme

open access: yesAdvances in Mathematical Physics, 2009
In this paper, we apply to (almost) all the “named” polynomials of the Askey scheme, as defined by their standard three-term recursion relations, the machinery developed in previous papers.
M. Bruschi, F. Calogero, R. Droghei
doaj   +1 more source

Uniform estimates for smooth polynomials over finite fields

open access: yesDiscrete Analysis, 2023
Uniform estimates for smooth polynomials over finite fields, Discrete Analysis 2023:16, 31 pp. A positive integer $n$ is called $m$-_smooth_ if its largest prime factor has size at most $m$.
Ofir Gorodetsky
doaj   +1 more source

T1 Over Squared Proton Density Ratio to Characterize Multiple Sclerosis Lesions

open access: yesAnnals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Differentiating remyelinated from demyelinated lesions in MS remains challenging without histological confirmation. This study introduces the T1‐to‐PD2 ratio (TPR) imaging approach and evaluates its ability to characterize MS lesions alongside other quantitative MRI (qMRI) metrics. Methods Thirty individuals with MS (mean age: 47.5 ± 
Sarah J. Wright   +10 more
wiley   +1 more source

Bi‐ and Mono‐Allelic RFC1 Expansion in a North American Cohort With Idiopathic Axonal Neuropathy

open access: yesAnnals 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

The Factorization Algorithm of Berlekamp and Zassenhaus [PDF]

open access: yes, 2016
We formalize the Berlekamp-Zassenhaus algorithm for factoring square-free integer polynomials in Isabelle/HOL. We further adapt an existing formalization of Yun’s square-free factorization algorithm to integer polynomials, and thus provide an efficient ...
Sebastiaan Joosten   +3 more
core  

Lattices and factorization of polynomials [PDF]

open access: yesACM SIGSAM Bulletin, 1981
A new algorithm to factorize univariate polynomials over an algebraic number field has been implemented in Algol-68 on a CDC-Cyber 170-750 computer. The algebraic number field is given as the field of rational numbers adjoined by a root of a prescribed minimal polynomial.
openaire   +2 more sources

Home - About - Disclaimer - Privacy