Searcharxiv⌕ Search

arXiv subjects

Zhiwei Zheng

Publications and source records attributed to Zhiwei Zheng.

At least 19 recordsLinked to original sources

Uniform-in-time error estimates for the Klein-Gordon-Schrödinger system in the nonrelativistic limit regime

In this paper, we study the Klein--Gordon--Schrödinger system in the nonrelativistic regime $\e\to 0$ on $\R^d$ with $d\ge4$, where $\e$ is a small parameter proportional to the inverse of the speed of light. For sufficiently regular initial data, we show that its solution is well approximated by oscillatory profiles governed by a decoupled linear Schrödinger-wave semi-limiting model with error $O(\e^2)$ uniformly for all $t \ge 0 $. This rigorously justifies the numerical study of Bao and Zhao \cite{BZ17}.

math.AP↗

3D Occupancy-Language Fields from mmWave Radar

Radar systems can recover scene geometry and recognize predefined categories, but these outputs do not provide a persistent spatial representation for open-ended language queries. Such queries require linking observations from different viewpoints to the same physical locations. We present TextRadar, a framework that constructs a scene-level 3D occupancy-language field from panoramic radar observations. The field combines occupancy with scale-dependent language features at surface locations, allowing the reconstructed scene to be queried with new descriptions. A single-frame radar distillation model predicts aligned ranges and language features from each radar observation. Using radar-estimated poses, we register these predictions to reconstruct the field from radar alone in a new scene. Experiments on approximately 20k synchronized observations across seven buildings demonstrate scene-level natural-language querying and prompt-free semantic visualization. Analysis of camera-to-radar concept transferability shows stronger agreement for structures, materials, and human poses than for colors and printed text.

cs.RO↗

Finite Symplectic Automorphism Groups of K3 Surfaces in Characteristic Seven

We classify all finite groups of order divisible by $7$ that admit a faithful symplectic action on a K3 surface over an algebraically closed field of characteristic seven, together with the possible heights and Artin invariants. Combined with the known classification of tame actions, this gives the complete list of finite groups admitting such an action in characteristic seven.

math.AG↗

A Sharp Bound for the Second Betti Number of Hyperkähler Sixfolds

Let $X$ be a smooth compact irreducible hyperkähler manifold of dimension six. We prove that the second Betti number satisfies $b_2(X) \le 23$. Furthermore, we show that the third cohomology vanishes whenever $b_2(X) \ge 19$, and that all odd cohomology vanishes when $b_2(X) = 23$. If the second Chern class lies in the subalgebra generated by $H^2(X,\mathbb{Q})$, then $b_2(X) \in \{5,8,23\}$. The proof uses the Looijenga--Lunts--Verbitsky decomposition, curvature inequalities for Segre classes, and the Hodge--Riemann bilinear relations on the projective cotangent bundle.

math.AG↗

PACT: Privileged Trace Co-Training for Multi-Turn Tool-Use Agents

Multi-turn tool-use agents must reason, call tools, and adapt to observations across several interaction turns. Post-training such agents is challenging, as reinforcement learning often suffers from sparse rewards and weak credit assignment despite matching the prompt-only inference setting, while supervised fine-tuning on expert traces provides dense process supervision but can over-constrain the model to fixed trajectories. To tackle this, we propose PACT, a Privileged trAce Co-Training framework for multi-turn tool-use agents. The key idea is to use expert traces only as training-time optimization signals rather than rollout-time hints. PACT keeps rollout generation prompt-only, then uses expert traces to guide optimization through two complementary signals: a trace-conditioned RL surrogate that evaluates prompt-only rollouts under expert-trace context, and a component-aware SFT loss that provides annealed process supervision over reasoning and tool-call components. To reduce over-reliance on the training-only trace context, PACT incorporates prompt-only anchoring with standard prompt-only RL updates. Experiments on FTRL, BFCL, and ToolHop show that PACT consistently outperforms strong SFT- and RL-based baselines. Further analyses support the complementarity of the two training objectives and the benefits of component-aware supervision and prompt-only anchoring. These results highlight the effectiveness of privileged trace co-training for multi-turn tool-use learning. The project page is available at https://zhenbangdu.github.io/pact-project-page.

cs.CL↗

A Proof of Mongardi's Conjecture on Finite Symplectic Group Actions on Hyperkähler Manifolds of $K3^{[n]}$ Type

Let a finite group act faithfully by symplectic automorphisms on a manifold of $K3^{[n]}$ type for $n\geq2$. We prove Mongardi's conjecture that the strict inequality $\mathrm{rk}(S)+\ell(A_S)<24$ holds for its associated Leech coinvariant lattice $S$. The converse was already proved independently by Huybrechts and Mongardi: any Leech coinvariant lattice $S$ satisfying the strict inequality and of rank at most $20$ is realized by such an action for some $n\geq2$. The key idea is to consider the minimum norms of vectors representing discriminant classes of $S$. The absence of numerical walls gives lower bounds for certain classes, while the structure of Leech lattice implies upper bounds for all discriminant classes. Comparing these bounds reduces the proof to finitely many values of $n$. We exclude the remaining cases using further lattice arguments, together with Höhn--Mason's classification of fixed-point sublattices of Leech lattice, thereby proving Mongardi's conjecture.

math.AG↗

Finite Symplectic Automorphisms of Hyperkähler Manifolds of $K3^{[n]}$-Type Act Trivially on Discriminant Groups

We give an alternative proof of Mongardi's result that every finite group of symplectic automorphisms of a hyperkähler manifold of $K3^{[n]}$-type acts trivially on the discriminant groups of its second cohomology lattice and its coinvariant lattice. The proof combines sphere-packing bounds, Vinberg's reflection chambers and structure results on even $2$-elementary lattices.

math.AG↗

Non-symplectic Indices of Automorphism Groups of Smooth Cubic Fourfolds

We study the full automorphism groups of smooth cubic fourfolds with prescribed symplectic automorphism group. Our starting point is the classification of symplectic automorphism groups by Laza and Zheng. We focus on the non-symplectic index, namely, the index of the symplectic automorphism group in the full automorphism group. We prove general restrictions on this index. We also compute bounds by group-theoretic and lattice-theoretic methods. In several cases, we determine all possible indices. For coinvariant lattices of rank 19, we classify all possible pairs consisting of the symplectic automorphism group and the full automorphism group.

math.AG↗

Classification of Automorphism Groups of Smooth Cubic Threefolds and Fourfolds

We classify the automorphism groups of smooth cubic threefolds and fourfolds. We also show that there are $156$ (respectively, $40$) connected families of smooth cubic fourfolds (respectively, threefolds) with specified automorphism group action. For each family, the group action and defining equations are also given. The classification combines both representation theory (based on GAP) and lattice theory (based on SageMath).

math.AG↗

Small-Subgroup Criteria for Liftability of Automorphism Groups of Smooth Hypersurfaces

In this paper, building on our previous Sylow criteria, we establish small-subgroup criteria of liftability and $F$-liftability for the linear automorphism group $G$ of smooth hypersurfaces $X$ over algebraically closed field of characteristic zero. When $\mathrm{dim} X = p-2$ for some odd prime $p$, we prove that ($F$-)liftability of any finite subgroup of $G$ can be tested on its $p$-subgroups of order at most $p^2$. When $X$ is a degree $p$ hypersurface of dimension $2p-2$, we prove that ($F$-)liftability of $G$ can be tested on all its $p$-subgroups of order at most $p^3$, which is sharp for $p\geq5$. When $p=3$, this bound improves to $9$, giving the corresponding criteria for smooth cubic fourfolds.

math.AG↗

Monodromy Eigenvalues of Milnor Fibers for Line Arrangements

It is an important problem to know whether the monodromy on the cohomology of Milnor fibers associated to hyperplane arrangements is a combinatorial invariant. In this paper, we obtain a combinatorial vanishing criterion for certain eigenspaces of this algebraic monodromy in line arrangements. Combining with Hirzebruch inequality, which is a consequence of Bogomolov--Miyaoka--Yau inequality, we prove that for essential complex line arrangements, the eigenvalues of the monodromy have orders at most five. This is a partial progress toward Papadima--Suciu conjecture and proves Salvetti--Serventi connectivity conjecture. For essential complexified real line arrangements, the monodromy order is improved to at most four thanks to Shnurnikov's inequality. This confirms Papadima--Suciu conjecture for real line arrangements and also Yoshinaga's sharp pair conjecture.

math.AG↗

Automorphism Groups of Smooth Cubic Fourfolds through Lattice Theory

Laza and the second author have classified all possible symplectic automorphism groups of smooth cubic fourfolds. There are $34$ such groups, and by Koike, there are $48$ families of cubic fourfolds with speficied symplectic automorphism group. For $42$ among those families, we complete the classification of all possible automorphism groups. The approach of this paper is mainly lattice theoretic, starting from known results about the period map of cubic fourfolds by Voisin, Hassett, Looijenga and Laza. We use a lattice-enumeration algorithm implemented in OSCAR.

math.AG↗

Optimal convergence rates of the Klein-Gordon-Schrödinger system in the nonrelativistic limit

In this paper, we study the Klein-Gordon-Schrödinger system in the nonrelativistic regime $ε\to 0$, where $ε$ is proportional to the inverse of the speed of light. We show that the Klein-Gordon-Schrödinger system converges to a system of decoupled linear Schrödinger equations over a long time interval of order $ε^{-1}$ with error estimates of the form $(1+t)ε^2$; in particular, the error estimate for the Schrödinger component is uniform in time of the form $ε^{2}$ The specific forms of the error estimates coincide with the numerical results shown by Bao et a.l., and the $O(ε^{2})$ convergence rates coincide with the order of initial error, and thus are optimal.

math.AP↗

Vision-TL-Action: Neuro-Symbolic Trajectory Generation from Visual Observations and Temporal Logic

Temporal logic (TL) provides a compositional language for the formulation of long horizon robotic tasks, but existing TL-conditioned trajectory generators can sidestep perception-to-symbol binding by encoding exact object geometry in the task graph. We introduce \emph{Vision-TL-Action}, which generates action trajectories from multi-view images, a coordinate-free TL syntax graph, and the robot initial state. TL-node tokens and spatial visual tokens are fused through bidirectional cross-attention, and the resulting representation conditions a flow-matching trajectory generator. Visual tokens are augmented only with normalized image-plane locations and camera-view identifiers, while a training-only predicate-to-region objective encourages grounding to referenced objects. Consistent with prior work in this domain, we evaluate the model using Success@$K$, the fraction of tasks for which at least one of K sampled trajectories satisfies the TL specification. On Panda task, our model achieves 67.45% Success@1024, compared with 59.11% for the oracle-state baseline. On AntMaze task, it achieves 96.35% Success@256, comparable to the oracle result of 96.88%. Resolution and intervention studies show that spatial detail depends on semantic grounding and predicate identity affects both attention and performance. These results demonstrate a direct mapping from visual observations and structured TL goals to action trajectories without requiring object geometry at inference. Code is available at https://github.com/AricLau07/vision-tl-action.

cs.RO↗

Sylow Criteria for Liftability of Automorphism Groups of Smooth Hypersurfaces

In this paper, we first establish Sylow criteria for liftability of finite subgroups of the projective linear groups over arbitrary field. We also obtain Sylow criteria for $F$-liftability: if $F$ is a nonsingular polynomial of degree $d$ in $N$ variables over a field of characteristic zero, then a finite subgroup $G$ of $\mathrm{Lin}(F)$ is $F$-liftable if and only if for every prime $p$ dividing $\gcd(|G|,N,d)$, there exists a Sylow $p$-subgroup of $G$ that is $F$-liftable. Our proof combines restriction and corestriction in group cohomology with the reduction-to-Klein method.

math.AG↗

Calabi-Yau Varieties via Cyclic Covers, and Complex Hyperbolic Structures for their Moduli Spaces

In this paper we mainly study Calabi--Yau varieties that arise as triple covers of products of projective lines branched along simple normal crossing divisors. For some of those families of Calabi--Yau varieties, the period maps factor through arithmetic quotients of complex hyperbolic balls. We give a classification of such examples. One of the families was previously studied by Voisin, Borcea and Rohde. For these ball-type cases, we will show arithmeticity of the monodromy groups. These ball quotients are all commensurable to ball quotients in Deligne--Mostow theory. As a byproduct, we prove some commensurability relations among arithmetic groups in Deligne--Mostow theory.

math.AG↗

Omnidirectional photonic chiral flatband in nonlocal membrane metasurfaces

Omnidirectional flat-band resonances, characterized by an enhanced photonic density of states and inherent angular robustness, are highly sought-after in integrated nanophotonic devices, particularly when integrated with chiral functionality. Here we realize such resonances in a nonlocal silicon membrane metasurface patterned with periodic square-lattice air-hole arrays. Increasing the lattice period not only compresses the Brillouin zone but, crucially, weakens the evanescent coupling between neighbouring Bloch modes associated with the same-order guided resonances. Driven by the tight-binding model in the limit of weak inter-unit-cell coupling, the pronounced band flattening of the degenerate guided resonance along both $k_{x}$ and $k_{y}$ yields, giving rise to an omnidirectional flat-band resonance. Remarkably, both numerical simulations and experiments reveal a universal route for endowing flat-band guided resonances with optical chirality through the deliberate breaking of the mirror symmetry of air holes. As a result, the omnidirectional chiral flat-band resonance emerges along both principal in-plane directions, with $Q$-factors exceeding 10$^{3}$ and circular dichroism greater than 0.9 over a wide angular range of $\pm 5^{\circ}$. Nonlinear measurements further show that the resulting resonance not only drives highly efficient third-harmonic generation but also imparts a pronounced spin-selective character to the nonlinear process. Simultaneously, the highly efficient nonlinear process also enables chirality-controlled frequency-upconversion imaging. Our results establish a general paradigm for engineering omnidirectional chiral flat-band resonances in planar silicon platforms, opening new opportunities for nonlinear nanophotonics and chiral imaging.

physics.optics↗

Scalable RF Simulation in Generative 4D Worlds

Radio Frequency (RF) sensing has emerged as a powerful, privacy-preserving alternative to vision-based methods for various perception tasks. However, building high-quality RF datasets in dynamic and diverse environments remains a major challenge. To address this, we introduce WaveVerse, a prompt-based, scalable framework that simulates realistic RF signals from generated indoor scenes with human motions guided by spatial paths, enabling diverse and feasible behaviors without manual trajectory design. WaveVerse features a language-guided 4D world generator and a physics-based signal simulator that enables realistic simulation of RF signals in diverse environments. It employs a phase-coherent ray tracer that preserves both spatial and temporal phase consistency. The simulated signals show high fidelity on phase-sensitive benchmarks, and closely align with both real-world collected measurements and simulations from a proprietary electromagnetic solver. When used for data augmentation, WaveVerse consistently improves performance in downstream tasks like RF imaging and human activity recognition, with gains that grow with the amount of simulated data and surpass existing methods. Code and additional materials are available on the webpage.

cs.CV↗