Results 1 to 10 of about 1,750,438 (373)
SIAM Journal on Optimization, 2018 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 ...
Ahmadi, Amir Ali +2 more
core +4 more sources
Limit key polynomials as p-polynomials [PDF]
Journal of Algebra, 2021 The main goal of this paper is to characterize limit key polynomials for a valuation $ $ on $K[x]$. We consider the set $ _ $ of key polynomials for $ $ of degree $ $. We set $p$ be the exponent characteristic of $ $. Our first main result (Theorem 1.1) is that if $Q_ $ is a limit key polynomial for $ _ $, then the degree of $Q_ $ is $p^r ...
Michael de Moraes, Josnei Novacoski
openaire +3 more sources
The image of polynomials in one variable on 2×2 upper triangular matrix algebras
AIMS Mathematics, 2022 In the present paper, we give a description of the image of polynomials in one variable on 2×2 upper triangular matrix algebras over an algebraically closed field.
Lan Lu +3 more
doaj +1 more source
Performance Comparison of Classical Methods and Neural Networks for Colour Correction
Journal of Imaging, 2023 Colour correction is the process of converting RAW RGB pixel values of digital cameras to a standard colour space such as CIE XYZ. A range of regression methods including linear, polynomial and root-polynomial least-squares have been deployed.
Abdullah Kucuk +3 more
doaj +1 more source
SMIRNOV’S INEQUALITY FOR POLYNOMIALS HAVING ZEROS OUTSIDE THE UNIT DISC
Проблемы анализа, 2021 In 1887, the famous chemist D. I. Mendeleev posed the following problem: to estimate |𝑓 ′(𝑥)| for a real polynomial 𝑓 (𝑥), satisfying the condition |𝑓 (𝑥)| ≤ 𝑀 on [𝑎, 𝑏]. This question arose when Mendeleev was studying aqueous solutions.
E. G. Kompaneet, V. V. Starkov
doaj +1 more source
The number of rational points on a class of hypersurfaces in quadratic extensions of finite fields
Electronic Research Archive, 2023 Let $ q $ be an even prime power and let $ \mathbb{F}_{q} $ be the finite field of $ q $ elements. Let $ f $ be a nonzero polynomial over $ \mathbb{F}_{q^2} $ of the form $ f = a_{1}x_{1}^{m_{1}}+\dots+a_{s}x_{s}^{m_{s}}+y_{1}y_{2}+\dots+y_{n-1}y_{n}+y_ ...
Qinlong Chen , Wei Cao
doaj +1 more source
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer [PDF]
SIAM Review, 1995 A digital computer is generally believed to be an efficient universal computing device; that is, it is believed to be able to simulate any physical computing device with an increase in computation time by at most a polynomial factor. This may not be true
P. Shor
semanticscholar +1 more source
Breaking SIDH in polynomial time
IACR Cryptology ePrint Archive, 2022 .
Damien Robert
semanticscholar +1 more source
NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
Sensors, 2020 Wireless sensor networks (WSNs) are the core of the Internet of Things and require cryptographic protection. Cryptographic methods for WSN should be fast and consume low power as these networks rely on battery-powered devices and microcontrollers.
Anas Ibrahim +5 more
doaj +1 more source
Semilocal smoothihg S-splines [PDF]
Компьютерные исследования и моделирование, 2010 Semilocal smoothing splines or S-splines from class C p are considered. These splines consist of polynomials of a degree n, first p + 1 coefficients of each polynomial are determined by values of the previous polynomial and p its derivatives at the point
Dmitrii Alekseevich Silaev
doaj +1 more source