Identifying several biased coins encountered by a hidden random walk

Suppose that attached to each site z ∈ ? is a coin with bias θ(z), and only finitely many of these coins have nonzero bias. Allow a simple random walker to generate observations by tossing, at each move, the coin attached to its current position. Then we can determine the biases {θ(z)}_z∈?, using only the outcomes of these coin tosses and no information about the path of the random walker, up to a shift and reflection of ?. This generalizes a result of Harris and Keane. © 2004 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Romanovski polynomials in selected physics problems

We briefly review the five possible real polynomial solutions of hypergeometric differential equations. Three of them are the well known classical orthogonal polynomials, but the other two are different with respect to their orthogonality properties. We then focus on the family of polynomials which exhibits a finite orthogonality. This family, to be referred to as the Romanovski polynomials, is required in exact solutions of several physics problems ranging from quantum mechanics and quark physics to random matrix theory. It appears timely to draw attention to it by the present study. Our survey also includes several new observations on the orthogonality properties of the Romanovski polynomials and new developments from their Rodrigues formula.     

Conditional expectation of integrands and random sets

The conditional expectation of integrands and random sets is the main tool of stochastic optimization. This work wishes to make up for the lack of real synthesis about this subject. We improve the existing hypothesis and simplify the corresponding proofs. In the convex case we especially study the problem of the exchange of conditional expectation and subdifferential operators.     

强色指数的一个新的上界

给出了图的强色指数的一个新的上界，并指出几类恰好达到该上界的图，从而改进了Erodoes和Nesetri的强色指数猜想，在某种意义上证明了这个猜想。     

Algebras of Random Operators Associated to Delone Dynamical Systems

We carry out a careful study of operator algebras associated with Delone dynamical systems. A von Neumann algebra is defined using noncommutative integration theory. Features of these algebras and the operators they contain are discussed. We restrict our attention to a certain C ^*-subalgebra to discuss a Shubin trace formula.     

Fully-angular polyhex chains with minimal total π-electron energy

By Hückel molecular orbital (HMO) theory, the calculation of the total energy of all π-electrons in conjugated hydrocarbons can be reduced to that of E(G)=|λ₁|+|λ₂|+?+|λn|, where λi are the eigenvalues of the corresponding graph G. Denote by Ψn the set of all fully-angular polyhex chains with n hexagons. In this paper, we show that Hn has the minimum total π-electron energy among chains in Ψn, where Hn is the helicene chain.     

Diameter graphs of polygons and the proof of a conjecture of Graham

We show that for an n-gon with unit diameter to have maximum area, its diameter graph must contain a cycle, and we derive an isodiametric theorem for such n-gons in terms of the length of the cycle. We then apply this theorem to prove Graham's 1975 conjecture that the diameter graph of a maximal 2m-gon (m?3) must be a cycle of length 2m−1 with one additional edge attached to it.     

A multifractal decomposition according to rate of returns

For one‐dimensional simple symmetric random walk, the Hausdorff and packing dimensions of sets of sample paths with prescribed rate of returns to the origin are determined. This gives a multifractal decomposition of the underlying sample space. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

最大度为6的极大外平面图的完备色数

证明了最大度为６的极大外平面图的完备色数为７。     

关于“信息熵”分析及其应用的研究

本文用Ｓｈａｎｎｏｎ熵函数的观点及最大离散熵原理，探讨了对随机试验项目的优选问题：即压缩某种“不确定性”试验项目的实施与探索．并通过应用实例的计算，获得了满意的聚类效果．这种方法对于信息资料的数据处理及压缩“不确定性“验项目具有普遍意义．