On Selecting k Balls from an n-line or n-circle without t-separations

ＯｎＳｅｌｅｃｔｉｎｇｋＢａｌｌｓｆｒｏｍａｎｎ－ｌｉｎｅｏｒｎ－ｃｉｒｃｌｅｗｉｔｈｏｕｔｔ－ｓｅｐａｒａｔｉｏｎｓ￥（蒋茂森）ＪｉａｎｇＭａｏｓｅｎ（ＤｅｐａｒｔｍｅｎｔｏｆＭａｔｈｅｍａｔｉｃｓ,ＪｉｌｉｎＵｎｉｖｅｒｓｉｔｙ,Ｃｈａｎｇｃｈｕ...     

基于一个抽球模型的组合恒等式及组合解释

本文研究了抽球概率模型的问题.利用概率方法,获得了关于第一类Stirling数和广义可重复二项式系数的无限求和形式的组合恒等式以及有关组合解释,推广了Stirling数和二项式系数的无限求和结果.     

Analogs of Essential Singularities for Sequences of Polynomial Mappings

For a sequence of polynomial self-mappings of and a given ball in , we state conditions guaranteeing that the union of images of any larger concentric ball is everywhere dense. Under slightly more severe conditions, one can use a sequence of concentric balls (one for each mapping) with radii tending to zero. The common center of these balls is, in a sense, an essential singularity of the sequence of mappings.     

Local times of homogeneous isotropic random fields of x-square type

We consider local times with respect to balls v(r) Rⁿ of homogeneous isotropic random fields of x-square type with strong dependence. We study the limit of the local times as r .Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 42, No. 10, pp. 1412–1415, October, 1990.     

Isospectral potentials and conformally equivalent isospectral metrics on spheres,balls and Lie groups

We construct pairs of conformally equivalent isospectral Riemannian metrics ?1g and ?2g on spheres Sⁿ and balls Bⁿ⁺¹ for certain dimensions n, the smallest of which is n=7, and on certain compact simple Lie groups. In the case of Lie groups, the metric g is left-invariant. In the case of spheres and balls, the metric g not the standard metric but may be chosen arbitrarily close to the standard one. For the same manifolds (M, g) we also show that the functions ?₁ and ?₂ are isospectral potentials for the Schrödinger operator ?₂\gD + \gf. To our knowledge, these are the first examples of isospectral potentials and of isospectral conformally equivalent metrics on simply connected closed manifolds.     

Improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set

We will establish the following improved Krasnosel'skii theorems for the dimension of the kernel of a starshaped set: For each k and d, 0 k d, define f(d,k) = d+1 if k = 0 and f(d,k) = max{d+1,2d–2k+2} if 1 k d.Theorem 1. Let S be a compact, connected, locally starshaped set in R^d, S not convex. Then for a k with 0 k d, dim ker S k if and only if every f(d, k) lnc points of S are clearly visible from a common k-dimensional subset of S.Theorem 2. Let S be a nonempty compact set in R^d. Then for a k with 0 k d, dim ker S k if and only if every f (d, k) boundary points of S are clearly visible from a common k-dimensional subset of S. In each case, the number f(d, k) is best possible for every d and k.     

Attractive Periodic Orbits in Nonlinear Discrete-time Neural Networks with Delayed Feedback

We consider the discrete-time system x ( n )= g x ( n m 1)+ f ( y ( n m k )), y ( n )= g y ( n m 1)+ f ( x ( n m k )), n ] N describing the dynamic interaction of two identical neurons, where g ] (0,1) is the internal decay rate, f is the signal transmission function and k is the signal transmission delay. We construct explicitly an attractive 2 k -periodic orbit in the case where f is a step function (McCulloch-Pitts Model). For the general nonlinear signal transmission functions, we use a perturbation argument and sharp estimates and apply the contractive map principle to obtain the existence and attractivity of a 2 k -periodic orbit. This is contrast to the continuous case (a delay differential system) where no stable periodic orbit can occur due to the monotonicity of the associated semiflow.     

Concretely Locally Presentable and Locally Generated Categories

We give concrete versions of the characterizations of locally -presentable (resp. -generated) categories as categories of models of (resp. weakly) -ary limit-theories and of (resp. weakly) -ary essentially algebraic theories. By concrete we mean that starting with a category of -structures, the theories obtained are extensions of the original ones, and the equivalences of categories are concrete isomorphisms. -presentable and -generated objects are also investigated from this viewpoint.     

Line Transversals to Disjoint Balls

We prove that the set of directions of lines intersecting three disjoint balls in ℝ³ in a given order is a strictly convex subset of . We then generalize this result to n disjoint balls in ℝ ^d . As a consequence, we can improve upon several old and new results on line transversals to disjoint balls in arbitrary dimension, such as bounds on the number of connected components and Helly-type theorems.     

Quasiclassical asymptotic behavior of the scattering cross section for asymptotically homogeneous potentials

One considers the total scattering cross section on the potential gV(x), x^m, m3, for large values of the coupling constant g and of the wave number k. One assumes that V(x)(x/|1x|)|x|^–, 2>m+1, as ¦x¦. It is shown that for gk^–1 , g^3–ak^2(a–2) the scattering cross section is equal asymptotically to _a(gk^–1), x=(m–1)(–1)^–1. Here the coefficient _a is determined only by the function and the number . Under the additional conditions >0, V>0, the indicated asymptotic behavior holds in the large domain gk^–1 , gk^a–z c(gk^–1), >0.Translated from Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta im. V. A. Steklova AN SSSR, Vol. 152, pp. 105–136, 1986.     

Optimal pairs of incomparable clouds in multisets

We consider the partially ordered set ([k] ⁿ, ), which is defined asn-th product of the chain [k] = {0, 1, 2,...,k – 1}, and study pairs (A, B) of incomparable setsA, B [k] ⁿ, that is,a b, a b for alla A, b B or (in short notation) A BWe are concerned with the growth of the functionsf _n: {0, 1,...,k ⁿ} {0, 1,...,k ⁿ},n , defined byf _n() = max {|B|: A, B [k] ⁿ with|A| = and A B} and a characterisation of pairs (A, B), which assume this bound.In the previously studied casek = 2 our results are considerably sharper than earlier results by Seymour, Hilton, Ahlswede and Zhang.     

Existence of compatible families of proper regular conditional probabilities

Summary Let (, , ) be a perfect probability space with countably generated, and let IB be a family of sub--fields of . Under a countability condition on the family IB, I show that there exists a family {}_IB of regular conditional probabilities which are everywhere compatible. Under a more stringent condition on IB, I show that the can furthermore be chosen to be everywhere proper. It follows that in the Dobrushin-Lanford-Ruelle formulation of the statistical mechanics of classical lattice systems, every (perfect) probability measure is a Gibbs measure for some specification.Research supported in part by NSF PHY-78-23952NSF Predoctoral Fellow (1976–79) and Danforth Fellow (1979–81).     

On the existence of wave operators for the Klein-Gordon equation

The problem of existence of wave operators for the Klein-Gordon equation ( _t ² –+²+iV_1t+V₂)u(x,t)=0 (x R ⁿ,t R, n3, >0) is studied where V₁ and V₂ are symmetric operators in L₂(R ⁿ) and it is shown that conditions similar to those of Veseli-Weidmann (Journal Functional Analysis 17, 61–77 (1974)) for a different class of operators are also sufficient for the Klein-Gordon equation.     

Minimax filtration of linear transformations of stationary sequences

We will consider the problem of determining a linear, mean-square optimal estimate of the transformation of a stationary random sequence (k) with density f() from observations of the sequence (k) + n(k) withk0, where (k) is a stationary sequence not correlated with (k) with density g(). The least favorable spectral densities and minimax (robust) spectral characteristics of an optimal estimate A for different classes of densities are found.Translated from Ukrainskii Matematicheskii Zhurnal, Vol. 43, No. 1, pp. 92–99, January, 1991.     

Formulae and Recursions for the Joint Distribution of Success Runs of Several Lengths

Consider a sequence of n independent Bernoulli trials with the j-th trial having probability pj of success, 1 j n. Let M(n,K) and N(n, K) denote, respectively, the r-dimensional random variables (M(n, k1),..., M(n,kr) and (N(n,k1), ..., N(n, kr)), where K = (k1, k2, ..., kr) and M(n, s) [N(n, s)] represents the number of overlapping [non-overlapping] success runs of length s. We obtain exact formulae and recursions for the probability distributions of M(n, K) and N(n, K). The techniques of proof employed include the inclusion-exclusion principle and generating function methodology. Our results have potential applications to statistical tests for randomness.     

A lower bound on packing density

Summary If ⁿ is a bounded, convex body which is symmetric through each of the coordinate hyperplanes, then there exist codes which give rise, via Construction A of Leech and Sloane, to lattice-packings of whose density satisfies the logarithmic Minkowski-Hlawka bound, lim . This follows as a corollary of our main result, Theorem 9, a general way of obtaining lower bounds on the lattice-packing densities of various bodies. Unfortunately, whenn is at all large, it is computationally prohibitive (although theoretically possible) to exhibit the arrangements explicitly.Preprints were entitled On Hilbert's eighteenth problem: Packing.The final drafts of this paper were written with the support of the Seggie-Brown Research Fellowship, for which the author is grateful.     

代數拓撲學中(μ,△,γ)-系統的正則同模論Ⅰ

<正> 設K與L為拓撲空間,又設f:K→L為連續映像.由f導出了準同模對應f~n:H~n(L,G)→H~n(K,G),n=1,2,…,其中H~n(L,G),H~n(K,G)表示上同調羣,而G表示係數環或域以γ_p~n(K)或者     

关于图中子图的（n,k）—正交因子分解

设G是一个具有顶点集V(G)和边集E(G)的图. 设g和f是定义在V(G)上的两个整数值函数,使得g(x)f(x)对所有的点x∈V(G)都成立.如果G是一个(mg+n,mf-n)-图,1n<m2k,且g(x)2k-1对所有的点x∈V(G)都成立,则对任意给定具有|E(H)|=nk边的G的子图H,存在G的一个子图G′使G′有一个(g,f)-因子分解(n,k)-正交H.     

Patterns and Structures in Disk Packings

Using a computational procedure that imitates tightening of an assembly of billiard balls, we have generated a number of packings of n equal and non-equal disks in regions of various shapes. Our experiments are of three major types. In the first type, the values of n are in thousands, the initial disk configuration is random and a priori one expects the generated packings to be random. In fact, the packings turn out to display non-random geometric patterns and regular features, including polycrystalline textures with "rattlers" typically trapped along the grain boundaries. An experiment of the second type begins with a known or conjectured optimal disk packing configuration, which is then "frustrated" by a small perturbation such as variation of the boundary shape or a relative increase of the size of a selected disk with respect to the sizes of the other disks. We present such frustrated packings for both large n (~ 10, 000) and small n (~ 50 to 200). Motivated by applications in material science and physics, the first and second type of experiments are performed for boundary shapes rarely discussed in the literature on dense packings: torus, a strip cut from a cylinder, a regular hexagon with periodic boundaries. Experiments of the third type involve the shapes popular among mathematicians: circles, squares, and equilateral triangles the boundaries of which are hard reflecting walls. The values of n in these experiments vary from several tens to few hundreds. Here the obtained configurations could be considered as candidates for the densest packings, rather than random ones. Some of these conjecturally optimal packings look regular and the regularity often extends across different values of n. Specifically, as n takes on an increasing sequence of values, n = n(1), n(2), ...n(k), ..., the packings follow a well-defined pattern. This phenomenon is especially striking for packings in equilateral triangles, where (as far as we can tell from our finite computational experiments), not only are there an infinite number of different patterns, each with its own different sequence n(1), n(2), ...n(k), ..., but many of these sequences seem to continue indefinitely. For other shapes, notably squares and circles, the patterns either cease to be optimal or even cease to exist (as packings of non-overlapping disks) above some threshold value n(k0) (depending on the pattern). In these cases, we try to identify the values of n(k0).