Fibrations of bigroupoids

Using Brown's construction (J. Algebra 15 (1970) 103) of an exact 6-term sequence for a fibration of groupoids we show how an exact 9-term sequence can be associated to a fibration of bigroupoids. Applications to topology and algebra are given.     

In situ neutron diffraction study (300-1273 K) of non-stoichiometric strontium ferrite SrFeOx

The high-temperature cubic phase of non-stoichiometric strontium ferrite SrFeO_x (2.5≤x≤3.0) has been studied by in situ neutron powder diffraction in air over the temperature range 300-1273 K. The composition of SrFeO_x changes within the range 2.56≤x≤2.81 from 1273 to 673 K, respectively.Rietveld refinements of the diffraction patterns show that the high-temperature cubic phase of SrFeO_x is consistent with a face-centred Fm3c structure. This structure leads to agreement with previous density measurements. This cell allows the high-temperature structure of SrFeO_x to be described in terms of a solid solution of the composition end members. Cubic SrFeO_x at high temperature is found to closely obey Vegard's law. The density of cubic SrFeO_x is also found to exhibit a linear relationship with composition.     

Asymptotique de la norme $L^2$ d'un cycle géodésique dans les revêtements de congruence d'une variété hyperbolique arithmétique

Let M be an arithmetic hyperbolic manifold and be a codimension 1 geodesic cycle. In this paper, we study the asymptotic growth of the -norm of the lifts of F in the congruence tower above M. We obtain an explicit value for the growth rate of this norm. In particular, we provide a new proof of a celebrated result of Millson [Mi] on the homology of the arithmetic hyperbolic manifolds. The method is quite general and gives a new way of getting non zero homology classes in certain locally symmetric spaces. Received: 20 April 2001; in final form: 26 September 2001 / Published online: 28 February 2002     

Simultaneous Packing and Covering in the Euclidean Plane

 In this article we study the simultaneous packing and covering constants of two-dimensional centrally symmetric convex domains. Besides an identity result between translative case and lattice case and a general upper bound, exact values for some special domains are determined. Similar to Mahler and Reinhardt’s result about packing densities, we show that the simultaneous packing and covering constant of an octagon is larger than that of a circle. (Received 17 January 2001; in revised form 13 July 2001)     

Nonexistence Results of Minimal Immersions

Let M be a Riemannian m-dimensional manifold with m ≥ 3, endowed with non zero parallel p-form. We prove that there is no minimal isometric immersions of M in a Riemannian manifold N with constant strictly negative sectional curvature. Next we show that, under the conform flatness of the manifold N and some assumptions on the Ricci curvature of N, there is no α-pluriharmonic isometric immersion.     

Defect operators, defect functions and defect indices for analytic submodules

This paper mainly concerns defect operators and defect functions of Hardy submodules, Bergman submodules over the unit ball, and Hardy submodules over the polydisk. The defect operator (function) carries key information about operator theory (function theory) and structure of analytic submodules. The problem when a submodule has finite defect is attacked for both Hardy submodules and Bergman submodules. Our interest will be in submodules generated by polynomials. The reason for choosing such submodules is to understand the interaction of operator theory, function theory and algebraic geometry.     

Unavoidable Traces Of Set Systems

Sauer, Shelah, Vapnik and Chervonenkis proved that if a set system on n vertices contains many sets, then the set system has full trace on a large set. Although the restriction on the size of the groundset cannot be lifted, Frankl and Pach found a trace structure that is guaranteed to occur in uniform set systems even if we do not bound the size of the groundset. In this note we shall give three sequences of structures such that every set system consisting of sufficiently many sets contains at least one of these structures with many sets.     

On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance

The graph-theoretic operation of rooted subtree prune and regraft is increasingly being used as a tool for understanding and modelling reticulation events in evolutionary biology. In this paper, we show that computing the rooted subtree prune and regraft distance between two rooted binary phylogenetic trees on the same label set is NP-hard. This resolves a longstanding open problem. Furthermore, we show that this distance is fixed parameter tractable when parameterised by the distance between the two trees.Received March 16, 2004