Composite Integers n for Which φ（n）｜n- 1

In this note, we show that the number of composite integers n ≤ x such that φ（n）｜n - 1 is at most O（x^1/2（loglog x）^1/2）, thus improving earlier results by Pomerance and by Shan.     

Proof of the Double Bubble Conjecture in <Emphasis Type="Bold">R</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

The least-area hypersurface enclosing and separating two given volumes in R ⁿ is the standard double bubble.      

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)     

Littlewood–Paley theorem on spaces <Emphasis Type="Italic">L</Emphasis><Superscript><Emphasis Type="Italic">p</Emphasis>(<Emphasis Type="Italic">t</Emphasis>)</Superscript>(ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>)

We point out that if the Hardy–Littlewood maximal operator is bounded on the space L ^p(t)(ℝ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ, then the well-known characterization of the spaces L ^p (ℝ), 1 < p < ∞, by the Littlewood–Paley theory extends to the space L ^p(t)(ℝ). We show that, for n > 1 , the Littlewood–Paley operator is bounded on L ^p(t) (ℝ ⁿ ), 1 < a ≤ p(t) ≤ b < ∞, t ∈ ℝ ⁿ , if and only if p(t) = const. Published in Ukrains’kyi Matematychnyi Zhurnal, Vol. 60, No. 12, pp. 1709–1715, December, 2008.     

Frame Wavelets with Compact Supports for L^2（R^n）

The construction of frame wavelets with compact supports is a meaningful problem in wavelet analysis. In particular, it is a hard work to construct the frame wavelets with explicit analytic forms. For a given n × n real expansive matrix A, the frame-sets with respect to A are a family of sets in R^n. Based on the frame-sets, a class of high-dimensional frame wavelets with analytic forms are constructed, which can be non-bandlimited, or even compactly supported. As an application, the construction is illustrated by several examples, in which some new frame wavelets with compact supports are constructed. Moreover, since the main result of this paper is about general dilation matrices, in the examples we present a family of frame wavelets associated with some non-integer dilation matrices that is meaningful in computational geometry.     

Consecutive customer losses in regular and oscillating <Emphasis Type="Italic">M</Emphasis><Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">G</Emphasis>/1/<Emphasis Type="Italic">n</Emphasis> systems

We derive fast recursions to compute the probability that k or more consecutive customer losses take place during a busy period of a queue, the so called k-CCL probability, for regular and oscillating M ^X /G/1/n systems.     

关于非牛顿流体衰减性的一个注记

In the study of long time asymptotic behaviors of the solutions to a class system of the incompressible non-Newtonian fluid flows in R3, it is proved that the weak solutions decay in L2 norm at (1+t) and the error of difference between non-Newtonian fluid and linear equation is also investigated. The findings are mainly based on the classic Fourier splitting methods.     

New construction of special Lagrangian submanifolds in <Emphasis Type="Italic">T</Emphasis>*R<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript> equipped with the standard metric

A class of twisted special Lagrangian submanifolds in T＊R^n and a kind of austere submanifold from conormal bundle of minimal surface of R^3 are constructed.     

<Emphasis Type="Italic">m</Emphasis> Components-admissible solutions of systems of higher-order partial differential equations on <Emphasis Type="Italic">C</Emphasis><Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

Using value distribution theory and techniques in several complex variables,we investigate the problem of existence of m components-admissible solutions of a class of systems of higher-order partial differential equations in several complex variables and estimate the number of admissible components of solutions.Some related results will also be obtained.     

Relative mean curvature configurations for surfaces in ℝ<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>, <Emphasis Type="Italic">n</Emphasis> ≥ 5

We define the relative mean curvature directions on surfaces immersed in ℝⁿ, n ≥ 4, generalizing the concept of mean curvature directions for surfaces in 4-space studied by Mello. We obtain their differential equations and study their corresponding generic configurations. *Work partially supported by DGCYT grant no. MTM2004-03244 and Unimontes-BR. †Work partially supported by DGCYT grant no. MTM2004-03244. ‡Work partially supported by DGCYT grant no. BFM2003-0203.     

The relative isoperimetric inequality outside convex domains in R<Superscript><Emphasis Type="Italic">n</Emphasis></Superscript>

We prove that the area of a hypersurface Σ which traps a given volume outside a convex domain C in Euclidean space R ⁿ is bigger than or equal to the area of a hemisphere which traps the same volume on one side of a hyperplane. Further, when C has smooth boundary ∂C, we show that equality holds if and only if Σ is a hemisphere which meets ∂C orthogonally.     

Analysis of GI<Superscript><Emphasis Type="Italic">X</Emphasis></Superscript>/<Emphasis Type="Italic">M</Emphasis>(<Emphasis Type="Italic">n</Emphasis>)//<Emphasis Type="Italic">N</Emphasis> systems with stochastic customer acceptance policy

We investigate GI ^X /M(n)//N systems with stochastic customer acceptance policy, function of the customer batch size and the number of customers in the system at its arrival. We address the time-dependent and long-run analysis of the number of customers in the system at prearrivals and postarrivals of batches and seen by customers at their arrival to the system, as well as customer blocking probabilities. These results are then used to derive the continuous-time long-run distribution of the number of customers in the system. Our analysis combines Markov chain embedding with uniformization and uses stochastic ordering as a way to bound the errors of the computed performance measures.      

SOME NEW PROPERTIES ON L^p（Ω, H^n）

Let L^p（Ω, H^n） indicate the L^P-space of the maps for Heisenberg group target. In this paper some new properties are obtained for the space L^p（Ω, H^n）     

An <Emphasis Type="Italic">M</Emphasis><Superscript>[<Emphasis Type="Italic">X</Emphasis>]</Superscript>/<Emphasis Type="Italic">G</Emphasis>/1 retrial queue with server breakdowns and constant rate of repeated attempts

We consider an M ^[X]/G/1 retrial queue subject to breakdowns where the retrial time is exponential and independent of the number of customers applying for service. If a coming batch of customers finds the server idle, one of the arriving customers begins his service immediately and the rest joins a retrial group (called orbit) to repeat his request later; otherwise, if the server is busy or down, all customers of the coming batch enter the orbit. It is assumed that the server has a constant failure rate and arbitrary repair time distribution. We study the ergodicity of the embedded Markov chain, its stationary distribution and the joint distribution of the server state and the orbit size in steady-state. The orbit and system size distributions are obtained as well as some performance measures of the system. The stochastic decomposition property and the asymptotic behavior under high rate of retrials are discussed. We also analyse some reliability problems, the k-busy period and the ordinary busy period of our retrial queue. Besides, we give a recursive scheme to compute the distribution of the number of served customers during the k-busy period and the ordinary busy period. The effects of several parameters on the system are analysed numerically. I. Atencia’s and Moreno’s research is supported by the MEC through the project MTM2005-01248.     

3-Selmer groups for curves <Emphasis Type="Italic">y</Emphasis><Superscript>2</Superscript> = <Emphasis Type="Italic">x</Emphasis><Superscript>3</Superscript> + <Emphasis Type="Italic">a</Emphasis>

We explicitly perform some steps of a 3-descent algorithm for the curves y ² = x ³ + a, a a nonzero integer. In general this will enable us to bound the order of the 3-Selmer group of such curves.