Related papers: A canonical tree-of-tangles theorem for structural…
Applications of tangles of connectivity systems suggest a duality between these, in which for two sets $X$ and $Y\!$ the elements $x$ of $X$ map to subsets $Y_x$ of $Y\!$, and the elements $y$ of $Y\!$ map to subsets $X_y$ of $X$, so that…
We study separating systems of the edges of a graph where each member of the separating system is a path. We conjecture that every $n$-vertex graph admits a separating path system of size $O(n)$ and prove this in certain interesting special…
In this paper it is shown that for any network there is a uniquely determined network based on a structure tree that provides a convenient way of determining a minimal cut separating a pair $s, t$ where each of $s, t$ is either a vertex or…
We classify all subterminal schemes by characterizing their point structure, stalks, and topologies. This extends our previous classification of subterminal affine schemes, which correspond to spectra of solid rings.
We prove two theorems on the locally finite decompositions of the cones of divisors by the cones which correspond to canonical and minimal models. We introduce the concept of the numerical linear systems in order to simplify the argument on…
Laminar set systems consist of non-crossing subsets of a universe with set inclusion essentially corresponding to the descendant relationship of a tree, the so-called laminar tree. Laminar set systems lie at the core of many graph…
A foundational question in the theory of linear compartmental models is how to assess whether a model is structurally identifiable -- that is, whether parameter values can be inferred from noiseless data -- directly from the combinatorics…
Let T be a tree with an action of a finitely generated group G. Given a suitable equivalence relation on the set of edge stabilizers of T (such as commensurability, co-elementarity in a relatively hyperbolic group, or commutation in a…
We show that the quantum family of all maps from a finite space to a finite dimensional compact quantum semigroup has a canonical quantum semigroup structure.
The aim of this paper is to show that, in the limit circle case, the defect index of a symmetric relation induced by canonical systems, is constant on C. This provides an alternative proof of the De Branges theorem that the canonical…
This paper gives two new combinatorial topological proofs of the classification of rational tangles. Each proof rests on an elegant lemma showing that rational tangles are isotopic to canonical alternating rational tangles. The first proof…
This is an exposition of the inverse spectral theory of canonical systems based on de Branges spaces of entire functions
We consider the features of multiparticle tree cross sections in scalar theories in the framework of a semiclassical approach. These cross sections at large multiplicities have exponential form, and the properties of the exponent in…
We obtain new results on the geometry of Hilbert modular varieties in positive characteristic and morphisms between them. Using these results and methods of rigid geometry, we develop a theory of canonical subgroups for abelian varieties…
We develop the basic theory of projective modules and splitting in the more general setting of systems. Systems provide a common language for most tropical algebraic approaches including supertropical algebra, hyperrings (specifically…
There are many results asserting the existence of tree-decompositions of minimal width which still represent local connectivity properties of the underlying graph, perhaps the best-known being Thomas' theorem that proves for every graph $G$…
Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…
Trees are partial orders in which every element has a linearly ordered set of predecessors. Here we initiate the exploration of the structural theory of trees with the study of different notions of \emph{branching in trees} and of…
We introduce essential subtrees for terms (trees) and tree automata . There are some results concerning independent sets of subtrees and separable sets for a tree and an automaton.
We prove that every quasi-projective semi log canonical pair has a quasi-log structure with several good properties. It implies that various vanishing theorems, torsion-free theorem, and the cone and contraction theorem hold for semi log…