SearcharxivSearch

arXiv subjects

Hengrui Liu

Publications and source records attributed to Hengrui Liu.

8 recordsLinked to original sources

Kneserized Anticoncentration and Reverse Absorption for Graham's Rearrangement Conjecture

We establish a Kneser-based anticoncentration estimate for uniform subset sums in composite cyclic groups. The estimate contains a periodic loss and is weaker than its prime-modulus counterpart. Nevertheless, together with known small- and large-set results, it proves that, for every fixed $t\geq2$ such that $\mathbb{Z}_t$ is strongly sequenceable and every sufficiently large prime $p$, every subset of $\mathbb{Z}_{tp}\setminus\{0\}$ has a valid ordering, thus establishing the analogue of Graham's rearrangement conjecture for this family of composite cyclic groups. We then identify the structural source of this loss. An inverse theorem shows that failure of the stabilizer-free growth underlying prime-type anticoncentration forces almost all of the set into a proper subgroup or one of its cosets. We exploit this structure by reverse absorption. Iterating the resulting dichotomy between non-periodic anticoncentration and structured concentration proves that every subset of \[ \mathbb{Z}_k\setminus\{0\}, \qquad k=\prod_{i=1}^{s}p_i^{e_i}, \qquad \sum_{i=1}^{s}e_i\leq L, \qquad p_1<\cdots<p_s\leq\gamma p_1, \] admits a valid ordering whenever $L$ and $\gamma$ are fixed and the primes $p_i$ are sufficiently large.

math.CO

HumanForge: A Human-Centric Deepfake Video Benchmark with Multi-Agent Forgery Rationales

Rapid advancements in video diffusion models and temporal editing tools have enabled the generation of highly realistic human-centric videos, presenting unprecedented challenges to digital content forensics. Existing benchmarks primarily focus on face-swapping or global text-to-video synthesis, overlooking the crucial dimensions of multimodal alignment and complex human-object or human-human interactions. To address these limitations, we introduce HumanForge, a unified, large-scale, and multi-paradigm human-centric video forgery benchmark containing over 18,000 synthesized videos across four distinct scenarios: audio-driven, pose-driven, semantic-driven, and interaction. To construct and annotate this dataset without labor-intensive manual labeling or blind monolithic prompting, we propose Gen2Anno (Generation-to-Annotation), a cooperative multi-agent pipeline. Gen2Anno orchestrates six specialized agents-ranging from driving asset profiling to MoE-based reference analysis and closed-loop verification-to dynamically execute video synthesis and produce structured annotations containing binary authenticity labels, generative model attribution, and natural-language contrastive forgery rationales. By systematically contrasting expected states derived from generation provenance with actual visual observations, the framework generates logically grounded forensic reasoning chains. Extensive benchmarks using state-of-the-art traditional detectors and Vision-Language Models demonstrate the significant challenges of cross-generator generalization, perturbation robustness, and explainable reasoning on HumanForge. The code and dataset will be publicly released.

cs.CV

Fractional clique decompositions of dense balanced multipartite graphs

This paper concerns fractional $K_s$-decompositions of multipartite graphs. For integers $r\ge s\ge 3$, we consider balanced $r$-partite graphs $G$ on $rn$ vertices. We establish necessary conditions for $G$ to admit a fractional $K_s$-decomposition, extending the notion of $s$-admissibility from the case $r=s$ to $r>s$. Using an association scheme on the edge set of a complete $r$-partite graph, we prove that if $r\ge s+2$ and the partite minimum degree of $G$ is at least $(1-c)n$ with $c\le 1/((s-2)(s+1)(s-1)^4)$, then $G$ has a fractional $K_s$-decomposition. For $r=s+1$, we show that under the condition $c\le 1/(3s^3(s-2)^2)$, every $s$-admissible balanced $(s+1)$-partite graph with partite minimum degree at least $(1-c)n$ admits a fractional $K_s$-decomposition. These results provide new degree thresholds for fractional $K_s$-decompositions of multipartite graphs with more than $s$ parts.

math.CO

Perfect difference families, perfect systems of difference sets and their applications

Let $v$ be a positive odd integer. A $(v,k,\lambda)$-perfect difference family (PDF) is a collection $\mathcal{F}$ of $k$-subsets of $\{0,1,\ldots,v-1\}$ such that the multiset $\bigcup_{F\in \mathcal{F}}\{x-y : x,y\in F, x>y\}$ covers each element of $\left\{1,2,\ldots,(v-1)/2\right\}$ exactly $\lambda$ times. Perfect difference families are a special class of perfect systems of difference sets. They were introduced by Bermond, Kotzig, and Turgeon in the 1970s, following a problem suggested by Erd\H{o}s. In this paper, we prove that a $(v,4,\lambda)$-PDF exists if and only if $\lambda(v-1) \equiv 0 \pmod{12}$, $v \geq 13$, and $(v,\lambda) \notin \{(25,1),(37,1)\}$. This result resolves a nearly 50-year-old conjecture posed by Bermond. Perfect difference families find applications in radio astronomy, optical orthogonal codes for optical code-division multiple access systems, geometric orthogonal codes for DNA origami, difference triangle sets, additive sequences of permutations, and graceful graph labelings. To establish our main result, we introduce a new concept termed a layered difference family. This concept provides a powerful and unified perspective that not only facilitates our proof of the main theorem but also simplifies recent existence proofs for various cyclic difference packings.

math.CO

PILOC: A Pheromone Inverse Guidance Mechanism and Local-Communication Framework for Dynamic Target Search of Multi-Agent in Unknown Environments

Multi-Agent Search and Rescue (MASAR) plays a vital role in disaster response, exploration, and reconnaissance. However, dynamic and unknown environments pose significant challenges due to target unpredictability and environmental uncertainty. To tackle these issues, we propose PILOC, a framework that operates without global prior knowledge, leveraging local perception and communication. It introduces a pheromone inverse guidance mechanism to enable efficient coordination and dynamic target localization. PILOC promotes decentralized cooperation through local communication, significantly reducing reliance on global channels. Unlike conventional heuristics, the pheromone mechanism is embedded into the observation space of Deep Reinforcement Learning (DRL), supporting indirect agent coordination based on environmental cues. We further integrate this strategy into a DRL-based multi-agent architecture and conduct extensive experiments. Results show that combining local communication with pheromone-based guidance significantly boosts search efficiency, adaptability, and system robustness. Compared to existing methods, PILOC performs better under dynamic and communication-constrained scenarios, offering promising directions for future MASAR applications.

cs.RO

Evaluating Gemini in an arena for learning

Artificial intelligence (AI) is poised to transform education, but the research community lacks a robust, general benchmark to evaluate AI models for learning. To assess state-of-the-art support for educational use cases, we ran an "arena for learning" where educators and pedagogy experts conduct blind, head-to-head, multi-turn comparisons of leading AI models. In particular, $N = 189$ educators drew from their experience to role-play realistic learning use cases, interacting with two models sequentially, after which $N = 206$ experts judged which model better supported the user's learning goals. The arena evaluated a slate of state-of-the-art models: Gemini 2.5 Pro, Claude 3.7 Sonnet, GPT-4o, and OpenAI o3. Excluding ties, experts preferred Gemini 2.5 Pro in 73.2% of these match-ups -- ranking it first overall in the arena. Gemini 2.5 Pro also demonstrated markedly higher performance across key principles of good pedagogy. Altogether, these results position Gemini 2.5 Pro as a leading model for learning.

cs.CY

Existence of magic rectangle sets over finite abelian groups

Let $a$, $b$ and $c$ be positive integers. Let $(G,+)$ be a finite abelian group of order $abc$. A $G$-magic rectangle set MRS$_G(a,b;c)$ is a collection of $c$ arrays of size $a\times b$ whose entries are elements of a group $G$, each appearing exactly once, such that the sum of each row in every array equals a constant $γ\in G$ and the sum of each column in every array equals a constant $δ\in G$. This paper establishes the necessary and sufficient conditions for the existence of an MRS$_G(a,b;c)$ for any finite abelian group $G$, thereby confirming a conjecture presented by Cichacz and Hinc.

math.CO

Si3AlP: A new promising material for solar cell absorber

First-principles calculations are performed to study the structural and optoelectronic properties of the newly synthesized nonisovalent and lattice-matched (Si2)0.6(AlP)0.4 alloy [T. Watkins et al., J. Am. Chem. Soc. 2011, 133, 16212.] We find that the ordered CC-Si3AlP with a basic unit of one P atom surrounded by three Si atoms and one Al atom is the most stable one within the experimentally observed unit cell.1 Si3AlP has a larger fundamental band gap and a smaller direct band gap than Si, thus it has much higher absorption in the visible light region. The calculated properties of Si3AlP suggest that it is a promising candidate for improving the performance of the existing Si-based solar cells. The understanding on the stability and band structure engineering obtained in this study is general and can be applied for future study of other nonisovalent and lattice-matched semiconductor alloys.

cond-mat.mtrl-sci