Related papers: On correlation distribution of Niho-type decimatio…
We show that determining the crossing number of a link is NP-hard. For some weaker notions of link equivalence, we also show NP-completeness.
The Cluster Deletion problem takes a graph $G$ as input and asks for a minimum size set of edges $X$ such that $G-X$ is the disjoint union of complete graphs. An equivalent formulation is the Clique Partition problem, which asks to find a…
We examine the computational complexity of approximately counting the list H-colourings of a graph. We discover a natural graph-theoretic trichotomy based on the structure of the graph H. If H is an irreflexive bipartite graph or a…
The cross-ratio degree problem is about counting rational curves with $n$ marked points satisfying $n-3$ cross-ratio conditions. This problem has a tropical analogue which provides the same number, as shown by a correspondence theorem. In…
The k-truss model is one of the most important models in cohesive subgraph analysis. The k-truss decomposition problem is to compute the trussness of each edge in a given graph, and has been extensively studied. However, the conventional…
We present time-efficient distributed algorithms for decomposing graphs with large edge or vertex connectivity into multiple spanning or dominating trees, respectively. As their primary applications, these decompositions allow us to achieve…
We consider recursive decoding techniques for RM codes, their subcodes, and newly designed codes. For moderate lengths up to 512, we obtain near-optimum decoding with feasible complexity.
We characterize the communication complexity of the following distributed estimation problem. Alice and Bob observe infinitely many iid copies of $\rho$-correlated unit-variance (Gaussian or $\pm1$ binary) random variables, with unknown…
In this paper we consider the $p$-Norm Hamming Centroid problem which asks to determine whether some given binary strings have a centroid with a bound on the $p$-norm of its Hamming distances to the strings. Specifically, given a set of…
Using conformal field theory, we derive several new crossing formulas at the two-dimensional percolation point. High-precision simulation confirms these results. Integrating them gives a unified derivation of Cardy's formula for the…
Applying the theory of Yang-Lee zeros to nonequilibrium critical phenomena, we investigate the properties of a directed bond percolation process for a complex percolation parameter p. It is shown that for the Golden Ratio…
The Hamilton-Waterloo problem asks for a decomposition of the complete graph into $r$ copies of a 2-factor $F_{1}$ and $s$ copies of a 2-factor $F_{2}$ such that $r+s=\left\lfloor\frac{v-1}{2}\right\rfloor$. If $F_{1}$ consists of…
The determination of the weight distribution of linear codes has been a fascinating problem since the very beginning of coding theory. There has been a lot of research on weight enumerators of special cases, such as self-dual codes and…
We explore the clearing problem in the barter exchange market. The problem, described in the terminology of graph theory, is to find a set of vertex-disjoint, length-restricted cycles that maximize the total weight in a weighted digraph.…
Drawing graphs with the minimum number of crossings is a classical problem that has been studied extensively. Many restricted versions of the problem have been considered. For example, bipartite graphs can be drawn such that the two sets in…
Let $m\geq 3$ be an odd integer and $p$ be an odd prime. % with $p-1=2^rh$, where $h$ is an odd integer. In this paper, many classes of three-weight cyclic codes over $\mathbb{F}_{p}$ are presented via an examination of the condition for…
We propose a bit-flip descent method for optimizing binary spreading codes with large family sizes and long lengths, addressing the challenges of large-scale code design in GNSS and emerging PNT applications. The method iteratively flips…
The Hamming weight enumerator function of the formally self-dual even, binary extended quadratic residue code of prime p = 8m + 1 is given by Gleason's theorem for singly-even code. Using this theorem, the Hamming weight distribution of the…
We have studied how lepton pairs from decays of heavy-flavoured mesons produced in p$A$ collisions can be used to determine the modifications of the gluon distribution in the nucleus. Since heavy quark production is dominated by the $gg$…
The classical Crossing Lemma by Ajtai et al.~and Leighton from 1982 gave an important lower bound of $c \frac{m^3}{n^2}$ for the number of crossings in any drawing of a given graph of $n$ vertices and $m$ edges. The original value was $c=…