On hypersurfaces with two distinct principal curvatures in a unit sphere

We investigate the immersed hypersurfaces in a unit sphere . By using Otsuki's idea, we obtain the local and global classification results for immersed hypersurfaces in of constant m-th mean curvature and two distinct principal curvatures of multiplicities n−1,1 (in the local version, we assume that the principal curvatures are non-zero when m2). As the result, we prove that any local hypersurface in of constant mean curvature and two distinct principal curvatures is an open part of a complete hypersurface of the same curvature properties. The corresponding result does not hold for m-th mean curvature when m2.     

Rotational hypersurfaces of periodic mean curvature

In this paper we discuss rotational hypersurfaces in and more specifically rotational hypersurfaces with periodic mean curvature function. We show that, for a given real analytic function H(s) on , every rotational hypersurface M in with mean curvature H(s) can be extended infinitely in the sense that all coordinate functions of the generating curve of M are defined on all of as well. For rotational hypersurfaces with periodic mean curvature we present a criterion characterizing the periodicity of such hypersurfaces in terms of their mean curvature function. We also discuss a method to produce families of periodic rotational hypersurfaces where each member of the family has the same mean curvature function. In fact, given any closed planar curve with curvature κ, we prove that there is a family of periodic rotational hypersurfaces such that the mean curvature of each element of the family is explicitly determined by κ. Delaunay's famous result for surfaces of revolution with constant mean curvature is included here as the case where n=3 and κ is constant.     

Biharmonic hypersurfaces in Sasakian space forms

We consider the Boothby–Wang fibration of a strictly regular Sasakian space form N and find the characterization of biharmonic Hopf cylinders over submanifolds of . Then, we determine all proper-biharmonic Hopf cylinders over homogeneous real hypersurfaces in complex projective spaces.     

The simplicity of certain groups of subanalytic diffeomorphisms

Let M be a connected real analytic manifold. We denote by , 1r<∞, the group of subanalytic C^r diffeomorphisms of M which are isotopic to the identity via a compactly supported subanalytic C^r isotopy. We show that satisfies Epstein's axioms. This implies that the commutator subgroup of is simple. Moreover, we show that the commutator subgroup of is dense in . As a corollary we obtain that is topologically simple.     

Poincaré's theorem for the modular group of real Riemann surfaces

Let Mod_g denote the modular group of (closed and orientable) surfaces S of genus g. Each element [h]Mod_g induces a symplectic automorphism H([h]) of . Poincaré showed that is an epimorphism. A real Riemann surface is a Riemann surface S together with an anticonformal involution σ. Let (S,σ) be a real Riemann surface, be the group of orientation preserving homeomorphisms of S such that h○σ=σ○h and be the subgroup of consisting of those isotopic to the identity by an isotopy in . The group plays the role of the modular group in the theory of real Riemann surfaces. In this work we describe the image by H of . Such image depends on the topological type of the involution σ.     

Projective change between two classes of -metrics

In this paper, we find equations to characterize projective change between (α,β)-metric and Randers metric on a manifold with dimension n3, where α and are two Riemannian metrics, β and are two nonzero one forms. Moreover, we consider this projective change when F has some special curvature properties.     

Regularity results for the gradient of solutions of a class of linear elliptic systems with data

We prove that if a vector-function f belongs to the Morrey space , with , n≥3, N≥2, λ]0,n−2], and u is the solution of the system

then Du belongs to the space , for any , provided the matrix of bounded measurable coefficients (A_ij) has sufficiently small dispersion of the eigenvalues.     

On a class of degenerate and singular elliptic systems in bounded domains

This paper deals with the nonexistence and multiplicity of nonnegative, nontrivial solutions to a class of degenerate and singular elliptic systems of the form

where Ω is a bounded domain with smooth boundary ∂Ω in , N2, and , , h_i (i=1,2) are allowed to have “essential” zeroes at some points in Ω, (F_u,F_v)=F, and λ is a positive parameter. Our proofs rely essentially on the critical point theory tools combined with a variant of the Caffarelli–Kohn–Nirenberg inequality in [P. Caldiroli, R. Musina, On a variational degenerate elliptic problem, NoDEA Nonlinear Differential Equations Appl. 7 (2000) 189–199].     

Upper bounds on the bisection width of 3- and 4-regular graphs

We derive new upper bounds on the bisection width of graphs which have a regular vertex degree. We show that the bisection width of sufficiently large 3-regular graphs with |V| vertices is at most , ε>0. For the bisection width of sufficiently large 4-regular graphs we show an upper bound of , ε>0.     

Ratio and relative asymptotics of polynomials orthogonal with respect to varying Denisov-type measures

Let μ be a finite positive Borel measure with compact support consisting of an interval plus a set of isolated points in , such that μ^′>0 almost everywhere on [c,d]. Let , be a sequence of polynomials, , with real coefficients whose zeros lie outside the smallest interval containing the support of μ. We prove ratio and relative asymptotics of sequences of orthogonal polynomials with respect to varying measures of the form dμ/w_2n. In particular, we obtain an analogue for varying measures of Denisov's extension of Rakhmanov's theorem on ratio asymptotics. These results on varying measures are applied to obtain ratio asymptotics for orthogonal polynomials with respect to fixed measures on the unit circle and for multi-orthogonal polynomials in which the measures involved are of the type described above.     

Simultaneous similarity and triangularization of sets of 2 by 2 matrices

Let be a finite or infinite sequence of 2×2 matrices with entries in an integral domain. We show that, except in a very special case, is (simultaneously) triangularizable if and only if all pairs (A_j,A_k) are triangularizable, for 1j,k∞. We also provide a simple numerical criterion for triangularization.Using constructive methods in invariant theory, we define a map (with the minimal number of invariants) that distinguishes simultaneous similarity classes for non-commutative sequences over a field of characteristic ≠2. We also describe canonical forms for sequences of 2×2 matrices over algebraically closed fields, and give a method for finding sequences with a given set of invariants.     

(Semi-)Riemannian geometry of (para-)octonionic projective planes

We use reduced homogeneous coordinates to construct and study the (semi-)Riemannian geometry of the octonionic (or Cayley) projective plane , the octonionic projective plane of indefinite signature , the para-octonionic (or split octonionic) projective plane and the hyperbolic dual of the octonionic projective plane . We also show that our manifolds are isometric to the (para-)octonionic projective planes defined classically by quotients of Lie groups.     

Iterated function systems on multifunctions and inverse problems

In this paper, we first consider the problem of defining IFS operators on the space of non-empty compact and convex subsets of . After defining a complete metric on , we construct an IFS operator and show some properties. A notable feature is the definition of a type of weak inner product on . We then define a family of complete metrics on the space of all measurable set-valued functions (with values in ), and extend the weak inner product to this space. Following this, we construct IFS operators on these spaces. We close with a brief discussion of the inverse problem of approximating an arbitrary multifunction by the attractor of an IFS.     

Properties of multilevel block -circulants

In a previous paper we characterized unilevel block α-circulants , , 0mn-1, in terms of the discrete Fourier transform of , defined by . We showed that most theoretical and computational problems concerning A can be conveniently studied in terms of corresponding problems concerning the Fourier coefficients F₀,F₁,…,F_n-1 individually. In this paper we show that analogous results hold for (k+1)-level matrices, where the first k levels have block circulant structure and the entries at the (k+1)-st level are unstructured rectangular matrices.     

About the geometry of almost para-quaternionic manifolds

We provide a general criterion for the integrability of the almost para-quaternionic structure of an almost para-quaternionic manifold of dimension 4m8 in terms of the integrability of two or three sections of the defining rank three vector bundle . We relate it with the integrability of the canonical almost complex structure of the twistor space and with the integrability of the canonical almost para-complex structure of the reflector space of . We deduce that has plenty of locally defined, compatible, complex and para-complex structures, provided that is integrable.     

Two new modified Gauss–Seidel methods for linear system with -matrices

In 2002, H. Kotakemori et al. proposed the modified Gauss–Seidel (MGS) method for solving the linear system with the preconditioner [H. Kotakemori, K. Harada, M. Morimoto, H. Niki, A comparison theorem for the iterative method with the preconditioner () J. Comput. Appl. Math. 145 (2002) 373–378]. Since this preconditioner is constructed by only the largest element on each row of the upper triangular part of the coefficient matrix, the preconditioning effect is not observed on the nth row. In the present paper, to deal with this drawback, we propose two new preconditioners. The convergence and comparison theorems of the modified Gauss–Seidel methods with these two preconditioners for solving the linear system are established. The convergence rates of the new proposed preconditioned methods are compared. In addition, numerical experiments are used to show the effectiveness of the new MGS methods.     

Plancherel–Polya-type inequalities for entire functions of exponential type in

The goal of the paper is to prove generalizations of the classical Plancherel–Polya inequalities in which point-wise sampling of functions (δ-distributions) is replaced by more general compactly supported distributions on . As an application it is shown that a function , 1p∞, which is an entire function of exponential type is uniquely determined by a set of numbers {Ψ_j(f)}, , where {Ψ_j}, , is a countable sequence of compactly supported distributions. In the case p=2 a reconstruction method of a Paley–Wiener function f from a sequence of samples {Ψ_j(f)}, , is given. This method is a generalization of the classical result of Duffin–Schaeffer about exponential frames on intervals.     

Broadcasting algorithms in radio networks with unknown topology

In this paper we present new randomized and deterministic algorithms for the classical problem of broadcasting in radio networks with unknown topology. We consider directed n-node radio networks with specified eccentricity D (maximum distance from the source node to any other node). Bar-Yehuda et al. presented an algorithm that for any n-node radio network with eccentricity D completes the broadcasting in time, with high probability. This result is almost optimal, since as it has been shown by Kushilevitz and Mansour and Alon et al., every randomized algorithm requires Ω(Dlog(n/D)+log²n) expected time to complete broadcasting.Our first main result closes the gap between the lower and upper bound: we describe an optimal randomized broadcasting algorithm whose running time complexity is , with high probability. In particular, we obtain a randomized algorithm that completes broadcasting in any n-node radio network in time , with high probability.The main source of our improvement is a better “selecting sequence” used by the algorithm that brings some stronger property and improves the broadcasting time. Two types of “selecting sequences” are considered: randomized and deterministic ones. The algorithm with a randomized sequence is easier (more intuitive) to analyze but both randomized and deterministic sequences give algorithms of the same asymptotic complexity.Next, we demonstrate how to apply our approach to deterministic broadcasting, and describe a deterministic oblivious algorithm that completes broadcasting in time , which improves upon best known algorithms in this case. The fastest previously known algorithm had the broadcasting time of , it was non-oblivious and significantly more complicated; our algorithm can be seen as a natural extension of our randomized algorithm. In this part of the paper we assume that each node knows the eccentricity D.Finally, we show how our randomized broadcasting algorithm can be used to improve the randomized complexity of the gossiping problem.     

Detecting induced subgraphs

An s-graph is a graph with two kinds of edges: subdivisible edges and real edges. A realisation of an s-graph B is any graph obtained by subdividing subdivisible edges of B into paths of arbitrary length (at least one). Given an s-graph B, we study the decision problem Π_B whose instance is a graph G and question is “Does G contain a realisation of B as an induced subgraph?”. For several B’s, the complexity of Π_B is known and here we give the complexity for several more.Our NP-completeness proofs for Π_B’s rely on the NP-completeness proof of the following problem. Let be a set of graphs and d be an integer. Let be the problem whose instance is (G,x,y) where G is a graph whose maximum degree is at most d, with no induced subgraph in and x,yV(G) are two non-adjacent vertices of degree 2. The question is “Does G contain an induced cycle passing through x,y?”. Among several results, we prove that is NP-complete. We give a simple criterion on a connected graph H to decide whether is polynomial or NP-complete. The polynomial cases rely on the algorithm three-in-a-tree, due to Chudnovsky and Seymour.