From the 1 of 6 linked papers with an AI index.
6 papers
Resource-efficient Semantic Coding Schemes with Manifold-constrained Hyper-connections
Jingwen Fu, Ming Xiao
Semantic communication (SemCom) and task-oriented communication (TOC) can reduce wireless resource consumption by focusing on transmitting semantic or task-relevant information ins…
An Optimal Bound for Ramsey Goodness of Cycles
Peiru Kuang, Yan Wang
The paper proves that for any nonempty graph H, the Ramsey number of a cycle C_n versus H satisfies R(C_n, H) = (χ(H)−1)(n−1)+σ(H) whenever n is at least a constant times |H|, conf…
Solutions to Two Problems of Sárközy and Sós on Additive Representation Functions
Peiru Kuang, Yan Wang
For a set , let denote the number of solutions of the equation with , and let denote the number of…
Nearly tight bound for rainbow clique subdivisions in properly edge-colored graphs and applications
Peiru Kuang, Yan Wang
An edge-colored graph is said to be rainbow if all its edges have distinct colors. In this paper, we study the rainbow analogue of a fundamental result of Mader [\emph{Math. Ann.}…
Tight bounds for judicious 3-partitions of graphs
Peiru Kuang, Yan Wang
In this paper, we show that every graph with edges admits a 3-partition such that \[ \max_{1 \leq i \leq 3} e(V_i) \leq \frac{m}{9} + \frac{1}{9}h(m) \quad \text{and} \quad e(V…
Consecutive and quasi-consecutive patterns: -Wilf classifications and generating functions
Yan Wang, Qi Fang, Shishuo Fu +2
Motivated by a correlation between the distribution of descents over permutations that avoid a consecutive pattern and those avoiding the respective quasi-consecutive pattern, as e…