Related papers: E = I + T: The internal extent formula for compact…
A general one-loop scattering amplitude may be expanded in terms of master integrals. The coefficients of the master integrals can be obtained from tree-level input in a two-step process. First, use known formulas to write the coefficients…
A shortcut of a directed path $v_1 v_2 \cdots v_n$ is an edge $v_iv_j$ with $j > i+1$. If $j = i+2$ the shortcut is called a hop. If all hops are present, the path is called hop complete, so the path and its hops form a square of a path. We…
We study compactifications of the $N=2$ 6D tensionless string on various complex two-folds down to two-dimensions. In the IR limit they become non-trivial conformal field theories in 2D. Using results of Vafa and Witten on the partition…
A suffix tree is a data structure used mainly for pattern matching. It is known that the space complexity of simple suffix trees is quadratic in the length of the string. By a slight modification of the simple suffix trees one gets the…
We prove that the extension complexity of the independence polytope of every regular matroid on $n$ elements is $O(n^6)$. Past results of Wong and Martin on extended formulations of the spanning tree polytope of a graph imply a $O(n^2)$…
Tree-width is an invaluable tool for computational problems on graphs. But often one would like to compute on other kinds of objects (e.g. decorated graphs or even algebraic structures) where there is no known tree-width analogue. Here we…
This paper introduces a series of methods for traversing binary decision trees using arithmetic operations. We present a suite of binary tree traversal algorithms that leverage novel representation matrices to flatten the full binary tree…
We construct an unfolding path in Outer space which does not converge in the boundary, and instead it accumulates on the entire 1-simplex of projectivized length measures on a non-geometric arational $\mathbb{R}$-tree T. We also show that T…
Combinatorial classes T that are recursively defined using combinations of the standard multiset, sequence, directed cycle and cycle constructions, and their restrictions, have generating series T(z) with a positive radius of convergence;…
This paper investigates the relationships between closed and mixed string amplitudes at the tree level in string theory. Through the analytic continuation of complex variables, we establish a factorization of closed string amplitudes into…
An important problem in geometric computing is defining and computing similarity between two geometric shapes, e.g. point sets, curves and surfaces, etc. Important geometric and topological information of many shapes can be captured by…
The derivative expnsion in the context of IIB string scattering compactified on non-trivial K3 and other Calabi-Yau manifolds is formulated. The scattering data in terms of automorphic functions can be inverted to find the these metrics.…
In this paper we investigate the use of the concept of tree dimension in Horn clause analysis and verification. The dimension of a tree is a measure of its non-linearity - for example a list of any length has dimension zero while a complete…
We study cyclic binary strings with bounds on the lengths of the intervals of consecutive ones and zeros. This is motivated by scheduling problems where such binary strings can be used to represent the state (on/off) of a machine. In this…
Regular tree grammars and regular path expressions constitute core constructs widely used in programming languages and type systems. Nevertheless, there has been little research so far on reasoning frameworks for path expressions where node…
Among subgraphs with a fixed number of vertices of the regular square lattice, we prove inequalities that essentially say that those with smaller boundaries have larger numbers of spanning trees and vice-versa. As an application, we relate…
We present approximation algorithms for the following NP-hard optimization problems related to bottleneck spanning trees in metric spaces. 1. The disjoint bottleneck spanning tree problem: Given $n$ pairs of points in a metric space, find…
A tanglegram consists of two rooted binary trees with the same number of leaves and a perfect matching between the leaves of the trees. Given a size-$n$ tanglegram, i.e., a tanglegram for two trees with $n$ leaves, a multiset of induced…
Graph pebbling is a network model for transporting discrete resources that are consumed in transit. Deciding whether a given configuration on a particular graph can reach a specified target is ${\sf NP}$-complete, even for diameter two…
In the longest plane spanning tree problem, we are given a finite planar point set $\mathcal{P}$, and our task is to find a plane (i.e., noncrossing) spanning tree for $\mathcal{P}$ with maximum total Euclidean edge length. Despite more…