Related papers: Perfect orderings on Bratteli diagrams II: general…
Given a Bratteli diagram B, we study the set O(B) of all possible orderings w on a Bratteli diagram B and its subset P(B) consisting of `perfect' orderings that produce Bratteli-Vershik dynamical systems (Vershik maps). We give necessary…
For the simple Bratteli diagrams B where there is a single edge connecting any two vertices in consecutive levels, we show that a random order has uncountably many infinite paths if and only if the growth rate of the level-n vertex sets is…
A Bratteli diagram is a type of graph in which the vertices are split into finite subsets occupying an infinite sequence of levels, starting with a bottom level and moving to successively higher levels along edges connecting consecutive…
Bratteli-Vershik models have been very successfully applied to the study of various dynamical systems, in particular, in Cantor dynamics. In this paper, we study dynamics on the path spaces of generalized Bratteli diagrams that form models…
We study the notion of isomorphism for generalized Bratteli diagrams and investigate properties preserved under isomorphism. We show that every generalized Bratteli diagram is isomorphic to an irreducible generalized Bratteli diagram. We…
This paper is a survey on general (simple and non-simple) Bratteli diagrams which focuses on the following topics: finite and infinite tail invariant measures on the path space $X_B$ of a Bratteli diagram $B$, existence of continuous…
We introduce a new class of structured symmetric matrices by extending the notion of perfect elimination ordering from graphs to weighted graphs or matrices. This offers a common framework capturing common vertex elimination orderings of…
An ordered $r$-matching is an $r$-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of $r$-dimensional orders. The theory of ordered 2-matchings is well-developed…
An important property of chordal graphs is that these graphs are characterized by existence of perfect elimination orderings on their vertex sets. In this paper, we generalize the notion of perfect elimination orderings to signed graphs,…
A successive vertex ordering of a graph is a linear ordering of its vertices in which every vertex except the first has at least one neighbour appearing earlier. Such orderings arise naturally in incremental growth and…
We study stationary ordered Bratteli diagrams and give necessary and sufficient conditions for these orders to generate a continuous Vershik map. We apply this to finding adic representations for one sided substitution subshifts. We give an…
A perfect matching in a hypergraph is a set of edges that partition the set of vertices. We study the complexity of deciding the existence of a perfect matching in orderable and separable hypergraphs. We show that the class of orderable…
A category structure for ordered Bratteli diagrams is proposed in which isomorphism coincides with the notion of equivalence of Herman, Putnam, and Skau. It is shown that the natural one-to-one correspondence between the category of Cantor…
In preference modelling, it is essential to determine the number of questions and their arrangements to ask from the decision maker. We focus on incomplete pairwise comparison matrices, and provide the optimal filling in patterns, which…
We introduce and study dynamical systems and measures on stationary generalized Bratteli diagrams $B$ that are represented as the union of countably many classical Pascal-Bratteli diagrams. We describe all ergodic tail invariant measures on…
In [LT16], Kathryn Lindsey and the second author constructed a translation surface from a bi-infinite Bratteli diagram. We continue an investigation into these surfaces. The construction given in [LT16] was essentially combinatorial. Here,…
In another article we associated a dynamical system to a non-properly ordered Bratteli diagram. In this article we describe how to compute the $K-$group $K_0$ of the dynamical system in terms of the Bratteli diagram. In the case of properly…
We propose efficient algorithms for enumerating the notorious combinatorial structures of maximal planar graphs, called canonical orderings and Schnyder woods, and the related classical graph drawings by de Fraysseix, Pach, and Pollack…
In this paper we focus on Bratteli-Vershik models of general compact zero-dimensional systems with the action of a homeomorphism. An ordered Bratteli diagram is called decisive if the corresponding Vershik map prolongs in a unique way to a…
Snake graphs and their perfect matchings play a key role in the description of cluster variables of cluster algebras associated to surfaces. In this paper, we introduce triangular snake graphs and establish a bijection between their routes…