Results 1 to 10 of about 774 (80)
Real Root Polynomials and Real Root Preserving Transformations
Polynomials can be used to represent real-world situations, and their roots have real-world meanings when they are real numbers. The fundamental theorem of algebra tells us that every nonconstant polynomial p with complex coefficients has a complex root.
Suchada Pongprasert +3 more
doaj +1 more source
Hierarchical Zonotopal Power Ideals [PDF]
Zonotopal algebra deals with ideals and vector spaces of polynomials that are related to several combinatorial and geometric structures defined by a finite sequence of vectors.
Matthias Lenz
doaj +1 more source
Hilbert polynomials of the algebras of $SL_ 2$-invariants
We consider one of the fundamental problems of classical invariant theory, the research of Hilbert polynomials for an algebra of invariants of Lie group $SL_2$.
N.B. Ilash
doaj +1 more source
Polynomials—Unifying or Fragmenting High School Mathematics?
This paper presents research on the origin, scope, evolution, and rationale of knowledge about polynomials in high school mathematics. Within the framework of the Anthropological Theory of the Didactic, Croatian high school curricula and textbooks were ...
Jelena Pleština +2 more
doaj +1 more source
Characteristic Polynomial and Eigenproblem of Triangular Matrix over Interval Min-Plus Algebra
A min-plus algebra is a linear algebra over the semiring R_ε', equipped with the operations “"⊕'=min" ” and “⊗=+”. In min-plus algebra, there is the concept of characteristic polynomial obtained from permanent of matrix.
Anita Dwi Rahmawati +2 more
doaj +1 more source
Complex power polynomials for solving the problem of identifying linear circuit parameters
The identification of parameters of linear electrical circuits refers to the problems of analysis and inverse problems of electrical engineering. Modern research in this field mainly boils down to determining the impulse response and/or the transfer ...
N. V. Korovkin, A. Yu. Grishentsev
doaj +1 more source
Quantum Computational Complexity of Matrix Functions
We investigate the dividing line between classical and quantum computational power in estimating properties of matrix functions. More precisely, we study the computational complexity of two primitive problems: given a function f and a Hermitian matrix A,
Santiago Cifuentes +4 more
doaj +1 more source
Polynomials in algebras of linear forms
van Maaren, H., De Smet, H.J.P.
openaire +2 more sources
Asymptotics of Symmetric Polynomials: A Dynamical Point of View. [PDF]
Guionnet A, Huang J.
europepmc +1 more source
Quadratic Subproduct Systems, Free Products, and Their C*-Algebras. [PDF]
Arici F, Ge Y.
europepmc +1 more source

