Related papers: Shelling Coxeter-like Complexes and Sorting on Tre…
The rational Calogero model based on an arbitrary rank-$n$ Coxeter root system is spherically reduced to a superintegrable angular model of a particle moving on $S^{n-1}$ subject to a very particular potential singular at the reflection…
We introduce a graph-theoretic condition, called $(n,m)$--branching, that ensures a combinatorial round tree with controlled branching parameters can be quasi-isometrically embedded in the Davis complex of the right-angled Coxeter group…
We study the asymptotic behavior af the number of cuts $X(T_n)$ needed to isolate the root in a rooted binary random tree $T_n$ with $n$ leaves. We focus on the case of subtrees of the Continuum Random Tree generated by uniform sampling of…
We prove various iteration theorems for forcing classes related to subproper and subcomplete forcing, introduced by Jensen. In the first part, we use revised countable support iterations, and show that 1) the class of subproper,…
We present a conceptually clear and algorithmically useful framework for parameterizing the costs of tensor network contraction. Our framework is completely general, applying to tensor networks with arbitrary bond dimensions, open legs, and…
Comparative analysis of scalar fields in scientific visualization often involves distance functions on topological abstractions. This paper focuses on the merge tree abstraction (representing the nesting of sub- or superlevel sets) and…
We study a partially ordered set of planar labeled rooted trees by use of combinatorial objects called Dyck tilings. A generating function of the poset is factorized when the minimum element of the poset is $312$-avoiding and satisfies some…
Intrinsic complexity of a relation on a given computable structure is captured by the notion of its degree spectrum - the set of Turing degrees of images of the relation in all computable isomorphic copies of that structure. We investigate…
Constrained Forest Problems (CFPs) as introduced by Goemans and Williamson in 1995 capture a wide range of network design problems with edge subsets as solutions, such as Minimum Spanning Tree, Steiner Forest, and Point-to-Point Connection.…
A pebble tree is an ordered tree where each node receives some colored pebbles, in such a way that each unary node receives at least one pebble, and each subtree has either one more or as many leaves as pebbles of each color. We show that…
In this paper, we initiate the study of the twisted weak order associated to a twisted Bruhat order for a Coxeter group and explore the relationship between the lattice property of such order and the infinite reduced words. We show that for…
We study the low-degree hardness of broadcasting on trees. Broadcasting on trees has been extensively studied in statistical physics, in computational biology in relation to phylogenetic reconstruction and in statistics and computer science…
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 $G$ be a connected reductive algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p \ge 0$, and let $\mathcal{N}$ be its nilpotent cone. Under mild hypotheses, we construct for each nilpotent $G$-orbit $C$ and…
In the decision tree computation model for Boolean functions, the depth corresponds to query complexity, and size corresponds to storage space. The depth measure is the most well-studied one, and is known to be polynomially related to…
Inference of species networks from genomic data under the Network Multispecies Coalescent Model is currently severely limited by heavy computational demands. It also remains unclear how complicated networks can be for consistent inference…
Suppose N is a phylogenetic network indicating a complicated relationship among individuals and taxa. Often of interest is a much simpler network, for example, a species tree T, that summarizes the most fundamental relationships. The…
A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…
We introduce an algorithm that performs a one-directional mesh overset of a parallel forest of octrees with another distributed mesh of unrelated partition. The forest mesh consists of several adaptively refined octrees. Individual smooth…
Let $\mathcal{X}$ be a skew-symmetrizable cluster Poisson variety. The cluster complex $\Delta^+(\mathcal{X})$ was introduced by Gross, Hacking, Keel and Kontsevich. It codifies the theta functions on $\mathcal{X}$ that restrict to a…