Results 31 to 40 of about 25,571,312 (380)
The Stability Interval of the Set of Linear System [PDF]
The article considers the problem of stability of interval-defined linear systems based on the Hurwitz and Lienard- Shipar interval criteria. Krylov, Leverier, and Leverier- Danilevsky algorithms are implemented for automated construction and analysis of
Talgat Mazakov +5 more
doaj +1 more source
Rigid continuation paths II. structured polynomial systems
This work studies the average complexity of solving structured polynomial systems that are characterised by a low evaluation cost, as opposed to the dense random model previously used.
Peter Bürgisser +2 more
doaj +1 more source
On Solving Parametric Polynomial Systems [PDF]
This work intends to cover similar ground and extend the paper [\textit{D. Lazard} and \textit{F. Rouillier}, J. Symb. Comput. 42, No. 6, 636--667 (2007; Zbl 1156.14044)]. Unfortunately the present paper is of questionable quality. The English is at times hard to follow and the paper lacks mathematical substance.
Maza, Marc Moreno +2 more
openaire +1 more source
Subsystems of the polynomial system [PDF]
This paper deals with the classification of subsystems of a polynomial system. A system is defined as a pair of complex vector spaces (V,W) for which there exists a \({\mathbb{C}}\)-bilinear map from \({\mathbb{C}}^ 2\times V\) to W, where \({\mathbb{C}}\) is the field of complex numbers.
Okoh, Frank, Zorzitto, Frank A.
openaire +3 more sources
Hydrodynamic-type systems describing 2-dimensional polynomially integrable geodesic flows
Starting from a homogeneous polynomial in momenta of arbitrary order we extract multi-component hydrodynamic-type systems which describe 2-dimensional geodesic flows admitting the initial polynomial as integral.
Manno, Gianni, Pavlov, Maxim V.
core +1 more source
A Class of Quadratic Polynomial Chaotic Maps and Their Fixed Points Analysis
When chaotic systems are used in different practical applications, such as chaotic secure communication and chaotic pseudorandom sequence generators, a large number of chaotic systems are strongly required.
Chuanfu Wang, Qun Ding
doaj +1 more source
We prove that control-affine systems whose drift is polynomial and whose control fields are constant possess a controllability space carrying complete information about local and global accessibility. This generalizes a well known result of linear system theory.
KUPKA, I., Jurdjevic, V.
openaire +2 more sources
On the relative proof complexity of deep inference via atomic flows [PDF]
We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore ...
Das, Anupam
core +3 more sources
Modern deep neural networks, particularly transformer architectures, have achieved unprecedented performance across various domains through sophisticated mathematical structures that remain incompletely understood from a security perspective.
Sandeep Gupta +3 more
doaj +1 more source
Automatic sequences as good weights for ergodic theorems
We study correlation estimates of automatic sequences (that is, sequences computable by finite automata) with polynomial phases. As a consequence, we provide a new class of good weights for classical and polynomial ergodic theorems, not coming themselves
Eisner, Tanja, Konieczny, Jakub
core +2 more sources

