Results 51 to 60 of about 248,977 (280)
Polynomial differential systems with explicit non-algebraic limit cycles
Up to now all the examples of polynomial differential systems for which non-algebraic limit cycles are known explicitly have degree at most 5. Here we show that already there are polynomial differential systems of degree at least exhibiting explicit ...
Rebiha Benterki, Jaume Llibre
doaj
Kac Polynomials for Canonical Algebras [PDF]
Abstract We prove that the number of geometrically indecomposable representations of fixed dimension vector $\mathbf{d}$ of a canonical algebra $C$ defined over a finite field $\mathbb{F}_q$ is given by a polynomial in $q$ (depending on $C$ and $\mathbf{d}$). We prove a similar result for squid algebras. Finally, we express the volume of
Plamondon, Pierre-Guy +1 more
openaire +3 more sources
Trust‐region filter algorithms utilizing Hessian information for gray‐box optimization
Abstract Optimizing industrial processes often involves gray‐box models that couple algebraic glass‐box equations with black‐box components lacking analytic derivatives. Such systems challenge derivative‐based solvers. The classical trust‐region filter (TRF) algorithm provides a robust framework but requires extensive parameter tuning and numerous ...
Gul Hameed +4 more
wiley +1 more source
We classify the phase portraits of quadratic polynomial differential systems having some relevant classic quartic algebraic curves as invariant algebraic curves, i.e. these curves are formed by orbits of the quadratic polynomial differential system.
Rebiha Benterki, Jaume Llibre
doaj
On convexity of the frequency response of a stable polynomial
In the complex plane, the frequency response of a univariate polynomial is the set of values taken by the polynomial when evaluated along the imaginary axis. This is an algebraic curve partitioning the plane into several connected components.
Henrion, Didier
core +4 more sources
A trust‐region funnel algorithm for gray‐box optimization
Abstract Gray‐box optimization, where parts of optimization problems are represented by algebraic models while others are treated as black‐box models lacking analytic derivatives, remains a challenge. Trust‐region (TR) methods provide a robust framework for gray‐box problems through local reduced models (RMs) for black‐box components, but they are ...
Gul Hameed +4 more
wiley +1 more source
In this paper we present a survey of some algebraic characterizations of Hilbert’s Nullstellensatz for non-commutative rings of polynomial type. Using several results established in the literature, we obtain a version of this theorem for the skew ...
Armando Reyes +1 more
doaj +1 more source
Comparison Between Algebraic Cryptanalysis on DES and NTRU
Algebraic cryptanalysis is a cryptanalysis method that aims to exploit the algebraic structure of an encryption algorithm to obtain the secret key. Algebraic cryptanalysis becomes interesting because it uses a small amount of known plaintext, which in ...
Fadila Paradise, Kiki Ariyanti Sugeng
doaj +1 more source
Polynomial identities in nil-algebras [PDF]
A polynomial identity is called `Specht' if every system containing this identity has a finite basis. By a theorem of Kemer, over a field of characteristic 0, every system of polynomial identities of associative algebras is finitely based. Recently, Belov, Grishin and Shchigolev proved that over a field of prime characteristic \(p>0\) there are non ...
Aladova, Elena V. +1 more
openaire +2 more sources
Abstract This article demonstrates the integration of in‐line mass spectrometry as a process analytical technology (PAT) tool with model‐based soft sensors in a continuous filtration‐drying carousel system for solid–liquid separation (SLS) of crystal slurries.
Inyoung Hur +3 more
wiley +1 more source

