Minimum boundary touching tilings of polyominoes

We study the problem of tiling a polyomino P with as few squares as possible such that every square in the tiling has a non‐empty intersection with the boundary of P . Our main result is an algorithm which given a simply connected polyomino P computes such a tiling of P . We indicate how one can improve the running time of this algorithm for the more restricted row‐column‐convex polyominoes. Finally we show that a related decision problem is in NP for rectangular polyominoes. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Gray codes for column-convex polyominoes and a new class of distributive lattices

We introduce the problem of polyomino Gray codes, which is the listing of all members of certain classes of polyominoes such that successive polyominoes differ by some well-defined closeness condition (e.g., the movement of one cell). We discuss various closeness conditions and provide several Gray codes for the class of column-convex polyominoes with a fixed number of cells in each column. For one of our closeness conditions, a natural new class of distributive lattice arises: the partial order is defined on the set of m-tuples [S₁]×[S₂]××[S_m], where each S_i>1 and [S_i]={0,1,…,S_i−1}, and the cover relations are (p₁,p₂,…,p_m)(p₁+1,p₂,…,p_m) and (p₁,p₂,…,p_j,p_j+1,…,p_m)(p₁,p₂,…,p_j−1,p_j+1+1,…,p_m). We also discuss some properties of this lattice.     

A circle packing algorithm

A circle packing is a configuration P of circles realizing a specified pattern of tangencies. Radii of packings in the euclidean and hyperbolic planes may be computed using an iterative process suggested by William Thurston. We describe an efficient implementation, discuss its performance, and illustrate recent applications. A central role is played by new and subtle monotonicity results for “flowers” of circles.     

Computing integral solutions of complementarity problems

In this paper an algorithm is proposed to find an integral solution of (nonlinear) complementarity problems. The algorithm starts with a nonnegative integral point and generates a unique sequence of adjacent integral simplices of varying dimension. Conditions are stated under which the algorithm terminates with a simplex, one of whose vertices is an integral solution of the complementarity problem under consideration.     

Tensor Tomography: Progress and Challenges

The authors survey recent progress in the problem of recovering a tensor field from its integrals along geodesics. Several open problems are also proposed.     

The number of unit distances is almost linear for most norms

We prove that there exists a norm in the plane under which no n-point set determines more than unit distances. Actually, most norms have this property, in the sense that their complement is a meager set in the metric space of all norms (with the metric given by the Hausdorff distance of the unit balls).     

The indicator of contact boundaries for an integral geometry problem

We pose and study a rather particular integral geometry problem. In the two-dimensional space we consider all possible straight lines that cross some domain. The known data consist of the integrals over every line of this kind of an unknown piecewise smooth function that depends on both points of the domain and the variables characterizing the lines. The object we seek is the discontinuity curve of the integrand. This problem arose in the author’s previous research in X-ray tomography. In essence, it is a generalization of one mathematical aspect of flaw detection theory, but seems of interest in its own right. The main result of this article is the construction of a special function that can be unbounded only near the required curve. Precisely for this reason we call the function the indicator of contact boundaries. A uniqueness theorem for the solution follows rather easily from the property of indicators.     

Combinatorial modulus and type of graphs

Let A be the 1-skeleton of a triangulated topological annulus. We establish bounds on the combinatorial modulus of a refinement A^′, formed by attaching new vertices and edges to A, that depend only on the refinement and not on the structure of A itself. This immediately applies to showing that a disk triangulation graph may be refined without changing its combinatorial type, provided the refinement is not too wild. We also explore the type problem in terms of disk growth, proving a parabolicity condition based on a superlinear growth rate, which we also prove optimal. We prove our results with no degree restrictions in both the EEL and VEL settings and examine type problems for more general complexes and dual graphs.     

Monochromatic simplices of any volume

We give a very short proof of the following result of Graham from 1980: For any finite coloring of R^d, d≥2, and for any α>0, there is a monochromatic (d+1)-tuple that spans a simplex of volume α. Our proof also yields new estimates on the number A=A(r) defined as the minimum positive value A such that, in any r-coloring of the grid points Z² of the plane, there is a monochromatic triangle of area exactly A.     

On the Limit Set of Discrete Subgroups of PU(2,1)

Let G be a discrete subgroup of PU(2,1); G acts on preserving the unit ball , equipped with the Bergman metric. Let be the limit set of G in the sense of Chen–Greenberg, and let be the limit set of the G-action on in the sense of Kulkarni. We prove that L(G) = Λ(G) ∩ S ³ and Λ(G) is the union of all complex projective lines in which are tangent to S ³ at a point in L(G).     

Existence and uniqueness of solutions for third-order nonlinear boundary value problems

In this paper, we present some general results of existence and uniqueness of solutions of nonlinear two-point boundary value problems for third-order nonlinear differential equations by using the Shooting method. As applications we give certain concrete sufficient conditions for the existence and uniqueness.     

R~3中的一个Heilbronn型问题

本文给出Ｈｅｉｌｂｒｏｎｎ型问题的结果．设Ｓ是Ｒ~３中六点组成的集合．直径为Ｄ．若ｄ表示Ｓ中任意两点距离的最小值,则Ｄ≥２ｄ．等号当且仅当Ｓ是由正八面体的六个顶点或多面体面△×△１的六个顶点组成时才成立（△１,△２分别表示一维、二维正则单形,且其棱长相等）．     

Determination of Unknown Boundary in the Composite Materials with Stefan-Boltzmann Conditions

Abstract The authors consider one specific kind of heat transfer problems in a threedimensional layered domain, with nonlinear Stefan-Boltzmann conditions on the boundaries as well as on the interfaces. To determine the unknown part of the boundary （or corrosion） by the Cauchy data on the reachable part is an important inverse problem in engineering. The mathematical model of this problem is introduced, the well-posedness of the forward problems and the uniqueness of the inverse problems are obtained.     

Rate of convergence for the discrete-time approximation of reflected BSDEs arising in switching problems

In this paper, we prove new convergence results improving the ones by Chassagneux et al. (2012) for the discrete-time approximation of multidimensional obliquely reflected BSDEs. These BSDEs, arising in the study of switching problems, were considered by Hu and Tang (2010) and generalized by Hamadène and Zhang (2010) and Chassagneux et al. (2011). Our main result is a rate of convergence obtained in the Lipschitz setting and under the same structural conditions on the generator as the one required for the existence and uniqueness of a solution to the obliquely reflected BSDE.     

On a question of Gross

Using the notion of weighted sharing of sets we prove two uniqueness theorems which improve the results proved by Fang and Qiu [H. Qiu, M. Fang, A unicity theorem for meromorphic functions, Bull. Malaysian Math. Sci. Soc. 25 (2002) 31-38], Lahiri and Banerjee [I. Lahiri, A. Banerjee, Uniqueness of meromorphic functions with deficient poles, Kyungpook Math. J. 44 (2004) 575-584] and Yi and Lin [H.X. Yi, W.C. Lin, Uniqueness theorems concerning a question of Gross, Proc. Japan Acad. Ser. A 80 (2004) 136-140] and thus provide an answer to the question of Gross [F. Gross, Factorization of meromorphic functions and some open problems, in: Proc. Conf. Univ. Kentucky, Lexington, KY, 1976, in: Lecture Notes in Math., vol. 599, Springer, Berlin, 1977, pp. 51-69], under a weaker hypothesis.     

A note on maximally repeated sub-patterns of a point set

We answer a question raised by Brass on the number of maximally repeated sub-patterns in a set of n points in R^d. We show that this number, which was conjectured to be polynomial, is in fact Θ(2^n/2) in the worst case, regardless of the dimension d.     

On the number of disjoint convex quadrilaterals for a planar point set

For a given planar point set P, consider a partition of P into disjoint convex polygons. In this paper, we estimate the maximum number of convex quadrilaterals in all partitions.     

An identity for a quasilinear ODE and its applications to the uniqueness of solutions of BVPs

The following boundary value problem

(1.1)