Image of the Spectral Measure of a Jacobi Field and the Corresponding Operators

By definition, a Jacobi field is a family of commuting selfadjoint three-diagonal operators in the Fock space The operators J(ϕ) are indexed by the vectors of a real Hilbert space H₊. The spectral measure ρ of the field J is defined on the space H₋ of functionals over H₊. The image of the measure ρ under a mapping is a probability measure ρ_K on T₋. We obtain a family J_K of operators whose spectral measure is equal to ρ_K. We also obtain the chaotic decomposition for the space L²(T₋, d_{ρ K}).     

Computing the radius of pointedness of a convex cone

Let Ξ(H) denote the set of all nonzero closed convex cones in a finite dimensional Hilbert space H. Consider this set equipped with the bounded Pompeiu-Hausdorff metric δ. The collection of all pointed cones forms an open set in the metric space (Ξ(H),δ). One possible way of measuring the degree of pointedness of a cone K is by evaluating the distance from K to the set of all nonpointed cones. The number ρ(K) obtained in this way is called the radius of pointedness of the cone K. The evaluation of this number is, in general, a very cumbersome task. In this note, we derive a simple formula for computing ρ(K), and we propose also a method for constructing a nonpointed cone at minimal distance from K. Our results apply to any cone K whose maximal angle does not exceed 120°. Dedicated to Clovis Gonzaga on the occassion of his 60th birthday.     

Bernstein�CWalsh Type Theorems for Real Analytic Functions in Several Variables

The aim of this paper is to extend the classical maximal convergence theory of Bernstein and Walsh for holomorphic functions in the complex plane to real analytic functions in ℝ ^N . In particular, we investigate the polynomial approximation behavior for functions F:L→ℂ, L={(Re z,Im z):z∈K}, of the structure F=g[`(h)]F=g\overline{h}, where g and h are holomorphic in a neighborhood of a compact set K⊂ℂ <sup>N</sup> . To this end the maximal convergence number ρ(S <sub>c</sub> ,f) for continuous functions f defined on a compact set S <sub>c</sub> ⊂ℂ <sup>N</sup> is connected to a maximal convergence number ρ(S <sub>r</sub> ,F) for continuous functions F defined on a compact set S <sub>r</sub> ⊂ℝ <sup>N</sup> . We prove that ρ(L,F)=min {ρ(K,h)),ρ(K,g)} for functions F=g[`(h)]F=g\overline{h} if K is either a closed Euclidean ball or a closed polydisc. Furthermore, we show that min {ρ(K,h)),ρ(K,g)}≤ρ(L,F) if K is regular in the sense of pluripotential theory and equality does not hold in general. Our results are based on the theory of the pluricomplex Green’s function with pole at infinity and Lundin’s formula for Siciak’s extremal function Φ. A properly chosen transformation of Joukowski type plays an important role.     

Convex surfaces which intersect each congruent copy of themselves in a connected set

LetK ⊂R ³ be a three-dimensional convex body such that, for every isometry ρ ofR ³, the boundaries ofK and ρK meet in a connected set. ThenK is a parallel set of some possibly degenerate linesegment.     

List Point Arboricity of Dense Graphs

Let G be a simple graph. The point arboricity ρ(G) of G is defined as the minimum number of subsets in a partition of the point set of G so that each subset induces an acyclic subgraph. The list point arboricity ρ _l (G) is the minimum k so that there is an acyclic L-coloring for any list assignment L of G which |L(v)| ≥ k. So ρ(G) ≤ ρ _l (G) for any graph G. Xue and Wu proved that the list point arboricity of bipartite graphs can be arbitrarily large. As an analogue to the well-known theorem of Ohba for list chromatic number, we obtain ρ _l (G + K _n ) = ρ(G + K _n ) for any fixed graph G when n is sufficiently large. As a consequence, if ρ(G) is close enough to half of the number of vertices in G, then ρ _l (G) = ρ(G). Particularly, we determine that , where K _2(n) is the complete n-partite graph with each partite set containing exactly two vertices. We also conjecture that for a graph G with n vertices, if then ρ _l (G) = ρ(G). Research supported by NSFC (No.10601044) and XJEDU2006S05.     

Sausages are good packings

LetB ^d be thed-dimensional unit ball and, for an integern, letC _n ={x ¹,...,x ⁿ } be a packing set forB ^d , i.e.,|x ⁱ −x ^j |≥2, 1≤i<j≤n. We show that for every a dimensiond(ρ) exists such that, ford≥d(ρ),V(conv(C _n )+ρB ^d )≥V(conv(S _n )+ρB ^d ), whereS _n is a “sausage” arrangement ofn balls, holds. This gives considerable improvement to Fejes Tóth's “sausage” conjecture in high dimensions. Further, we prove that, for every convex bodyK and ρ<1/32d ⁻²,V(conv(C _n )+ρK)≥V(conv(S _n )+ρK), whereC _n is a packing set with respect toK andS _n is a minimal “sausage” arrangement ofK, holds.     

Multidimensional version of M. A. Krasnoseľskii’s generalized contraction principle

Let M be a complete K-metric space with n-dimensional metric ρ(x, y): M × M → R ⁿ , where K is the cone of nonnegative vectors in R ⁿ . A mapping F: M → M is called a Q-contraction if ρ (Fx,Fy) ⩽ Qρ (x,y), where Q: K → K is a semi-additive absolutely stable mapping. A Q-contraction always has a unique fixed point x* in M, and ρ(x*,a) ⩽ (I - Q)^-1 ρ(Fa, a) for every point a in M. The point x* can be obtained by the successive approximation method x _k = Fx _k-1, k = 1, 2,..., starting from an arbitrary point x ₀ in M, and the following error estimates hold: ρ (x*, x _k ) ⩽ Q ^k (I - Q)^-1ρ(x ₁, _x ⁰) ⩽ (I - Q)^-1 Q ^k ρ(x ₁, x ₀), k = 1, 2,.... Generally the mappings (I - Q)^-1 and Q ^k do not commute. For n = 1, the result is close to M. A. Krasnosel’skii’s generalized contraction principle.     

The Probability that a Convex Body Intersects the Integer Lattice in a <Emphasis Type="Italic">k</Emphasis>-dimensional Set

Let K be a convex body in ℝ ^d . It is known that there is a constant C ₀ depending only on d such that the probability that a random copy ρ(K) of K does not intersect ℤ ^d is smaller than \fracC₀|K|\frac{C_{0}}{|K|} and this is best possible. We show that for every k<d there is a constant C such that the probability that ρ(K) contains a subset of dimension k is smaller than \fracC|K|\frac{C}{|K|}. This is best possible if k=d−1. We conjecture that this is not best possible in the rest of the cases; if d=2 and k=0 then we can obtain better bounds. For d=2, we find the best possible value of C ₀ in the limit case when width(K)→0 and |K|→∞.     

Instances of the Conjecture of Chang

We consider various forms of the Conjecture of Chang. Part A constitutes an introduction. Donder and Koepke have shown that if ρ is a cardinal such that ρ ≧ ω₁, and (ρ⁺⁺,ρ⁺↠(ρ⁺, ρ), then 0⁺ exists. We obtain the same conclusion in Part B starting from some other forms of the transfer hypothesis. As typical corollaries, we get: Theorem A.Assume that there exists cardinals λ, κ, such that λ ≧ K ⁺ ≧ω₂ and (λ⁺, λ)↠(K ⁺,K. Then 0⁺ exists. Theorem B.Assume that there exists a singularcardinal κ such that(K ⁺,K↠(ω₁, ω₀. Then 0⁺ exists. Theorem C.Assume that (λ ⁺⁺, λ). Then 0⁺ exists (also ifK=ω ₀. Remark. Here, as in the paper of Donder and Koepke, “O⁺ exists” is a matter of saying that the hypothesis is strictly stronger than “L(μ) exists”. Of course, the same proof could give a few more sharps overL(μ), but the interest is in expecting more cardinals, coming from a larger core model. Theorem D.Assume that (λ ⁺⁺, λ)↠(K ⁺, K) and thatK≧ω ₁. Then 0⁺ exists. Remark 2. Theorem B is, as is well-known, false if the hypothesis “κ is singular” is removed, even if we assume thatK≧ω ₂, or that κ is inaccessible. We shall recall this in due place. Comments. Theorem B and Remark 2 suggest we seek the consistency of the hypothesis of the form:K ⁺, K↠(ω_n +1, ω_n), for κ singular andn≧0. 0266 0152 V 3 The consistency of several statements of this sort—a prototype of which is (N _ω+1,N _ω)↠(ω₁, ω₀) —have been established, starting with an hypothesis slightly stronger than: “there exists a huge cardinal”, but much weaker than: “there exists a 2-huge cardinal”. These results will be published in a joint paper by M. Magidor, S. Shelah, and the author of the present paper.     

Upper Bounds for the Laplacian Graph Eigenvalues

We first apply non-negative matrix theory to the matrix K = D A, where D and A are the degree-diagonal and adjacency matrices of a graph G, respectively, to establish a relation on the largest Laplacian eigenvalue λ1 (G) of G and the spectral radius p(K) of K. And then by using this relation we present two upper bounds for λ1(G) and determine the extremal graphs which achieve the upper bounds.     

Constructing Restricted Patterson Measures for Geometrically Infinite Kleinian Groups

In this paper, we study exhaustions, referred to as p-restrictions, of arbitrary nonelementary Kleinian groups with at most finitely many bounded parabolic elements. Special emphasis is put on the geometrically infinite case, where we obtain that the limit set of each of these Kleinian groups contains an infinite family of closed subsets, referred to as p-restricted limit sets, such that there is a Poincaré series and hence an exponent of convergence δp, canonically associated with every element in this family. Generalizing concepts which are well known in the geometrically finite case, we then introduce the notion of p-restricted Patterson measure, and show that these measures are non-atomic, δp-harmonic, δp-subconformal on special sets and δp-conformal on very special sets. Furthermore, we obtain the results that each p-restriction of our Kleinian group is of δp-divergence type and that the Hausdorff dimension of the p-restricted limit set is equal to δp.     

Decompositions of the 3-uniform hypergraphs <Emphasis Type="Italic">K</Emphasis><Stack><Subscript>v</Subscript><Superscript>(3)</Superscript></Stack> into hypergraphs of a certain type

In this paper, we investigate a generalization of graph decomposition, called hypergraph decomposition. We show that a decomposition of a 3-uniform hypergraph K(3)v into a special kind of hypergraph K(3)4 - e exists if and only if v ≡ 0, 1, 2 (mod 9) and v ≥ 9.     

Triangular finite elements of HCT type and classC ρ

Let τ be some triangulation of a planar polygonal domain Ω. Given a smooth functionu, we construct piecewise polynomial functionsv∈C ^ρ(Ω) of degreen=3 ρ for ρ odd, andn=3ρ+1 for ρ even on a subtriangulation τ₃ of τ. The latter is obtained by subdividing eachT∈ρ into three triangles, andv/T is a composite triangular finite element, generalizing the classicalC ¹ cubic Hsieh-Clough-Tocher (HCT) triangular scheme. The functionv interpolates the derivatives ofu up to order ρ at the vertices of τ. Polynomial degrees obtained in this way are minimal in the family of interpolation schemes based on finite elements of this type.     

Generalized V-univexity type-I for multiobjective programming with n-set functions

In the last time important results in multiobjective programming involving type-I functions were obtained (Yuan et al. in: Konnov et al. (eds) Lecture notes in economics and mathematical systems, 2007; Mishra et al. An Univ Bucureşti Ser Mat, LII(2): 207–224, 2003). Following one of these ways, we study optimality conditions and generalized Mond-Weir duality for multiobjective programming involving n-set functions which satisfy appropriate generalized univexity V-type-I conditions. We introduce classes of functions called (ρ, ρ′)-V-univex type-I, (ρ, ρ′)-quasi V-univex type-I, (ρ, ρ′)-pseudo V-univex type-I, (ρ, ρ′)-quasi pseudo V-univex type-I, and (ρ, ρ′)-pseudo quasi V-univex type-I. Finally, a general frame for constructing functions of these classes is considered. This research was supported by Grant PN II code ID No. 112/01.10.2007, CEEX code 1/2006 No. 1531/2006, and CNCSIS A No. 105 GR/2006.     

Inequalities of Maximum of Partial Sums and Weak Convergence for a Class of Weak Dependent Random Variables

In this paper, we establish a Rosenthal-type inequality of the maximum of partial sums for ρ^- -mixing random fields. As its applications we get the Hájeck -Rènyi inequality and weak convergence of sums of ρ^- -mixing sequence. These results extend related results for NA sequence and p^＊ -mixing random fields,     

On the local Artin conductor f<Subscript>Artin</Subscript> (Χ) of a character Χ of Gal(E/K) — II: Main results for the metabelian case

This paper which is a continuation of [2], is essentially expository in nature, although some new results are presented. LetK be a local field with finite residue class fieldK _k. We first define (cf. Definition 2.4) the conductorf(E/K) of an arbitrary finite Galois extensionE/K in the sense of non-abelian local class field theory as wheren _G is the break in the upper ramification filtration ofG = Gal(E/K) defined by . Next, we study the basic properties of the idealf(E/K) inO _k in caseE/K is a metabelian extension utilizing Koch-de Shalit metabelian local class field theory (cf. [8]). After reviewing the Artin charactera _G : G → ℂ ofG := Gal(E/K) and Artin representationsA _g G → G →GL(V) corresponding toa _G : G → ℂ, we prove that (Proposition 3.2 and Corollary 3.5) where Χ_gr : G → ℂ is the character associated to an irreducible representation ρ: G → GL(V) ofG (over ℂ). The first main result (Theorem 1.2) of the paper states that, if in particular,ρ : G → GL(V) is an irreducible representation ofG(over ℂ) with metabelian image, then where Gal(E^ker(ρ)/E^ker(ρ)•) is any maximal abelian normal subgroup of Gal(E^ker(ρ)/K) containing Gal(E^ker(ρ) /K)′, and the break n_G/ker(ρ) in the upper ramification filtration of G/ker(ρ) can be computed and located by metabelian local class field theory. The proof utilizes Basmaji’s theory on the structure of irreducible faithful representations of finite metabelian groups (cf. [1]) and on metabelian local class field theory (cf. [8]). We then discuss the application of Theorem 1.2 on a problem posed by Weil on the construction of a ‘natural’A _G ofG over ℂ (Problem 1.3). More precisely, we prove in Theorem 1.4 that ifE/K is a metabelian extension with Galois group G, then Kazim İlhan ikeda whereN runs over all normal subgroups of G, and for such anN, V _n denotes the collection of all ∼-equivalence classes [ω]∼, where ‘∼’ denotes the equivalence relation on the set of all representations ω : (G/N)^• → ℂ^Χ satisfying the conditions Inert(ω) = {δ ∈ G/N : ℂ_δ} = ω =(G/N) and where δ runs over R((G/N)^•/(G/N)), a fixed given complete system of representatives of (G/N)^•/(G/N), by declaring that ω₁ ∼ ω₂ if and only if ω₁ = ω _2,δ for some δ ∈ R((G/N)^•/(G/N)). Finally, we conclude our paper with certain remarks on Problem 1.1 and Problem 1.3.     

Multiplicative arithmetic of finite quadratic forms over Dedekind rings

Letq(X) be a quadratic form in an even numberm of variables with coefficients in a Dedekind ringK. Let us assume that the setsR(q,a) = {N∈K ^m ;q(N) = a} of representations of elementsa ofK by the formq are finite. Then certain multiplicative relations are obtained by elementary means between the setsR(q,a) andR(q,ab), whereb is a product of prime elementsρ ofK with finite coefficientsK/ρK. The relations imply similar multiplicative relations between the numbers of elements of the setsR(q,a), which formerly could be obtained only in some special cases like the case whenK = ℤ is the ring of rational integers and only by means of the theory of Hecke operators on the spaces of theta-series. As an application, an almost elementary proof of the Siegel theorem on the mean number of representations of integers by integral positive quadratic forms of determinant 1 is given. Dedicated to the memory of Professor K G Ramanathan     

On a class of stochastic partial differential equations related to turbulent transport

Summary. We consider the Cauchy problem for the mass density ρ of particles which diffuse in an incompressible fluid. The dynamical behaviour of ρ is modeled by a linear, uniformly parabolic differential equation containing a stochastic vector field. This vector field is interpreted as the velocity field of the fluid in a state of turbulence. Combining a contraction method with techniques from white noise analysis we prove an existence and uniqueness result for the solution ρ∈C ^1,2([0,T]×ℝ ^d ,(S)^*), which is a generalized random field. For a subclass of Cauchy problems we show that ρ actually is a classical random field, i.e. ρ(t,x) is an L ²-random variable for all time and space parameters (t,x)∈[0,T]×ℝ ^d . Received: 27 March 1995 / In revised form: 15 May 1997     

The K°-relation on the Congruence Lattice of a Regular Semigroup with an Inverse Transversal

Let S be a regular semigroup with an inverse transversal S° and C(S) the congruence lattice of S. A relation K° on C(S) is introduced as follows: if ρ, θ∈ C(S), then we say that ρ and θ are K°-related if Ker ρ° = Ker θ° , where ρ° = ρ|S°. Expressions for the least and the greatest congruences in the same K°-class as ρ are provided. A number of equivalent conditions for K° being a congruence are given.     

Estimating the ratio of two scale parameters: a simple approach

We describe a simple approach for estimating the ratio ρ = σ ₂/σ ₁ of the scale parameters of two populations from a decision theoretic point of view. We show that if the loss function satisfies a certain condition, then the estimation of ρ reduces to separately estimating σ ₂ and 1/σ ₁. This implies that the standard estimator of ρ can be improved by just employing an improved estimator of σ ₂ or 1/σ ₁. Moreover, in the case where the loss function is convex in some function of its argument, we prove that such improved estimators of ρ are further dominated by corresponding ones that use all the available data. Using this result, we construct new classes of double-adjustment improved estimators for several well-known convex as well as non-convex loss functions. In particular, Strawderman-type estimators of ρ in general models are given whereas Shinozaki-type estimators of the ratio of two normal variances are briefly treated.