Related papers: The chromatic symmetric function in the star-basis
Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension $2+\epsilon$, which admits a fault-tolerant non-Clifford CCZ gate. We investigate the performance of such FSCs as…
Tree-decompositions and treewidth are of fundamental importance in structural and algorithmic graph theory. The "spread" of a tree-decomposition is the minimum integer $s$ such that every vertex lies in at most $s$ bags. A…
The uniform spanning forest (USF) in Z^d is the weak limit of random, uniformly chosen, spanning trees in [-n,n]^d. Pemantle proved that the USF consists a.s. of a single tree if and only if d <= 4. We prove that any two components of the…
Self-consistent field theory (SCFT) is one of the most widely-used framework in studying the equilibrium phase behaviors of inhomogenous polymers. For liquid crystalline polymeric systems, the main numerical challenges of solving SCFT…
In this paper, we consider different aspects of the network functional compression problem where computation of a function (or, some functions) of sources located at certain nodes in a network is desired at receiver(s). The rate region of…
Classification of functional data where observations are curves or trajectories poses unique challenges, particularly under severe class imbalance. Traditional Random Forest algorithms, while robust for tabular data, often fail to capture…
We use modular invariance and crossing symmetry of conformal field theory to reveal approximate reflection symmetries in the spectral decompositions of the partition function in two dimensions in the limit of large central charge and of the…
In the Priority Steiner Tree (PST) problem, we are given an undirected graph $G=(V,E)$ with a source $s \in V$ and terminals $T \subseteq V \setminus \{s\}$, where each terminal $v \in T$ requires a nonnegative priority $P(v)$. The goal is…
Void size function (VSF) contains information of the cosmic large-scale structure (LSS), and can be used to derive the properties of dark energy and dark matter. We predict the VSFs measured from the spectroscopic galaxy survey operated by…
Direct imaging of exoplanets is limited by bright quasi-static speckles in the point spread function (PSF) of the central star. This limitation can be reduced by subtraction of reference PSF images. We have developed an algorithm to…
We introduce a new structural graph parameter called \emph{partial matching width}. For each (sufficiently large) integer $k \geq 1$, we introduce a class $\mathcal{G}_k$ of graphs of treewidth at most $k$ and max-degree $7$ such that for…
Toda Conformal Field Theories (CFTs) form a family of 2d CFTs indexed by semisimple and complex Lie algebras. They are natural generalizations of the Liouville CFT in that they enjoy an enhanced level of symmetry encoded by W-algebras.…
The arboricity $\Gamma$ of a graph is the minimum number of forests its edge set can be partitioned into. Previous approximation schemes were nonconstructive, i.e., they only approximated the arboricity as a value without computing a…
Cubicity of a graph $G$ is the smallest dimension $d$, for which $G$ is a unit disc graph in ${\mathbb{R}}^d$, under the $l^\infty$ metric, i.e. $G$ can be represented as an intersection graph of $d$-dimensional (axis-parallel) unit…
We study a natural problem in graph sparsification, the Spanning Tree Congestion (\STC) problem. Informally, the \STC problem seeks a spanning tree with no tree-edge \emph{routing} too many of the original edges. The root of this problem…
The information content of the minimum spanning tree (MST), used to capture higher-order statistics and information from the cosmic web, is compared to that of the power spectrum for a $\nu\Lambda$CDM model. The measurements are made in…
We present improved learning-augmented algorithms for finding an approximate minimum spanning tree (MST) for points in an arbitrary metric space. Our work follows a recent framework called metric forest completion (MFC), where the learned…
Some general properties of perturbed (rational) CFT in the background metric of symmetric 2D sphere of radius $R$ are discussed, including conformal perturbation theory for the partition function and the large $R$ asymptotic. The truncated…
The stochastic density functional theory (DFT) [Phys. Rev. Lett. 111, 106402 (2013)] is a valuable linear scaling approach to Kohn-Sham DFT that does not rely on the sparsity of the density matrix. Linear (and often sub-linear) scaling is…
The problem of characterizing trees with minimal atom-bond-connectivity index (minimal-ABC trees) has a reputation as one of the most demanding recent open optimization problems in mathematical chemistry. Here firstly, we give an…