相关论文: The chromatic symmetric function in the star-basis
Noise reduction constitutes a crucial operation within Digital Signal Processing. Regrettably, it frequently remains neglected when dealing with the processing of convolutional features in segmentation networks. This oversight could trigger…
In 2020, Dahlberg, She, and van Willigenburg conjectured that the chromatic symmetric function of any tree with maximum degree at least 4 is not e-positive. Zheng and Tom verified this conjecture for all trees with maximum degree at least 5…
We present an application of the Richardson-Lucy algorithm to the analysis of color-magnitude diagrams by converting the CMD into an image and using a restoring point spread function function ({\it psf}) derived from the known, often…
We apply the theory of harmonic analysis on the fundamental domain of $SL(2,\mathbb{Z})$ to partition functions of two-dimensional conformal field theories. We decompose the partition function of $c$ free bosons on a Narain lattice into…
For a graph $G$, the tree graph ${\cal T}_{G,t}$ has all tree subgraphs of $G$ with $t$ vertices as vertex set and two tree subgraphs are neighbors if they are edge-disjoint. Also, the $r^{th}$ cut number of $G$ is the minimum number of…
Richard Stanley defined the chromatic symmetric function $X_G$ of a graph $G$ and asked whether there are non-isomorphic trees $T$ and $U$ with $X_T=X_U$. We study variants of the chromatic symmetric function for rooted graphs, where we…
The convergence property of a stochastic algorithm for the self-consistent field (SCF) calculations of electron structures is studied. The algorithm is formulated by rewriting the electron charges as a trace/diagonal of a matrix function,…
An \emph{acyclic coloring} of a graph is a proper vertex coloring such that the union of any two color classes induces a disjoint collection of trees. The more restricted notion of \emph{star coloring} requires that the union of any two…
In this paper, we introduce and study two variants of the chromatic quasisymmetric function of a graph: the total chromatic quasisymmetric function via vertex labeling and via acyclic orientations. The original definition of the chromatic…
Cosmological studies of large-scale structure have relied on two-point statistics, not fully exploiting the rich structure of the cosmic web. In this paper we show how to capture some of this cosmic web information by using the minimum…
We present results of a study aiming at shedding light on the specific advantages and limitations of methods to derive star formation histories (SFH) in galaxies using resolved stellar populations and using integrated light, respectively.…
We present a mean-field approach to simulating merging processes of two spherical collisionless stellar systems. This approach is realized with a self-consistent field (SCF) method in which the full spatial dependence of the density and…
Phylogenetic trees are leaf-labelled trees used to model the evolution of species. In practice it is not uncommon to obtain two topologically distinct trees for the same set of species, and this motivates the use of distance measures to…
The use of summary statistics beyond the two-point correlation function to analyze the non-Gaussian clustering on small scales is an active field of research in cosmology. In this paper, we explore a set of new summary statistics -- the…
In this paper we prove results regarding Boolean functions with small spectral norm (the spectral norm of f is $\|\hat{f}\|_1=\sum_{\alpha}|\hat{f}(\alpha)|$). Specifically, we prove the following results for functions $f:\{0,1\}^n \to…
We prove that for any tree with a vertex of degree at least six, its chromatic symmetric function is not $e$-positive, that is, it cannot be written as a nonnegative linear combination of elementary symmetric functions. This makes…
The constraint satisfaction problem (CSP) has important applications in computer science and AI. In particular, infinite-domain CSPs have been intensively used in subareas of AI such as spatio-temporal reasoning. Since constraint…
We describe a rational approach to reduce the computational and communication complexities of lossless point-to-point compression for computation with side information. The traditional method relies on building a characteristic graph with…
We introduce decorated sweep covers as a colouring on maximal antichains in tree posets such that if two elements have the same colour they are siblings. DSCs appear in applications wherever maximal antichains require structural…
To model discriminative, i.e. competition induced, self-thinning in even-aged forest stands a concept has been explored that discriminative mortality alters spatial arrangement of trees which in turn alters the mortality. Function of…