Klein polyhedra for three extremal cubic forms

Davenport and Swinnerton-Dyer found the first 19 extremal ternary cubic forms g _i, which have the same meaning as the well-known Markov forms in the binary quadratic case. Bryuno and Parusnikov recently computed the Klein polyhedra for the forms g ₁ – g ₄. They also computed the convergents for various matrix generalizations of the continued fractions algorithm for multiple root vectors and studied their position with respect to the Klein polyhedra. In the present paper, we compute the Klein polyhedra for the forms g ₅, – g ₇ and the adjoint form g ₇ ^* . Their periods and fundamental domains are found and the expansions of the multiple root vectors of these forms by means of the matrix algorithms due to Euler, Jacobi, Poincaré, Brun, Parusnikov, and Bryuno, are computed. The position of the convergents of the continued fractions with respect to the Klein polyhedron is used as a measure of quality of the algorithms. Eulers and Poincarés algorithms proved to be the worst ones from this point of view, and the Bryuno one is the best. However, none of the algorithms generalizes all the properties of continued fractions.Translated from Matematicheskie Zametki, vol. 77, no. 4, 2005, pp. 566–583.Original Russian Text Copyright © 2005 by V. I. Parusnikov.This revised version was published online in April 2005 with a corrected issue number.     

Two-point Padé approximants for formal Stieltjes series

We prove that certain two-point Padé approximants occupying the diagonal of the Padé table form monotone sequences of lower and upper bounds uniformly converging to a Stieltjes function. The results can be applied to the theory of inhomogeneous media for the calculation of the bounds on the effective transport coefficients of heterogeneous materials.     

A Characterization of Graphs without Even Factors

In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived. This paper was accomplished while the second author was visiting the Center for Combinatorics, Nankai University. The research is supported by NSFC     

矩阵连分式序列的收敛性

本文研究了矩阵连分式的性质，获得了关于矩阵连分式序列收敛性的一些结果．     

On the Approximation of Irrationals by Rationals

Let ξ be a real irrational number, and a ≧ 0, b ≧ 0, s > 1 be integers. A theorem of S. UCHIYAMA states that there are infinitely many pairs of integers u and v ≠ 0 such that OVBARξ?u/vOVBAR ≤ s²/4v² and u ? a, v ? b mod s, provided that it is not a ? 6 ? 0 mod s. It is shown that this result is best-possible for all integers s > 1.     

Stieltjes-Newton型有理插值

Stieltjes型分叉连分式在有理插值问题中有着重要的地位，它通过定义反差商和混合反差商构造给定结点上的二元有理函数，我们将Stieltjes型分叉连分式与二元多项式结合起来，构造Stieltje- Newton型有理插值函数，通过定义差商和混合反差商，建立递推算法，构造的Stieltjes-Newton型有理插值函数满足有理插值问题中所给的插值条件，并给出了插值的特征定理及其证明，最后给出的数值例子，验证了所给算法的有效性．     

On Tori Triangulations Associated with Two-Dimensional Continued Fractions of Cubic Irrationalities

The notion of equivalence of multidimensional continued fractions is introduced. We consider some properties and state some conjectures related to the structure of the family of equivalence classes of two-dimensional periodic continued fractions. Our approach to the study of the family of equivalence classes of two-dimensional periodic continued fractions leads to revealing special subfamilies of continued fractions for which the triangulations of the torus (i.e., the combinatorics of their fundamental domains) are subjected to clear rules. Some of these subfamilies are studied in detail; the way to construct other similar subfamilies is indicated.     

Quadruple systems of the projective special linear group PSL(2,q), q ≡ 1 (mod 4)

We determine the distribution of quadruple systems among the orbits of 4‐element subsets under the action of PSL(2,q) on the projective line when q ≡ 1 (mod 4). © 2003 Wiley Periodicals, Inc. J Combin Designs 11: 339–351, 2003; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/jcd.10043     

Generating Birth and Death Processes

Associated with an ordered sequence of an even number 2N of positive real numbers is a birth and death process (BDP) on {0, 1, 2,…, N} having these real numbers as its birth and death rates. We generate another birth and death process from this BDP on {0, 1, 2,…, 2N}. This can be further iterated. We illustrate with an example from tan(kz). In BDP, the decay parameter, viz., the largest non-zero eigenvalue is important in the study of convergence to stationarity. In this article, the smallest eigenvalue is found to be useful.