Many Collinear k-Tuples with no k+1 Collinear Points

For every $k>3$ k > 3 , we give a construction of planar point sets with many collinear $k$ k -tuples and no collinear $(k+1)$ ( k + 1 ) -tuples. We show that there are $n_0=n_0(k)$ n 0 = n 0 ( k ) and $c=c(k)$ c = c ( k ) such that if $n\ge n_0$ n ≥ n 0 , then there exists a set of $n$ n points in the plane that does not contain $k+1$ k + 1 points on a line, but it contains at least $n^{2-({c}/{\sqrt{\log n}})}$ n 2 - ( c / log n ) collinear $k$ k -tuples of points. Thus, we significantly improve the previously best known lower bound for the largest number of collinear $k$ k -tuples in such a set, and get reasonably close to the trivial upper bound $O(n^2)$ O ( n 2 ) .     

Collinear Points in Permutations

Consider the following problem: how many collinear triples of points must a transversal of have? This question is connected with venerable issues in discrete geometry. We show that the answer, for n prime, is between (n − 1)/4 and (n − 1)/2, and consider an analogous question for collinear quadruples. We conjecture that the upper bound is the truth and suggest several other interesting problems in this area.Received August 29, 2004     

Enumerating Constrained Non-crossing Minimally Rigid Frameworks

In this paper we present an algorithm for enumerating without repetitions all the non-crossing generically minimally rigid bar-and-joint frameworks under edge constraints, which we call constrained non-crossing Laman frameworks, on a given set of n points in the plane. Our algorithm is based on the reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n ⁴) time and O(n) space, or, with a slightly different implementation, in O(n ³) time and O(n ²) space. In particular, we obtain that the set of all the constrained non-crossing Laman frameworks on a given point set is connected by flips which preserve the Laman property. D. Avis’s research was supported by NSERC and FQRNT grants. N. Katoh’s, M. Ohsaki’s and S.-i. Tanigawa’s research was supported by NEXT Grant-in-Aid for Scientific Research on priority areas of New Horizons in Computing. I. Streinu’s research was supported by NSF grant CCF-0430990 and NSF-DARPA CARGO CCR-0310661.     

各向异性材料中共线刚性线夹杂的纵向剪切问题

本文研究各向异性材料中共线刚性线夹杂，（有时称作“硬裂纹”或“反裂纹”问题）的纵向剪切问题。利用复变函数方法，提出了一般问题的公式和某些实际重要问题的封闭形式解，考察了刚性线端点附近的应力分布．从本文解答的特殊情形，可以直接导出各向同性材料相应问题的公式和结果，包括某些已有的结果￣［７］．     

Every Large Point Set contains Many Collinear Points or an Empty Pentagon

We prove the following generalised empty pentagon theorem for every integer ℓ ≥ 2, every sufficiently large set of points in the plane contains ℓ collinear points or an empty pentagon. As an application, we settle the next open case of the “big line or big clique” conjecture of Kára, Pór, and Wood [Discrete Comput. Geom. 34(3):497–506, 2005].     

A Two-Dimensional Bisection Envelope Algorithm for Fixed Points

In this paper we present a new algorithm for the two-dimensional fixed point problem f(x)=x on the domain [0, 1]×[0, 1], where f is a Lipschitz continuous function with respect to the infinity norm, with constant 1. The computed approximation x satisfies 6f(x)−x6_∞⩽ε for a specified tolerance ε<0.5. The upper bound on the number of required function evaluations is given by 2⌈log₂(1/ε)⌉+1. Similar bounds were derived for the case of the 2-norm by Z. Huang et al. (1999, J. Complexity15, 200–213), our bound is the first for the infinity norm case.     

Two-Dimensional Artin Groups with CAT(0) Dimension Three

We exhibit 3-generator Artin groups which have finite two-dimensional Eilenberg-Mac Lane spaces, but which do not act properly discontinuously by semi-simple isometries on a two-dimensional CAT(0) complex. We prove that infinitely many of these groups are the fundamental groups of compact, non-positively curved 3-complexes. These examples show that the geometric dimension of a CAT(0) group may be strictly less than its CAT(0) dimension.     

三点粗异宿环分支

本文研究高维系统连接三个鞍点的粗异宿环的分支问题.在一些横截性条件和非扭曲条件下,获得了Γ附近的1-异宿三点环, 1-异宿两点环、 1-同宿环和1-周期轨的存在性,唯一性和不共存性.同时给出了分支曲面和存在域.上述结果被进一步推广到连接l个鞍点的异宿环的情况,其中l≥2.     

Bifurcations of Rough Heteroclinic Loops with Three Saddle Points

In this paper, we study the bifurcation problems of rough heteroclinic loops connecting three saddle points for a higher-dimensional system. Under some transversal conditions and the nontwisted condition, the existence, uniqueness, and incoexistence of the 1-heteroclinic loop with three or two saddle points, 1-homoclinic orbit and 1-periodic orbit near Γ are obtained. Meanwhile, the bifurcation surfaces and existence regions are also given. Moreover, the above bifurcation results are extended to the case for heteroclinic loop with l saddle points. Received January 4, 2001, Accepted July 3, 2001.     

On Two-Dimensional Area-Preserving Maps with Homoclinic Tangencies that Have Infinitely Many Generic Elliptic Periodic Points

We study the semilocal dynamics of two-dimensional symplectic diffeomorphisms with homoclinic tangencies. Conditions for the existence of infinitely many generic elliptic periodic orbits of successive periods starting with some integer are found. Bibliography: 14 titles.__________Published in Zapiski Nauchnykh Seminarov POMI, Vol. 300, 2003, pp. 155–166.     

Reduction of the Two-Dimensional Thermoelasticity Problems for Solids with Corner Points to Key Integrodifferential Equations

Ukrainian Mathematical Journal - We propose a generalization of the method of direct integration of the original equations of two-dimensional problems of thermoelasticity for solids with corner...     

高维纵向数据群点的刚体结构检验方法

本文中, 我们提出一种检验高维纵向数据群点在运动中是否保持刚体结构的方法, 并给出高维群点变形系数的定义. 对群点刚体结构的检验, 可以把握群点运动的主要特征, 并便于对群点的未来运动趋势做总体预测. 通过仿真案例以及分析比较中国东部、西部城市群的经济发展过程中多元性的变化, 验证了方法的合理性和应用价值.     

一类具有三个转向点的大参数奇摄动问题(英文)

文中研究了一类具有三个转向点的大参数奇摄动方程的渐近解.首先利用Liouville-Green变换构造方程在不同区域的外部解.然后利用1/3阶和-1/3阶Bessel函数,分别构造出方程在三个转向点附近的内层解.最后利用匹配原理得到外部解和内层解中任意常数满足的匹配条件.     

The Steiner Mapping for Three Points in Euclidean Plane

For the Euclidean plane ? the Steiner mapping associating any three points a, b, c with their median s, and the corresponding operator P _D of metric projection of the space l ₁ ³ (?) onto its diagonal subspace D = {(x,x,x): x ∈ ?}, P _D (a,b,c) = (s,s,s): s are considered. The exact value of the linearity coefficient of P _D is calculated.     

An Optimal Size of a Rigid Thin Stiffener Reinforcing an Elastic Two-Dimensional Body on the Outer Edge

The equilibrium problem for a two-dimensional body with a crack is studied. We suppose that the body consists of two parts: an elastic part and a rigid thin stiffener on the outer edge of the body. Inequality-type boundary conditions are prescribed at the crack faces providing a non-penetration between the crack faces. For a family of variational problems, dependence of their solutions on the length of the thin rigid stiffener is investigated. It is shown that there exists a solution of an optimal control problem. For this problem, the cost functional is defined by a continuous functional on a solution space, while the length parameter serves as a control parameter.     

Restricted Point Configurations with Many Collinear {k}-Tuplets

   Abstract. Given k≥ 3 , denote by t' _k (N) the largest integer for which there is a set of N points in the plane, no k+1 of them on a line such that there are t' _k (N) lines, each containing exactly k of the points. Erdos (1962) raised the problem of estimating the order of magnitude of t' _k (N) . We prove that