TheT-ideal generated by the standard identitys 3[x 1,x 2,x 3]

LetK = T_o(s₃), {c_n} its codimensions, {l_n} its colengths and {Χ_n} its sequence of co-characters. For 9≦n, c_n =2n - 1 or c_n =n(n + l)/2- 1, 3≦l_n ≦4 and χ_n =[n] + 2[n-1,1] + α[n-2,2] + β[2²,1^n?4] where α + β≦l.     

Approximation operators and tauberian constants

The explicit expression of the smallest constantC satisfying $$\mathop {lim}\limits_{\lambda \to \infty } \left| {t_{n(\lambda )}^{(1)} - t_{m(\lambda )}^{(2)} } \right| \leqq C. \mathop {lim sup}\limits_{n \to \infty } \left| {d_n } \right|$$ for all sequences {s _n} satisfying lim sup _n→∞ |d _n| <∞, where {t _n ⁽¹⁾ }, {t _n ⁽²⁾ } are two generalised Hausdorff transforms of {s _n }, {d _n} is the generalised (C, α)-transform (0≦α≦1) of {λ _n a _n} andn(λ, m(λ) are suitably related, is obtained. These results are obtained by using new properties of positive approximation operators and generalised Bernstein approximation operators.     

The combinatorial structure of (m,n)-convex sets

LetS be a closed subset of a Hausdorff linear topological space,S having no isolated points, and letc _s (m) denote the largest integern for whichS is (m,n)-convex. Ifc _s (k)=0 andc _s (k+1)=1, then $$ c_s \left( m \right) = \sum\limits_{i = 1}^k {\left( {\begin{array}{*{20}c} {\left[ {\frac{{m + k - i}} {k}} \right]} \\ 2 \\ \end{array} } \right)} $$ . Moreover, ifT is a minimalm subset ofS, the combinatorial structure ofT is revealed.     

The inverse eigenvalue problem of reflexive matrices with a submatrix constraint and its approximation

In this paper, we first consider the existence of and the general expression for the solution to the constrained inverse eigenvalue problem defined as follows: given a generalized reflection matrix P∈R ^n×n , a set of complex n-vectors {x _i } _i=1 ^m , a set of complex numbers {λ _i } _i=1 ^m , and an s-by-s real matrix C ₀, find an n-by-n real reflexive matrix C such that the s-by-s leading principal submatrix of C is C ₀, and {x _i } _i=1 ^m and {λ _i } _i=1 ^m are the eigenvectors and eigenvalues of C, respectively. We are then concerned with the best approximation problem for the constrained inverse problem whose solution set is nonempty. That is, given an arbitrary real n-by-n matrix $\tilde{C}$ , find a matrix C which is the solution to the constrained inverse problem such that the distance between C and $\tilde{C}$ is minimized in the Frobenius norm. We give an explicit solution and a numerical algorithm to the best approximation problem. An illustrative experiment is also presented.     

Construction of a Jacobi matrix from spectral data

A proof is given for the existence and uniqueness of a correspondence between two pairs of sequences {a},{b} and {ω},{μ}, satisfying b_i>0 for i=1,…,n?1 and ω₁<μ₁<?<μ_n?1<ω_n, under which the symmetric Jacobi matrices J(n,a,b) and J(n?1,a,b) have eigenvalues {ω} and {μ} respectively. Here J(m,a,b) is symmetric and tridiagonal with diagonal elements a_i (i=1,…,m) and off diagonal elements b_i (i=1,…,m?1). A new concise proof is given for the known uniqueness result. The existence result is new.     

EXISTENCE AND NONEXISTENCE OF GLOBAL POSITIVE SOLUTIONS FOR DEGENERATE PARABOLIC EQUATIONS IN EXTERIOR DOMAINS

This article deals with the degenerate parabolic equations in exterior domains and with inhomogeneous Dirichlet boundary conditions. We obtain that pc = (σ+m)n/(n-σ-2) is its critical exponent provided max{-1, [(1-m)n-2]/(n+1)} σ n-2. This critical exponent is not the same as that for the corresponding equations with the boundary value 0, but is more closely tied to the critical exponent of the elliptic type degenerate equations. Furthermore, we demonstrate that if max{1, σ + m} p ≤ pc, then every positive solution of the equations blows up in finite time; whereas for ppc, the equations admit global positive solutions for some boundary values and initial data. Meantime, we also demonstrate that its positive solutions blow up in finite time provided n ≤σ+2.     

Limit distributions for the maxima of stationary Gaussian processes

Let {X_n} be a stationary Gaussian sequence with E{X₀} = 0, {X²₀} = 1 and E{X₀X_n} = rⁿ_n Let c_n = (2ln n)^{$\text{built1}\text{2}$}, b_n = c_n? $\text{1}\text{2}$c^-1_n ln(4π ln n), and set M_n = max_{0 ?k?n}X_k. A classical result for independent normal random variables is that

$\text{P[c}{}_{\mathrm{n}}\text{(M}{}_{\mathrm{n}}\text{?b}{}_{\mathrm{n}}\text{)?x]→exp[-e}{}^{\mathrm{-x}}\text{] as n → ∞ for all x.}$

Berman has shown that (1) applies as well to dependent sequences provided r_nlnn = o(1). Suppose now that {r_n} is a convex correlation sequence satisfying r_n = o(1), (r_nlnn)^-1 is monotone for large n and o(1). Then

$\text{P[r}{}_{\mathrm{n}}{}^{\mathrm{<mtext>-1</mtext><mtext>2</mtext>}}\text{(M}{}_{\mathrm{n}}\text{? (1?r}{}_{\mathrm{n}}\text{)}{}^{\mathrm{<mtext>1</mtext><mtext>2</mtext>}}\text{b}{}_{\mathrm{n}}\text{)?x] → Ф(x)}$

for all x, where Ф is the normal distribution function. While the normal can thus be viewed as a second natural limit distribution for {M_n}, there are others. In particular, the limit distribution is given below when r_n is (sufficiently close to) γ/ln n. We further exhibit a collection of limit distributions which can arise when r_n decays to zero in a nonsmooth manner. Continuous parameter Gaussian processes are also considered. A modified version of (1) has been given by Pickands for some continuous processes which possess sufficient asymptotic independence properties. Under a weaker form of asymptotic independence, we obtain a version of (2).     

Strong convergence of an iterative method for nonexpansive and accretive operators

Let X be a Banach space and A an m-accretive operator with a zero. Consider the iterative method that generates the sequence {xn} by the algorithm xn+1=αnu+(1−αn)Jrnxn, where {αn} and {rn} are two sequences satisfying certain conditions, and Jr denotes the resolvent ⁻¹(I+rA) for r>0. Strong convergence of the algorithm {xn} is proved assuming X either has a weakly continuous duality map or is uniformly smooth.     

Probabilities of dominant candidates based on first-place votes

Suppose each of an odd number n of voters has a strict preference order on the three ‘candidates’ in {1,2,3} and votes for his most preferred candidate on a plurality ballot. Assume that a voter who votes for i is equally likely to have ijk and ikj as his preference order when {i,j,k} = {1,2,3}.Fix an integer m between $\text{1}\text{2}$(n + 1) and n inclusive. Then, given that n_i of the n voters vote for i, let f_m(n₁,n₂,n₃) be the probability that one of the three candidates is preferred by m or more voters to each of the other two.This paper examines the behavior of f_m over the lattice points in L_n, the set of triples of non-negative integers that sum to n. It identifies the regions in L_n where f_m is 1 and where f_m is 0, then shows that f_m(a,b + 1, c)>f_m(a + 1,b,c) whenever a + b + c + 1 = n, a≤c≤b, a<c<m and c≤n ? m. These results are used to partially identify the points in L_n where f_m is minimized subject to f_m>0. It is shown that at least two of the n_i are equal at minimizing points.     

Optimal labelling of a product of two paths

If G is a graph with p vertices and at least one edge, we set φ (G) = m n max |f(u) ? f(v)|, where the maximum is taken over all edges uv and the minimum over all one-to-one mappings f : V(G) → {1, 2, …, p}: V(G) denotes the set of vertices of G.P_n will denote a path of length n whose vertices are integers 1, 2, …, n with i adjacent to j if and only if |i ? j| = 1. P_m × P_n will denote a graph whose vertices are elements of {1, 2, …, m} × {1, 2, …, n} and in which (i, j), (r, s) are adjacent whenever either i = r and |j ? s| = 1 or j = s and |i ? r| = 1.Theorem.If max(m, n) ? 2, thenφ(P_m × P_n) = min(m, n).     

Job shop scheduling with unit time operations under resource constraints and release dates

We consider the problem of job shop scheduling with m machines and n jobs J_i, each consisting of l_i unit time operations. There are s distinct resources R_h and a quantity q_h available of each one. The execution of the j-th operation of J_i requires the presence of u_ijh units of R_h, 1 ≤i≤n, 1 ≤j≤l_i, and 1 ≤h≤s. In addition, each J_i has a release date r_i, that is J_i cannot start before time r_i. We describe algorithms for finding schedules having minimum length or sum of completion times of the jobs. Let l=max{l_i} and u=|{u_ijh}|. If m, u and l are fixed, then both algorithms terminate within polynomial time.     

Quadratic Decomposition of a Laguerre-Hahn Polynomial Sequence II

In [4] the authors proved that a quasi-symmetric orthogonal polynomial sequence {R_n}_{n 3 0}{{\{R_{n}\}}_{n \ge 0}} is a Laguerre-Hahn sequence if and only if the component {P_n}_{n 3 0}{{\{P_{n}\}}_{n \ge 0}} in its quadratic decomposition is also a Laguerre-Hahn sequence. In this paper and under these conditions, we deduce the class s of the Laguerre-Hahn sequence {R_n}_{n 3 0}{{\{R_{n}\}}_{n \ge 0}}. More precisely, if s′ is the class of {P_n}_{n 3 0}{{\{P_{n}\}}_{n \ge 0}} then 2s′ ≤ s ≤ 2s′ + 3. On the other hand the polynomial coefficients of the Riccati equation satisfied by the Stieltjes function corresponding to {R_n}_{n 3 0}{{\{R_{n}\}}_{n \ge 0}} are given in terms of those of {P_n}_{n 3 0}{{\{P_{n}\}}_{n \ge 0}}. As an application, we determine all non-symmetric quasi-symmetric Laguerre-Hahn sequences of class one.     

Geometric, topological and differentiable rigidity of submanifolds in space forms

Let M be an n-dimensional submanifold in the simply connected space form F ^n+p (c) with c + H ² > 0, where H is the mean curvature of M. We verify that if M ⁿ (n ≥ 3) is an oriented compact submanifold with parallel mean curvature and its Ricci curvature satisfies Ric _M ≥ (n ? 2)(c + H ²), then M is either a totally umbilic sphere, a Clifford hypersurface in an (n + 1)-sphere with n = even, or ${\mathbb{C}P^{2} \left(\frac{4}{3}(c + H^{2})\right) {\rm in} S^{7} \left(\frac{1}{\sqrt{c + H^{2}}}\right)}$ C P 2 4 3 ( c + H 2 ) in S 7 1 c + H 2 . In particular, if Ric _M > (n ? 2)(c + H ²), then M is a totally umbilic sphere. We then prove that if M ⁿ (n ≥ 4) is a compact submanifold in F ^n+p (c) with c ≥ 0, and if Ric _M > (n ? 2)(c + H ²), then M is homeomorphic to a sphere. It should be emphasized that our pinching conditions above are sharp. Finally, we obtain a differentiable sphere theorem for submanifolds with positive Ricci curvature.     

Geodesic distance for right invariant Sobolev metrics of fractional order on the diffeomorphism group

We study Sobolev-type metrics of fractional order s ≥ 0 on the group Diff _c (M) of compactly supported diffeomorphisms of a manifold M. We show that for the important special case M = S ¹, the geodesic distance on Diff _c (S ¹) vanishes if and only if ${s\leq\frac12}$ . For other manifolds, we obtain a partial characterization: the geodesic distance on Diff _c (M) vanishes for ${M=\mathbb{R}\times N, s < \frac12}$ and for ${M=S^1\times N, s\leq\frac12}$ , with N being a compact Riemannian manifold. On the other hand, the geodesic distance on Diff _c (M) is positive for ${{\rm dim}(M)=1, s > \frac12}$ and dim(M) ≥ 2, s ≥ 1. For ${M=\mathbb{R}^n}$ , we discuss the geodesic equations for these metrics. For n = 1, we obtain some well-known PDEs of hydrodynamics: Burgers’ equation for s = 0, the modified Constantin–Lax–Majda equation for ${s=\frac12}$ , and the Camassa–Holm equation for s = 1.     

Distribution of roots of quasianalytic functions

For functions of certain quasianalytic classes C{m_n} on (?∞, ∞) we determine a function ξ (x), depending on {m_n}, which is such that a sequence {x_k} is a sequence of the roots off(x) ε C{m_n} if and only if for somea $$\int_a^\infty {\tfrac{{dn(x)}}{{\xi (x - a}}< \infty ,} $$ where n(x) is a distribution function of the sequence {x_k}.     

On real hypersurfaces with η-parallel curvature tensor in complex space forms

The purpose of this paper is to give a complete classification of real hypersurfces M in complex space forms M _n(c), c≠0 in terms of an η-parallel curvature tensor and a certain commutative condition defined on the distribution T ₀={X∈T _x M| X⊥ξ} of M in M _n(c).     

Weak infinitesimal Hilbert’s 16th problem

The following weak infinitestimal Hilbert’s 16th problem is solved. Given a real polynomial H in two variables, denote by M(H, m) the maximal number possessing the following property: for any generic set {γ _i } of at most M(H,m) compact connected components of the level lines H = c _i of the polynomial H, there exists a form θ = P dx + Q dy with polynomials P and Q of degrees no greater than m such that the integral ∫ _H=c θ has nonmultiple zeros on the connected components {γ _i }. An upper bound for the number M(H,m) in terms of the degree n of the polynomial H is found; this estimate is sharp for almost every polynomial H of degree n. A multidimensional version of this result is proved. The relation between the weak infinitesimal Hilbert’s 16th problem and the following question is discussed: How many limit cycles can a polynomial vector field of degree n have if it is close to a Hamiltonian vector field?     

Roots in differential rings of ultradifferentiable functions

Let {M _k } be a logconvex sequence satisfying the differentiability condition $$\sup (M_{n + 1} /M_n )^{1/n} < \infty $$ . It is shown that the Carleman class C{k! M _k } contains all C ^∞ roots of its nonflat elements, i.e., if f ∈ C{k! M _k } and α > 0, then $$f^\alpha \in C\{ k!M_k \} whenever f^\alpha \in C^\infty $$ . If {M _k } also satisfies the additional condition M _n ^1/n → ∞, then the Beurling class C(k! M _k ) is also contains all C ^∞ roots of its nonflat elements.     

Series by Haar system with monotone coefficients

Let χ = {χ _n } _n=0 ^∞ be the Haar system normalized in L ²(0, 1) and M = {M _s } _s=1 ^∞ be an arbitrary, increasing sequence of nonnegative integers. For any subsystem of χ of the form {φ _k } = χS = {χ _n } _n∈S , where S = S(M) = {n _k } _k=1 ^∞ = {n ∈ V[p]: p ∈ M}, V[0] = {1, 2} and V[p] = {2 ^p + 1, 2 ^p + 2, …, 2 ^p+1} for p = 1, 2, … a series of the form Σ _i=1 ^∞ a _i φ _i with a _i ↘ 0 is constructed, that is universal with respect to partial series in all classes L ^r (0, 1), r ∈ (0, 1), in the sense of a.e. convergence and in the metric ofL ^r (0, 1). The constructed series is universal in the class of all measurable, finite functions on [0, 1] in the sense of a.e. convergence. It is proved that there exists a series by Haar system with decreasing coefficients, which has the following property: for any ? > 0 there exists a measurable function µ(x), x ∈ [0, 1], such that 0 ≤ µ(x) ≤ 1 and |{x ∈ [0, 1], µ(x) ≠ = 1}| < ?, and the series is universal in the weighted space L _µ[0, 1] with respect to subseries, in the sense of convergence in the norm of L _µ[0, 1].     

Chain Lengths in Certain Random Directed Graphs

We study the random directed graph with vertex set {1, …, n} in which the directed edges (i, j) occur independently with probability c_n/n for i<j and probability zero for i ? j. Let M_n (resp., L_n) denote the length of the longest path (resp., longest path starting from vertex 1). When c_n is bounded away from 0 and ∞ as n→∞, the asymptotic behavior of M_n was analyzed in previous work of the author and J. E. Cohen. Here, all restrictions on c_n are eliminated and the asymptotic behavior of L_n is also obtained. In particular, if c_n/ln(n)→∞ while c_n/n→0, then both M_n/c_n and L_n/c_n are shown to converge in probability to the constant e.