Wandering subspaces and quasi-wandering subspaces in the Hardy–Sobolev spaces

In this paper, we prove that for-1/2 ≤β≤0.suppose M is an invariant subspaces of the Hardy Sobolev spaces H_β~2(D) for T_z~β, then M() zM is a generating wandering subspace of M, that is,M=[MzM]_T_z~β Moreover, any non-trivial invariant subspace M of H_β~2(D) is also generated by the quasi-wandering subspace P_MT_z~βM~⊥ that is,M=[P_MT_z~βM~⊥]_(T_z~β).     

Embeddings of the base and bundle isomorphisms

Let π_i :E_i→M, i=1,2, be oriented, smooth vector bundles of rank k over a closed, oriented n-manifold with zero sections s_i :M→E_i. Suppose that U is an open neighborhood of s₁(M) in E₁ and F :U→E₂ a smooth embedding so that π₂Fs₁ :M→M is homotopic to a diffeomorphism f. We show that if k>[(n+1)/2]+1 then E₁ and the induced bundle f^*E₂ are isomorphic as oriented bundles provided that f have degree +1; the same conclusion holds if f has degree −1 except in the case where k is even and one of the bundles does not have a nowhere-zero cross-section. For n≡0(4) and [(n+1)/2]+1<kn we give examples of nonisomorphic oriented bundles E₁ and E₂ of rank k over a homotopy n-sphere with total spaces diffeomorphic with orientation preserved, but such that E₁ and f^*E₂ are not isomorphic oriented bundles. We obtain similar results and counterexamples in the more difficult limiting case where k=[(n+1)/2]+1 and M is a homotopy n-sphere.     

A new formula for an evaluation of the Tutte polynomial of a matroid

Given a matroid M and its Tutte polynomial T_M(x,y), T_M(0,1) is an invariant of M with various interesting combinatorial and topological interpretations. Being a Tutte–Grothendieck invariant, T_M(0,1) may be computed via deletion–contraction recursions. In this note we derive a new recursion formula for this invariant that involves contractions of M through the circuits containing a fixed element of M.     

Intersections of nest algebras in finite dimensions

If are maximal nests on a finite-dimensional Hilbert space H, the dimension of the intersection of the corresponding nest algebras is at least dim H. On the other hand, there are three maximal nests whose nest algebras intersect in the scalar operators. The dimension of the intersection of two nest algebras (corresponding to maximal nests) can be of any integer value from n to n(n+1)/2, where n=dim H. For any two maximal nests there exists a basis {f₁,f₂,…,f_n} of H and a permutation π such that and where M_i=  span{f₁,f₂,…,f_i} and N_i= span{f_π(1),f_π(2),…,f_π(i)}. The intersection of the corresponding nest algebras has minimum dimension, namely dim H, precisely when π(j)=n−j+1,1jn. Those algebras which are upper-triangular matrix incidence algebras, relative to some basis, can be characterised as intersections of certain nest algebras.     

Probabilistic version of the method of feasible directions

A probabilistic version of the method of feasible directions (MFD) for solving nonlinear programming (NLP) problems of the type min{f(x): f_j(x)0,j=1,2,…,m} is presented. Randomization is applied to modify the algorithm and a global convergence Theorem is used in the analysis of convergence. Some numerical experiments on problems with known solutions serve to compare this method with the traditional deterministic versions.     

On a paper of Lang and Maslamani

Let k be a field of characteristic 0, and let f : kⁿ→kⁿ be a polynomial map with components of the form f_i=x_i+h_i, where the h_i are monomials. If the Jacobian determinant of the map f is a nonzero constant, then f is a tame automorphism. If, in addition, each h_i is either constant or of degree 2 or more, then f is linearly triangularizable.     

Efficient Energy-preserving Methods for General Nonlinear Oscillatory Hamiltonian System

In this paper, we propose and analyze two kinds of novel and symmetric energy-preserving formulae for the nonlinear oscillatory Hamiltonian system of second-order differential equations Aq"(t)+ Bq(t)=f(q(t)), where A ∈ R^m×m is a symmetric positive definite matrix, B ∈ R^m×m is a symmetric positive semi-definite matrix that implicitly contains the main frequencies of the problem and f(q)=-▽_qV(q) for a real-valued function V(q). The energy-preserving formulae can exactly preserve the Hamiltonian H(q', q)=(1)/2q'^τ Aq' + (1)/2q^τ Bq + V(q). We analyze the properties of energy-preserving and convergence of the derived energy-preserving formula and obtain new efficient energy-preserving integrators for practical computation. Numerical experiments are carried out to show the efficiency of the new methods by the nonlinear Hamiltonian systems.     

Decompositions of positive self-dual boolean functions

A coterie, which is used to realize mutual exclusion in distributed systems, is a family C of subsets such that any pair of subsets in C has at least one element in common, and such that no subset in C contains any other subset in C. Associate with a family of subsets C a positive Boolean function f_c such that f_c(x) = 1 if the Boolean vector x is equal to or greater than the characteristic vector of some subset in C, and 0 otherwise. It is known that C is a coterie if and only if f_c is dual-minor, and is a non-dominated (ND) coterie if and only if f_c is self-dual. We study in this paper the decomposition of a positive self-dual function into smaller positive self-dual functions, as it explains how to represent and how to construct the corresponding ND coterie. A key step is how to decompose a positive dual-minor function f into a conjunction of positive self-dual functions f₁,f₂,…, f_k. In addition to the general condition for this decomposition, we clarify the condition for the decomposition into two functions f₁, and f₂, and introduce the concept of canonical decomposition. Then we present an algorithm that determines a minimal canonical decomposition, and a very simple algorithm that usually gives a decomposition close to minimal. The decomposition of a general self-dual function is also discussed.     

Algorithms for finding a Kth best valued assignment

We consider a new problem, the Kth best valued assignment problem. Given a bipartite graph G and a cost vector w on its edge set, this is the problem of finding a perfect matching M_k in G such that there exist perfect matchings M₁,…,M_K−1 satisfying w(M₁) < < w(M_K−1) < w(M_K), and w(M_K) < w(M) for all perfect matchings M with w(M) ≠ w(M₁),…,w(M_K). Here w(M) denotes the sum of costs of edges in M. In this paper, we propose two algorithms for solving this problem and verify the efficiency of our algorithms by our preliminary computational experiments.     

Stability of Periodic Orbits and Return Trajectories of Continuous Multi-valued Maps on Intervals

Let I be a compact interval of real axis R, and(I, H) be the metric space of all nonempty closed subintervals of I with the Hausdorff metric H and f : I → I be a continuous multi-valued map. Assume that Pn =(x_0, x_1,..., xn) is a return tra jectory of f and that p ∈ [min Pn, max Pn] with p ∈ f(p). In this paper, we show that if there exist k(≥ 1) centripetal point pairs of f(relative to p)in {(x_i; x_i+1) : 0 ≤ i ≤ n-1} and n = sk + r(0 ≤ r ≤ k-1), then f has an R-periodic orbit, where R = s + 1 if s is even, and R = s if s is odd and r = 0, and R = s + 2 if s is odd and r 0. Besides,we also study stability of periodic orbits of continuous multi-valued maps from I to I.     

Weak convergence to the multiple Stratonovich integral

We have considered the problem of the weak convergence, as tends to zero, of the multiple integral processes

in the space , where fL²([0,T]ⁿ) is a given function, and {η(t)}_>0 is a family of stochastic processes with absolutely continuous paths that converges weakly to the Brownian motion. In view of the known results when n2 and f(t₁,…,t_n)=1_{t1<t2<<tn}, we cannot expect that these multiple integrals converge to the multiple Itô–Wiener integral of f, because the quadratic variations of the η are null. We have obtained the existence of the limit for any {η}, when f is given by a multimeasure, and under some conditions on {η} when f is a continuous function and when f(t₁,…,t_n)=f₁(t₁)f_n(t_n)1_{t1<t2<<tn}, with f_iL²([0,T]) for any i=1,…,n. In all these cases the limit process is the multiple Stratonovich integral of the function f.     

How many maxima can there be?

Let C be a planar region. Choose n points p₁,,p_nI.I.D. from the uniform distribution over C. Let M^C_n be the number of these points that are maximal. If C is convex it is known that either E(M^C_n)=Θ(√n)> or E(M^C_n)=O(log n). In this paper we will show that, for general C, there is very little that can be said, a-priori, about E(M^C_n). More specifically we will show that if g is a member of a large class of functions then there is always a region C such that E(M^C_n)=Θ(g(n)). This class contains, for example, all monotically increasing functions of the form g(n)= nln^βn, where 0<<1 and β0. This class also contains nondecreasing functions like g(n)=ln^*n. The results in this paper remain valid in higher dimensions.     

On a class of fractals: the constructive structure

In the present paper, we consider the following generalization of Besicovitch functions. Let {λ_n} satisfy Hadamard condition, write

f(t)=∑^∞_n=1a_ncosλ_nt.

We are interested in the intrinsic relationship among the coefficients {a_n}, the modulus of continuity of f and the upper Box dimension of graph of f. Especially, constructive structure of the function f which can be deduced from the (upper) Box dimension is a very interesting subject, and is hardly ever touched upon as far as we are aware.     

Every tree is 3-equitable

A labeling of a graph is a function f from the vertex set to some subset of the natural numbers. The image of a vertex is called its label. We assign the label |f(u)−f(v)| to the edge incident with vertices u and v. In a k-equitable labeling the image of f is the set {0,1,2,…,k−1}. We require both the vertex labels and the edge labels to be as equally distributed as possible, i.e., if v_i denotes the number of vertices labeled i and e_i denotes the number of edges labeled i, we require |v_i−v_j|1 and |e_i−e_j|1 for every i,j in {0,1,2,…,k−1}. Equitable graph labelings were introduced by I. Cahit as a generalization for graceful labeling. We prove that every tree is 3-equitable.     

On extensions of the domain invariance theorem

If f maps continuously a compact subset X of Rⁿ into Rⁿ and x is a point whose distance from the boundary ∂X is greater than double diameter of the fibres of the points in f(∂X) then f(x) is in the interior of f(X). This theorem extends some results due to Borsuk and Sitnikov.     

Pontryagin–Thom construction for approximation of mappings by embeddings

Let n3 and be positive integers, f :Sⁿ→Sⁿ be a C⁰-mapping, and denote the standard embedding. As an application of the Pontryagin–Thom construction in the special case of the two-point configuration space, we construct complete algebraic obstructions O(f) and to discrete and isotopic realizability (realizability as an embedding) of the mapping Jf. The obstructions are described in terms of stable (equivariant) homotopy groups of neighborhoods of the singular set Σ(f)={(x,y)Sⁿ×Sⁿf(x)=f(y), x≠y}.

A standard method of solving problems in differential topology is to translate them into homotopy theory by means of bordism theory and Pontryagin–Thom construction. By this method we give a generalization of the van-Kampen–Skopenkov obstruction to discrete realizability of f and the van-Kampen–Melikhov obstruction to isotopic realizability of f. The latter are complete only in the case d=0 and are the images of our obstructions under a Hurewicz homomorphism.

We consider several examples of computation of the obstructions.     

Full quadrature sums for pth powers of polynomials with Freud weights

In this paper, we provide a solution of the quadrature sum problem of R. Askey for a class of Freud weights. Let r> 0, b (− ∞, 2]. We establish a full quadrature sum estimate

1 p < ∞, for every polynomial P of degree at most n + rn^1/3, where W² is a Freud weight such as exp(−¦x¦), > 1, λ_jn are the Christoffel numbers, x_jn are the zeros of the orthonormal polynomials for the weight W², and C is independent of n and P. We also prove a generalisation, and that such an estimate is not possible for polynomials P of degree M = m(n) if m(n) = n + ξ_nn^1/3, where ξ_n → ∞ as n → ∞. Previous estimates could sum only over those x_jn with ¦x_jn¦ σx_1n, some fixed 0 < σ < 1.     

π-Armendariz rings relative to a monoid

Let Mbe a monoid. A ring Ris called M-π-Armendariz if whenever α = a₁g₁+ a₂g₂+ · · · + a_ng_n, β = b₁h₁+ b₂h₂+ · · · + b_mh_m ∈ R[M] satisfy αβ ∈ nil(R[M]), then aibj ∈ nil(R) for all i, j. A ring R is called weakly 2-primal if the set of nilpotent elements in R coincides with its Levitzki radical. In this paper, we consider some extensions of M-π-Armendariz rings and further investigate their properties under the condition that R is weakly 2-primal. We prove that if R is an M-π-Armendariz ring then nil(R[M]) = nil(R)[M]. Moreover, we study the relationship between the weak zip-property (resp., weak APP-property, nilpotent p.p.-property, weak associated prime property) of a ring R and that of the monoid ring R[M] in case R is M-π-Armendariz.     

A note on a property of a weak self-similar perfect set

Let S be a compact, weak self-similar perfect set based on a system of weak contractions f_j, j=1,…,m each of which is characterized by a variable contraction coefficient _j(l) as d(f_j(x),f_j(y)) _j(l)d(x,y), d(x,y)<l, l>0. If the relation ∑^m_j=1j(l₀)<1 holds at at least one point l₀, then every nonempty compact metric space is a continuous image of the set S.