Covering Squares with Squares

For 0<x<1 denote by f(x) the length of the side of the largest open square Q that can be covered by the sequence {Q _n } ^∈ fty _n=0 of closed squares, where Q _n has side of length x ⁿ , and is placed so that its sides are parallel to those of Q. We obtain some information concerning f(x) and discuss some related questions. Received February 23, 1999, and in revised form October 13, 1999.     

Difference Covering Arrays and Pseudo-Orthogonal Latin Squares

A pair of Latin squares, A and B, of order n, is said to be pseudo-orthogonal if each symbol in A is paired with every symbol in B precisely once, except for one symbol with which it is paired twice and one symbol with which it is not paired at all. A set of t Latin squares, of order n, are said to be mutually pseudo-orthogonal if they are pairwise pseudo-orthogonal. A special class of pseudo-orthogonal Latin squares are the mutually nearly orthogonal Latin squares (MNOLS) first discussed in 2002, with general constructions given in 2007. In this paper we develop row complete MNOLS from difference covering arrays. We will use this connection to settle the spectrum question for sets of 3 mutually pseudo-orthogonal Latin squares of even order, for all but the order 146.     

Division Algebras that Ramify only on a Plane Quartic Curve with Simply Connected Components

A central division algebra over the field of rational functions in two variables with coefficients over an algebraically closed field ramifies along a divisor on P ². If the ramification divisor of is a quartic curve which is the union of simply connected curves, we show that is a symbol algebra and satisfies the index equals exponent equation.     

生长曲线模型的惩罚最小二乘估计

主要考虑了生长曲线模型中的参数矩阵的估计.首先基于Potthoff-Roy变换后的生长曲线模型,采用不同的惩罚函数:Hard Thresholding函数,LASSO,ENET,改进LASSO,SACD给出了参数矩阵的惩罚最小二乘估计.接着对不做变换的生长曲线模型,直接定义其惩罚最小二乘估计,基于Nelder-Mead法给出了估计的数值解算法.最后对提出的参数估计方法进行了数据模拟.结果表明自适应LASSO在估计方面效果比较好.     

Packing Disks on a Torus

We determine the densest packing of two congruent disks on a torus. The maximal density varies depending on the ratio of the disk radius to the length of a closed geodesic on the torus.     

Fractal Interpolation on a Torus

A very general method of fractal interpolation on T ¹ is proposed in the first place. The approach includes the classical cases using trigonometric functions, periodic splines, etc. but, at the same time, adds a diversity of fractal elements which may be more appropriate to model the complexity of some variables. Upper bounds of the committed error are provided. The arguments avoid the use of derivatives in order to handle a wider framework. The Lebesgue constant of the associated partition plays a key role. The procedure is proved convergent for the interpolation of specific functions with respect to some nodal bases. In a second part, the approximation is then extended to bidimensional tori via tensor product of interpolation spaces. Some sufficient conditions for the convergence of the process in the Fourier case are deduced.      

Covering a graph with cycles

Let k and n be two integers such that k ≥ 0 and n ≥ 3(k + 1). Let G be a graph of order n with minimum degree at least ?(n + k)/2?. Then G contains k + 1 independent cycles covering all the vertices of G such that k of them are triangles. © 1995, John Wiley & Sons, Inc.     

Radon Transform on the Torus

We consider the Radon transform on the (flat) torus \mathbbTⁿ = \mathbbRⁿ/\mathbbZⁿ{\mathbb{T}^{n} = \mathbb{R}^{n}/\mathbb{Z}^n} defined by integrating a function over all closed geodesics. We prove an inversion formula for this transform and we give a characterization of the image of the space of smooth functions on \mathbbTⁿ{\mathbb{T}^{n}} .     

Covering the Plane with Translates of a Triangle

The minimum density of a covering of the plane with translates of a triangle is frac32frac{3}{2} .     

Covering shadows with a smaller volume

For n?2 a construction is given for convex bodies K and L in Rn such that the orthogonal projection Lu onto the subspace u^⊥ contains a translate of Ku for every direction u, while the volumes of K and L satisfy Vn(K)>Vn(L).A more general construction is then given for n-dimensional convex bodies K and L such that each orthogonal projection Lξ onto a k-dimensional subspace ξ contains a translate of Kξ, while the mth intrinsic volumes of K and L satisfy Vm(K)>Vm(L) for all m>k.For each k=1,…,n, we then define the collection Cn,k to be the closure (under the Hausdorff topology) of all Blaschke combinations of suitably defined cylinder sets (prisms).It is subsequently shown that, if L∈Cn,k, and if the orthogonal projection Lξ contains a translate of Kξ for every k-dimensional subspace ξ of Rn, then Vn(K)?Vn(L).The families Cn,k, called k-cylinder bodies of Rn, form a strictly increasing chain

Cn,1⊂Cn,2⊂?⊂Cn,n−1⊂Cn,n,     

Connected matroids with a small circumference

Lemos and Oxley proved that if M is a connected matroid with |E(M)|⩾3r(M), then M has a circuit C such that M⧹C is connected. In this paper, we shall improve this result proving that for a simple and connected matroid M, if r(M)⩾7 and |E(M)|⩾3r(M)−3, then M has a circuit C such that M⧹C is connected. To prove this result, we shall construct all the connected matroids having circumference at most five, with the exception of those which are 3-connected and have rank five.     

Expansive Endomorphisms on the Infinite-Dimensional Torus

Functional Analysis and Its Applications - A natural class of expansive endomorphisms $$Gin C^1$$ of the infinite-dimensional torus $$mathbb{T}^{infty}$$ (the Cartesian product of countably many...     

Torus Actions on Rings

We study torus actions on non-commutative rings, focusing on upper bounds on the dimensions of tori for which faithful actions are possible. We give sharp bounds for actions on algebras of generic matrices and their trace rings.     

The Covering Radius of a Mapping and the Multiplicity of a Covering

Siberian Mathematical Journal -     

On the Lieb-Thirring Constant on the Torus

Mathematical Notes -     

Covering the plane with copies of a convex disk

We prove that for every convex disk in the plane there exists a double-lattice covering of the plane with copies of with density ≤ 1.2281772 . This improves the best previously known upper bound ≤ 8/(3+2\sqrt{3}) 1.2376043 , due to Kuperberg, but it is still far from the conjectured value . <lsiheader> <onlinepub>7 August, 1998 <editor>Editors-in-Chief: &lsilt;a href=../edboard.html#chiefs&lsigt;Jacob E. Goodman, Richard Pollack&lsilt;/a&lsigt; <pdfname>20n2p251.pdf <pdfexist>yes <htmlexist>no <htmlfexist>no <texexist>no <sectionname> </lsiheader> Received June 1, 1996, and in revised form January 24, 1997.