Unit and Proper Tube Orders

In 2005, we defined the n-tube orders, which are the n-dimensional analogue of interval orders in 1 dimension, and trapezoid orders in 2 dimensions. In this paper we consider two variations of n-tube orders: unit n-tube orders and proper n-tube orders. It has been proven that the classes of unit and proper interval orders are equal, and the classes of unit and proper trapezoid orders are not. We prove that the classes of unit and proper n-tube orders are not equal for all n ≥ 3, so the general case follows the situation in 2 dimensions.     

Orders on Multisets and Discrete Cones

We study additive representability of orders on multisets (of size k drawn from a set of size n) which satisfy the condition of independence of equal submultisets (IES) introduced by Sertel and Slinko (Ranking committees, words or multisets. Nota di Laboro 50.2002. Center of Operation Research and Economics. The Fundazione Eni Enrico Mattei, Milan, 2002, Econ. Theory 30(2):265–287, 2007). Here we take a geometric view of those orders, and relate them to certain combinatorial objects which we call discrete cones. Following Fishburn (J. Math. Psychol., 40:64–77, 1996) and Conder and Slinko (J. Math. Psychol., 48(6):425–431, 2004), we define functions f(n,k) and g(n,k) which measure the maximal possible deviation of an arbitrary order satisfying the IES and an arbitrary almost representable order satisfying the IES, respectively, from a representable order. We prove that g(n,k) = n − 1 whenever n ≥ 3 and (n, k) ≠ (5, 2). In the exceptional case, g(5,2) = 3. We also prove that g(n,k) ≤ f(n,k) ≤ n and establish that for small n and k the functions g(n,k) and f(n,k) coincide.      

On the Slowly Well Orderedness of εo

For α < ε₀, N_α denotes the number of occurrences of ω in the Cantor normal form of α with the base ω. For a binary number-theoretic function f let B(K; f) denote the length n of the longest descending chain (α₀, …, α_n–1) of ordinals <ε₀ such that for all i < n, Nα_i ≤ f (K, i). Simpson [2] called ε₀ as slowly well ordered when B (K; f) is totally defined for f (K; i) = K · (i+ 1). Let |n| denote the binary length of the natural number n, and |n|_k the k-times iterate of the logarithmic function |n|. For a unary function h let L(K; h) denote the function B (K; h₀(K; i)) with h₀(K, i) = K + |i| · |i|_h(i). In this note we show, inspired from Weiermann [4], that, under a reasonable condition on h, the functionL (K; h) is primitive recursive in the inverse h^–1 and vice versa.     

On the number of positive solutions of elliptic systems

The paper deals with the existence, multiplicity and nonexistence of positive radial solutions for the elliptic system div(|?|^{p –2}?) + λk_i (|x |) fⁱ (u₁, …,u_n) = 0, p > 1, R₁ < |x | < R₂, u_i (x) = 0, on |x | = R₁ and R₂, i = 1, …, n, x ∈ ?^N , where k_i and fⁱ, i = 1, …, n, are continuous and nonnegative functions. Let u = (u₁, …, u_n), φ (t) = |t |^{p –2}t, fⁱ₀ = lim_{‖ u ‖→0}((fⁱ ( u ))/(φ (‖ u ‖))), fⁱ_∞= lim_{‖ u ‖→∞}((fⁱ ( u ))/(φ (‖ u ‖))), i = 1, …, n, f = (f¹, …, fⁿ), f ₀ = ∑ⁿ _{i =1} fⁱ ₀ and f _∞ = ∑ⁿ _{i =1} fⁱ _∞. We prove that either f ₀ = 0 and f _∞ = ∞ (superlinear), or f ₀ = ∞and f _∞ = 0 (sublinear), guarantee existence for all λ > 0. In addition, if fⁱ ( u ) > 0 for ‖ u ‖ > 0, i = 1, …, n, then either f ₀ = f _∞ = 0, or f ₀ = f _∞ = ∞, guarantee multiplicity for sufficiently large, or small λ, respectively. On the other hand, either f₀ and f_∞ > 0, or f₀ and f_∞ < ∞ imply nonexistence for sufficiently large, or small λ, respectively. Furthermore, all the results are valid for Dirichlet/Neumann boundary conditions. We shall use fixed point theorems in a cone. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Matrices associated with arithmetical functions

Let f be an arithmetical function and S={x ₁,x ₂,…,x_n } a set of distinct positive integers. Denote by [f(x_i ,x_j }] the n×n matrix having f evaluated at the greatest common divisor (x_i ,x_j ) of x_i , and x_j as its i j-entry. We will determine conditions on f that will guarantee the matrix [f(x_i ,x_j )] is positive definite and, in fact, has properties similar to the greatest common divisor (GCD) matrix

[(x_i ,x_j )] where f is the identity function. The set S is gcd-closed if (x_i ,x_j )∈S for 1≤ i j ≤ n. If S is gcd-closed, we calculate the determinant and (if it is invertible) the inverse of the matrix [f(x_i ,x_j )]. Among the examples of determinants of this kind are H. J. S. Smith's determinant det[(i,j)].     

Extremal hypergraph problems and convex hulls

Theprofile of a hypergraph onn vertices is (f ₀, f₁, ...,f _n) wheref _i denotes the number ofi-element edges. The extreme points of the set of profiles is determined for certain hypergraph classes. The results contain many old theorems of extremal set theory as particular cases (Sperner. Erdős—Ko—Rado, Daykin—Frankl—Green—Hilton).     

Gelfand pairs,K-spherical means and injectivity on the Heisenberg group

We study the injectivity properties of the spherical mean value operators associated to the Gelfand pairs (H ⁿ,K), whereK is a compact subgroup ofU(n). We show that these spherical mean value operators are injective onL ^p Hⁿ) for 1≤p<∞. Forp=∞, these operators are not injective. Nevertheless, if the spherical meansf*μ _i overK-orbits of sufficiently many points (z _i,t _i) ∈H ⁿ vanish, we identify a necessary and sufficient condition on the points (z _i,t _i) which guaranteesf=0. ForK=U(n), this is equivalent to the condition for the two-radius theorem. Research supported by N.B.H.M. Research Grant, Govt. of India.     

Multiple vertex coverings by specified induced subgraphs

Given graphs H₁,…, H_k, let f(H₁,…, H_k) be the minimum order of a graph G such that for each i, the induced copies of H_i in G cover V(G). We prove constructively that f(H₁, H₂) ≤ 2(n(H₁) + n(H₂) − 2); equality holds when H₁ = H ₂ = K_n. We prove that f(H₁, K _n) = n + 2√δ(H₁)n + O(1) as n → ∞. We also determine f(K_{1, m −1}, K _n) exactly. © 2000 John Wiley & Sons, Inc. J Graph Theory 34: 180–190, 2000     

Divisibility of matrices associated with multiplicative functions

Let S={x₁,…,x_n} be a set of n distinct positive integers. For x,y∈S and y<x, we say the y is a greatest-type divisor of x in S if y∣x and it can be deduced that z=y from y∣z,z∣x,z<x and z∈S. For x∈S, let G_S(x) denote the set of all greatest-type divisors of x in S. For any arithmetic function f, let (f(x_i,x_j)) denote the n×n matrix having f evaluated at the greatest common divisor (x_i,x_j) of x_i and x_j as its i,j-entry and let (f[x_i,x_j]) denote the n×n matrix having f evaluated at the least common multiple [x_i,x_j] of x_i and x_j as its i,j-entry. In this paper, we assume that S is a gcd-closed set and . We show that if f is a multiplicative function such that (f∗μ)(d)∈Z whenever and f(a)|f(b) whenever a|b and a,b∈S and (f(x_i,x_j)) is nonsingular, then the matrix (f(x_i,x_j)) divides the matrix (f[x_i,x_j]) in the ring M_n(Z) of n×n matrices over the integers. As a consequence, we show that (f(x_i,x_j)) divides (f[x_i,x_j]) in the ring M_n(Z) if (f∗μ)(d)∈Z whenever and f is a completely multiplicative function such that (f(x_i,x_j)) is nonsingular. This confirms a conjecture of Hong raised in 2004.     

Multiplicative isometries on the Smirnov class

We show that T is a surjective multiplicative (but not necessarily linear) isometry from the Smirnov class on the open unit disk, the ball, or the polydisk onto itself, if and only if there exists a holomorphic automorphism Φ such that T(f)=f ○ Φ for every class element f or T(f) = [`(f<sup>°</sup> [`(j)] )]\overline {f^\circ \bar \varphi } for every class element f, where the automorphism Φ is a unitary transformation in the case of the ball and Φ(z ₁, ..., z _n ) = (l₁ z_i1 ,...,l_n z_in )(\lambda _1 z_{i_1 } ,...,\lambda _n z_{i_n } ) for |λ _j | = 1, 1 ≤ j ≤ n, and (i ₁; ..., i _n )is some permutation of the integers from 1through n in the case of the n-dimensional polydisk.     

Korovkin-type theorem and application

Let (L_n) be a sequence of positive linear operators on C[0,1], satisfying that (L_n(e_i)) converge in C[0,1] (not necessarily to e_i) for i=0,1,2, where e_i(x)=xⁱ. We prove that the conditions that (L_n) is monotonicity-preserving, convexity-preserving and variation diminishing do not suffice to insure the convergence of (L_n(f)) for all fC[0,1]. We obtain the Korovkin-type theorem and give quantitative results for the approximation properties of the q-Bernstein operators B_n,q as an application.     

Convexity of Products of Univariate Functions and Convexification Transformations for Geometric Programming

We investigate the characteristics that have to be possessed by a functional mapping f:ℝ↦ℝ so that it is suitable to be employed in a variable transformation of the type x→f(y) in the convexification of posynomials. We study first the bilinear product of univariate functions f ₁(y ₁), f ₂(y ₂) and, based on convexity analysis, we derive sufficient conditions for these two functions so that ℱ₂(y ₁,y ₂)=f ₁(y ₁)f ₂(y ₂) is convex for all (y ₁,y ₂) in some box domain. We then prove that these conditions suffice for the general case of products of univariate functions; that is, they are sufficient conditions for every f _i (y _i ), i=1,2,…,n, so as ℱ _n (y ₁,y ₂,…,y _n )=∏ _i=1 ⁿ f _i (y _i ) to be convex. In order to address the transformation of variables that are exponentiated to some power κ≠1, we investigate under which further conditions would the function (f) ^κ be also suitable. The results provide rigorous reasoning on why transformations that have already appeared in the literature, like the exponential or reciprocal, work properly in convexifying posynomial programs. Furthermore, a useful contribution is in devising other transformation schemes that have the potential to work better with a particular formulation. Finally, the results can be used to infer the convexity of multivariate functions that can be expressed as products of univariate factors, through conditions on these factors on an individual basis. The authors gratefully acknowledge support from the National Science Foundation.     

Functions and line digraphs

Consider two maps f and g from a set E into a set F such that f(x) ≠ g(x) for every x in E. Suppose that there exists a positive integer n such that for any element z in F either f^?1(z) or g^?1(z) has at most n elements. Then, E can be partitioned into 2n + 1 subsets E₁, E₂,…,E_{2n + 1} such that f(E_i)∩ g(E_i) = ?, 1 ≤ i ≤ 2n + 1. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 296–303, 2003     

On the generalized critical values of a polynomial mapping

 Let be a polynomial dominant mapping and let deg f _i ≤d. We prove that the set K(f) of generalized critical values of f is contained in the algebraic hypersurface of degree at most D=(d+s(m−1)(d−1)) ⁿ , where . This implies in particular that the set B(f) of bifurcations points of f is contained in the hypersurface of degree at most D=(d+s(m−1)(d−1)) ⁿ . We give also an algorithm to compute the set K(f) effectively. Received: 11 June 2001 / Revised version: 1 July 2002 Published online: 24 January 2003 The author is partially supported by the KBN grant 2 PO3A 017 22. Mathematics Subject Classification (2000): 14D06, 14Q20, 51N10, 51N20, 15A04     

A topological invariant for pairs of maps

In this paper we develop the notion of contact orders for pairs of continuous self-maps (f, g) from ℝⁿ, showing that the set Con(f, g) of all possible contact orders between f and g is a topological invariant (we remark that Con(f, id) = Per(f)). As an interesting application of this concept, we give sufficient conditions for the graphs of two continuous self-maps from ℝ intersect each other. We also determine the ordering of the sets Con(f, 0) and Con(f, h), for h ∈ Hom(ℝ) such that f ∘ h = h ∘ f. For this latter set we obtain a generalization of Sharkovsky’s theorem.     

Lower Bound for the Poles of Igusa’s p-adic Zeta Functions

Let K be a p-adic field, R the valuation ring of K, P the maximal ideal of R and q the cardinality of the residue field R/P. Let f be a polynomial over R in n >1 variables and let χ be a character of . Let M _i (u) be the number of solutions of f = u in (R/P ⁱ ) ⁿ for and. These numbers are related with Igusa’s p-adic zeta function Z _f,χ(s) of f. We explain the connection between the M _i (u) and the smallest real part of a pole of Z _f,χ(s). We also prove that M _i (u) is divisible by , where the corners indicate that we have to round up. This will imply our main result: Z _f,χ(s) has no poles with real part less than − n/2. We will also consider arbitrary K-analytic functions f.     

Comonotone approximation of twice differentiable periodic functions

In the case where a 2π-periodic function f is twice continuously differentiable on the real axis ℝ and changes its monotonicity at different fixed points y _i ∈ [− π, π), i = 1,…, 2s, s ∈ ℕ (i.e., on ℝ, there exists a set Y := {y _i } _i∈ℤ of points y _i = y _i+2s + 2π such that the function f does not decrease on [y _i , y _i−1] if i is odd and does not increase if i is even), for any natural k and n, n ≥ N(Y, k) = const, we construct a trigonometric polynomial T _n of order ≤n that changes its monotonicity at the same points y _i ∈ Y as f and is such that

Optimal Constant in Approximation by Bernstein Operators

We obtained that for any n N, C = 1 is the smallest constant for which the inequality ||B _n (f) - f|| C ₂(f, 1/n) holds on the class of continuous functions f, as well as on the class of bounded functions f, where B _n is the Bernstein operators of degree n, ₂ is the second order modulus and || || is the sup-norm.     

相关序的进一步研究

Let (X1,X2,…,Xn) and (Y1,Y2,…Yn) be real random vectors with the same marginal distributions,if (X1,X2,…,Xn)≤c(Y1,Y2,…Yn), it is showed in this paper that ∑i=1^n Xi≤cx∑i=1^n Yi and max1≤k≤n∑i=1^k Xi≤icx max1≤k≤n∑i=1^k Yi hold. Based on this fact,a more general comparison theorem is obtained.     

WAVELET ESTIMATION IN NONPARAMETRIC MODEL UNDER MARTINGALE DIFFERENCE ERRORS

§1　IntroductionConsider the following heteroscedastic regression model:Yi =g(xi) +σiei,　1≤i≤n,(1.1)whereσ2i=f(ui) ,(xi,ui) are nonrandom design points,0≤x0 ≤x1 ≤...≤xn=1and0≤u0≤u1 ≤...≤un=1,Yi are the response variables,ei are random errors,and f(·) andg(·) are unknown functions defined on closed interval[0 ,1] .It is well known thatregression model has many applications in practical problems,sothe model (1.1) and its special cases have been studied extensively. For instance,…