相关论文: The chromatic symmetric function in the star-basis
We consider the problem of approximating partition functions for Ising models. We make use of recent tools in combinatorial optimization: the Sherali-Adams and Lasserre convex programming hierarchies, in combination with variational methods…
We introduce the spanning tree matching (STM) decoder for surface codes, which guarantees the error correction capability up to the code's designed distance by first employing an instance of the minimum spanning tree on a subset of ancilla…
We prove that the coefficient of the star $\mathfrak{st}_{21^{n-2}}$ in the chromatic symmetric function $X_G$ determines whether a connected graph $G$ is $2$-connected. We also prove new linear relations on other star coefficients of…
Graham and Sloane proposed in 1980 a conjecture stating that every tree has a harmonious labelling, a graph labelling closely related to additive base. Very limited results on this conjecture are known. In this paper, we proposed a…
We consider a class of structured fractional minimization problems, in which the numerator part of the objective is the sum of a differentiable convex function and a convex non-smooth function, while the denominator part is a convex or…
Spatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications. They also find application in various data storage systems because of their…
Stochastic approximation techniques have been used in various contexts in data science. We propose a stochastic version of the forward-backward algorithm for minimizing the sum of two convex functions, one of which is not necessarily…
Interactive graph-based segmentation methods partition an image into foreground and background regions with the aid of user inputs. However, existing approaches often suffer from high computational costs, sensitivity to user interactions,…
We construct fermionic conformal field theories (CFTs) whose spectra are characterized by quantum stabilizer codes. We exploit our construction to search for fermionic CFTs with supersymmetry by focusing on quantum stabilizer codes of the…
Spectroscopic redshift surveys offer great prospects for constraining the dark sector in cosmology. Future surveys will however be both deep and wide and will thus require an analysis in 3-dimensional spherical geometry. We review and…
We apply a spherical harmonic analysis to the Point Source Redshift Survey (PSCz), to compute the real-space galaxy power spectrum and the degree of redshift distortion caused by peculiar velocities. We employ new parameter eigenvector and…
This thesis develops computational methods in similarity-preserving hashing, classification, and cancer genomics. Standard space partitioning-based hashing relies on Binary Search Trees (BSTs), but their exponential growth and sparsity…
When searching for deviations of statistical isotropy in CMB, a popular strategy is to write the two-point correlation function (2pcf) as the most general function of four spherical angles (i.e., two unit vectors) in the celestial sphere.…
In this paper, we establish that the number of partitions of a natural number with positive odd rank is equal to the number of two-color partitions (red and blue), where the smallest part is even (say $2n$) and all red parts are even and…
We introduce our new binary tree code for neighbour search and gravitational force calculations in an N-particle system. The tree is built in a "top-down" fashion by "recursive coordinate bisection" where on each tree level we split the…
We discuss the statistical foundations of morphological star-galaxy separation. We show that many of the star-galaxy separation metrics in common use today (e.g. by SDSS or SExtractor) are closely related both to each other, and to the…
Wavelength-dependent point spread functions (PSFs) violate an implicit assumption in current galaxy shape measurement algorithms that deconvolve the PSF measured from stars (which have stellar spectral energy distributions (SEDs)) from…
We study an implementation of the theoretical splitting scheme introduced in [Chassagneux and Yang, 2022] for singular FBSDEs [Carmona and Delarue 2013] and their associated quasi-linear degenerate PDEs. The fully implementable algorithm is…
We study the problem of building space-efficient, in-memory indexes for massive key-value datasets with highly skewed value distributions. This challenge arises in many data-intensive domains and is particularly acute in computational…
The Steiner tree problem aims to determine a minimum edge-weighted tree that spans a given set of terminal vertices from a given graph. In the past decade, a considerable number of algorithms have been developed to solve this…