A note on properties of locally finitely convergent sequences with respect to median filter

Let F_k be a mapping from R^Z to R^Z, satisfying that for x∈R^Z and n∈Z, F_k(x)(n) is the (k+1)th largest value (median value) of the 2k+1 numbers x(n−k),…,x(n),…,x(n+k). In [3] [W.Z. Ye, L. Wang, L.G. Xu, Properties of locally convergent sequences with respect to median filter, Discrete Mathematics 309 (2009) 2775–2781], we conjectured that for k∈{2,3}, if there exists n₀∈Z such that x is locally finitely convergent with respect to F_k on {n₀,…,n₀+k−1}, then x is finitely convergent with respect to F_k. In this paper, we obtain some sufficient conditions for a sequence finitely converging with respect to median filters. Based on these results, we prove that the conjecture is true.     

Classification of the centers and their isochronicity for a class of polynomial differential systems of arbitrary degree

In this paper we classify the centers localized at the origin of coordinates, and their isochronicity for the polynomial differential systems in R² of degree d that in complex notation z=x+iy can be written as where j is either 0 or 1. If j=0 then d?5 is an odd integer and n is an even integer satisfying 2?n?(d+1)/2. If j=1 then d?3 is an integer and n is an integer with converse parity with d and satisfying 0<n?[(d+1)/3] where [⋅] denotes the integer part function. Furthermore λ∈R and A,B,C,D∈C. Note that if d=3 and j=0, we are obtaining the generalization of the polynomial differential systems with cubic homogeneous nonlinearities studied in K.E. Malkin (1964) [17], N.I. Vulpe and K.S. Sibirskii (1988) [25], J. Llibre and C. Valls (2009) [15], and if d=2, j=1 and C=0, we are also obtaining as a particular case the quadratic polynomial differential systems studied in N.N. Bautin (1952) [2], H. Zoladek (1994) [26]. So the class of polynomial differential systems here studied is very general having arbitrary degree and containing the two more relevant subclasses in the history of the center problem for polynomial differential equations.     

Oscillations of the system of linear nonautonomous difference equations

We consider the linear nonautonomous system of difference equations x_n+1−x_n+P(n)x_n−k=0, n=0,1,2,… , where k∈Z, P(n)∈R^rxr. We obtain sufficient conditions for the system to be oscillatory. The conditions based on the eigenvalues of the matrix coefficients of the system.     

Bitableaux Bases for the Diagonally Invariant Polynomial Quotient Rings

LetR=Q[x₁, x₂, …, x_n,y₁, y₂, …, y_n,z₁, …, z_n,w₁, …, w_n], letR^S_n={P∈R:σP=P∀σ∈S_n} and letμandνbe hook shape partitions ofn. WithΔ_μ(X, Y) andΔ_ν(Z, W) being appropriately defined determinants, ∂_xibeing the partial derivative operator with respect tox_iandP(∂)=P(∂_x1, …, ∂_xn, ∂_y1, …, ∂_wn), define _{μ, ν}={P∈R^S_n:P(∂)Δ_μ(X, Y)Δ_ν(Z, W)=0}. A basis is constructed for the polynomial quotient ringR^S_n/_{μ, ν}that is indexed by pairs of standard tableaux. The Hilbert series ofR^S_n/_{μ, ν}is related to the Macdonaldq, t-Kostka coefficients.     

Adding machines, kneading maps, and endpoints

Given a unimodal map f, let I=[c₂,c₁] denote the core and set E={(x₀,x₁,…)∈(I,f)|xi∈ω(c,f) for all i∈N}. It is known that there exist strange adding machines embedded in symmetric tent maps f such that the collection of endpoints of (I,f) is a proper subset of E and such that limk→∞Q(k)≠∞, where Q(k) is the kneading map.We use the partition structure of an adding machine to provide a sufficient condition for x to be an endpoint of (I,f) in the case of an embedded adding machine. We then show there exist strange adding machines embedded in symmetric tent maps for which the collection of endpoints of (I,f) is precisely E. Examples of this behavior are provided where limk→∞Q(k) does and does not equal infinity, and in the case where limk→∞Q(k)=∞, the collection of endpoints of (I,f) is always E.     

Closed Polynomials in Polynomial Rings over Unique Factorization Domains

Let R be a UFD, and let M(R, n) be the set of all subalgebras of the form R[f], where f ∈ R[x ₁,…, x _n ]?R. For a polynomial f ∈ R[x ₁,…, x _n ]?R, we prove that R[f] is a maximal element of M(R, n) if and only if it is integrally closed in R[x ₁,…, x _n ] and Q(R)[f] ∩ R[x ₁,…, x _n ] = R[f]. Moreover, we prove that, in the case where the characteristic of R equals zero, R[f] is a maximal element of M(R, n) if and only if there exists an R-derivation on R[x ₁,…, x _n ] whose kernel equals R[f].     

Polyhedra with the Integer Carathéodory Property

A polyhedron P has the Integer Carathéodory Property if the following holds. For any positive integer k and any integer vector w∈kP, there exist affinely independent integer vectors x₁,…,xt∈P and positive integers n₁,…,nt such that n₁+?+nt=k and w=n₁x₁+?+ntxt.In this paper we prove that if P is a (poly)matroid base polytope or if P is defined by a totally unimodular matrix, then P and projections of P have the Integer Carathéodory Property. For the matroid base polytope this answers a question by Cunningham from 1984.     

An Erd?s-Ko-Rado theorem for partial permutations

Let [n] denote the set of positive integers {1,2,…,n}. An r-partial permutation of [n] is a pair (A,f) where A⊆[n], |A|=r and f:A→[n] is an injective map. A set A of r-partial permutations is intersecting if for any (A,f), (B,g)∈A, there exists x∈A∩B such that f(x)=g(x). We prove that for any intersecting family A of r-partial permutations, we have .It seems rather hard to characterize the case of equality. For 8?r?n-3, we show that equality holds if and only if there exist x₀ and ε₀ such that A consists of all (A,f) for which x₀∈A and f(x₀)=ε₀.     

Solving polynomial optimization problems via the truncated tangency variety and sums of squares

Let f,g_i,i=1,…,l,h_j,j=1,…,m, be polynomials on Rⁿ and S?{x∈Rⁿ∣g_i(x)=0,i=1,…,l,h_j(x)≥0,j=1,…,m}. This paper proposes a method for finding the global infimum of the polynomial f on the semialgebraic set S via sum of squares relaxation over its truncated tangency variety, even in the case where the polynomial f does not attain its infimum on S. Under a constraint qualification condition, it is demonstrated that: (i) The infimum of f on S and on its truncated tangency variety coincide; and (ii) A sums of squares certificate for nonnegativity of f on its truncated tangency variety. These facts imply that we can find a natural sequence of semidefinite programs whose optimal values converge, monotonically increasing to the infimum of f on S.     

On the integrality of nth roots of generating functions

Motivated by the discovery that the eighth root of the theta series of the E₈ lattice and the 24th root of the theta series of the Leech lattice both have integer coefficients, we investigate the question of when an arbitrary element f∈R (where R=1+xZ?x?) can be written as f=gn for g∈R, n?2. Let Pn:={gn|g∈R} and let . We show among other things that (i) for f∈R, f∈Pn⇔f (mod μn)∈Pn, and (ii) if f∈Pn, there is a unique g∈Pn with coefficients mod μn/n such that f≡gn (mod μn). In particular, if f≡1 (mod μn) then f∈Pn. The latter assertion implies that the theta series of any extremal even unimodular lattice in Rn (e.g. E₈ in R⁸) is in Pn if n is of the form i²j³k⁵ (i?3). There do not seem to be any exact analogues for codes, although we show that the weight enumerator of the rth order Reed-Muller code of length m² is in Pr² (and similarly that the theta series of the Barnes-Wall lattice BWm² is in Pm²). We give a number of other results and conjectures, and establish a conjecture of Paul D. Hanna that there is a unique element f∈Pn (n?2) with coefficients restricted to the set {1,2,…,n}.     

Cohen–Macaulayness and Limit Behavior of Depth for Powers of Cover Ideals

Let 𝕂 be a field, and let R = 𝕂[x ₁,…, x _n ] be the polynomial ring over 𝕂 in n indeterminates x ₁,…, x _n . Let G be a graph with vertex-set {x ₁,…, x _n }, and let J be the cover ideal of G in R. For a given positive integer k, we denote the kth symbolic power and the kth bracket power of J by J ^(k) and J ^[k], respectively. In this paper, we give necessary and sufficient conditions for R/J ^k , R/J ^(k), and R/J ^[k] to be Cohen–Macaulay. We also study the limit behavior of the depths of these rings.     

The inversion formulae for automorphisms of polynomial algebras and rings of differential operators in prime characteristic

Let K be an arbitrary field of characteristic p>0. We find an explicit formula for the inverse of any algebra automorphism of any of the following algebras: the polynomial algebra P_n?K[x₁,…,x_n], the ring of differential operators D(P_n) on P_n, D(P_n)⊗P_m, the n’th Weyl algebra A_n or A_n⊗P_m, the power series algebra K[[x₁,…,x_n]], the subalgebra T_k1,…,kn of D(P_n) generated by P_n and the higher derivations , 0≤j<p^k_i, i=1,…,n (where k₁,…,k_n∈N), T_k1,…,kn⊗P_m or an arbitrary central simple (countably generated) algebra over an arbitrary field.     

An extremal property of Hermite polynomials

Let H_n be the nth Hermite polynomial, i.e., the nth orthogonal on polynomial with respect to the weight w(x)=exp(−x²). We prove the following: If f is an arbitrary polynomial of degree at most n, such that |f||H_n| at the zeros of H_n+1, then for k=1,…,n we have f^(k)H_n^(k), where · is the norm. This result can be viewed as an inequality of the Duffin and Schaeffer type. As corollaries, we obtain a Markov-type inequality in the norm, and estimates for the expansion coefficients in the basis of Hermite polynomials.     

On pairs of commuting derivations of the polynomial ring in one or two variables

It is well known that each pair of commuting linear operators on a finite dimensional vector space over an algebraically closed field has a common eigenvector. We prove an analogous statement for derivations of k[x] and k[x,y] over any field k of zero characteristic. In particular, if D₁ and D₂ are commuting derivations of k[x,y] and they are linearly independent over k, then either (i) they have a common polynomial eigenfunction; i.e., a nonconstant polynomial f∈k[x,y] such that D₁(f)=λf and D₂(f)=μf for some λ,μ∈k[x,y], or (ii) they are Jacobian derivations

     

Effective computation of singularities of parametric affine curves

Let k be a field of characteristic zero and f(t),g(t) be polynomials in k[t]. For a plane curve parameterized by x=f(t),y=g(t), Abhyankar developed the notion of Taylor resultant (Mathematical Surveys and Monographs, Vol. 35, American Mathematical Society, Providence, RI, 1990) which enables one to find its singularities without knowing its defining polynomial. This concept was generalized as D-resultant by Yu and Van den Essen (Proc. Amer. Math. Soc. 125(3) (1997) 689), which works over an arbitrary field. In this paper, we extend this to a curve in affine n-space parameterized by x₁=f₁(t),…,x_n=f_n(t) over an arbitrary ground field k, where f₁,…,f_n∈k[t]. This approach compares to the usual approach of computing the ideal of the curve first. It provides an efficient algorithm of computing the singularities of such parametric curves using Gröbner bases. Computational examples worked out by symbolic computation packages are included.     

Global stability in difference equations satisfying the generalized Yorke condition

We present several conditions sufficient for global stability of the zero solution of nonautonomous difference equation xn+1=qxn+fn(xn,…,xn−k), n∈Z, when the nonlinearities fn satisfy a sort of negative feedback condition. Moreover, for every k∈N, we indicate qk such that one of our stability conditions is sharp if q∈(0,qk]. We apply our results to discrete versions of Nicholson's blowflies equation, the Mackey-Glass equations, and the Wazewska and Lasota equation.     

Hoffman polynomials of nonnegative irreducible matrices and strongly connected digraphs

For a nonnegative n × n matrix A, we find that there is a polynomial f(x)∈R[x] such that f(A) is a positive matrix of rank one if and only if A is irreducible. Furthermore, we show that the lowest degree such polynomial f(x) with tr f(A) = n is unique. Thus, generalizing the well-known definition of the Hoffman polynomial of a strongly connected regular digraph, for any irreducible nonnegative n × n matrix A, we are led to define its Hoffman polynomial to be the polynomial f(x) of minimum degree satisfying that f(A) is positive and has rank 1 and trace n. The Hoffman polynomial of a strongly connected digraph is defined to be the Hoffman polynomial of its adjacency matrix. We collect in this paper some basic results and open problems related to the concept of Hoffman polynomials.     

Three-monotone spline approximation

For r≥3, n∈N and each 3-monotone continuous function f on [a,b] (i.e., f is such that its third divided differences [x₀,x₁,x₂,x₃]f are nonnegative for all choices of distinct points x₀,…,x₃ in [a,b]), we construct a spline s of degree r and of minimal defect (i.e., s∈C^r−1[a,b]) with n−1 equidistant knots in (a,b), which is also 3-monotone and satisfies ‖f−s‖_L∞[a,b]≤cω₄(f,n⁻¹,[a,b])_∞, where ω₄(f,t,[a,b])_∞ is the (usual) fourth modulus of smoothness of f in the uniform norm. This answers in the affirmative the question raised in [8, Remark 3], which was the only remaining unproved Jackson-type estimate for uniform 3-monotone approximation by piecewise polynomial functions (ppfs) with uniformly spaced fixed knots.Moreover, we also prove a similar estimate in terms of the Ditzian–Totik fourth modulus of smoothness for splines with Chebyshev knots, and show that these estimates are no longer valid in the case of 3-monotone spline approximation in the L_p norm with p<∞. At the same time, positive results in the L_p case with p<∞ are still valid if one allows the knots of the approximating ppf to depend on f while still being controlled.These results confirm that 3-monotone approximation is the transition case between monotone and convex approximation (where most of the results are “positive”) and k-monotone approximation with k≥4 (where just about everything is “negative”).     

A new continuation method for complementarity problems with uniformP-functions

The complementarity problem with a nonlinear continuous mappingf from the nonnegative orthantR ₊ ⁿ ofR ⁿ intoR ⁿ can be written as the system of equationsF(x, y) = 0 and(x, y) R ₊ ²ⁿ , whereF denotes the mapping from the nonnegative orthantR ₊ ²ⁿ ofR ²ⁿ intoR ₊ ⁿ × Rⁿ defined byF(x, y) = (x ₁y₁,,x_ny_n, f₁(x) – y₁,, f_n(x) – y_n) for every(x, y) R ₊ ²ⁿ . Under the assumption thatf is a uniformP-function, this paper establishes that the mappingF is a homeomorphism ofR ₊ ²ⁿ ontoR ₊ ⁿ × Rⁿ. This result provides a theoretical basis for a new continuation method of tracing the solution curve of the one parameter family of systems of equationsF(x, y) = tF(x ⁰, y⁰) and(x, y) R ₊ ²ⁿ from an arbitrary initial point(x ⁰, y⁰) R ₊ ²ⁿ witht = 1 until the parametert attains 0. This approach is an extension of the one used in the polynomially bounded algorithm recently given by Kojima, Mizuno and Yoshise for solving linear complementarity problems with positive semi-definite matrices.     

Bernstein operators for extended Chebyshev systems

Let U_n ⊂ Cⁿ[a, b] be an extended Chebyshev space of dimension n + 1. Suppose that f₀ ∈ U_n is strictly positive and f₁ ∈ U_n has the property that f₁/f₀ is strictly increasing. We search for conditions ensuring the existence of points t₀, …, t_n ∈ [a, b] and positive coefficients α₀, …, α_n such that for all f ∈ C[a, b], the operator B_n:C[a, b] → U_n defined by satisfies B_nf₀ = f₀ and B_nf₁ = f₁. Here it is assumed that p_n,k, k = 0, …, n, is a Bernstein basis, defined by the property that each p_n,k has a zero of order k at a and a zero of order n − k at b.