Results 41 to 50 of about 281,189 (325)
Self-reciprocal polynomials and coterm polynomials [PDF]
Designs, 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 Dumont Ansatz for the Eulerian Polynomials, Peak Polynomials and Derivative Polynomials
Annals of Combinatorics, 2022 We observe that three context-free grammars of Dumont can be brought to a common ground, via the idea of transformations of grammars, proposed by Ma-Ma-Yeh. Then we develop a unified perspective to investigate several combinatorial objects in connection with the bivariate Eulerian polynomials. We call this approach the Dumont ansatz.
Chen, William Y. C., Fu, Amy M.
openaire +2 more sources
Introduction to Third-Order Jacobsthal and Modified Third-Order Jacobsthal Hybrinomials
Discussiones Mathematicae - General Algebra and Applications, 2021 The hybrid numbers are generalization of complex, hyperbolic and dual numbers. In this paper, we introduce and study the third-order Jacobsthal and modified third-order Jacobsthal hybrinomials, i.e., polynomials, which are a generalization of the ...
Cerda-Morales Gamaliel
doaj +1 more source
Hard to Detect Factors of Univariate Integer Polynomials
Mathematics, 2023 We investigate the computational complexity of deciding whether a given univariate integer polynomial p(x) has a factor q(x) satisfying specific additional constraints.
Alberto Dennunzio +2 more
doaj +1 more source
Experimental Mathematics, 2019 30 pages, 20 figures, 1 ...
Sami Assaf, Dominic Searles
openaire +2 more sources
Towards an efficient LWE‐based fully homomorphic encryption scheme
IET Information Security, 2022 The security of most early fully homomorphic encryption schemes was based on the hardness of the Learning with Errors (LWE) problem. These schemes were inefficient in terms of per gate computations and public‐key size.
Uddipana Dowerah +1 more
doaj +1 more source
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
Adaptive Polynomial Method for Solving Third-Order ODE With Application in Thin Film Flow
IEEE Access, 2021 Differential equations are commonly used to model several engineering, science, and biological applications. Unfortunately, finding analytical solutions for solving higher-order Ordinary Differential Equations (ODEs) is a challenge.
Mohammad T. Haweel +2 more
doaj +1 more source
Local polynomials are polynomials [PDF]
Studia Mathematica, 1995 Summary: We prove that a function \(f\) is a polynomial if \(G\circ f\) is a polynomial for every bounded linear functional \(G\). We also show that an operator-valued function is a polynomial if it is locally a polynomial.
Fong, C. K. +4 more
openaire +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals 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