Related papers: The chromatic symmetric function in the star-basis

We give a succinct data-structure that stores a tree with colors on the nodes. Given a node x and a color alpha, the structure finds the nearest node to x with color alpha. This results improves the $O(n\log n)$-bits structure of…

Widefield surveys of the sky probe many clustered scalar fields -- such as galaxy counts, lensing potential, gas pressure, etc. -- that are sensitive to different cosmological and astrophysical processes. Our ability to constrain such…

Measuring distances of cosmological sources such as galaxies, stars and quasars plays an increasingly critical role in modern cosmology. Obtaining the optical spectrum and consequently calculating the redshift as a distance indicator could…

Anisoplanatic effects can cause significant systematic photometric uncertainty in the analysis of dense stellar fields observed with adaptive optics. Program packages have been developed for a spatially variable PSF, but they require that a…

This chapter presents controlled approximations of Kohn-Sham density functional theory (DFT) that enable very large scale simulations. The work is motivated by the study of defects in crystalline solids, though the ideas can be used in…

The chromatic symmetric function (CSF) of Dyck paths of Stanley and its Shareshian-Wachs $q$-analogue have important connections to Hessenberg varieties, diagonal harmonics, and LLT polynomials. In the case of, so-called, abelian Dyck paths…

The minimum spanning tree (MST) is a combinatorial optimization problem: given a connected graph with a real weight ("cost") on each edge, find the spanning tree that minimizes the sum of the total cost of the occupied edges. We consider…

Simple flavor symmetry argument without QCD dynamics shows why CP violation observed in neutral $B$ to $K\pi$ decays is absent in charged B decays where tree diagram final state has two $u$ quarks satisfying Pauli principle. Entanglement…

The Angular Constrained Minimum Spanning Tree Problem ($\alpha$-MSTP) is defined in terms of a complete undirected graph $G=(V,E)$ and an angle $\alpha \in (0,2\pi]$. Vertices of $G$ define points in the Euclidean plane while edges, the…

R.P. Stanley defined a invariant for graphs called the chromatic symmetric function and conjectured it is complete invariant for trees. Miezaki et al. generalised the chromatic symmetric function and defined the Kneser chromatic functions…

It has recently been shown that configuration state functions (CSF) with local orbitals can provide a compact reference state for low-spin open-shell electronic structures, such as antiferromagnetic states. However, optimizing a low-spin…

In this paper we study a family of discrete configuration spaces, the so-called protocol complexes, which are of utmost importance in theoretical distributed computing. Specifically, we consider questions of the existance of compliant…

We explore statistical inference in self-similar conservative fragmentation chains when only approximate observations of the sizes of the fragments below a given threshold are available. This framework, introduced by Bertoin and Martinez…

This paper presents a novel stochastic barrier function (SBF) framework for safety analysis of stochastic systems based on piecewise (PW) functions. We first outline a general formulation of PW-SBFs. Then, we focus on PW-Constant (PWC) SBFs…

We study the structure of trees minimizing their number of stable sets for given order $n$ and stability number $\alpha$. Our main result is that the edges of a non-trivial extremal tree can be partitioned into $n-\alpha$ stars, each of…

We test the efficacy of the energy-balance spectral energy distribution (SED) fitting code Magphys for recovering the spatially-resolved properties of a simulated isolated disc galaxy, for which it was not designed. We perform 226,950…

We propose a method for finding a cumulative distribution function (cdf) that minimizes the distance to a given cdf, while belonging to an ambiguity set constructed relative to another cdf and, possibly, incorporating soft information. Our…

Variational approximation, such as mean-field (MF) and tree-reweighted (TRW), provide a computationally efficient approximation of the log-partition function for a generic graphical model. TRW provably provides an upper bound, but the…

Let $f$ be a proper $k$-coloring of a connected graph $G$ and $\Pi=(V_1,V_2,\ldots,V_k)$ be an ordered partition of $V(G)$ into the resulting color classes. For a vertex $v$ of $G$, the color code of $v$ with respect to $\Pi$ is defined to…

We present the first mathematical analysis of stochastic density functional theory (DFT) in the context of the Hartree approximation. We motivate our analysis via the notion of nearly-optimal or $\tilde{O}(n)$ scaling with respect to the…