Related papers: On the missing branches of the Bruhat-Tits tree
Suppose $k$ is a nonarchimedean local field, $K$ is a maximally unramified extension of $k$, and $\mathbf{G}$ is a connected reductive $k$-group. If $\mathbf{T}$ is a $K$-minisotropic maximal $k$-torus in $\mathbf{G}$, then we use…
We classify cuts in (totally) ordered abelian groups $\g$ and compute the coinitiality and cofinality of all cuts in case $\g$ is divisible, in terms of data intrinsically associated to the invariance group of the cut. We relate cuts with…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number…
We study the computational content of various theorems with reverse mathematical strength around Arithmetical Transfinite Recursion ($\mathsf{ATR}_0$) from the point of view of computability-theoretic reducibilities, in particular Weihrauch…
We present a general method for obtaining strong bounds for discrete optimization problems that is based on a concept of branching duality. It can be applied when no useful integer programming model is available, and we illustrate this with…
Recently proposed budding tree is a decision tree algorithm in which every node is part internal node and part leaf. This allows representing every decision tree in a continuous parameter space, and therefore a budding tree can be jointly…
K-theory provides a framework for classifying Ramond-Ramond (RR) charges and fields. K-theory of manifolds has a natural extension to K-theory of noncommutative algebras, such as the algebra considered in noncommutative Yang-Mills theory or…
Littlewood--Offord Problem concerns the number of subsums of a set of vectors that fall in a given convex set. We present a discrete variation of this problem where we estimate the number of subsums that are $(0,1)$-vectors. We then utilize…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
We present an order-theoretic approach to the study of countably infinite locally 2-arc-transitive bipartite graphs. Our approach is motivated by techniques developed by Warren and others during the study of cycle-free partial orders. We…
A tree with at most $k$ leaves is called a $k$-ended tree. A spanning 2-ended tree is a Hamilton path. A Hamilton cycle can be considered as a spanning 1-ended tree. The earliest result concerning spanning trees with few leaves states that…
We propose a new topological invariant of unlabeled trees of N nodes. The invariant is a set of Nx2 matrices of integers, with sum_j k^{d_{i,j}} and v_i as the matrix elements, where d_{i,j} are the elements of the distance matrix and v_i…
We study an abstract notion of tree structure which lies at the common core of various tree-like discrete structures commonly used in combinatorics: trees in graphs, order trees, nested subsets of a set, tree-decompositions of graphs and…
The classical Ehresmann-Bruhat order describes the possible degenerations of a pair of flags in a finite-dimensional vector space V; or, equivalently, the closure of an orbit of the group GL(V) acting on the direct product of two full flag…
Motivated by the question of how macromolecules assemble, the notion of an {\it assembly tree} of a graph is introduced. Given a graph $G$, the paper is concerned with enumerating the number of assembly trees of $G$, a problem that applies…
Decision tree optimization is fundamental to interpretable machine learning. The most popular approach is to greedily search for the best feature at every decision point, which is fast but provably suboptimal. Recent approaches find the…
Decision Tree (DT) Learning is a fundamental problem in Interpretable Machine Learning, yet it poses a formidable optimisation challenge. Practical algorithms have recently emerged, primarily leveraging Dynamic Programming and Branch &…
We propose a new arithmetic for non-empty rooted unordered trees simply called trees. After discussing tree representation and enumeration, we define the operations of tree addition, multiplication and stretch, prove their properties, and…
Knots are commonly represented and manipulated via diagrams, which are decorated planar graphs. When such a knot diagram has low treewidth, parameterized graph algorithms can be leveraged to ensure the fast computation of many invariants…
Pairs $\aa \subset \bb$ of local quantum field theories are studied, where $\aa$ is a chiral conformal \qft and $\bb$ is a local extension, either chiral or two-dimensional. The local correlation functions of fields from $\bb$ have an…