Related papers: A counterexample to linear relationship between la…
Minimum Bisection denotes the NP-hard problem to partition the vertex set of a graph into two sets of equal sizes while minimizing the width of the bisection, which is defined as the number of edges between these two sets. We first consider…
We consider counterfactual explanations, the problem of minimally adjusting features in a source input instance so that it is classified as a target class under a given classifier. This has become a topic of recent interest as a way to…
Among all characteristics exhibited by natural and man-made networks the small-world phenomenon is surely the most relevant and popular. But despite its significance, a reliable and comparable quantification of the question `how small is a…
We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…
Because of the existence of cubic scalar couplings, there are in general nondecoupling effects at tree level in the scalar sector of any theory with two or more very different mass scales. We show this explicitly in the minimal…
We continue to study the relationship between the size of the sum of a set and the common energy of its subsets. We find a rather sharp subexponential dependence between the doubling constant of a set $A$ and the minimal common energy taken…
We consider three probability measures on subsets of edges of a given finite graph $G$, namely those which govern, respectively, a uniform forest, a uniform spanning tree, and a uniform connected subgraph. A conjecture concerning the…
Reverse search is a convenient method for enumerating structured objects, that can be used both to address theoretical issues and to solve data mining problems. This method has already been successfully developed to handle unordered trees.…
Let $s$ be a finite sequence over a field of length $n$. It is well-known that if $s$ satisfies a linear recurrence of order $d$ with non-zero constant term, then the reverse of $s$ also satisfies a recurrence of order $d$ (with…
We destroy a finite tree of size $n$ by cutting its edges one after the other and in uniform random order. Informally, the associated cut-tree describes the genealogy of the connected components created by this destruction process. We…
We demonstrate the versatility of the tangle-tree duality theorem for abstract separation systems by using it to prove tree-of-tangles theorems. This approach allows us to strengthen some of the existing tree-of-tangles theorems by bounding…
The minimum linear arrangement problem on a network consists of finding the minimum sum of edge lengths that can be achieved when the vertices are arranged linearly. Although there are algorithms to solve this problem on trees in polynomial…
We bound the greatest common divisor of two coprime multivariable polynomials evaluated at algebraic numbers, generalizing work of Levin, and going towards conjectured inequalities of Silverman and Vojta. As an application, we prove results…
Konig's theorem states that the covering number and the matching number of a bipartite graph are equal. We prove a generalisation of this result, in which each point in one side of the graph is replaced by a subtree of a given tree. The…
Chiral superfields have been used, and extensively, almost ever since supersymmetry has been discovered. Complex linear superfields afford an alternate representation of matter, but are widely misbelieved to be 'physically equivalent' to…
We investigate the relation between degree sequences of trees and the majorization order using the Muirhead theorem. In this way, we prove a theorem that provides a necessary and sufficient condition for delta sequences of trees to be…
A closed-form formula is derived for the number of occurrences of matches of a multiset of patterns among all ordered (plane-planted) trees with a given number of edges. A pattern looks like a tree, with internal nodes and leaves, but also…
We address the problem of computing distances between rankings that take into account similarities between candidates. The need for evaluating such distances is governed by applications as diverse as rank aggregation, bioinformatics, social…
One strategy for reconstruction of phylogenetic networks is to solve the phylogenetic network problem, which involves inferring phylogenetic trees first and subsequently computing the smallest phylogenetic network that displays all the…
We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for…