On the structure of finite coverings of compact connected groups

Finite-sheeted covering mappings onto compact connected groups are studied. We show that for a covering mapping from a connected Hausdorff topological space onto a compact (in general, non-abelian) group there exists a topological group structure on the covering space such that the mapping becomes a homomorphism of groups. To prove this fact we construct an inverse system of covering mappings onto Lie groups which approximates the given covering mapping. As an application, it is shown that a covering mapping onto a compact connected abelian group G must be a homeomorphism provided that the character group of G admits division by degree of the mapping. We also get a criterion for triviality of coverings in terms of means and prove that each finite covering of G is equivalent to a polynomial covering.     

Euler configurations and quasi-polynomial systems

Consider the problem of three point vortices (also called Helmholtz’ vortices) on a plane, with arbitrarily given vorticities. The interaction between vortices is proportional to 1/r, where r is the distance between two vortices. The problem has 2 equilateral and at most 3 collinear normalized relative equilibria. This 3 is the optimal upper bound. Our main result is that the above standard statements remain unchanged if we consider an interaction proportional to r ^b, for any b < 0. For 0 < b < 1, the optimal upper bound becomes 5. For positive vorticities and any b < 1, there are exactly 3 collinear normalized relative equilibria. The case b = −2 of this last statement is the well-known theorem due to Euler: in the Newtonian 3-body problem, for any choice of the 3 masses, there are 3 Euler configurations (also known as the 3 Euler points). These small upper bounds strengthen the belief of Kushnirenko and Khovanskii [18]: real varieties defined by simple systems should have a simple topology. We indicate some hard conjectures about the configurations of relative equilibrium and suggest they could be attacked within the quasi-polynomial framework.     

Infima and complements in the lattice of quasi-uniformities

We show that the infimum of any family of proximally symmetric quasi-uniformities is proximally symmetric, while the supremum of two proximally symmetric quasi-uniformities need not be proximally symmetric. On the other hand, the supremum of any family of transitive quasi-uniformities is transitive, while there are transitive quasi-uniformities whose infimum with their conjugate quasi-uniformity is not transitive. Moreover we present two examples that show that neither the supremum topology nor the infimum topology of two transitive topologies need be transitive. Finally, we prove that several operations one can perform on and between quasi-uniformities preserve the property of having a complement.     

Prospective and retrospective analyses under logistic regression models

In logistic case-control studies, Prentice and Pyke (Biometrika 66 (1979) 403-411) showed that valid point estimators of the odds-ratio parameters and their standard errors may be obtained by fitting the prospective logistic regression model to case-control data. Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) generalized Prentice and Pyke's (Biometrika 66 (1979) 403-411) results to robust logistic case-control studies. In this paper, we extend the results of Prentice and Pyke (Biometrika 66 (1979) 403-411) and Wang and Carroll (Biometrika 80 (1993) 237-241; J. Statist. Plann. Inference 43 (1995) 331-340) to a class of statistics and a class of unbiased estimating equations. We present some results on simulation and on the analysis of two real datasets.     

A Note on Log-Convexity of q-Catalan Numbers

The q-Catalan numbers studied by Carlitz and Riordan are polynomials in q with nonnegative coefficients. They evaluate, at q = 1, to the Catalan numbers: 1, 1, 2, 5, 14,…, a log-convex sequence. We use a combinatorial interpretation of these polynomials to prove a q-log-convexity result. The sequence of q-Catalan numbers is not q-log-convex in the narrow sense used by other authors, so our work suggests a more flexible definition of q-log convex be adopted. Received January 2, 2007     

Coalgebraic representations of distributive lattices with operators

We present a framework for extending Stone's representation theorem for distributive lattices to representation theorems for distributive lattices with operators. We proceed by introducing the definition of algebraic theory of operators over distributive lattices. Each such theory induces a functor on the category of distributive lattices such that its algebras are exactly the distributive lattices with operators in the original theory. We characterize the topological counterpart of these algebras in terms of suitable coalgebras on spectral spaces. We work out some of these coalgebraic representations, including a new representation theorem for distributive lattices with monotone operators.     

Periodic solutions for a Lotka–Volterra mutualism system with several delays

In the present paper, a Lotka–Volterra type mutualism system with several delays is studied. Some new and interesting sufficient conditions are obtained for the global existence of positive periodic solutions of the mutualism system. Our method is based on Mawhin’s coincidence degree and novel estimation techniques for the a priori bounds of unknown solutions. Our results are different from the existing ones such as those in of Yang et al. [F. Yang, D. Jiang, A. Ying, Existence of positive solution of multidelays facultative mutualism system, J. Eng. Math. 3 (2002) 64–68] and Chen et al. [F. Chen, J. Shi, X. Chen, Periodicity in a Lotka–Volterra facultative mutualism system with several delays, J. Eng. Math. 21 (3) (2004) 403–409].     

Multiple harmonic series related to multiple Euler numbers

In this paper, we define the multiple Euler numbers and consider some multiple harmonic series of Mordell-Tornheim's type, which is a partial sum of the Mordell-Tornheim zeta series defined by Matsumoto. Indeed, we prove a certain reducibility of these series as well as the multiple zeta values.     

Laplacians and the Cheeger Inequality for Directed Graphs

We consider Laplacians for directed graphs and examine their eigenvalues. We introduce a notion of a circulation in a directed graph and its connection with the Rayleigh quotient. We then define a Cheeger constant and establish the Cheeger inequality for directed graphs. These relations can be used to deal with various problems that often arise in the study of non-reversible Markov chains including bounding the rate of convergence and deriving comparison theorems.Received September 8, 2004