Matrix transformations on some sequence spaces related to strong Cesàro summability and boundedness

The spaces and introduced by Ayd?n and Ba?ar [C. Ayd?n, F. Ba?ar, Some new difference sequence spaces, Appl. Math. Comput. 157 (3) (2004) 677-693] can be considered as the matrix domains of a triangle in the sets of all sequences that are summable to zero, summable, and bounded by the Cesàro method of order 1. Here we define the sets of sequences which are the matrix domains of that triangle in the sets of all sequences that are summable, summable to zero, or bounded by the strong Cesàro method of order 1 with index p?1. We determine the β-duals of the new spaces and characterize matrix transformations on them into the sets of bounded, convergent and null sequences.     

On one-relator products induced by generalized triangle groups I

In this paper and a sequel, we study a group which is the quotient of a free product of groups by the normal closure of a single word that is contained in a subgroup which has the form of a free product of two cyclic groups. We use known properties of generalized triangle groups, together with detailed analysis of pictures and of words in free monoids, to prove a number of results such as a Freiheitssatz and the existence of Mayer-Vietoris sequences for such groups under suitable hypotheses. The results generalize those in an earlier article of the second author and Shwartz.     

On one-relator products induced by generalized triangle groups II

This is the second of two papers in which we study a group which is the quotient of a free product of groups by the normal closure of a single word that is contained in a subgroup which has the form of a free product of two cyclic groups. We use known properties of generalized triangle groups, together with detailed analysis of pictures and of words in free monoids, to prove a number of results such as a Freiheitssatz and the existence of Mayer-Vietoris sequences for such groups under suitable hypotheses. The results generalize those in an earlier article of the second author and Shwartz.     

Batrachion序列的数值求解

Batrachion序列是一类奇特的序列，有着非常的分形图形行为和轨迹，已引起计算机图形领域许多学者的兴趣和重视．本文给出Batrachion序列的完整求解，并且予以严格的证明．在证明过程中，同时显示了它与杨晖三角形密切的关系．     

Triangles I: Shapes

Summary This paper is the first in a series of three examining Euclidean triangle geometry via complex cross ratios. In this paper we show that every triangle can be characterized up to similarity by a single complex number, called its shape. We then use shapes and two basic theorems about shapes to prove theorems about similar triangles. The remaining papers in this series will examine complex triangle coordinates and complex triangle functions.     

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.     

Triangles III: Complex triangle functions

Summary This paper is the third in a series of three examining Euclidean triangle geometry via complex cross ratios. In the first two papers, we looked at triangle shapes and triangle coordinates. In this paper, we look at the triangle coordinates of the special points of a triangle, and show that they are functions of its shape. We then show how these functions can be used to prove theorems about triangles, and to gain some insight into what makes a special point of a triangle a centre.     

Counting with Borel’s triangle

Borel’s triangle is an array of integers closely related to the classical Catalan numbers. In this paper we study combinatorial statistics counted by Borel’s triangle. We present various combinatorial interpretations of Borel’s triangle in terms of lattice paths, binary trees, and pattern avoiding permutations and matchings, and derive a functional equation that is useful in analyzing the involved structures.     

Bivariate CDF iterations and asymptotic independence

Asymptotic independence under weak convergence of sequences of bivariate random vectors is studied via the behavior of a certain class of bivariate cdf iterands that includes the extreme value iterand and a certain maximin iterand.     

Minimalist designs

The iterative absorption method has recently led to major progress in the area of (hyper‐)graph decompositions. Among other results, a new proof of the existence conjecture for combinatorial designs, and some generalizations, was obtained. Here, we illustrate the method by investigating triangle decompositions: We give a simple proof that a triangle‐divisible graph of large minimum degree has a triangle decomposition and prove a similar result for quasi‐random host graphs.     

A generalized Malfatti problem

Malfatti?s problem, first published in 1803, is commonly understood to ask fitting three circles into a given triangle such that they are tangent to each other, externally, and such that each circle is tangent to a pair of the triangle?s sides. There are many solutions based on geometric constructions, as well as generalizations in which the triangle sides are assumed to be circle arcs. A generalization that asks to fit six circles into the triangle, tangent to each other and to the triangle sides, has been considered a good example of a problem that requires sophisticated numerical iteration to solve by computer. We analyze this problem and show how to solve it quickly.     

Mapping Planar Graphs into Projective Cubes

Projective cubes are obtained by identifying antipodal vertices of hypercubes. We introduce a general problem of mapping planar graphs into projective cubes. This question, surprisingly, captures several well‐known theorems and conjectures in the theory of planar graphs. As a special case , we prove that the Clebsch graph, a triangle‐free graph on 16 vertices, is the smallest triangle‐free graph to which every triangle‐free planar graph admits a homomorphism.     

Lattice surfaces and smallest triangles

We calculate the area of the smallest triangle and the area of the smallest virtual triangle for many known lattice surfaces. We show that our list of the lattice surfaces for which the area of the smallest virtual triangle greater than \(1\over 20\) is complete. In particular, this means that there are no new lattice surfaces for which the area of the smallest virtual triangle is greater than .05. Our method follows an algorithm described by Smillie and Weiss and improves on it in certain respects.     

Exact Location of the Weighted Fermat–Torricelli Point on Flat Surfaces of Revolution

We find the exact location of the weighted Fermat–Torricelli point of a geodesic triangle on flat surfaces of revolution (circular cylinder and circular cone) in the three dimensional Euclidean space by applying a cosine law of three circular helixes which form a geodesic triangle on a circular cylinder, an explicit solution of the corresponding weighted Fermat–Torricelli point in the dimensional Euclidean space by calculating some lengths of geodesic arcs and angles and by using some lengths of straight lines on a circular cone which connect the vertices of the geodesic triangle with the vertex of the circular cone.     

A new 11 point degree 6 cubature formula for the triangle

We present a new cubature formula in the triangle which exactly integrates polynomials up to degree 6, using only 11 points. The formula was computed by starting with a 12 point cubature formula and applying the reduced basis method to drive one of the weights to zero, resulting in an 11 point formula with positive weights and no points outside the triangle. This improves upon the previously best known positive inside formulas, which have 12 or more points. The lower bound on the number of points for a degree 6 cubature formula in the triangle is 10, which to date has only been obtained by allowing some of the points to be outside the triangle. (© 2008 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim)     

On the complexity of the independent set problem in triangle graphs

We consider the complexity of the maximum (maximum weight) independent set problem within triangle graphs, i.e., graphs G satisfying the following triangle condition: for every maximal independent set I in G and every edge uv in G−I, there is a vertex w∈I such that {u,v,w} is a triangle in G. We also introduce a new graph parameter (the upper independent neighborhood number) and the corresponding upper independent neighborhood set problem. We show that for triangle graphs the new parameter is equal to the independence number. We prove that the problems under consideration are NP-complete, even for some restricted subclasses of triangle graphs, and provide several polynomially solvable cases for these problems within triangle graphs. Furthermore, we show that, for general triangle graphs, the maximum independent set problem and the upper independent neighborhood set problem cannot be polynomially approximated within any fixed constant factor greater than one unless P=NP.     

Recognizing bull-free perfect graphs

A bull is the graph obtained from a triangle by adding two pendant vertices adjacent to distinct vertices of the triangle. Chvátal and Sbihi showed that the strong perfect graph conjecture holds for Bull-free graphs. We give a polynomial time recognition algorithm for Bull-free perfect graphs.     

Triangles II: Complex triangle coordinates

Summary This paper is the second in a series of three examining Euclidean triangle geometry via complex cross ratios. In the first paper of the series, we examined triangle shapes. In this paper, we coordinatize the Euclidean plane using cross ratios, and use these triangle coordinates to prove theorems about triangles. We develop a complex version of Ceva's theorem, and apply it to proofs of several new theorems. The remaining paper of this series will deal with complex triangle functions.     

A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts

We consider mixed integer linear sets defined by two equations involving two integer variables and any number of non-negative continuous variables. We analyze the benefit from adding a non-split inequality on top of the split closure. Applying a probabilistic model, we show that the importance of a type 2 triangle inequality decreases with decreasing lattice width, on average. Our results suggest that this is also true for type 3 triangle and quadrilateral inequalities.     

Drawing planar 3-trees with given face areas

We study straight-line drawings of planar graphs such that each interior face has a prescribed area. It was known that such drawings exist for all planar graphs with maximum degree 3. We show here that such drawings exist for all planar partial 3-trees, i.e., subgraphs of a triangulated planar graph obtained by repeatedly inserting a vertex in one triangle and connecting it to all vertices of the triangle. Moreover, vertices have rational coordinates if the face areas are rational, and we can bound the resolution. We also give some negative results for other graph classes.