On the genericity of chaos

Let M be a compact manifold with dimM?2. We prove that some iteration of the generic homeomorphism on M is semiconjugated to the shift map and has infinite topological entropy (Theorem 1.1).     

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     

Separable subgroups of mapping class groups

We investigate separability questions for the mapping class group of a surface. While this group is not subgroup separable in general, we prove a large family of interesting subgroups are separable. This includes many classically studied subgroups such as solvable subgroups, Heegaard and Handlebody groups, geometric subgroups, and all the terms in the Johnson filtration.     

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.     

The solvable radical of Sylow factorizable groups

Let G be a finite group. A complete Sylow product of G is a product of Sylow subgroups of G, one for each prime divisor of |G|. We shall call G a Sylow factorizable group if it is equal to at least one of its complete Sylow products. We prove that if G is a Sylow factorizable group then the intersection of all complete Sylow products of G is equal to the solvable radical of G. We generalize the concepts and the result to Sylow products which involve an arbitrary subset of the prime divisors of |G|. Received: 26 January 2005     

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     

Bi12TiO20纳米粉体的制备及其光吸收特性研究

以钛酸四丁酯和硝酸铋为原料 ,利用化学溶液分解法制备了Bi12 TiO2 0 纳米多晶粉体 .采用XRD和TEM对其结构和形貌进行了表征 .结合热重 差热 (TG DTA)分析 ,探讨了Bi12 TiO2 0 晶相的形成机理 .通过UV Vis漫反射谱的测定 ,研究了Bi12 TiO2 0 纳米晶粉体的光吸收特性 .结果显示 ,从组成为化学计量比的前驱液中可以很容易制得纯Bi12 TiO2 0 纳米晶粉体 ,该Bi12 TiO2 0 纳米晶粉体呈现了在很宽的波长范围内 (5 6 0～ 385nm )对光的吸收的特性 .     

Ihara zeta functions of digraphs

After defining and exploring some of the properties of Ihara zeta functions of digraphs, we improve upon Kotani and Sunada’s bounds on the poles of Ihara zeta functions of undirected graphs by considering digraphs whose adjacency matrices are directed edge matrices.