Results 41 to 50 of about 146,061 (197)
Self-reciprocal polynomials and coterm polynomials [PDF]
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
Vanishing Results for Hall-Littlewood Polynomials [PDF]
It is well-known that if one integrates a Schur function indexed by a partition λ over the symplectic (resp. orthogonal) group, the integral vanishes unless all parts of λ have even multiplicity (resp. all parts of λ are even).
Venkateswaran, Vidya
core +1 more source
Real-valued propagator method for fast DOA estimation via polynomial rooting
In this study, the problem of low-complexity direction-of-arrival (DOA) estimation is addressed, and a novel real-valued propagator method (PM) is presented with a uniform linear array.
Xiang-Tian Meng +3 more
doaj +1 more source
Polynomials Over Splitting Fields [PDF]
In this paper we study some results concerning the existence of splitting fields which are generated by roots of polynomials. Also we study the roots of cubic polynomials.
Majid Mohammed Abid
doaj +1 more source
The Dumont Ansatz for the Eulerian Polynomials, Peak Polynomials and Derivative Polynomials
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
30 pages, 20 figures, 1 ...
Sami Assaf, Dominic Searles
openaire +2 more sources
Singular polynomials from orbit spaces [PDF]
We consider the polynomial representation S(V*) of the rational Cherednik algebra H_c(W) associated to a finite Coxeter group W at constant parameter c.
Feigin, M., Silantyev, A.
core +1 more source
Introduction to Third-Order Jacobsthal and Modified Third-Order Jacobsthal Hybrinomials
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
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
Towards an efficient LWE‐based fully homomorphic encryption scheme
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

