We consider directed figures defined as labelled polyominoes with designated start and end points, with two types of catenation operations. We are especially interested in codicity verification for sets of figures, and we show that depending on the catenation type the question whether a given set of directed figures is a code is decidable or not. In the former case we give a constructive proof which leads to a straightforward algorithm.
In this paper we investigate the contribution of Dehn to the development of non-Archimedean geometries. We will see that it is possible to construct some models of non-Archimedean geometries in order to prove the independence of the continuity axiom and we will study the interrelations between Archimedes’ axiom and Legendre’s theorems. Some of these interrelations were also studied by Bonola, who was one of the very few Italian scholars to appreciate Dehn’s work. We will see that, if Archimedes’...
Sharma-Kaushik partitions have been used to define distances between vectors with -coordinates. In this paper, “difference matrices” for the partitioning classes have been introduced and investigated. It has been shown that the difference matrices are circulant and that the entries of a product of matrices is an extended intersection number of a distance scheme. The sum of the entries of each row or columns of the product matrix has been obtained. The algebra of matrices generated by the difference...
A result about the distribution of the number of nodes in the relative interior of the typical I-segment in homogeneous and isotropic random tessellations stable under iteration (STIT tessellations) is extended to the anisotropic case using recent findings from Schreiber/Thäle, Typical geometry, second-order properties and central limit theory for iteration stable tessellations, arXiv:1001.0990 [math.PR] (2010). Moreover a new expression for the values of this probability distribution is presented...
In this article we prove the friendship theorem according to the article [1], which states that if a group of people has the property that any pair of persons have exactly one common friend, then there is a universal friend, i.e. a person who is a friend of every other person in the group