On a Polynomial Vector Field Model for Shape Representation

2006 ◽  
pp. 386-397
Author(s):  
Mickael Chekroun ◽  
Jérôme Darbon ◽  
Igor Ciril
Keyword(s):  
Vector Field ◽  
Field Model ◽  
Shape Representation ◽  
Polynomial Vector ◽  
Polynomial Vector Field

Application of Gaussian moment method to a gene autoregulation model of rational vector field

2016 ◽  
Vol 30 (20) ◽  
pp. 1650264 ◽  
Author(s):  
Yan-Mei Kang ◽  
Xi Chen
Keyword(s):  
Vector Field ◽  
Moment Method ◽  
Stochastic Systems ◽  
Polynomial Vector ◽  
Polynomial Vector Field ◽  
Model Driven ◽  
Rational Polynomial ◽  
Resonant Effect ◽  
Biochemical Systems ◽  
Gaussian Moment

We take a lambda expression autoregulation model driven by multiplicative and additive noises as example to extend the Gaussian moment method from nonlinear stochastic systems of polynomial vector field to noisy biochemical systems of rational polynomial vector field. As a direct application of the extended method, we also disclose the phenomenon of stochastic resonance. It is found that the transcription rate can inhibit the stochastic resonant effect, but the degradation rate may enhance the phenomenon. These observations should be helpful in understanding the functional role of noise in gene autoregulation.

scholarly journals Zero Counting and Invariant Sets of Differential Equations

2017 ◽  
Vol 2019 (13) ◽  
pp. 4119-4158
Author(s):  
Gal Binyamini
Keyword(s):  
Vector Field ◽  
Differential Equations ◽  
Upper Bound ◽  
Linear Differential Equations ◽  
Invariant Sets ◽  
Polynomial Vector ◽  
Algebraic Hypersurface ◽  
Polynomial Differential Equations ◽  
Polynomial Vector Field ◽  
Linear Differential

Abstract Consider a polynomial vector field $\xi$ in ${\mathbb C}^n$ with algebraic coefficients, and $K$ a compact piece of a trajectory. Let $N(K,d)$ denote the maximal number of isolated intersections between $K$ and an algebraic hypersurface of degree $d$. We introduce a condition on $\xi$ called constructible orbits and show that under this condition $N(K,d)$ grows polynomially with $d$. We establish the constructible orbits condition for linear differential equations over ${\mathbb C}(t)$, for planar polynomial differential equations and for some differential equations related to the automorphic $j$-function. As an application of the main result, we prove a polylogarithmic upper bound for the number of rational points of a given height in planar projections of $K$ following works of Bombieri–Pila and Masser.

scholarly journals Computing the topological degree of polynomial maps

1997 ◽  
Vol 56 (1) ◽  
pp. 87-94
Author(s):  
Takis Sakkalis ◽  
Zenon Ligatsikas
Keyword(s):  
Vector Field ◽  
Topological Degree ◽  
Recursive Algorithm ◽  
Main Idea ◽  
Dimensional Problem ◽  
Polynomial Vector ◽  
Polynomial Vector Field ◽  
Polynomial Maps

Let C be a cube in Rn+1 and let F = (f1, …, fn+1) be a polynomial vector field. In this note we propose a recursive algorithm for the computation of the degree of F on C. The main idea of the algorithm is that the degree of F is equal to the algebraic sum of the degrees of the map (f1, f2, …, fi−1, fi, fi+1, …, fn+1) over all sides of C, thereby reducing an (n + 1)–dimensional problem to an n–dimensional one.

scholarly journals On relations between Jacobians and resultants of polynomials in two variables

1993 ◽  
Vol 47 (3) ◽  
pp. 473-481 ◽  
Author(s):  
Takis Sakkalis
Keyword(s):  
Vector Field ◽  
Sufficient Conditions ◽  
Jacobian Determinant ◽  
Polynomial Vector ◽  
Polynomial Vector Field

This paper investigates some of the connections between the zeros of a polynomial vector field F = (f, g): ℂ2 ← ℂ2 and the Jacobian determinant J(f, g) of f and g. As a consequence, sufficient conditions are given for F to have no zeros. In addition, in the case where F has an inverse F−1, it is proven that F−1 is also polynomial.

Sign in / Sign up

Export Citation Format

Share Document