Related papers: Associated Permutations of Complete Non-Ambiguous …

We investigate pattern avoidance in permutations satisfying some additional restrictions. These are naturally considered in terms of avoiding patterns in linear extensions of certain forest-like partially ordered sets, which we call binary…

Based on the Connes--Kreimer Hopf algebra of rooted trees, the rooted tree maps are defined as linear maps on noncommutative polynomial algebra in two indeterminates. It is known that they induce a large class of linear relations for…

The decidability of equivalence for three important classes of tree transducers is discussed. Each class can be obtained as a natural restriction of deterministic macro tree transducers (MTTs): (1) no context parameters, i.e., top-down tree…

We consider a large family of equivalence relations on permutations in Sn that generalise those discovered by Knuth in his study of the Robinson-Schensted correspondence. In our most general setting, two permutations are equivalent if one…

We investigate the connections between tree amalgamations and quasi-isometries. In particular, we prove that the quasi-isometry type of multi-ended accessible quasi-transitive connected locally finite graphs is determined by the…

We give some results about a bijection associating each permutation with a subexcedant function. This function is related to a particular decomposition of the permutation as a product of transpositions and therefore it has been called…

In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed…

In this manuscript, we show that any neural network with any activation function can be represented as a decision tree. The representation is equivalence and not an approximation, thus keeping the accuracy of the neural network exactly as…

We compute the continuous bounded cohomology of the full automorphism groups of regular trees in all positive degrees, with coefficients arising from any irreducible continuous unitary representations. To the author's knowledge, this seems…

We study a fragmentation of the $\mathbf p$-trees of Camarri and Pitman [Elect. J. Probab., vol. 5, pp. 1--18, 2000]. We give exact correspondences between the $\mathbf p$-trees and trees which encode the fragmentation. We then use these…

Consider matrices of order $k+N$ over $p$-adic field determined up to conjugations by elements of $GL$ over $p$-adic integers. We define a product of such conjugacy classes and construct the analog of characteristic functions (transfer…

In this paper, we consider the knot matching problem arising in computational forestry. The knot matching problem is an important problem that needs to be solved to advance the state of the art in automatic strength prediction of lumber. We…

Correlation functions in a dynamic quartic matrix model are obtained from the two-point function through a recurrence relation. This paper gives the explicit solution of the recurrence by mapping it bijectively to a two-fold nested…

We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…

Increasingly, biologists are constructing evolutionary trees on large numbers of overlapping sets of taxa, and then combining them into a `supertree' that classifies all the taxa. In this paper, we ask how much coverage of the total set of…

In this paper we prove a combinatorial theorem for finite labellings of trees, and show that it is equivalent to a theorem for finite covers of metric trees and a fixed point theorem on metric trees. We trace how these connections mimic the…

We introduce and investigate the approximability of the maximum binary tree problem (MBT) in directed and undirected graphs. The goal in MBT is to find a maximum-sized binary tree in a given graph. MBT is a natural variant of the…

Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…

For a graph with edge ordering, a linear order on the edge set, we obtain a permutation of vertices by considering the edges as transpositions of endvertices. It is known from D\'enes' results that the permutation of a tree is a full cyclic…

This paper revisits two classical distributed problems in anonymous networks, namely spanning tree construction and topology recognition, from the point of view of graph covering theory. For both problems, we characterize necessary and…