A shuffling theorem for reflectively symmetric tilings

The author and Rohatgi recently proved a ‘shuffling theorem’ for doubly-dented hexagons. In particular, they showed that shuffling removed unit triangles along a horizontal axis in a hexagon changes the tiling number by only a simple multiplicative factor. In this paper, we consider a similar phenomenon for a symmetry class of tilings, namely, the reflectively symmetric tilings. We also prove several shuffling theorems for halved hexagons.     

A note on tropical triangles in the plane

We define transversal tropical triangles （affine and projective） and characterize them via six inequalities to be satisfied by the coordinates of the vertices. We prove that the vertices of a transversal tropical triangle are tropically independent and they tropically span a classical hexagon whose sides have slopes ∞, 0, 1. Using this classical hexagon, we determine a parameter space for transversal tropical triangles. The coordinates of the vertices of a transversal tropical triangle determine a tropically regular matrix. Triangulations of the tropical plane are obtained.     

Minimum Covering for Hexagon Triple Systems

A hexagon triple is a graph consisting of three triangles of the form (a, x, b), (b, y, c), and (c,z,a), where a, b, c, x, y, z are distinct. The triangle (a, b, c) is called the inside triangle and the triangles (a, x, b), (b,y,c), and (c, z, a) are called outside triangles. A 3k-fold hexagon triple system of order n is a pair (X, H), where H is an edge-disjoint collection of hexagon triples which partitions the edge set of 3kK ⁿ with vertex set X. Note that the outside triangles form a 3k-fold triple system. If the 3k-fold hexagon triple system (X, H) has the additional property that the inside triangles form a k-fold triple system, then (X, H) is said to be perfect. A covering of 3kK ⁿ with hexagon triples is a triple (X, H, P) such that: 1.3kK ⁿ has vertex set X. 2.P is a subset of E(λ K ⁿ ) with vertex set X for some λ, and 3.H is an edge disjoint partition of E(3kK ⁿ )∪ P with hexagon triples. If P is as small as possible (X, H, P) is called a minimum covering of 3kK ⁿ with hexagon triples. If the inside triangles of the hexagon triples in H form a minimum covering of kK ⁿ with triangles, the covering is said to be perfect. A complete solution for the problem of constructing perfect 3k-fold hexagon triple system and perfect maximum packing of 3kK ⁿ with hexagon triples was given recently by the authors [2]. In this work, we give a complete solution of the problem of constructing perfect minimum covering of 3kK ⁿ with hexagon triples.     

Approximation of quadrilaterals by rational quadrilaterals in the plane

Many questions about triangles and quadrilaterals with rational sides, diagonals and areas can be reduced to solving certain diophantine equations. We look at a number of such questions including the question of approximating arbitrary triangles and quadrilaterals by those with rational sides, diagonals and areas. We transform these problems into questions on the existence of infinitely many rational solutions on a two parameter family of quartic curves. This is further transformed to a two parameter family of elliptic curves to deduce our main result concerning density of points on a line which are at a rational distance from three collinear points (Theorem 4). We deduce from this a new proof of density of rational quadrilaterals in the space of all quadrilaterals (Theorem 39). The other main result (Theorem 3) of this article is on the density of rational triangles which is related to analyzing rational points on the unit circle. Interestingly, this enables us to deduce that parallelograms with rational sides and area are dense in the class of all parallelograms. We also give a criterion for density of certain sets in topological spaces using local product structure and prove the density Theorem 6 in the appendix section. An application of this proves the density of rational points as stated in Theorem 31.     

On Napoleon's theorem in the isotropic plane]{On Napoleon's theorem in the isotropic plane

Summary Napoleon's original theorem refers to arbitrary triangles in the Euclidean plane. If equilateral triangles are externally erected on the sides of a given triangle, then their three corresponding circumcenters form an equilateral triangle. We present some analogous theorems and related statements for the isotropic (Galilean) plane.     

An interpretation of viète's “calculus of triangles” as a precursor of the algebra of complex numbers

Viète introduced operations over right triangles which are directly related to the multiplication and division of complex numbers. He determined the relationships between the angles and sides of the triangles concerned. His first operation is characterised by what corresponds to the fact that arguments of complex numbers are added when the latter are multiplied, and in a similar theorem he shows what we now can see as the anticipation of the analogous characteristic for division of complex numbers. Viète finds powers of an arbitrary right triangle which correspond to powers of complex numbers. One of his theorems is structurally similar to the modern formulation of De Moivre's theorem. The investigation of this subject promises further results.     

An operator formula for the number of halved monotone triangles with prescribed bottom row

Monotone triangles are certain triangular arrays of integers, which correspond to n×n alternating sign matrices when prescribing (1,2,…,n) as bottom row of the monotone triangle. In this article we define halved monotone triangles, a specialization of which correspond to vertically symmetric alternating sign matrices. We derive an operator formula for the number of halved monotone triangles with prescribed bottom row which is analogous to our operator formula for the number of ordinary monotone triangles [I. Fischer, The number of monotone triangles with prescribed bottom row, Adv. in Appl. Math. 37 (2) (2006) 249-267].     

On Reduced Triangles in Normed Planes

A convex body is reduced if it does not properly contain a convex body of the same minimal width. In this paper we present new results on reduced triangles in normed (or Minkowski) planes, clearly showing how basic seemingly elementary notions from Euclidean geometry (like that of the regular triangle) spread when we extend them to arbitrary normed planes. Via the concept of anti-norms, we study the rich geometry of reduced triangles for arbitrary norms giving bounds on their side-lengths and on their vertex norms. We derive results on the existence and uniqueness of reduced triangles, and also we obtain characterizations of the Euclidean norm by means of reduced triangles. In the introductory part we discuss different topics from Banach Space Theory, Discrete Geometry, and Location Science which, unexpectedly, benefit from results on reduced triangles.     

Non-Unit Free Triangle Orders

A Free Triangle order is a partially ordered set in which every element can be represented by a triangle. All triangles lie between two parallel baselines, with each triangle intersecting each baseline in exactly one point. Two elements in the partially ordered set are incomparable if and only if their corresponding triangles intersect. A unit free triangle order is one with such a representation in which all triangles have the same area. In this paper, we present an example of a non-unit free triangle order.     

On the Napoleon-Torricelli configuration in Affine Cayley-Klein planes

There are three affine Cayley-Klein planes (see [5]), namely, the Euclidean plane, the isotropic (Galilean) plane, and the pseudo-Euclidean (Minkow-skian or Lorentzian) plane. We extend the generalization of the well-known Napoleon theorem related to similar triangles erected on the sides of an arbitrary triangle in the Euclidean plane to all affine Cayley-Klein planes. Using the Ω_k-and anti-Ω_k-equilateral triangles introduced in [28], we construct the Napoleon and the Torricelli triangle of an arbitrary triangle in any affine Cayley-Klein plane. Some interesting geometric properties of these triangles are derived. The author is partially supported by grant VU-MI-204/2006.     

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.     

曲边三角形及曲边四边形上的混合函数插值格式

一、引言 二元函数在标准三角形上的混合函数插值格式在许多文献,例如,Birkhofft,Barnhill,Gordon及Gregory等的文章中都有讨论。在三角形周边上对高阶偏导数进行插值,而且计算比较简单的是J.A.Gregory的文章中所给出的一种混合函数插值格式。这种格式是由简单函数的线性组合所构成的,而且格式是对称的,因此计算比较简便。但是J.A.Gregory只是对直边三角形给出了格式。本文企图推广Gregory的格式,给出曲边三角形上对高阶偏导数进行插值的插值格式。我们还进一步给出了曲边四边形上     

Empty Convex Hexagons in Planar Point Sets

Erdős asked whether every sufficiently large set of points in general position in the plane contains six points that form a convex hexagon without any points from the set in its interior. Such a configuration is called an empty convex hexagon. In this paper, we answer the question in the affirmative. We show that every set that contains the vertex set of a convex 9-gon also contains an empty convex hexagon.     

A simple explanation for the “shuffling phenomenon” for lozenge tilings of dented hexagons

In a recent preprint, Lai and Rohatgi proved a “shuffling theorem” for lozenge tilings of a hexagon with “dents” (i.e., missing triangles). Here, we shall point out that this follows immediately from the enumeration of Gelfand–Tsetlin patterns with given bottom row. This observation is also contained in a recent preprint of Byun.     

Area functions on affine planes

Oriented area functions are functions defined on the set of ordered triangles of an affine plane which are antisymmetric under odd permutations of the vertices and which behave additively when triangles are cut into two. We compare several elementary properties which such an area function may have (roughly speaking shear invariance, equality of area of the two triangles obtained by cutting a parallelogram along a diagonal, and equality of area of the two triangles obtained by cutting a triangle along a median). It turns out purely by arguments of elementary affine geometry (if cleverly arranged) that these properties are grosso modo equivalent, although one has to be careful about “pathological” situations. Furthermore, all oriented area functions satisfying these properties are explicitly determined. Finally they are compared with so-called geometric valuations.     

整体函数域素数次循环扩域的类群

设K/F是整体函数域的素数l次循环扩张,F是有理函数域F_q(T)上的有限可分扩域.利用函数域的Conner-Hurrelbrink正合六边形与源于短正合列的正合六边形,本文在l整除与不整除基域F的理想类数的情形下,分别研究函数域K理想类群的Sylow l-子群的结构.同时,利用得到的结果,本文给出了基域F的单位为K中元素norm的若干条件.     

边界为三角形或四边形时反平面弹性或Laplace方程中的退化尺寸问题

对于反平面弹性或Laplace方程的外部边值问题, 给出了三角形或四边形周界时一系列退化尺寸问题的解,并利用了Schwarz-Christoffel 保角映象．证实当某一尺寸“R”等于它的临界值或一个单位值时,一个形式上简明的复位函数满足单位圆上位移为0的条件,或w=0．这就意味着在实际平面上的退化尺寸已经得到．最后,退化尺寸可从某些特殊积分得出,这些积分依赖于保角映象中的诸参数．给出了三角形或四边形周界时一系列退化尺寸问题的数值结果．     

非自伴椭圆问题的离散强极值原理与区域分解法

1．引言本文考虑非自伴二阶椭圆型方程的边值问题（）：其中Q是有界多角形开域,其边界＊O充分光滑;并且方程左端微分算子是H’川椭圆的．虽然在一定条件下问题（P）的解满足极值原理,但是,用通常的Galerkin有限元法求解（P）时,得到的解叫的一般并不满足极值原理．特别,当问＞＞a时,qx）还可能出现剧烈的振荡．即使对自伴问题（即（卫．1）中b一时在三角形线性元的情形,P．G．O。小t和P．－A．Ravlart证明了：如果限定三角形的内角。三。／2－。（其中常数。＞则,且网格参数人＞0充分小时,则有较弱形式的极值原理：maxfrU（…