SearcharxivSearch

arXiv subjects

Rongrong Lu

Publications and source records attributed to Rongrong Lu.

4 recordsLinked to original sources

A Spectral Hilton--Milner--Frankl Theorem for $t$-Intersecting Families

Keevash, Lenz, and Mubayi proved a spectral Erdős--Ko--Rado theorem, showing that, for sufficiently large $n$, the complete $t$-star uniquely maximizes the adjacency-tensor spectral radius among all $t$-intersecting $k$-uniform families. In this paper, we establish a spectral Hilton--Milner--Frankl theorem for nontrivial $t$-intersecting families in the explicit range $1\le t\le k-2$ and $n\ge 100\cdot 2^k k^7$. More precisely, we prove that, for every nontrivial $t$-intersecting $k$-uniform family $\mathcal F$, the spectral radius satisfies \[ ρ(\mathcal F)\le \max\{ρ(\mathcal H_{n,k,t}),ρ(\mathcal A_{n,k,t})\}, \] where $\mathcal H_{n,k,t}$ and $\mathcal A_{n,k,t}$ are the two extremal families appearing in the classical Hilton--Milner--Frankl theorem. Moreover, equality holds only for the extremal candidates attaining the maximum, up to isomorphism. We further compare the two candidates asymptotically. For each fixed $t$, the unique real solution $x=x_t$ of \[ (t+2)^{x-t-1}(t+1)^{t+1}=(x-t+1)^{x-1} \] determines, as $k$ varies, which of $\mathcal H_{n,k,t}$ and $\mathcal A_{n,k,t}$ has the larger asymptotic spectral radius.

math.CO

An improved range for the maximum critically $t$-intersecting hypergraphs

Let $k>t\ge 1$ be integers and set $d=k-t$. A $k$-uniform hypergraph $\mathcal F$ is called $t$-intersecting if any two edges intersect in at least $t$ vertices, and is called $t$-critical if its minimum $t$-transversal has size $k$. Frankl proved that, for $k\ge d^4$,$|\mathcal F|\le \binom{k+d}{d},$ with equality only for the complete $k$-graph on $k+d$ vertices, and conjectured that the same conclusion should hold when $k>c d^2$ for some constant $c$. In this paper we confirm this conjecture for $c=30$. The proof relies on Frankl's fixed-edge decomposition and Füredi's pseudo-sunflower method.

math.CO

Constraint-Aware Generative Re-ranking for Multi-Objective Optimization in Advertising Feeds

Optimizing reranking in advertising feeds is a constrained combinatorial problem, requiring simultaneous maximization of platform revenue and preservation of user experience. Recent generative ranking methods enable listwise optimization via autoregressive decoding, but their deployment is hindered by high inference latency and limited constraint handling. We propose a constraint-aware generative reranking framework that transforms constrained optimization into bounded neural decoding. Unlike prior approaches that separate generator and evaluator models, our framework unifies sequence generation and reward estimation into a single network. We further introduce constraint-aware reward pruning, integrating constraint satisfaction directly into decoding to efficiently generate optimal sequences. Experiments on large-scale industrial feeds and online A/B tests show that our method improves revenue and user engagement while meeting strict latency requirements, providing an efficient neural solution for constrained listwise optimization.

cs.IR

The number of rooted spanning forests of bicirculant graphs

A bi-Cayley graph over the cyclic group $(\mathbb{Z}_n, +)$ is called a bicirculant graph. Let $Γ=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=-R\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T={-}T\subseteq \mathbb{Z}_n\setminus \{0\}$ and $S\subseteq \mathbb{Z}_n$. In this paper, using Chebyshev polynomials, we obtain a closed formula for the number of rooted spanning forests of $Γ$. Moreover, we investigate some arithmetic properties of the number of rooted spanning forests of $Γ$, and find its asymptotic behaviour as $n$ tends infinity.

math.CO