Results 21 to 30 of about 323,104 (323)
Polynomial invariants are polynomial [PDF]
Mathematical Research Letters, 1995 AMSLaTeX+epic.sty+eepic.sty, 7 ...
openaire +2 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
A critique of terms and symbols in school mathematics
Lietuvos Matematikos Rinkinys, 2023 Criticism of some terms and symbols of school mathematics is presented, and recommendations are given. The problem of writing decimal fractions using a comma and the resulting semicolon when separating such numbers, which contradicts not only the ...
Robertas Vilkas
doaj +1 more source
The taut polynomial and the Alexander polynomial
Journal of Topology, 2023 AbstractLandry, Minsky and Taylor defined the taut polynomial of a veering triangulation. Its specialisations generalise the Teichmüller polynomial of a fibred face of the Thurston norm ball. We prove that the taut polynomial of a veering triangulation is equal to a certain twisted Alexander polynomial of the underlying manifold.
openaire +2 more sources
Analisa Prediksi Harga Emas Dengan Kemungkinan Terjadinya Resesi Menggunakan Metode SVR
SINTECH (Science and Information Technology) Journal, 2023 Gold is a resource that has a high value and has the advantage of a stable selling price. This can be proven by the choice of gold which is often used as a long-term investment tool.
Fevrierdo Nathaniel Shanahan Pradana +1 more
doaj +1 more source
Practical polynomial factoring in polynomial time [PDF]
Proceedings of the 36th international symposium on Symbolic and algebraic computation, 2011 State of the art factoring in Q[x] is dominated in theory by a combinatorial reconstruction problem while, excluding some rare polynomials, performance tends to be dominated by Hensel lifting. We present an algorithm which gives a practical improvement (less Hensel lifting) for these more common polynomials.
Hart, William +2 more
openaire +8 more sources
Nihon Kikai Gakkai ronbunshu, 2020 Modal parameters are sometimes identified by using single-degree-of-freedom (SDOF) methods in the experimental modal analysis, where each resonance peak of the frequency response function (FRF) is considered as a SDOF system.
Daiki TAJIRI +3 more
doaj +1 more source
Polynomial reconstruction of the matching polynomial
Electronic Journal of Graph Theory and Applications, 2015 The matching polynomial of a graph is the generating function of the numbers of its matchings with respect to their cardinality. A graph polynomial is polynomial reconstructible, if its value for a graph can be determined from its values for the vertex-deleted subgraphs of the same graph.
Yongtang Shi, Xueliang Li, Martin Trinks
openaire +5 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
Advanced Materials Interfaces, EarlyView., 2023 This review discusses the use of Surface‐Enhanced Raman Spectroscopy (SERS) combined with Artificial Intelligence (AI) for detecting antimicrobial resistance (AMR). Various SERS studies used with AI techniques, including machine learning and deep learning, are analyzed for their advantages and limitations.
Zakarya Al‐Shaebi +4 more
wiley +1 more source