关于一类特殊梯形的等面积三角形划分

1970年 Monsky证明了正方形不能划分为奇数个面积相等的三角形 .Stein等人对梯形的等面积三角形划分作了深入的研究 ,得到了大量结果 .本文就未解决的问题作了进一步的讨论 ,即讨论一类特殊梯形的等面积三角形划分问题 .     

四边形的等积三角剖分

1970年Monsky证明了著名的Richman猜想: 正方形不能剖分成奇数个面积相等的三角形。近年来Stein等人研究一类特殊类型的四边形的等积三角剖分问题，获得了许多重要结果。该文进一步研究四边形等积三角剖分的待解决问题。      

Equidissections of centrally symmetric octagons

Summary In 1970 Monsky proved that a square cannot be cut into an odd number of triangles of equal areas. In 1988 Kasimatis proved that if a regularn-gon,n 5, is cut intom triangles of equal areas, thenm is a multiple ofn. These two results imply that a centrally symmetric regular polygon cannot be cut into an odd number of triangles of equal areas. We conjecture that the conclusion holds even if the restriction regular is deleted from the hypothesis and prove that it does forn = 6 andn = 8.     

A Generalized Conjecture about Cutting a Polygon into Triangles of Equal Areas

In 1970 it was proved that a square cannot be cut into an odd number of triangles of equal areas. In 1990 it was proved that any centrally symmetric polygon has that property. In the present paper we propose a broad generalization, which would also imply that any polygon whose edges are parallel to the x - or y -axes has that property. We prove that the generalization holds for polygons with at most six sides. Received November 24, 1999, and in revised form January 28, 2000.     

Dissections of regular polygons into triangles of equal areas

This paper answers the question, “If a regular polygon withn sides is dissected intom triangles of equal areas, mustm be a multiple ofn?” Forn=3 the answer is “no,” since a triangle can be cut into any positive integral number of triangles of equal areas. Forn=4 the answer is again “no,” since a square can be cut into two triangles of equal areas. However, Monsky showed that a square cannot be dissected into an odd number of triangles of equal areas. We show that ifn is at least 5, then the answer is “yes.” Our approach incorporates the techniques of Thomas, Monsky, and Mead, in particular, the use of Sperner's lemma and non-Archimedean valuations, but also makes use of affine transformations to distort a given regular polygon into one to which those techniques apply.     

Tilings of the plane with unit area triangles of bounded diameter

There exist tilings of the plane with pairwise noncongruent triangles of equal area and bounded perimeter. Analogously, there exist tilings with triangles of equal perimeter, the areas of which are bounded from below by a positive constant. This solves a problem of Nandakumar.     

More on cutting a polygon into triangles of equal areas

In 2000 a general conjecture was proposed:a special polygon cannot be cut into an odd number of triangles of equal areas. It has been proved that the conjecture holds for polygons with at most six sides. In this paper we prove the existence of specialn-polygon for any integern>6 and discuss the conjecture for special polygons with seven sides.     

Properties of triangulations obtained by the longest-edge bisection

The Longest-Edge (LE) bisection of a triangle is obtained by joining the midpoint of its longest edge with the opposite vertex. Here two properties of the longest-edge bisection scheme for triangles are proved. For any triangle, the number of distinct triangles (up to similarity) generated by longest-edge bisection is finite. In addition, if LE-bisection is iteratively applied to an initial triangle, then minimum angle of the resulting triangles is greater or equal than a half of the minimum angle of the initial angle. The novelty of the proofs is the use of an hyperbolic metric in a shape space for triangles.     

Dissection of a Triangle into Similar Triangles

We prove that the number of non-similar triangles T which can be dissected into two, three or five similar non-right triangles is equal to zero, one and nine, respectively. We find all these triangles. Moreover, every triangle can be dissected into n similar triangles whenever n = 4 or n ≥ 6. In the last section we allow dissections into right-triangles but we add another restriction. We prove that in any perfect, prime and simplicial dissection into at least three tiles, the tiles must have one of only three possible shapes.     

Convergence of a multigrid cascadic algorithm for second-order finite elements in a domain with smooth boundary

A cascadic multigrid algorithm is substantiated for a grid problem obtained by discretization of a second-order elliptic equation with second-order finite elements on triangles. The efficiency of the algorithm is proved. In particular, it is shown that the number of arithmetic operations required to achieve the order of accuracy of an approximate solution equal to that of the discretization error depends linearly on the number of unknowns. The rate of convergence is found to be higher than one for linear finite elements despite achieving a higher order of accuracy.     

Triangulation refinement by using edge subdivision

It is proved that any triangulation of a flat polygonal region can be refined by using repeated subdivisions of an edge so that: (1) the maximum diameter of the triangles would be less than any pre-assigned positive number, and (2) the minimum interior angle of the triangles of the triangulation obtained would be not less than the minimum interior angle of the triangles of the original triangulation divided by 9. The required triangulation refinement is constructed in two steps: first, the triangulation is refined so that the triangles of the triangulation obtained can be combined into pairs, and only boundary triangles may be left unpaired; at this step each triangle is split into at most 4 parts. Then the triangulation obtained is refined once again in order that the diameter of each triangle be less then a prescribed ?. At each of the steps, the minimum interior angle of triangles is reduced by at most 3 times. This is guaranteed by the lemma saying that the interior angles of the triangles into which the original triangle is divided by a median are at least as great as one-third of the minimum interior angle of the original triangle.     

Auslander-Reiten theory over topological spaces

Auslander-Reiten triangles and quivers are introduced into algebraic topology. It is proved that the existence of Auslander-Reiten triangles characterizes Poincaré duality spaces, and that the Auslander-Reiten quiver is a weak homotopy invariant. The theory is applied to spheres whose Auslander-Reiten triangles and quivers are computed. The Auslander-Reiten quiver over the $d$-dimensional sphere turns out to consist of $d-1$ copies of ${\mathbb Z} A_{\infty}$. Hence the quiver is a sufficiently sensitive invariant to tell spheres of different dimension apart.     

Incongruent equipartitions of the plane

R. Nandakumar asked whether there is a tiling of the plane by pairwise incongruent triangles of equal area and equal perimeter. Recently a negative answer was given by Kupavskii, Pach and Tardos. Still one may ask for weaker versions of the problem, or for the analogue of this problem for quadrangles, pentagons, or hexagons. Several answers were given by the first author in a previous paper. Here we solve three further cases. In particular, our main result shows that there are vertex-to-vertex tilings by pairwise incongruent triangles of unit area and bounded perimeter.     

图的结合数猜想的新结果

［１］中Ｗｏｏｄａｌ猜想：若图Ｇ的结合数ｂｉｎｄ（Ｇ）≥３２,则图Ｇ包含三角形,本文证明：若ｂｉｎｄ（Ｇ）≥７＋√６９１０,则图Ｇ包含三角形,从而进一步改进了［２］的结果     

Ein Satz über Dreieckswinkel und seine Beziehung zu einer Ungleichung von O. Perron

In [4] Perron gave three inequalities for triangles of the classical hyperbolic plane. In this note these and the analogous inequalities for triangles of the classical elliptic plane are proved in a simple and unified manner.     

Bivariate interpolating polynomials and splines (I)

The multivariate splines which were first presented by de Boor as a complete theoretical system have intrigued many mathematicians who have devoted many works in this field which is still in the process of development. The author of this paper is interested in the area of interpolation with special emphasis on the interpolation methods and their approximation orders. But such B-splines (both univariate and multivariate) do not interpolated directly, so I approached this problem in another way which is to extend my interpolating spline of degree 2n-1 in univariate case (See[7]) to multivariate case. I selected triangulated region which is inspired by other mathematician’s works (e.g. [2] and [3]) and extend the interpolating polynomials from univariate to m-variate case (See [10])In this paper some results in the case m=2 are discussed and proved in more concrete details. Based on these polynomials, the interpolating splines (it is defined by me as piecewise polynomials in which the unknown partial derivatives are determined under certain continuous conditions) are also discussed. The approximation orders of interpolating polynomials and of cubic interpolating splines are inverstigated. We limited our discussion on the rectangular domain which is partitioned into equal right triangles. As to the case in which the rectangular domain is partitioned into unequal right triangles as well as the case of more complicated domains, we will discuss in the next paper.     

A sufficient condition on 3-colorable plane graphs without 5- and 6-circuits

In 2003, Borodin and Raspaud proved that if G is a plane graph without 5-circuits and without triangles of distance less than four, then G is 3-colorable. In this paper, we prove that if G is a plane graph without 5- and 6-circuits and without triangles of distance less than 2, then G is 3-colorable.     

Acute triangulations of trapezoids

In this paper we discuss acute triangulations of trapezoids. It is known that every rectangle can be triangulated into eight acute triangles, and that this is best possible. In this paper we prove that all other trapezoids can be triangulated into at most seven acute triangles.     

Asymptotic properties of some triangulations of the sphere

In this paper we analyse a method for triangulating the sphere originally proposed by Baumgardner and Frederickson in 1985. The method is essentially a refinement procedure for arbitrary spherical triangles that fit into a hemisphere. Refinement is carried out by dividing each triangle into four by introducing the midpoints of the edges as new vertices and connecting them in the usual ‘red’ way. We show that this process can be described by a sequence of piecewise smooth mappings from a reference triangle onto the spherical triangle. We then prove that the whole sequence of mappings is uniformly bi-Lipschitz and converges uniformly to a non-smooth parameterization of the spherical triangle, recovering the Baumgardner and Frederickson spherical barycentric coordinates. We also prove that the sequence of triangulations is quasi-uniform, that is, areas of triangles and lengths of the edges are roughly the same at each refinement level. Some numerical experiments confirm the theoretical results.     

Each maximal planar graph with exactly two separating triangles is Hamiltonian

A classical result of Whitney states that each maximal planar graph without separating triangles is Hamiltonian, where a separating triangle is a triangle whose removal separates the graph. Chen [Any maximal planar graph with only one separating triangle is Hamiltonian J. Combin. Optim. 7 (2003) 79-86] proved that any maximal planar graph with only one separating triangle is still Hamiltonian. In this paper, it is shown that the conclusion of Whitney's Theorem still holds if there are exactly two separating triangles.