On intersection cohomology with torus action of complexity one, II

This paper establishes that the decomposition theorem components for contraction maps of torus actions of complexity one are intersection cohomology complexes of even codimensional subvarieties, leading to the vanishing of odd-dimensional intersection cohomology for rational complete varieties of this type and providing explicit formulas for the Betti numbers of affine trinomial hypersurfaces based on their defining equations.

Marta Agustin Vicente, Narasimha Chary Bonala, Kevin LangloisTue, 10 Ma🔢 math

Iterated club shooting and the stationary-logic constructible model

This paper investigates the iteration of the stationary-logic constructible model C(aa)C(\mathtt{aa}) by proving distributivity and stationary-set preservation for countable iterations of club-shooting forcings using mutually stationary sets, and introducing mutually fat sets to achieve stronger results for uncountable iterations, thereby demonstrating the ability to force models where V=C(aa)V=C(\mathtt{aa}) and where iterated C(aa)C(\mathtt{aa}) sequences decrease with arbitrarily large order types.

Ur Ya'arTue, 10 Ma🔢 math

Amenable equivalence relations, Kesten's property, and measurable lamplighters

This paper characterizes the amenability of countable Borel equivalence relations via the uniform Liouville property, investigates Kesten's property for return probabilities on topological groups, and constructs an amenable contractible Polish group lacking this property by linking it to anti-concentration inequalities in measurable lamplighter groups.

Maksym Chaudkhari, Kate Juschenko, Friedrich Martin SchneiderTue, 10 Ma🔢 math

Bilevel Optimization and Heuristic Algorithms for Integrating Latent Demand into the Design of Large-Scale Transit Systems

This paper introduces a bilevel optimization model (TN-DA) for designing large-scale transit networks that integrates latent demand through rider adoption behavior, and proposes five efficient heuristic algorithms that outperform exact methods in computational speed while maintaining high solution quality and key adoption properties in real-world case studies.

Hongzhao Guan, Beste Basciftci, Pascal Van HentenryckTue, 10 Ma🔢 math

Nuisance Function Tuning and Sample Splitting for Optimally Estimating a Doubly Robust Functional

This paper demonstrates that by strategically combining sample splitting with specific nuisance function tuning strategies (such as undersmoothing or oversmoothing), both plug-in and first-order bias-corrected estimators can achieve minimax rates of convergence for doubly robust functionals across all Hölder smoothness classes, overcoming limitations of existing literature.

Sean McGrath, Rajarshi MukherjeeTue, 10 Ma🔢 math

Erratum and original of Port-Hamiltonian structure of interacting particle systems and its mean-field limit

This paper presents a minimal port-Hamiltonian formulation for interacting particle systems to analyze their stability and mean-field limits, while simultaneously issuing an erratum that corrects a previous claim regarding trajectory compactness by providing a counterexample for repulsive interactions and a revised proof for Hamiltonian gradient convergence.

Jannik Daun, Daniel Jannik Happ, Birgit Jacob, Claudia TotzeckTue, 10 Ma🔢 math

Small mass limit of expected signature for physical Brownian motion

This paper establishes the convergence of the expected signature of a generalized physical Brownian motion to a nontrivial tensor in the small mass limit (m0+m \to 0^+) by analyzing a graded PDE system, revealing that the limit differs from the standard mathematical Brownian motion and exhibits explicit combinatorial patterns when the system's coefficient matrix is diagonalizable.

Siran Li, Hao Ni, Qianyu ZhuTue, 10 Ma🔢 math

On colorings of hypergraphs embeddable in Rd\mathbb{R}^d

This paper improves upon previous results by Heise et al. by proving that the weak chromatic number of kk-uniform hypergraphs arising from linearly or PL-embeddable simplicial complexes in Rd\mathbb{R}^d is infinite for most dimensions and uniformities, and further extends these findings to show that the weak chromatic number of ss-dimensional faces in triangulations of any fixed triangulable dd-manifold is infinite for all $1 \le s \le d$.

Seunghun Lee, Eran NevoTue, 10 Ma🔢 math