Results 51 to 60 of about 248,011 (369)
In this paper, we study polynomial norms, i.e. norms that are the $d^{\text{th}}$ root of a degree-$d$ homogeneous polynomial $f$. We first show that a necessary and sufficient condition for $f^{1/d}$ to be a norm is for $f$ to be strictly convex, or equivalently, convex and positive definite.
Amir Ali Ahmadi +2 more
openaire +3 more sources
Extremal Polynomials Connected with Zolotarev Polynomials [PDF]
In this paper, the authors deal with the following extremal problem: Using the notation \(P_{n}(x,t)=x_{0}t^{n}+x_{1}t^{n-1}+\dotsb+x_{n}\) for a polynomial of degree not greater than \(n\), \(n\ge 2\) and given real parameters \[ a>1,\quad b0,\quad A \] maximize the magnitude of \(P_{n}(x,b)\) at the following constraints \[ |P_{n}(x,t)|\le M\quad ...
Agafonova, I. V., Malozemov, V. N.
openaire +2 more sources
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
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
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
Asymptotically extremal polynomials with respect to varying weights and application to Sobolev orthogonality [PDF]
9 pages, no figures.-- MSC2000 code: 33C45.MR#: MR2431543 (2009g:41009)Zbl#: Zbl 1155.33006We study the asymptotic behavior of the zeros of a sequence of polynomials whose weighted norms, with respect to a sequence of weight functions, have the same $n ...
Díaz Mendoza, Carlos J. +3 more
core +1 more source
Local polynomials are polynomials [PDF]
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
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
Adaptive Polynomial Method for Solving Third-Order ODE With Application in Thin Film Flow
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

