Spectra of degrees of some structures

We argue for the existence of structures with the spectrum {x : x ≰ a} of degrees, where a is an arbitrary low degree. Also it is stated that there exist structures with the spectrum of degrees, {x : x ≰ a} ⋃ {x : x ≰ b}, for any low degrees a and b. Supported by RFBR grant No. 05-01-00605. __________ Translated from Algebra i Logika, Vol. 46, No. 6, pp. 729–744, November–December, 2007.     

Large Sets and Overlarge Sets of Triangle-Decomposition

There are six types of triangles:undirected triangle,cyclic triangle,transitive triangle,mixed-1triangle,mixed-2 triangle and mixed-3 triangle.The triangle-decompositions for the six types of triangles havealready been solved.For the first three types of triangles,their large sets have already been solved,and theiroverlarge sets have been investigated.In this paper,we establish the spectrum of LT_i(v,λ),OLT_i(v)(i=1,2),and give the existence of LT_3(v,λ)and OLT_3(v,λ)with λ even.     

Approximation of analytic sets by Nash tangents of higher order

The aim of this paper is to show that for every locally analytic subset X of C ^m and every there exist a neighborhood V of a in C ^m and a sequence of Nash subsets of V converging to such that X _ν and X satisfy a certain condition for tangency of order ν. Next it is shown that this condition implies that for sufficiently large ν the multiplicities of X _ν and X at a are equal.      

Basic Results of Gabor Frame on Local Fields

Basic facts for Gabor frame {Eu(m)bTu(n)ag}m,n∈p on local field are investigated. Accurately, that the canonical dual of frame {Eu(m)bTu(n)ag}m,n∈p also has the Gabor structure is showed; that the product ab decides whether it is possible for {Eu(m)bTu(n)ag}m,n∈p to be a frame for L2(K) is discussed; some necessary conditions and two sufficient conditions of Gabor frame for L2(K) are established. An example is finally given.     

On Lachlan’s major sub-degree problem

The Major Sub-degree Problem of A. H. Lachlan (first posed in 1967) has become a long-standing open question concerning the structure of the computably enumerable (c.e.) degrees. Its solution has important implications for Turing definability and for the ongoing programme of fully characterising the theory of the c.e. Turing degrees. A c.e. degree a is a major subdegree of a c.e. degree b > a if for any c.e. degree x, if and only if . In this paper, we show that every c.e. degree b ≠ 0 or 0′ has a major sub-degree, answering Lachlan’s question affirmatively. Both authors were funded by EPSRC Research Grant no. GR/M 91419, “Turing Definability”, by INTAS-RFBR Research Grant no. 97-0139, “Computability and Models”, and by an NSFC Grand International Joint Project Grant no. 60310213, “New Directions in Theory and Applications of Models of Computation”. Both authors are grateful to Andrew Lewis for helpful suggestions regarding presentation, technical aspects of the proof, and verification. A. Li is partially supported by National Distinguished Young Investigator Award no. 60325206 (People’s Republic of China).     

On the value distribution of <Emphasis Type="Italic">ƒ</Emphasis> + <Emphasis Type="Italic">a</Emphasis>(<Emphasis Type="Italic">ƒ</Emphasis>′)<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Let ƒ be a transcendental meromorphic function, a a nonzero finite complex number, and n ⩾ 2 a positive integer. Then ƒ + a(ƒ′) ⁿ assumes every complex value infinitely often. This answers a question of Ye for n = 2. A related normality criterion is also given. This work was supported by the National Natural Science Foundation of China (Grant No. 10771076), the Natural Science Foundation of Guangdong Province, China (Grant No. 07006700) and by the German-Israeli Foundation for Scientific Research and Development (Grant No. G-809-234.6/2003)     

Erdos-Ko-Rado Theorems of Labeled Sets

For k = (k1, ··· , kn) ∈ Nn, 1 ≤ k1 ≤···≤ kn, let Lkr be the family of labeled r-sets on k given by Lkr := {{(a1, la1), ··· , (ar, lar)} : {a1, ··· , ar} ■[n],lai ∈ [kai],i = 1, ··· , r}. A family A of labeled r-sets is intersecting if any two sets in A intersect. In this paper we give the sizes and structures of intersecting families of labeled r-sets.     

Normal Families and Uniqueness of Entire Functions and Their Derivatives

Let f be a nonconstant entire function; let k ≥ 2 be a positive integer; and let a be a nonzero complex number. If f（z） = a→f′（z） = a, and f′（z） = a →f^（k）（z） = a, then either f = Ce^λz ＋ a or f = Ce^λz ＋ a（λ - 1）/）λ, where C and ）, are nonzero constants with λ^k-1 = 1. The proof is based on the Wiman-Vlairon theory and the theory of normal families in an essential way.     

Chaos caused by a strong-mixing measure-preserving transformation

The chaos caused by a strong-mixing preserving transformation is discussed and it is shown that for a topological spaceX satisfying the second axiom of countability and for an outer measurem onX satisfying the conditions: (i) every non-empty open set ofX ism-measurable with positivem-measure; (ii) the restriction ofm on Borel σ-algebra ℬ(X) ofX is a probability measure, and (iii) for everyY⊂X there exists a Borel setB⊂ℬ(X) such thatB⊃Y andm(B) =m(Y), iff:X→X is a strong-mixing measure-preserving transformation of the probability space (X, ℬ(X),m), and if {m}, is a strictly increasing sequence of positive integers, then there exists a subsetC⊂X withm (C) = 1, finitely chaotic with respect to the sequence {m _i}, i.e. for any finite subsetA ofC and for any mapF:A→X there is a subsequencer _i such that lim_i→∞ f ^r i(a) =F(a) for anya ∈A. There are some applications to maps of one dimension. the National Natural Science Foundation of China.     

Bott Generator and Its Application to an Almost Complex Structure on $S^6$

The Bott generator of the homotopy group π2k-1U(∞) is used to construct an almost complex structure on S6, which is integrable except a small neighborhood.     

Properties of positive solutions to a nonlinear parabolic problem

This paper deals with the properties of positive solutions to a quasilinear parabolic equation with the nonlinear absorption and the boundary flux. The necessary and sufficient conditions on the global existence of solutions are described in terms of different parameters appearing in this problem. Moreover, by a result of Chasseign and Vazquez and the comparison principle, we deduce that the blow-up occurs only on the boundary (?)Ω. In addition, for a bounded Lipschitz domainΩ, we establish the blow-up rate estimates for the positive solution to this problem with a= 0.     

Improved confidence set estimators of a multivariate normal mean and generalizations

Summary LetX be the observed vector of thep-variate (p≧3) normal distribution with mean θ and covariance matrix equal to the identity matrix. Denotey ₊=max{0,y} for any real numbery. We consider the confidence set estimator of θ of the formC _δa,φ={θ:|θ−δ^a,φ(X)}≦c}, whereδ ^a,φ=[1−aφ({X})/{X}²]₊X is the positive part of the Baranchik (1970,Ann. Math. Statist.,41, 642–645) estimator. We provide conditions on ϕ(•) anda which guarantee thatC _δa.φ has higher coverage probability than the usual one, {θ:|θ−X|≦c}. This dominance result will be shown to hold for spherically symmetric distributions, which include the normal distribution,t-distribution and double exponential distribution. The latter result generalizes that of Hwang and Chen (1983,Technical Report, Dept. of Math., Cornell University).     

Acyclic edge colorings of planar graphs and seriesparallel graphs

A proper edge coloring of a graph G is called acyclic if there is no 2-colored cycle in G. The acyclic edge chromatic number of G, denoted by a′(G), is the least number of colors in an acyclic edge coloring of G. Alon et al. conjectured that a′(G) ⩽ Δ(G) + 2 for any graphs. For planar graphs G with girth g(G), we prove that a′(G) ⩽ max{2Δ(G) − 2, Δ(G) + 22} if g(G) ⩾ 3, a′(G) ⩽ Δ(G) + 2 if g(G) ⩾ 5, a′(G) ⩽ Δ(G) + 1 if g(G) ⩾ 7, and a′(G) = Δ(G) if g(G) ⩾ 16 and Δ(G) ⩾ 3. For series-parallel graphs G, we have a′(G) ⩽ Δ(G) + 1. This work was supported by National Natural Science Foundation of China (Grant No. 10871119) and Natural Science Foundation of Shandong Province (Grant No. Y2008A20).     

Fixed Points for Mean Non-expansive Mappings

For a Banach Space X Garcia-Falset introduced the coefficient R（X） and showed that if R（X） 〈 2 then X has a fixed point. In this paper, we define a mean non-expansive mapping T on X in the sense that ｜｜Tx - TY｜｜ ≤ a｜｜x - y｜｜ ＋ b｜｜x - Ty｜｜ for any x,y E X, where a,b ≥ 0, a ＋ b ≤ 1. We show that if R（X） 〈 1/1＋b then T has a fixed point in X.     

Universal minimal topological dynamical systems

Rokhlin (1963) showed that any aperiodic dynamical system with finite entropy admits a countable generating partition. Krieger (1970) showed that aperiodic ergodic systems with entropy < log a, admit a generating partition with no more than a sets. In Symbolic Dynamics terminology, these results can be phrased— ℕ^ℤ is a universal system in the category of aperiodic systems, and [a]^ℤ is a universal system for aperiodic ergodic systems with entropy < log a. Weiss ([We89], 1989) presented a Minimal system, on a Compact space (a subshift of ) which is universal for aperiodic systems. In this work we present a joint generalization of both results: given ɛ, there exists a minimal subshift of [a]^ℤ, universal for aperiodic ergodic systems with entropy < log a − ɛ.     

Branching in the {\Sigma^0_2} -enumeration degrees: a new perspective

We give an alternative and more informative proof that every incomplete -enumeration degree is the meet of two incomparable -degrees, which allows us to show the stronger result that for every incomplete -enumeration degree a, there exist enumeration degrees x ₁ and x ₂ such that a, x ₁, x ₂ are incomparable, and for all b  ≤  a, b  =  (b ∨ x ₁ ) ∧ (b ∨ x ₂ ). The first author would like to thank her advisor, Andrea Sorbi, whose guidance made this paper possible. The second author has been supported by a Marie Curie Incoming International Fellowship of the European Community FP6 Program under contract number MIFI-CT-2006-021702.     

Heavy-traffic analysis for the GI/G/1 queue with heavy-tailed distributions

We consider a GI/G/1 queue in which the service time distribution and/or the interarrival time distribution has a heavy tail, i.e., a tail behaviour like t ^−ν with 1 < ν ⩽ 2 , so that the mean is finite but the variance is infinite. We prove a heavy-traffic limit theorem for the distribution of the stationary actual waiting time W. If the tail of the service time distribution is heavier than that of the interarrival time distribution, and the traffic load a → 1, then W, multiplied by an appropriate ‘coefficient of contraction’ that is a function of a, converges in distribution to the Kovalenko distribution. If the tail of the interarrival time distribution is heavier than that of the service time distribution, and the traffic load a → 1, then W, multiplied by another appropriate ‘coefficient of contraction’ that is a function of a, converges in distribution to the negative exponential distribution. This revised version was published online in June 2006 with corrections to the Cover Date.     

Numerical semigroups: Apéry sets and Hilbert series

Let a ₁,…,a _n be relatively prime positive integers, and let S be the semigroup consisting of all non-negative integer linear combinations of a ₁,…,a _n . In this paper, we focus our attention on AA-semigroups, that is semigroups being generated by almost arithmetic progressions. After some general considerations, we give a characterization of the symmetric AA-semigroups. We also present an efficient method to determine an Apéry set and the Hilbert series of an AA-semigroup. Dedicated to the memory of Ernst S. Selmer (1920–2006), whose calculations revealed the “Selmer group”.     

Symmetric Positive Solutions for a Singular Second-Order Three-Point Boundary Value Problem

In this paper, we consider the following second order three-point boundary value problem u″（t）＋a（t）f（u（t））=0,0〈t〈1,u（0）-u（1）=0,u＇（0）-u＇（1）=u（1/2）,where a ： （0, 1） → [0, ∞） is symmetric on （0, 1） and may be singular at t = 0 and t = 1, f ： [0, ∞） → [O, ∞） is continuous. By using Krasnoselskii＇s fixed point theorem ia a cone, we get some existence results of positive solutions for the problem. The associated Green＇s function for the three-point boundary value problem is also given.