Results 11 to 20 of about 6,152,737 (292)
On the local dynamics of polynomial difference equations with fading stochastic perturbations [PDF]
We examine the stability-instability behaviour of a polynomial difference equa- tion with state-independent, asymptotically fading stochastic perturbations. We find that the set of initial values can be partitioned into a stability region, an instability
Kelly, C. +3 more
core +4 more sources
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width [PDF]
It is known that evaluating the Tutte polynomial, $T(G; x, y)$, of a graph, $G$, is $\#$P-hard at all but eight specific points and one specific curve of the $(x, y)$-plane.
Noble, S D
core +7 more sources
Local Polynomial Factorisation
We improve significantly the Nart-Montes algorithm for factoring polynomials over a complete discrete valuation ring $\mathbb{A}$. Our first contribution is to extend the Hensel lemma in the context of generalised Newton polygons, from which we derive a new divide and conquer strategy. Also, if $\mathbb{A}$ has residual characteristic zero or high
Poteaux, Adrien, Weimann, Martin
openaire +4 more sources
Localized Polynomial Frames on the Ball [PDF]
26 ...
Petrushev, Pencho, Xu, Yuan
openaire +2 more sources
Note on the smallest root of the independence polynomial [PDF]
One can define the independence polynomial of a graph G as follows. Let i(k)(G) denote the number of independent sets of size k of G, where i(0)(G) = 1. Then the independence polynomial of G is I(G,x) = Sigma(n)(k=0)(-1)(k)i(k)(G)x(k).
Csíkvári, Péter
core +1 more source
The approximation of localized Bernstein polynomials
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Linsen Xie, Tingfan Xie
openaire +3 more sources
Local polynomial method for frequency response function identification
Here we propose the local polynomial method to solve the problem of estimating the frequency response function in the linear system. Compared with other nonparametric identification methods based on the windowing strategies, this new identification ...
Dong Xiguang +2 more
doaj +1 more source
Entanglement classification via operator size
In this work, multipartite entanglement is classified by polynomials. I show that the operator size is closely related to the entanglement structure. Given a generic quantum state, I define a series of subspaces generated by operators of different sizes ...
Qi-Feng Wu
doaj +1 more source
Polynomial cubic splines with tension properties [PDF]
In this paper we present a new class of spline functions with tension properties. These splines are composed by polynomial cubic pieces and therefore are conformal to the standard, NURBS based CAD/CAM ...
Costantini, P. +2 more
core +4 more sources
Image Local Features Description Through Polynomial Approximation
This work introduces a novel local patch descriptor that remains invariant under varying conditions of orientation, viewpoint, scale, and illumination.
Fawad +6 more
doaj +1 more source

