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.     

Equipartitioning by a convex 3-fan

We show that for a given planar convex set K of positive area there exist three pairwise internally disjoint convex sets whose union is K such that they have equal area and equal perimeter.     

An elliptic K3 surface associated to Heron triangles

A rational triangle is a triangle with rational sides and rational area. A Heron triangle is a triangle with integral sides and integral area. In this article we will show that there exist infinitely many rational parametrizations, in terms of s, of rational triangles with perimeter 2s(s+1) and area s(s²−1). As a corollary, there exist arbitrarily many Heron triangles with all the same area and the same perimeter. The proof uses an elliptic K3 surface Y. Its Picard number is computed to be 18 after we prove that the Néron-Severi group of Y injects naturally into the Néron-Severi group of the reduction of Y at a prime of good reduction. We also give some constructions of elliptic surfaces and prove that under mild conditions a cubic surface in P³ can be given the structure of an elliptic surface by cutting it with the family of hyperplanes through a given line L. Some of these constructions were already known, but appear to have lacked proof in the literature until now.     

Isoperimetric triangular enclosures with a fixed angle

In this paper, we study four variants of the famous isoperimetric problem. Given a set S of n > 2 points in the plane (in general position), we show how to compute in O(n ²) time, a triangle with maximum (or minimum) area enclosing S among all enclosing triangles with fixed perimeter and one fixed angle. We also show how to compute in O(n ²) time, a triangle with maximum (or minimum) perimeter enclosing S among all enclosing triangles with fixed area and one fixed angle. We also provide an Ω (n log n) lower bound for these problems in the algebraic computation tree model.     

Challenging Students to View the Concept of Area in Triangles in a Broad Context: Exploiting the Features of Cabri-II

This study focuses on the constructions in terms of area and perimeter in equivalent triangles developed by students aged 12–15 years-old, using the tools provided by Cabri-Geometry II [Labore (1990). Cabri-Geometry (software), Université de Grenoble]. Twenty-five students participated in a learning experiment where they were asked to construct: (a) pairs of equivalent triangles “in as many ways as possible” and to study their area and their perimeter using any of the tools provided and (b) “any possible sequence of modifications of an original triangle into other equivalent ones”. As regards the concept of area and in contrast to a paper and pencil environment, Cabri provided students with different and potential opportunities in terms of: (a) means of construction, (b) control, (c) variety of representations and (d) linking representations, by exploiting its capability for continuous modifications. By exploiting these opportunities in the context of the given open tasks, students were helped by the tools provided to develop a broader view of the concept of area than the typical view they would construct in a typical paper and pencil environment.     

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

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

On the Helly Number for Line Transversals to Parallel Triangles

We prove two results about the problem of finding the Helly number for line transversals to a family of parallel triangles in the plane: (1) If each three triangles of a family of parallel right triangles are intersected by an ascending (or a descending) line, then there is an ascending (or a descending) line that intersects all     

Triangles of Extremal Area or Perimeter in a Finite Planar Point Set

We show the following two results on a set of n points in the plane, thus answering questions posed by Erdos and Purdy [11]: 1. The maximum number of triangles of maximum area (or of maximum perimeter) in a set of n points in the plane is exactly n . 2. The maximum possible number of triangles of minimum positive area in a set of n points in the plane is Θ(n ² ) . Received April 19, 1999, and in revised form February 29, 2000, and September 12, 2000. Online publication April 6, 2001.     

On Equilibrium Shape of Charged Flat Drops

The equilibrium shapes of two‐dimensional charged, perfectly conducting liquid drops are governed by a geometric variational problem that involves a perimeter term modeling line tension and a capacitary term modeling Coulombic repulsion. Here we give a complete explicit solution to this variational problem. Namely, we show that at fixed total charge a ball of a particular radius is the unique global minimizer among all sufficiently regular sets in the plane. For sets whose area is also fixed, we show that balls are the only minimizers if the charge is less than or equal to a critical charge, while for larger charge minimizers do not exist. Analogous results hold for drops whose potential, rather than charge, is fixed. © 2018 Wiley Periodicals, Inc.     

A variant of the isoperimetric problem,PartⅠ

This paper deals with the following isoperimetric problem in the plane:Among all regions with prescribed perimeter and covering a given line segment,what is the region that has the greatest area?     

A variant of the isoperimetric problem, Part I

This paper deals with the following isoperimetric problem in the plane: Among all regions with prescribed perimeter and covering a given line segment, what is the region that has the greatest area?     

二维等谱问题研究的计算数学框架

等谱问题是数学、物理诸学科关注的一个热点问题,本文总结并诠释了二维等谱问题的内在计算数学性质与规律:利用镜像反演讨论等谱对的几何结构(不等距而谱相等);把一般文献中假定的特殊三角形扩展到一般的三角形或者矩形;研究特征函数的正交结构,把特定的Laplace等谱问题扩展到一般零边值的二阶线性椭圆算子等谱问题.指出合理的粗网格对于研究等谱问题及其计算的重要性:两个连续问题等谱成立的充分必要条件是存在自然粗网格使其离散问题谱相等.文中给出的数值例子与特征值近似逼近验证了相应的结论,所用的方法原则上可用于研究三维乃至高维的PDE等谱问题.     

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.     

Dynamic Polygons and the Graphing Calculator

A match stick puzzle is used as a springboard for a secondary classroom investigation into mathematical modeling techniques with the graphing calculator. Geometric models, through their corresponding area formulas, are constructed, tested, and analyzed graphically to fit specified problem conditions. These specialized versions are then synthesized into generalizations that determine a polygon containing integral sides with a given perimeter and area.     

The Isis problem as an experimental probe and teaching resource

The Isis problem, which has a link with the Isis cult of ancient Egypt, asks: “Find which rectangles with sides of integral length (in some unit) have area and perimeter (numerically) equal, and prove the result.” Since the solution requires minimal technical mathematics, the problem is accessible to a wide range of students. Further, it is notable for the variety of proofs (empirically grounded, algebraic, geometrical) using different forms of argument, and their associated representations, and it provides an instrument for probing students’ ideas about proof, and the interplay between routine and adaptive expertise. A group of 39 Flemish pre-service mathematics teachers was confronted with the Isis problem. More specifically, we first asked them to solve the problem and to look for more than one solution. Second, we invited them to study five given contrasting proofs and to rank these proofs from best to worst. The results highlight a preference of many students for algebraic proofs as well as their rejection of experimentation. The potential of the problem as a teaching tool is outlined.     

Small Edge Sets Meeting all Triangles of a Graph

It was conjectured in 1981 by the third author that if a graph G does not contain more than t pairwise edge-disjoint triangles, then there exists a set of at most 2t edges that shares an edge with each triangle of G. In this paper, we prove this conjecture for odd-wheel-free graphs and for ‘triangle-3-colorable’ graphs, where the latter property means that the edges of the graph can be colored with three colors in such a way that each triangle receives three distinct colors on its edges. Among the consequences we obtain that the conjecture holds for every graph with chromatic number at most four. Also, two subclasses of K ₄-free graphs are identified, in which the maximum number of pairwise edge-disjoint triangles is equal to the minimum number of edges covering all triangles. In addition, we prove that the recognition problem of triangle-3-colorable graphs is intractable.     

Hot spots conjecture for a class of acute triangles

We show that the hot spots conjecture of J. Rauch holds for acute triangles if one of the angles is not larger than \(\pi /6\). More precisely, we show that the second Neumann eigenfunction on those acute triangles has no maximum or minimum inside the domain. We first simplify the problem by showing that absence of critical points on two sides implies no critical points inside a triangle. This result applies to any acute triangle and might help prove the conjecture for arbitrary acute triangles. Then we show that there are no critical points on two sides assuming one small angle. We also establish simplicity for the smallest positive Neumann eigenvalue for all non-equilateral acute triangles. This result was already known for obtuse triangles, and it fails for the equilateral case.     

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.     

Sharp $$N^{3/4}$$ Law for the Minimizers of the Edge-Isoperimetric Problem on the Triangular Lattice

We investigate the edge-isoperimetric problem (EIP) for sets of n points in the triangular lattice by emphasizing its relation with the emergence of the Wulff shape in the crystallization problem. By introducing a suitable notion of perimeter and area, EIP minimizers are characterized as extremizers of an isoperimetric inequality: they attain maximal area and minimal perimeter among connected configurations. The maximal area and minimal perimeter are explicitly quantified in terms of n. In view of this isoperimetric characterizations, EIP minimizers \(M_n\) are seen to be given by hexagonal configurations with some extra points at their boundary. By a careful computation of the cardinality of these extra points, minimizers \(M_n\) are estimated to deviate from such hexagonal configurations by at most \(K_t\, n^{3/4}+\mathrm{o}(n^{3/4})\) points. The constant \(K_t\) is explicitly determined and shown to be sharp.