Searcharxiv⌕ Search

arXiv subjects

Chunlin Liu

Publications and source records attributed to Chunlin Liu.

At least 19 recordsLinked to original sources

The Bishop--Phelps--Bollobás Property for Extremally Disconnected Ranges

Let $\mathbb F$ be either $\mathbb R$ or $\mathbb C$, and let $L$ be a nonempty extremally disconnected compact Hausdorff space. We show that $(X,C(L,\mathbb F))$ has the Bishop--Phelps--Bollobás property with $η(\varepsilon)=\varepsilon^2/2$ for every Banach space $X$ over $\mathbb F$. For each fixed $L$ and either scalar field, this bound is optimal uniformly over $X$.

math.FA↗

Directional Ergodic Theorems, Ergodicity, and Weak mixing for $\mathbb Z^2$-actions

In this paper, we study Birkhoff and von Neumann type ergodic theorems for $\mathbb Z^2$-measure preserving systems along irrational directions. This leads us to a further investigation of directional ergodicity and weak mixing. Additionally, we show that our framework (dynamical definitions) is equivalent to the spectral definitions of directional ergodicity and weak mixing introduced by Robinson, Rosenblatt and Şahin \cite{RRS2023} for $\mathbb Z^2$-actions. We note that in their recent paper \cite{RS2026}, Robinson and Şahin established the equivalence between dynamical and spectral directional weak mixing for $\mathbb Z^2$-actions using an approach fundamentally different from the one employed in the present paper.

math.DS↗

Same Outcome, Different Evidence: Intent Recovery in LLM Safety Evaluation

Safety evaluations of large language models commonly summarize harmful-output behavior with attack success rate (ASR). Yet the same non-harmful outcome can arise for very different reasons. A model may recover a harmful task and refuse it, fail to recover the task, or respond to something else entirely. Distinguishing these cases becomes especially important under intent-obscuring prompts, where a low ASR does not reveal whether the evaluated task was actually engaged. To make this distinction explicit, we pair ASR with operative understanding rate (UR), which measures whether a response both identifies the evaluated task and treats it as the task to be answered. Across interfaces, this paired view reveals substantial variation hidden by ASR: similar ASR values can correspond to sharply different recovery rates. Controlled English reconstructions show that recovery consistently improves as compressed prompts become more explicit, whereas ASR does not follow the same pattern. A complementary contrast comes from FormalLogic, where high recovery can still coincide with frequent harmful assistance. Together, these results show that non-harmful outcomes are not equally informative about model safety, motivating the joint reporting of intent recovery and ASR in LLM safety evaluation. Code and experiment inputs are available at https://github.com/kevinjiang0121-cyber/IRIS.

cs.CL↗

Groupoid strict comparison for Ample Groupoids: Fiberwise Supramenability and Topological Amenability

In this paper, we first introduce fiberwise supramenability for locally compact Hausdorff étale groupoids with compact unit space. Then, for such a minimal ample groupoid $\mathcal{G}$, we show that if $\mathcal{G}$ is fiberwise supramenable or topologically amenable, then the clopen type semigroup $S(\mathcal{G})$ is almost unperforated. Consequently, if $\mathcal{G}$ is $σ$-compact, then it has groupoid strict comparison. We then present several applications, including Matui's AH conjecture and pure infiniteness for groupoids and groupoid $C^*$-algebras.

math.DS↗

Comparison and Almost Finiteness for Actions of Amenable Groups

We prove that every action of a countably infinite discrete amenable group on a nonempty compact Hausdorff zero-dimensional space has dynamical comparison, without assuming minimality, freeness, or metrizability. More precisely, strict inequalities under all invariant probability measures imply comparison in the clopen type semigroup with an order-unit remainder. For minimal Cantor actions, the clopen type semigroup is cancellative and almost unperforated, and its canonical map onto the positive cone of the coinvariant group is an isomorphism of ordered monoids. These results answer Melleray's cancellation question and the amenable case of his comparison question. For minimal Cantor actions, we also prove goodness of the associated affine evaluation map and obtain a minimal homeomorphism of the same Cantor space with the same invariant probability measures. We identify the precise obstruction to recovering clopen equidecomposability from affine evaluation alone. This obstruction is given by the infinitesimal subgroup: for every nonempty proper clopen set $A$, it parametrizes the topological-full-group orbits of clopen sets having the same affine evaluation as $A$. Combining comparison with the theorems of Kerr and Szabó, we prove that every free action of a countably infinite discrete amenable group on a nonempty compact metrizable space with the topological small boundary property is almost finite. This settles Naryshkin's almost-finiteness conjecture for finite-dimensional compact metrizable spaces. If the action is also minimal, its reduced crossed product is $\mathcal Z$-stable, has nuclear dimension at most one, and satisfies all the regularity conditions in the Toms--Winter conjecture.

math.DS↗

Li--Yorke Chaos Along Any Infinite Sequence: Relative Mixing, Sofic and Rokhlin Entropy versus Naive Entropy

Let $G$ be a countably infinite discrete group and let $ π:(X,μ,G)\to(Y,ν,G) $ be a nontrivial relatively mixing extension, where $X$ is a compact metrizable $G$-space. We prove that there exists a constant $δ>0$ such that, for every injective sequence $(s_i)_{i\geq 1}$ in $G$, there is a Cantor set $K_{(s_i)}\subseteq X$ whose distinct points $x,x'$ satisfy \[ \liminf_{i\to\infty}ρ(s_i x,s_i x')=0, \qquad \limsup_{i\to\infty}ρ(s_i x,s_i x')>δ. \] The method also yields higher-order scrambled Cantor sets. As a principal application, for a sofic group $G$, positive topological sofic entropy implies the preceding conclusion, answering a question of Huang, Li, and Ye. The same conclusion also holds for actions of arbitrary countably infinite discrete groups admitting an essentially free invariant measure of positive Rokhlin entropy. In contrast, we construct a hereditary subshift over a residually finite group with positive naive topological entropy for which all points converge to a common fixed point along a prescribed injective sequence. This answers a question of García-Ramos and Li negatively even for sofic groups.

math.DS↗

Exact Feedback Is Not Control: Evaluating Text-based Closed-Loop Revision in LLMs

Closed-loop revision is increasingly used in large language model (LLM) applications, but failures may reflect incomplete feedback or ineffective responses to correct feedback. We introduce a fixed-budget revision protocol with deterministic verifiers that report all remaining violations across exact-length, lexical, and compositional constraints. Fixing feedback correctness and completeness isolates model-side revision behavior. Across 19 open- and closed-source models, controller-level mean final joint success ranges from 17.4% to 99.8%, with substantial cross-model gaps persisting under identical initial drafts. Controlled experiments reveal reproducible model-specific responses to exact feedback. Post-training and scale reshape these responses without consistently bringing them closer to exact correction. Across all constraint families, failed trajectories often repeat earlier outputs, and prior recurrence is associated with lower subsequent recoverability. Matched-state interventions show that removing earlier dialogue while holding the current draft and feedback fixed changes recurrence escape without reliably improving final success; effects depend on the model, task, and trigger-state composition. Exact feedback makes revision errors observable, but does not make the closed loop reliable. Code and reproduction instructions: https://github.com/kevinjiang0121-cyber/exact-feedback-code.

cs.CL↗

Generic Sharp Shift Embedding for Amenable Group Actions with the Uniform Rokhlin Property and Comparison

Naryshkin recently proved that a free action of a countably infinite discrete amenable group $G$ on a compact metrizable space $X$ with the uniform Rokhlin property and comparison (URPC) admits an equivariant embedding into $([0,1]^m)^G$ whenever $\mathrm{mdim}(X,G)<m/2$. We strengthen this result from existence to genericity by a substantially different method: the set of observables $f\in C(X,[0,1]^m)$ whose orbit maps are equivariant embeddings into $([0,1]^m)^G$ is a dense $G_δ$ subset of $C(X,[0,1]^m)$. The proof combines an adaptation of the Kakutani skyscraper construction used by Gutman--Tsukamoto with a new polynomial perturbation method, departing from the predominantly linear perturbation approaches used in earlier equivariant embedding literature.

math.DS↗

Classifying Slice-Regular Polynomials via Group Actions on the Twistor Space

We study the equivalence classes of slice-regular functions $f:Ω\to\mathbb{H}$ on a symmetric slice domain $Ω$, and of their subclass made of polynomial slice-regular functions, with respect to the natural action of $\mathrm{PGL}(2,\mathbb{H})$ and its subgroups, by employing the twistor construction. In particular, we characterize slice--regular functions whose twistor lift is planar and belongs to a given orbit, and we find normal classes of slice-regular polynomials with respect to the action of a parabolic subgroup of $\mathrm{GL}(2,\mathbb{H})$.

math.DG↗

A Uniform Product-Difference Theorem for Dense Subsets of $\mathbb Z^2$

We establish a uniform product-difference theorem for dense subsets of $\mathbb Z^2$, which gives an affirmative answer to Problem~2 of Fish and, as consequences, to both parts of his Problem~1. More precisely, we prove that for every $δ>0$ there exists an integer $K(δ)\geq 1$ such that every set $E\subseteq\mathbb Z^2$ with upper Banach density $d^\star(E)\geqδ$ satisfies \[ K(δ)\mathbb Z \subseteq \{ab:(a,b)\in E-E\}. \] As consequences, we obtain affirmative answers to both parts of Fish's Problem~1: for positive-density sets $E_1,E_2\subseteq\mathbb Z$ and $E\subseteq\mathbb Z^2$, respectively, the sets \[ (E_1-E_1)^2-(E_2-E_2)^2 \quad\text{and}\quad \{x^2-y^2:(x,y)\in E-E\} \] contain nontrivial ideals of $\mathbb Z$, with generators depending only on the corresponding density thresholds. In particular, the latter result also settles a conjecture of Davies concerning differences of the indefinite quadratic form $x^2-y^2$ in dense subsets of $\mathbb Z^2$.

math.CO↗

Joint Point-Distality and structure theory for commuting actions

Let $G$ and $H$ act commutatively and minimally on a compact metrizable space $X$. We prove that if the two subactions are point-distal, equivalently HPI, then the action generated by them is again point-distal. We also construct a common highly proximal extension on which both subactions are strictly HPI. As consequences, transitivity of mixed products and linear iterates upgrades to minimality in the point-distal category. We then compare the canonical structure of the two subactions with that of the joint action. The maximal highly proximal operations coincide, whereas the maximal joint isometric factor over a common factor is the meet of the two subaction-isometric factors. This gives a recursive description of the joint Furstenberg tower. Finally, we construct commuting minimal distal homeomorphisms of $\mathbb T^3$ whose canonical Furstenberg towers are different, showing that the meet formula can be strict.

math.DS↗

Conditional Topomorphic Degree and Multivariate Mean Equicontinuity for Minimal Amenable Group Actions

Let $G$ be a countably infinite discrete amenable group acting minimally on a compact metric space $X$, and let $π:X\to X_{\mathrm{eq}}$ be the maximal equicontinuous factor map. We introduce the \emph{conditional topomorphic degree} $d:=\tdeg_G(X)\in\mathbb N\cup\{\infty\}$, which, when finite, is the least integer such that $π$ is an at most $d$-to-one topomorphic extension. We prove that, for every $r\ge2$, Weyl mean $r$-equicontinuity, mean $r$-equicontinuity along some Følner sequence, and $d\le r-1$ are equivalent. For minimal $\mathbb Z$-systems, this settles a conjecture of Breitenbücher, Haupt, and Jäger. We further establish the decomposition formula $d=\sum_{μ\in\mathcal M_G^e(X)}ι_μ\exp\bigl(h_μ^*(G)\bigr),$ where $ι_μ$ is the degree of the factor map from the measure-theoretic maximal compact factor associated with $μ$ onto $X_{\mathrm{eq}}$, and $h_μ^*(G)$ is the maximal measure sequence entropy of $μ$. As further consequences of the decomposition formula, we show that for every finite $N$ with $2\le N\le d$, the system admits an essential IT $N$-tuple. Consequently, $h_{\mathrm{top}}^*(X,G)\ge \log d.$ This strengthens a lower bound of Liu, Wang, and Xu by also detecting compact multiplicities. As an application, we answer a question of Gómez, León-Torres, and Muñoz-López. If $G$ contains a finite-index normal subgroup isomorphic to $\mathbb Z^r$, then, for every $m\ge2$, there exists a free minimal uniquely ergodic zero-entropy finite-alphabet $G$-subshift with maximal topological sequence entropy $\log m$, an essential IT $m$-tuple, and no essential IN $(m+1)$-tuple. For $G=\mathbb Z$, the alphabet may be chosen to have exactly $m$ symbols. Finally, we realize every finite multiplicity profile by a zero-entropy minimal almost one-to-one extension of an irrational circle rotation.

math.DS↗

Does Forgetting Transfer Across Modalities? A Real-World Benchmark for Cross-Modal Knowledge Unlearning Evaluation

Vision-Language Models (VLMs), like Large Language Models (LLMs), may memorize sensitive, copyrighted, or harmful knowledge from their pretraining corpora. Removing such knowledge is essential for building trustworthy AI systems. However, existing studies primarily focus on forgetting within individual modalities. Although recent work has begun to explore cross-modal consistency in unlearning, the cross-modal transfer of real-world knowledge unlearning remains insufficiently studied. To address this gap, we introduce UNLINK-VL, a real-world benchmark for cross-modal knowledge unlearning in VLMs. Under a post-hoc unlearning setting in which the original forget and retain corpora are unavailable, UNLINK-VL selects visually identifiable real-world entities as unlearning targets and associates them with corresponding images and one-hop and multi-hop facts derived from Wikidata. The benchmark comprises four complementary subsets that evaluate direct forgetting of target knowledge, the propagation of forgetting through relational knowledge, the preservation of related non-target knowledge, and robustness to semantically equivalent queries. We train models under text-only and multimodal unlearning settings and evaluate forgetting effectiveness and retained utility across textual, visual, and cross-modal scenarios. Extensive experiments reveal a pronounced asymmetry in cross-modal transfer: multimodal unlearning remains effective under textual evaluation, whereas text-only unlearning transfers poorly to visual and cross-modal scenarios. Meanwhile, the evaluated methods largely preserve the models' general capabilities. These findings demonstrate that relying solely on intra-modal evaluation, particularly text-only evaluation, may substantially overestimate the effectiveness of knowledge unlearning in VLMs, underscoring the need for cross-modal unlearning and evaluation.

cs.AI↗

Mean Equicontinuity and Related Properties in Hyperspace and Measure Dynamics

For a dynamical system $(X,T)$ we consider the induced dynamical systems $(\myper(X),T)$ and $(\hyper(X),T)$, consisting of Borel probability measures and closed non-empty subsets, respectively. We show that diam-mean equicontinuity of $(X,T)$ is equivalent to the diam-mean equicontinuity of $(\myper(X),T)$. Furthermore, we establish that $(X,T)$ is mean equicontinuous, iff $(\myper(X),T)$ is mean equicontinuous, iff $(\myper(X),T)$ is weakly-mean equicontinuous. For $(\hyper(X),T)$ the situation is different. It is not hard to see that the diam-mean equicontinuity of $(\hyper(X),T)$ implies the diam-mean equicontinuity of $(X,T)$. We provide examples for which $(X,T)$ is diam-mean equicontinuous, while $(\hyper(X),T)$ is not diam-mean equicontinuous. We prove that $(\hyper(X),T)$ is diam-mean equicontinuous, iff $(\hyper(X),T)$ is mean equicontinuous, iff $(\hyper(X),T)$ is weakly-mean equicontinuous. We present our results in the context of continuous surjective maps $T\colon X\to X$ and discuss why they also hold for actions of locally compact $σ$-compact amenable groups.

math.DS↗

Dynamical Cantor Staircase Functions and The Small Flow Boundary Property

The small flow boundary property (SFBP), introduced by Burguet for fixed-point free topological flows, is a non-trivial generalization of the small boundary property (SBP). We characterize when a time-discretization of such a flow satisfies the SBP and deduce that an SFBP flow admitting an aperiodic time-discretization has vanishing mean dimension. Furthermore, we introduce a new quantity, \textit{flow-generated entropy}, for a factor between a flow and a time-discretization, quantifying the dynamical complexity inherited from the flow itself. This is used in order to establish that any time-discretization of a flow with SFBP admits factors of arbitrarily small flow-generated entropy separating any fixed pair of distinct points. The argument relies on a construction of a dynamical version of the Cantor staircase function. Finally, the appendix includes proofs of fundamental properties of the marker property which have not yet appeared in the literature.

math.DS↗

SDDF: Specificity-Driven Dynamic Focusing for Open-Vocabulary Camouflaged Object Detection

Open-vocabulary object detection (OVOD) aims to detect known and unknown objects in the open world by leveraging text prompts. Benefiting from the emergence of large-scale vision--language pre-trained models, OVOD has demonstrated strong zero-shot generalization capabilities. However, when dealing with camouflaged objects, the detector often fails to distinguish and localize objects because the visual features of the objects and the background are highly similar. To bridge this gap, we construct a benchmark named OVCOD-D by augmenting carefully selected camouflaged object images with fine-grained textual descriptions. Due to the limited scale of available camouflaged object datasets, we adopt detectors pre-trained on large-scale object detection datasets as our baseline methods, as they possess stronger zero-shot generalization ability. In the specificity-aware sub-descriptions generated by multimodal large models, there still exist confusing and overly decorative modifiers. To mitigate such interference, we design a sub-description principal component contrastive fusion strategy that reduces noisy textual components. Furthermore, to address the challenge that the visual features of camouflaged objects are highly similar to those of their surrounding environment, we propose a specificity-guided regional weak alignment and dynamic focusing method, which aims to strengthen the detector's ability to discriminate camouflaged objects from background. Under the open-set evaluation setting, the proposed method achieves an AP of 56.4 on the OVCOD-D benchmark.

cs.CV↗

The maximal mean equicontinuous factor via regional mean sensitivity

For actions of amenable groups, mean equicontinuity-a natural relaxation of equicontinuity obtained by averaging metrics along orbits-is well known to yield a maximal mean equicontinuous factor. In 2021, Li and Yu introduced the notion of weak sensitivity in the mean for actions of $\mathbb{Z}$ to gain a deeper understanding of this phenomenon, building on earlier work by Qiu and Zhao. We demonstrate that this relation is insufficient for actions of non-Abelian groups. To overcome this limitation, we introduce the regional mean sensitive relation, which more precisely captures the dynamical behaviour underlying the maximal mean equicontinuous factor. We discuss its fundamental properties and highlight its advantages in the non-Abelian setting. In particular, we show that mean equicontinuity is equivalent to the nonexistence of non-diagonal regional mean sensitive pairs. For this, we work in the context of actions of $σ$-compact and locally compact amenable groups.

math.DS↗

Rigidity of Generalized Furstenberg Boundaries and Applications to Intermediate Crossed Products

We develop a relative boundary theory for actions of discrete groups on compact spaces and use it to derive rigidity results for reduced crossed products. For a discrete group $Γ$ acting on a compact space $X$ and a subgroup $H$, we construct a universal boundary over $X$ which is minimal as a $Γ$-system and strongly proximal with respect to $H$. When $H\le_cΓ$ is commensurated and the $H$-action on $X$ is minimal, we show that this universal boundary agrees, in a canonical $Γ$-equivariant way, with the generalized Furstenberg boundary of $(H,X)$, thereby unifying and extending earlier results on relative boundaries. As an application, we introduce the notion of an $X$-plump subgroup given a $Γ$-space $X$, a generalized version of plumpness tailored to crossed products. Under natural dynamical hypotheses, this leads to new examples of irreducible $C^*$-inclusions. Under additional assumptions, we also show that every intermediate $C^*$-algebra is a crossed product.

math.OA↗