相关论文: A Bramble like Witness for Large Branch-Width

A split graph is a graph whose vertices can be partitioned into a clique and a stable set. We investigate the combinatorial species of split graphs, providing species-theoretic generalizations of enumerative results due to B\'ina and…

We study entanglement witness and present a construction of entanglement witnesses in terms of the mutually unbiased measurements (MUMs). These witnesses include the entanglement witnesses constructed from mutually unbiased bases (MUBs) as…

The goal of these lectures is to survey some of the recent progress on the description of large-scale structure of random trees. We use the framework of Markov-Branching sequences of trees and discuss several applications.

Many enumeration problems in combinatorics, including such fundamental questions as the number of regular graphs, can be expressed as high-dimensional complex integrals. Motivated by the need for a systematic study of the asymptotic…

We present several criteria for genuine multipartite entanglement from universal uncertainty relations based on majorization theory. Under non-negative Schur-concave functions, the vector-type uncertainty relation generates a family of…

We consider the observability model in networks with arbitrary topologies. We introduce a system of coupled nonlinear equations, valid under the locally tree-like ansatz, to describe the size of the largest observable cluster as a function…

Abstract separation systems provide a simple general framework in which both tree-shape and high cohesion of many combinatorial structures can be expressed, and their duality proved. Applications range from tangle-type duality and tree…

The vertices of an interval graph represent intervals over a real line where overlapping intervals denote that their corresponding vertices are adjacent. This implies that the vertices are measurable by a metric and there exists a linear…

When can a map between manifolds be deformed away from itself? We describe a (normal bordism) obstruction which is often computable and in general much stronger than the classical primary obstruction in cohomology. In particular, it answers…

We consider random graphs sampled uniformly from a structured class of graphs, such as the class of graphs embeddable in a given surface. We sharpen and extend earlier results on pendant appearances, concerning for example numbers of…

We study a class of algebras that can be used as recognisers for regular languages of infinite trees.

Roberston and Seymour introduced tangles of order $k$ as objects representing highly connected parts of a graph and showed that every graph admits a tree-decomposition of adhesion $<k$ in which each tangle of order $k$ is contained in a…

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…

A $(1+\varepsilon)$-stretch tree cover of an edge-weighted $n$-vertex graph $G$ is a collection of trees, where every pair of vertices has a $(1+\varepsilon)$-stretch path in one of the trees. The celebrated Dumbbell Theorem by Arya et. al.…

The controlled generation of entangled states and their subsequent detection are integral aspects of quantum information science. In this work, we analyse the application of nonlinear witnesses to the verification of entanglement, and we…

In a recent Letter, Yang et al. [Phys. Rev. Lett. 109, 258701 (2012)] introduced the concept of observability transitions: the percolation-like emergence of a macroscopic observable component in graphs in which the state of a fraction of…

We consider entanglement witnesses arising from positive linear maps which generate exposed extremal rays. We show that every entanglement can be detected by one of these witnesses, and this witness detects a unique set of entanglement…

We show how an image can, in principle, be described by the tangles of the graph of its pixels. The tangle-tree theorem provides a nested set of separations that efficiently distinguish all the distinguishable tangles in a graph. This…

We introduce the notion of differential largeness for fields equipped with several commuting derivations (as an analogue to largeness of fields). We lay out the foundations of this new class of "tame" differential fields. We state several…

We consider random graphs with a given degree sequence and show, under weak technical conditions, asymptotic normality of the number of components isomorphic to a given tree, first for the random multigraph given by the configuration model…