Related papers: Infinite trees of matroids
We give a short, topological proof that all graphs admit tree-decompositions displaying their topological ends.
The Matrix-Tree Theorem states that the number of spanning trees of a graph is given by the absolute value of any cofactor of the Laplacian matrix of the graph. We propose a very short proof of this result which amounts to comparing Taylor…
We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.
We consider the rooted trees which not have isomorphic representation and introduce a conception of complexity a natural number also. The connection between quantity such trees with $n$ edges and a complexity of natural number $n$ is…
We introduce a new construction of the Uniform Infinite Planar Quadrangulation (UIPQ). Our approach is based on an extension of the Cori-Vauquelin-Schaeffer mapping in the context of infinite trees, in the spirit of previous work. However,…
We consider a structure $\mathcal {M} = \langle \mathbb N, \{Tr,<\} \rangle$, where the relation $Tr(a,x,y)$ with a parameter $ a$ defines a family of trees on $\mathbb N$ and $<$ is the usual order on $\mathbb N$. We show that if the…
In this paper, we study various properties of matroidal ideals.
We look for partition theorems for large subtrees for suitable uncountable trees and colourings. We concentrate on sub-trees of $^{\kappa \ge} 2$ expanded by a well ordering of each level. Unlike earlier works, we do not ask the embedding…
We give an exposition of some results from matroid theory which characterise the finite pregeometries arising from Hrushovski's predimension construction. As a corollary, we observe that a finite pregeometry which satisfies Hrushovski's…
We characterize those countable rooted trees whose full automorphism group has uncountable strong cofinality or contains an open subgroup with ample generics.
We arrange the orders in an algebraic number field in a tree. This tree can be used to enumerate all orders of bounded index in the maximal order as well as the orders over some given order.
One perspective on tree decompositions is that they display (low-order) separations of the underlying graph or matroid. The separations displayed by a tree decomposition are necessarily nested. In 2013, Clark and Whittle proved the…
We study a class of algebras that can be used as recognisers for regular languages of infinite trees.
We present some exact expressions for the number of paths of a given length in a perfect $m$-ary tree. We first count the paths in perfect rooted $m$-ary trees and then use the results to determine the number of paths in perfect unrooted…
We define an independence system associated with simple graphs. We prove that the independence system is a matroid for certain families of graphs, including trees, with bases as minimal resolving sets. Consequently, the greedy algorithm on…
We study infinite tree and ultrametric matrices, and their action on the boundary of the tree. For each tree matrix we show the existence of a symmetric random walk associated to it and we study its Green potential. We provide a…
A transversal matroid $M$ of rank $r$ on $[n]$ can be associated to a family of binary matrices corresponding to different presentations of $M$. We describe those matrices which arise from unique maximal presentations of size $r$- giving a…
We consider the class of graphs for which the edge connectivity is equal to the maximum number of edge-disjoint spanning trees, and the natural generalization to matroids, where the cogirth is equal to the number of disjoint bases. We…
Although algebraic matroids were discovered in the 1930s, interest in them was largely dormant until their recent use in applications of algebraic geometry. Because nonlinear algebra is computationally challenging, it is easier to work with…
In this paper we extend the theory of oriented matroids to Lagrangian orthogonal matroids and their representations, and give a completely natural transformation from a representation of a classical oriented matroid to a representation of…