Related papers: On triangular paperfolding patterns
We compute the distance-dependent three-point function of general planar maps and of bipartite planar maps, i.e., the generating function of these maps with three marked vertices at prescribed pairwise distances. Explicit expressions are…
We review and extend previous results on coincidence of mesh patterns. We introduce the notion of a force on a permutation pattern and apply it to the coincidence classification of mesh patterns, completing the classification up to size…
We study the problem of deciding whether a crease pattern can be folded by simple folds (folding along one line at a time) under the infinite all-layers model introduced by [Akitaya et al., 2017], in which each simple fold is defined by an…
The spaces of triangulations of a given manifold have been widely studied. The celebrated theorem of Pachner~\cite{Pachner} says that any two triangulations of a given manifold can be connected by a sequence of bistellar moves, or Pachner…
We introduce and study a three-folded linear operator depending on three parameters that has associated a triangular number tilling of the plane. As a result the set of all triples of integers is decomposed in classes of equivalence…
It is important to have fast and effective methods for simplifying 3-manifold triangulations without losing any topological information. In theory this is difficult: we might need to make a triangulation super-exponentially more complex…
We show that for certain triangulations of surfaces, circle packings realising the triangulation can be found by solving a system of polynomial equations. We also present a similar system of equations for unbranched circle packings. The…
Tensors play a pivotal role in the realms of science and engineering, particularly in the realms of data analysis, machine learning, and computational mathematics. The process of unfolding a tensor into matrices, commonly known as tensor…
We give a Python program that is capable to compute and print all the distinct trivalent 2-stratifold graphs up to $N$ white vertices with trivial fundamental group. Our algorithm uses the three basic operations to construct new graphs from…
We give formulae for the multiplicities of eigenvalues of generalized rotation operators in terms of generalized Frobenius-Schur indicators in a semisimple spherical tensor category $\mathcal{C}$. In particular, this implies that the entire…
In this work we present a general and versatile algorithmic framework for exhaustively generating a large variety of different combinatorial objects, based on encoding them as permutations. This approach provides a unified view on many…
We prove that for a given flat surface with conical singularities, any pair of geometric triangulations can be connected by a chain of flips.
Finding, counting and/or listing triangles (three vertices with three edges) in large graphs are natural fundamental problems, which received recently much attention because of their importance in complex network analysis. We provide here a…
This paper investigates enumerative aspects of permutohedral blades, which provide a generalization of the notion of the tropical hyperplane arrangement. Blade provide the combinatorial underpinning of generalized biadjoint scalar…
In the present paper, as a generalization of the classical periodic rings, we explore those rings whose elements are additively generated by two (or more) periodic elements by calling them additively periodic. We prove that, in some major…
This article presents the formal proof of correctness for a plane Delaunay triangulation algorithm. It consists in repeating a sequence of edge flippings from an initial triangulation until the Delaunay property is achieved. To describe…
We study aspects of the enumeration of permutation classes, sets of permutations closed downwards under the subpermutation order. First, we consider monotone grid classes of permutations. We present procedures for calculating the generating…
Three--dimensional colored triangulations are gluings of tetrahedra whose faces carry the colors 0, 1, 2, 3 and in which the attaching maps between tetrahedra are defined using the colors. This framework makes it possible to generalize the…
We explore the following problem: given a collection of creases on a piece of paper, each assigned a folding direction of mountain or valley, is there a flat folding by a sequence of simple folds? There are several models of simple folds;…
In this paper we give a new and simple algorithm to put any multivariate polynomial into a normal determinant form in which each entry has the form , and in each column the same variable appears. We also apply the algorithm to obtain a…