Results 11 to 20 of about 1,196,282 (285)

Nonnegative Polynomials and Circuit Polynomials

SIAM Journal on Applied Algebra and Geometry, 2022
21 ...
openaire   +3 more sources

Local polynomials are polynomials [PDF]

Studia Mathematica, 1995
Summary: We prove that a function \(f\) is a polynomial if \(G\circ f\) is a polynomial for every bounded linear functional \(G\). We also show that an operator-valued function is a polynomial if it is locally a polynomial.
Fong, C. K., Lumer, G., Nordgren, E., Radjavi, H., Rosenthal, P.   +4 more
openaire   +1 more source

The Maximal Complexity of Quasiperiodic Infinite Words

Axioms, 2021
A quasiperiod of a finite or infinite string is a word whose occurrences cover every part of the string. An infinite string is referred to as quasiperiodic if it has a quasiperiod.
Ludwig Staiger
doaj   +1 more source

Mathematical approximator based on basic spline approximation [PDF]

E3S Web of Conferences
The article considers the problem of constructing a mathematical piecewise linear approximator based on approximation by basis splines. An algorithm has been developed designed to implement a class of special functions and create parallel ...
Turdimatov Mamirjon, Mukhtarov Farrukh, Ibrokhimov Nodirbekh, Umarov Shukhratjon, Mirzayev Jamshid, Rakhmatov Rasuljon   +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

Relations between M\"obius and coboundary polynomial [PDF]

, 2012
It is known that, in general, the coboundary polynomial and the M\"obius polynomial of a matroid do not determine each other. Less is known about more specific cases.
A. Faldum, C. Greene, D.J.A. Welsh, F.J. MacWilliams, H. Crapo, I.M. Duursma, I.M. Duursma, I.M. Duursma, J.G. Oxley, M. Aigner, M.A. Boer de, N. White, R.P.M.J. Jurrius, Relinde Jurrius, T. Kløve, T. Zaslavsky   +15 more
core   +3 more sources

Bounds for the sums of zeros of solutions of $u^{(m)}=P(z)u$ where $P$ is a polynomial

Electronic Journal of Qualitative Theory of Differential Equations, 2011
The main purpose of this paper is to consider the differential equation $u^{(m)}=P(z)u$ $(m\geq 2)$ where $P$ is a polynomial with in general complex coefficients. Let $z_{k}(u),$ $k=1,2,\ldots$ be the zeros of a nonzero solution $u$ to that equation. We
Ting-Bin Cao, Kai Liu, Hong-Yan Xu
doaj   +1 more source

Tutte Polynomials and Link Polynomials [PDF]

Proceedings of the American Mathematical Society, 1988
We show how the Tutte polynomial of a plane graph can be evaluated as the "homfly" polynomial of an associated oriented link. Then we discuss some consequences for the partition function of the Potts model, the Four Color Problem and the time complexity of the computation of the homfly polynomial.
openaire   +1 more source

Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length [PDF]

, 2016
We provide an implicit characterization of polynomial time computation in terms of ordinary differential equations: we characterize the class $\operatorname{PTIME}$ of languages computable in polynomial time in terms of differential equations with ...
Bournez, Olivier, Graça, Daniel S., Pouly, Amaury   +2 more
core   +3 more sources

Polynomial Algebras Have Polynomial Growth [PDF]

Transactions of the American Mathematical Society, 1987
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source