SearcharxivSearch

arXiv subjects

Qiuyu Ren

Publications and source records attributed to Qiuyu Ren.

At least 19 recordsLinked to original sources

Deciding strong quasipositivity and quasipositivity

We present two results concerning the decidability of (strong) quasipositivity of links in the 3-sphere. First, using a result of Dynnikov--Prasolov, we provide an algorithm to decide whether or not a link is strongly quasipositive. Second, we reduce the decision problem of the quasipositivity of links to that of braids.

math.GT

Small undecidable groups and unrecognizable 4-manifolds

We construct a $3$-generator $9$-relator group with unsolvable word problem. We use the group to construct two fixed-size Adian--Rabin families of group presentations, one with $4$ generators and $11$ relators, and another with $2$ generators and $10$ relators. As a consequence, $\#_7(S^2\times S^2)$ is topologically unrecognizable and $\#_9(S^2\times S^2)$ is smoothly unrecognizable. These algebraic and topological results improve the previous best known bounds by Borisov, Tancer, and Gordon. The construction of the group builds upon an example of Borisov and uses additional HNN extensions and Tietze eliminations to reduce the size of the presentation. We also provide a machine-checked Lean~4 formalization of the algebraic results.

math.GR

Trisection invariants of 4-manifolds are uncomputable

We prove that two invariants of smooth 4-manifolds defined in terms of trisections are uncomputable: the trisection genus and the Kirby-Thompson L-invariant. That is, there does not exist an algorithm that takes as input a triangulated closed orientable 4-manifold and outputs one of these quantities. The result on the L-invariant resolves the second part of Problem 4.116 in the K3 problem list. In the same spirit, we show that the PL multisection genus of PL manifolds is uncomputable in dimensions at least four.

math.GT

Multisections and bridge positions in arbitrary dimensions

Multisections were defined by Ben Aribi--Courte--Golla--Moussard as a way to decompose closed manifolds into $1$-handlebodies, which is a generalization of Heegaard splittings and trisections. Previously, their existence was only known in dimensions up to $5$. We show that multisections exist for closed manifolds in arbitrary dimensions. We also show that submanifolds of codimension at least $2$ in multisected manifolds can always be put into an appropriate bridge position, generalizing the existence result on bridge trisections in dimension $4$.

math.GT

Insensitivity of Khovanov homology under rim surgery

We show that rim surgery on a smooth, oriented, properly embedded surface in $B^4$ does not change the map on Khovanov homology induced by the surface, answering a question raised by Hayden and Sundber. More generally, the same insensitivity holds for a class of local surgery operations that we call local annulus replacements. Combined with the work of Hayden--Sundberg, this result yields exotic pairs of surfaces in $B^4$ that cannot be related by any sequence of local annulus replacements. We give two proofs, both making essential use of Khovanov skein lasagna modules.

math.GT

Humanity's Last Exam

Benchmarks are important tools for tracking the rapid advancements in large language model (LLM) capabilities. However, benchmarks are not keeping pace in difficulty: LLMs now achieve over 90\% accuracy on popular benchmarks like MMLU, limiting informed measurement of state-of-the-art LLM capabilities. In response, we introduce Humanity's Last Exam (HLE), a multi-modal benchmark at the frontier of human knowledge, designed to be the final closed-ended academic benchmark of its kind with broad subject coverage. HLE consists of 2,500 questions across dozens of subjects, including mathematics, humanities, and the natural sciences. HLE is developed globally by subject-matter experts and consists of multiple-choice and short-answer questions suitable for automated grading. Each question has a known solution that is unambiguous and easily verifiable, but cannot be quickly answered via internet retrieval. State-of-the-art LLMs demonstrate low accuracy and calibration on HLE, highlighting a significant gap between current LLM capabilities and the expert human frontier on closed-ended academic questions. To inform research and policymaking upon a clear understanding of model capabilities, we publicly release HLE at https://lastexam.ai.

cs.LG

End-to-end deep learning for superoscillatory subtraction imaging

Breaking the diffraction limit in optical imaging is crucial for resolving subwavelength details in a wide range of applications, where superoscillatory imaging and subtraction imaging are two common strategies for surpassing conventional resolution limits. We propose an end-to-end deep learning framework that integrates superoscillatory focusing and subtraction imaging into a single jointly-optimized vectorial Debye integral neural network pipeline, eliminating the traditional two-step acquisition and manual weighting process. With this end-to-end neural network, we further improve the focusing capability of the system to the sub-100-nm regime, enabling deep-subwavelength imaging resolution.

physics.optics

Families of cosmetic surgeries

We construct infinite families of chirally cosmetic surgeries on chiral hyperbolic knots and purely cosmetic surgeries on hyperbolic manifolds with multiple cusps, disproving conjectures that these phenomena do not appear, including Problem 1.12(d) in the K3 problem list. We also give some hints regarding why chirally cosmetic surgeries appear to be more common than purely cosmetic surgeries on $1$-cusped manifolds.

math.GT

Ribbon concordance of fibered knots and compressions of surface homeomorphisms

We prove that simplicial volume and dilatation are monotone under ribbon concordance between fibered knots in $S^3$, and that every fibered knot has only finitely many predecessors in the ribbon-concordance partial order, providing evidence for questions raised by Gordon. We also give an algorithm to enumerate, up to symmetries, all minimal compressions of a surface homeomorphism, extending a theorem of Casson--Long. This yields an algorithm to find all knots that are strongly homotopy-ribbon concordant to a given fibered knot in some homotopy $I\times S^3$. Our study of minimal compressions also provides an alternative perspective on results of Miyazaki concerning nonsimple fibered ribbon knots.

math.GT

FrontierMath: A Benchmark for Evaluating Advanced Mathematical Reasoning in AI

We introduce FrontierMath, a benchmark of hundreds of original, exceptionally challenging mathematics problems crafted and vetted by expert mathematicians. The questions cover most major branches of modern mathematics -- from computationally intensive problems in number theory and real analysis to abstract questions in algebraic geometry and category theory. Solving a typical problem requires multiple hours of effort from a researcher in the relevant branch of mathematics, and for the upper end questions, multiple days. FrontierMath uses new, unpublished problems and automated verification to reliably evaluate models while minimizing risk of data contamination. Current state-of-the-art AI models solve under 2% of problems, revealing a vast gap between AI capabilities and the prowess of the mathematical community. As AI systems advance toward expert-level mathematical abilities, FrontierMath offers a rigorous testbed that quantifies their progress.

cs.AI

Khovanov homology and exotic $4$-manifolds

We show that the Khovanov-Rozansky $\mathfrak{gl}_2$ skein lasagna module distinguishes the exotic pair of knot traces $X_{-1}(-5_2)$ and $X_{-1}(P(3,-3,-8))$, an example first discovered by Akbulut. This gives the first analysis-free proof of the existence of exotic compact orientable $4$-manifolds. We also present a family of exotic knot traces that seem not directly recoverable from gauge/Floer-theoretic methods. Along the way, we present new explicit calculations of the Khovanov skein lasagna modules, and we define lasagna generalizations of the Lee homology and Rasmussen $s$-invariant, which are of independent interest. Other consequences of our work include a slice obstruction of knots in $4$-manifolds with nonvanishing skein lasagna module, a sharp shake genus bound for some knots from the lasagna $s$-invariant, and a construction of induced maps on Khovanov homology for cobordisms in $k\mathbb{CP}^2$.

math.GT

Khovanov skein lasagna modules with $1$-dimensional inputs

We construct a variant of Khovanov skein lasagna modules, which takes the Khovanov homology in connected sums of $S^1\times S^2$ defined by Rozansky and Willis as the input link homology. To carry out the construction, we prove functoriality of Rozansky-Willis's homology for cobordisms in a class of $4$-manifolds that we call $4$-dimensional relative $1$-handlebody complements, by using, as a bypass, an isomorphism proved by Sullivan--Zhang relating the Rozansky-Willis homology and the classical Khovanov skein lasagna module of links on the boundary of $D^2\times S^2$. Along the way, we also present new results on diffeomorphism groups, on Gluck twists for Khovanov skein lasagna modules, and on the functoriality of $\mathfrak{gl}_2$ foams.

math.GT

Intrinsic Khovanov homology in $\mathbb{RP}^3$

We prove that Khovanov homology is an invariant of links in unparametrized $\mathbb{RP}^3$'s, i.e., oriented $3$-manifolds diffeomorphic to $\mathbb{RP}^3$. Along the way, we establish the functoriality of Khovanov homology for link cobordisms in $I\times\mathbb{RP}^3$.

math.GT

GAUSS: Benchmarking Structured Mathematical Skills for Large Language Models

We introduce \textbf{GAUSS} (\textbf{G}eneral \textbf{A}ssessment of \textbf{U}nderlying \textbf{S}tructured \textbf{S}kills in Mathematics), a benchmark that evaluates LLMs' mathematical abilities across twelve core skill dimensions, grouped into three domains: knowledge and understanding, problem solving and communication, and meta-skills and creativity. By categorizing problems according to cognitive skills and designing tasks that isolate specific abilities, GAUSS constructs comprehensive, fine-grained, and interpretable profiles of models' mathematical abilities. These profiles faithfully represent their underlying mathematical intelligence. To exemplify how to use the \textsc{GAUSS} benchmark, we have derived the skill profile of \textsc{GPT-5-thinking}, revealing its strengths and weaknesses as well as its differences relative to \textsc{o4-mini-high}, thereby underscoring the value of multidimensional, skill-based evaluation.

cs.AI

Cosmetic surgery on satellite knots

We show that if there exists a knot in $S^3$ that admits purely cosmetic surgeries, then there exists a hyperbolic one with this property.

math.GT

Universal Trajectory Optimization Framework for Differential Drive Robot Class

Differential drive robots are widely used in various scenarios thanks to their straightforward principle, from household service robots to disaster response field robots. There are several types of driving mechanisms for real-world applications, including two-wheeled, four-wheeled skid-steering, tracked robots, and so on. The differences in the driving mechanisms usually require specific kinematic modeling when precise control is desired. Furthermore, the nonholonomic dynamics and possible lateral slip lead to different degrees of difficulty in getting feasible and high-quality trajectories. Therefore, a comprehensive trajectory optimization framework to compute trajectories efficiently for various kinds of differential drive robots is highly desirable. In this paper, we propose a universal trajectory optimization framework that can be applied to differential drive robots, enabling the generation of high-quality trajectories within a restricted computational timeframe. We introduce a novel trajectory representation based on polynomial parameterization of motion states or their integrals, such as angular and linear velocities, which inherently matches the robots' motion to the control principle. The trajectory optimization problem is formulated to minimize complexity while prioritizing safety and operational efficiency. We then build a full-stack autonomous planning and control system to demonstrate its feasibility and robustness. We conduct extensive simulations and real-world testing in crowded environments with three kinds of differential drive robots to validate the effectiveness of our approach.

cs.RO