Probability
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Wednesday 11 March
For a random variable $X$ define $Q(X) = \sup_{x \in \mathbb{R}} \mathbb{P}(X=x)$. Let $X_1, \dots, X_n$ be independent integer random variables. Suppose $Q(X_i) \le \alpha_i \in (0,1]$ for each $i \in \{1, \dots, n\}$. Juškevičius (2023) conjectured that $Q(X_1 + \dots +X_n) \le Q(Y_1 + \dots+ Y_n)$ where $Y_1, \dots, Y_n$ are independent and $Y_i$ is a random integer variable with $Q(Y_i) =\alpha_i$ that has the smallest variance, i.e. the distribution of $Y_i$ has probabilities $\alpha_i, \dots, \alpha_i, \beta_i$ or probabilities $\beta_i, \alpha_i, \dots, \alpha_i$ on some interval of integers, where $0 \le \beta_i < \alpha_i$. We prove this conjecture asymptotically: i.e., we show that for each $\delta > 0$ there is $V_0 = V_0(\delta)$ such that if ${\mathrm Var} (\sum Y_i) \ge V_0$ then $Q(\sum X_i) \le (1+\delta) Q(\sum Y_i)$. This implies an analogous asymptotically optimal inequality for concentration at a point when $X_1$, $\dots$, $X_n$ take values in a separable Hilbert space. Our long and technical argument relies on several non-trivial previous results including an inverse Littlewood–Offord theorem and an approximation in total variation distance of sums of multivariate lattice random vectors by a discretized Gaussian distribution.
Statistics Theory
On positive definite thresholding of correlation matrices
Standard thresholding techniques for correlation matrices often destroy positive semidefiniteness. We investigate the construction of positive definite functions that vanish on specific sets $K \subseteq [-1,1)$, ensuring that the thresholded matrix remains a valid correlation matrix. We establish existence results, define a criterion for faithfulness based on the linear coefficient of the normalized Gegenbauer expansion in analogy with Delsarte's method in coding theory, and provide bounds for thresholding at single points and pairs of points. We prove that for correlation matrices of rank $n$, any soft-thresholding operator that preserves positive semidefiniteness necessarily induces a geometric collapse of the feature space, as quantified by an $\mathcal{O}(1/n)$ bound on the faithfulness constant. Such demonstrates that geometrically unbiased soft-thresholding limits the recoverable signal.
Read the full abstract
Combinatorics
Schur complements for tensors and multilinear commutative rank
We show that three notions of rank for matrices of multilinear forms are equivalent. This result generalizes a classical result of Flanders, corrects a minor hole in work of Fortin and Reutenauer, answers a question of Lampert on the relation between the analytic and slice ranks of trilinear forms, and establishes a special case of the conjecture that the analytic and partition ranks of a tensor are equivalent.
Read the full abstract
Differential Geometry
Conformal symmetries in geometry and harmonic analysis
In this essay we give an introduction to conformal symmetry, based on the example of the Yamabe operator and its use in conformal differential geometry, and in representation theory.
Differential Geometry
Nondegenerate neck pinches along the mean curvature flow
We show that for generic smooth compact initial surfaces the mean curvature flow in $\mathbb{R}^3$ has spherical or nondegenerate neck pinch singularities at the first singular time. In particular the singularities at the first singular time are isolated in spacetime. As an application we give a new approach to constructing a mean curvature flow with surgery for smooth compact initial surfaces in $\mathbb{R}^3$.
Read the full abstract
Numerical Analysis
Linear-Scaling Tensor Train Sketching
We introduce the TTStack sketch, a structured random projection tailored to the tensor train (TT) format that unifies existing TT-adapted sketching operators. By varying two integer parameters $P$ and $R$, TTStack interpolates between the Khatri-Rao sketch ($R=1$) and the Gaussian TT sketch ($P=1$). We prove that TTStack satisfies an oblivious subspace embedding (OSE) property with parameters $R = \mathcal{O}(d(r+\log 1/\delta))$ and $P = \mathcal{O}(\varepsilon^{-2})$, and an oblivious subspace injection (OSI) property under the condition $R = \mathcal{O}(d)$ and $P = \mathcal{O}(\varepsilon^{-2}(r + \log r/\delta))$. Both guarantees depend only linearly on the tensor order $d$ and on the subspace dimension $r$, in contrast to prior constructions that suffer from exponential scaling in $d$. As direct consequences, we derive quasi-optimal error bounds for the QB factorization and randomized TT rounding. The theoretical results are supported by numerical experiments on synthetic tensors, Hadamard products, and a quantum chemistry application.
Read the full abstract
Algebraic Topology
Cores and localizations of $(\infty,\infty)$-categories
We consider $(\infty,d)$-categories in the limit $d\to \infty$ via the core or localization functors that forget or invert higher non-invertible arrows, respectively. We compare the two resulting $(\infty,1)$-categories of $(\infty,\infty)$-categories and exhibit the localization-limit as a reflective localization of the core-limit. Furthermore, we study notions of invertibility that only emerge at $d=\infty$ and give rise to intermediate reflective localizations between the two limits. For example, we characterize coinductive completion and the maps it inverts, and reveal a new separation beyond the one of Henry–Loubaton by showing that even the stronger $\omega$-completeness does not suffice to carve out the localization-limit.
Read the full abstract
Dynamical Systems
Global dynamics and bifurcation analysis of a chemostat model with obligate mutualism and mortality
We propose a system of differential equations modeling the competition between two obligate mutualistic species for a single nutrient in a chemostat. Each species promotes the growth of the other, and growth occurs only in the presence of its partner. The three-dimensional model incorporates interspecific density-dependent growth functions and distinct removal rates. We perform a mathematical analysis by characterizing the multiplicity of equilibria and deriving conditions for their existence and stability. Using MatCont, we construct numerical operating diagrams in the parameter space of dilution rate and input substrate concentration, providing a global view of the qualitative dynamics of the system. One-parameter bifurcation diagrams with respect to the input substrate then reveal a variety of dynamical transitions, including saddle-node, Hopf, limit point of cycles LPC, period-doubling PD, and homoclinic bifurcations. When mortality is included, the system exhibits a richer dynamical repertoire than in the mortality-free case, with stable and unstable periodic orbits, tri-stability between equilibria and limit cycles, and several codimension-two bifurcations, including Bogdanov-Takens (BT), cusp of cycles (CPC), resonance points (R1 and R2), and generalized Hopf GH points. These features allow coexistence not only around positive equilibria but also along stable limit cycles, reflecting more realistic ecological dynamics. In contrast, neglecting mortality restricts coexistence to equilibria only. Overall, this study highlights the critical role of mortality in shaping complex dynamics in obligate mutualism, producing multistability and oscillatory coexistence patterns that may better represent natural microbial or ecological systems.
Read the full abstract
Analysis of PDEs
Arnold stability and rigidity in Zeitlin's model of hydrodynamics
Zeitlin's model is a discretisation of the 2-D Euler equations that preserves the underlying geometric structure. This feature makes it suitable for studying the qualitative behaviour of the dynamics. Here, we utilise Arnold's geometric approach to prove Lyapunov stability of steady states in Zeitlin's model. Furthermore, we show that such Arnold stable stationary solutions are subject to a rigidity condition that enforces a specific form of the matrix describing the state. Our argument relies on matrix theory and is therefore detached, and conceptually different, from the nonlinear stability analysis as developed for the 2-D Euler equations. Nevertheless, our results concur with those known for the 2-D Euler equations, which hints at links between matrix theory and nonlinear PDE techniques. Furthermore, our results show that the Zeitlin's model, as a numerical discretisation, is reliable for studying stationary solutions.
Read the full abstract
Statistics Theory
ForwardFlow: Simulation only statistical inference using deep learning
Deep learning models are being used for the analysis of parametric statistical models based on simulation-only frameworks. Bayesian models using normalizing flows simulate data from a prior distribution and are composed of two deep neural networks: a summary network that learns a sufficient statistic for the parameter and a normalizing flow that conditional on the summary network can approximate the posterior distribution. Here, we explore frequentist models that are based on a single summary network. During training, input of the network is a simulated data set based on a parameter and the loss function minimizes the mean-square error between learned summary and parameter. The network thereby solves the inverse problem of parameter estimation. We propose a branched network structure that contains collapsing layers that reduce a data set to summary statistics that are further mapped through fully connected layers to approximate the parameter estimate. We motivate our choice of network structure by theoretical considerations. In simulations we demonstrate three desirable properties of parameter estimates: finite sample exactness, robustness to data contamination, and algorithm approximation. These properties are achieved offering the the network varying sample size, contaminated data, and data needing algorithmic reconstruction during the training phase. In our simulations an EM-algorithm for genetic data is automatically approximated by the network. Simulation only approaches seem to offer practical advantages in complex modeling tasks where the simpler data simulation part is left to the researcher and the more complex problem of solving the inverse problem is left to the neural network. Challenging future work includes offering pre-trained models that can be used in a wide variety of applications.
Read the full abstract
Probability
Sharp propagation of chaos for mean field Langevin dynamics, control, and games
We establish the sharp rate of propagation of chaos for McKean-Vlasov equations with coefficients that are non-linear in the measure argument, i.e., not necessarily given by pairwise interactions. Results are given both on bounded time horizon and uniform in time. As applications, we deduce the sharp rate of propagation of chaos for the convergence problem in mean field games and control, and for mean field Langevin dynamics, the latter being uniform in time in the strongly displacement convex regime. Our arguments combine the BBGKY hierarchy with techniques from the literature on weak propagation of chaos.
Read the full abstract
Information Theory · Cross-listed from quant-ph
Permutation-invariant codes: a numerical study and qudit constructions
We investigate Permutation-Invariant (PI) quantum error-correcting codes encoding a logical qudit of dimension $\mathrm{d}_\mathrm{L}$ in PI states using physical qudits of dimension $\mathrm{d}_\mathrm{P}$. We extend the Knill–Laflamme (KL) conditions for $d-1$ deletion errors from qubits to qudits and investigate numerically both qubit ($\mathrm{d}_\mathrm{L} = \mathrm{d}_\mathrm{P} = 2$) and qudit ($\mathrm{d}_\mathrm{L} > 2$ or $\mathrm{d}_\mathrm{P} > 2$) PI codes. We analyze the scaling of the block length $n$ in terms of the code distance $d$, and compare to existing families of PI codes due to Ouyang, Aydin–Alekseyev–Barg (AAB) and Pollatsek–Ruskai (PR). Our three main findings are: (i) We conjecture that qubit PI codes correcting up to $d-1$ deletion errors have block length $n(d) \geq (3d^2 + 1) / 4$, which implies an upper bound $d \leq \sqrt{12n-3}/3$ on their code distance, and that PR codes can saturate this bound. (ii) For qudit PI codes encoding a single qudit we numerically observe that increasing $\mathrm{d}_\mathrm{P}$ results in $n$ monotonically decreasing and approaching the quantum Singleton bound $n(d) \geq 2d-1$. (iii) We propose a semi-analytic extension of the qubit AAB construction to qudits that finds explicit solutions by solving a linear program. Our results therefore provide key insights into lower bounds on the block length scaling of both qubit and qudit PI codes, and demonstrate the benefit of increased physical local dimension in the context of PI codes.
Read the full abstract
Analysis of PDEs
Nontangential Maximal Function estimates for the elliptic Mixed Boundary Value Problem with variable coefficients
We consider an elliptic operator $L$ with variable, merely bounded, and measurable coefficients on a Lipschitz domain, and study solutions to $Lu=0$ that attain given Neumann and Dirichlet-regularity data on different parts of the boundary. The boundary data lies in $L^p$ or $W^{1,p}$ respectively, and we show nontangential maximal function estimates of the gradient of the solution. This mixed boundary value problem generalizes the pure Dirichlet, regularity, and Neumann problem with rough boundary data in $L^p$, and the already established mixed boundary value problem for the Laplacian.
Read the full abstract
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Violating the All-or-Nothing Picture of Local Charges in Non-Hermitian Bosonic Chains
We present explicit counterexamples to a widespread empirical expectation that local commuting charges display all-or-nothing behavior. In the class of bosonic chains with symmetric nearest-neighbor hopping and arbitrary on-site terms (including non-Hermitian terms), we exhibit systems that possess k-local charges for some but not all k. Concretely, we construct non-Hermitian models with a 3-local charge but no other nontrivial local charges and models with k-local charges for all k except k = 4. These results show that the Grabowski–Mathieu integrability test based on 3-local charges is not universally applicable. We further give necessary and sufficient conditions for the existence of k-local charges in this class, yielding an exhaustive classification and uncovering additional integrable models.
Read the full abstract
Numerical Analysis
Convergence Analysis of a Fully Discrete Observer For Data Assimilation of the Barotropic Euler Equations
We study the convergence of a discrete Luenberger observer for the barotropic Euler equations in one dimension, for measurements of the velocity only. We use a mixed finite element method in space and implicit Euler integration in time. We use a modified relative energy technique to show an error bound comparing the discrete observer to the original system's solution. The bound is the sum of three parts: an exponentially decaying part, proportional to the difference in initial value, a part proportional to the grid sizes in space and time and a part that is proportional to the size of the measurement errors as well as the nudging parameter. The proportionality constants of the second and third parts are independent of time and grid sizes. To the best of our knowledge, this provides the first error estimate for a discrete observer for a quasilinear hyperbolic system, and implies uniform-in-time accuracy of the discrete observer for long-time simulations.
Read the full abstract
Statistics Theory · Cross-listed from cs.LG
Ranking Reasoning LLMs under Test-Time Scaling
Test-time scaling evaluates reasoning LLMs by sampling multiple outputs per prompt, but ranking models in this regime remains underexplored. We formalize dense benchmark ranking under test-time scaling and introduce Scorio, a library that implements statistical ranking methods such as paired-comparison models, item response theory (IRT) models, voting rules, and graph- and spectral-based methods. Across $20$ reasoning models on four Olympiad-style math benchmarks (AIME'24, AIME'25, HMMT'25, and BrUMO'25; up to $N=80$ trials), most full-trial rankings agree closely with the Bayesian gold standard $\mathrm{Bayes}_{\mathcal{U}}@80$ (mean Kendall's $\tau_b = 0.93$–$0.95$), and $19$–$34$ methods recover exactly the same ordering. In the single-trial regime, the best methods reach $\tau_b \approx 0.86$. Using greedy decoding as an empirical prior ($\mathrm{Bayes}_{\mathbf{R}_0}@N$) reduces variance at $N=1$ by $16$–$52\%$, but can bias rankings when greedy and stochastic sampling disagree. These results identify reliable ranking methods for both high- and low-budget test-time scaling. We release Scorio as an open-source library at https://github.com/mohsenhariri/scorio.
Read the full abstract
Logic
Applications of the Gelfand–Naimark duality
Stone duality is an indispensable tool for the study of compact, zero-dimensional, Hausdorff spaces. In the case of general compact Hausdorff spaces one can get quite a bit of mileage by considering the `Wallman duality' between compact spaces and lattices of closed sets. I will argue that the Gelfand–Naimark duality between compact Hausdorff spaces and unital, commutative C*-algebras provides great insight into compact Hausdorff spaces as well as into \v Cech–Stone remainders and their autohomeomorphisms in particular.
Read the full abstract
Combinatorics
Extremal Laplacian energy of $\overrightarrow{C_{k+1}}$-free digraphs
The Laplacian energy of a digraph $G$ is defined as $\sum_{i=1}^n \lambda_i^2$, where $\lambda_i$ are the eigenvalues of the Laplacian matrix of $G$. A (di)graph $G$ is said to be $H$-free if it does not contain a copy of the fixed (di)graph $H$ as a sub(di)graph. In this paper, we extend the Turán problems to spectral Turán problems in digraphs: what is the maximal Laplacian energy of an $H$-free digraph of given order? In particular, we determine the maximum Laplacian energy and characterize the extremal digraphs of $\overrightarrow{C_{k+1}}$-free digraphs.
Read the full abstract
Combinatorics
Semidegree threshold for spanning trees in oriented graphs
We show that for all $\gamma > 0$ and $\Delta \in \mathbb{N}$, there is some $n_0$ such that, if $n \geq n_0$, then every oriented graph on $n$ vertices with minimum semidegree at least $(3/8 + \gamma)n$ contains a copy of each oriented tree on $n$ vertices with maximum degree at most $\Delta$. This is asymptotically best possible.
Read the full abstract
Analysis of PDEs
On elliptic systems with $k$-wise interactions in the strong competition regime: uniform Hölder bounds and properties of the limiting configurations
In this paper we investigate a class of variational reaction-diffusion systems with strong competition driven by beyond-pairwise interactions. The model involves $d$ nonnegative components interacting through $k$-wise terms, with $3 \leq k \leq d$, and includes symmetric interaction coefficients accounting for multi-component effects as well as suitable nonlinear terms. We focus on minimal energy solutions, proving uniform-in-$\beta$ Hölder bounds up to an explicit threshold exponent depending only on the dimension of the space and on the order $k$ of the interaction. As $\beta \to +\infty$, we show that minimizers converge strongly in $H^1$ and in Hölder spaces to a partially segregated configuration, characterized as minimizer of a natural variational problem under a $k$-segregation constraint. Finally, we prove that every minimizer of the limit problem enjoys the Hölder regularity and we derive some basic extremality conditions.
Read the full abstract
Mathematical Physics
Hamiltonian formulation and matrix discretization for axisymmetric magnetohydrodynamics
Equations of ideal magnetohydrodynamics (MHD) play an important role in the studies of turbulence, astrophysics, and plasma physics. These equations possess remarkable geometric structures and symmetries. Indeed, they admit a geodesic formulation in the sense of Arnold, as a Lie–Poisson flow on the dual of an infinite-dimensional Lie algebra. Zeitlin's model, previously developed for MHD on the flat torus and the two-sphere, is a matrix approximation of MHD consistent with the underlying geometric structures. In this paper, we derive the reduced model of axially symmetric magnetohydrodynamics on the three-sphere and give its Hamiltonian formulation. We further extend finite dimensional Zeitlin's matrix model for MHD from 2D to axially symmetric 3D flows of magnetized fluids, yielding the first discrete model for 3D magnetohydrodynamics compatible with the underlying Lie–Poisson structure.
Read the full abstract
Analysis of PDEs
Incompressible Euler Blowup at the $C^{1,\frac{1}{3}}$ Threshold
We prove finite-time Type–I blowup for the three-dimensional incompressible Euler equations in the axisymmetric no-swirl class, with initial velocity in $C^{1,\alpha}(\mathbb{R}^3)\cap L^2(\mathbb{R}^3)$, odd symmetry in $z$, and $0<\alpha<\tfrac13$, for an explicit class of finite-energy initial data. The singularity forms at a stagnation point on the symmetry axis. The axial strain and the global vorticity norm blow up at the Type–I rates $-\partial_z u_z(0,0,t)\simeq (T^*-t)^{-1}$ and $\|\omega(\cdot,t)\|_{L^\infty}\simeq (T^*-t)^{-1}$, while the meridional Jacobian collapses according to $J(t)\simeq (T^*-t)^{1/(1-3\alpha)}$. The proof is organized around a Lagrangian clock-and-driver framework. The clock is the meridional Jacobian $J(t)$, and the driver is the compressive axial strain $-\partial_z u_z(0,0,t)$. These variables satisfy, to leading order, a closed Riccati-clock system: the axial strain drives the collapse of $J(t)$, while the collapse of $J(t)$ amplifies the axial strain. We prove that the Euler flow tracks this clock-and-driver model up to the singular time. The main nonlocal obstruction is the pressure Hessian; it is controlled by a non-perturbative strain–pressure Hessian comparison showing that pressure cannot cancel the quadratic compressive strain responsible for collapse. This gives a dynamical explanation of the threshold $\alpha=\tfrac13$. The blowup mechanism is structurally stable and persists for an open set of admissible angular functions in a weighted Hölder topology.
Read the full abstract
Logic · Cross-listed from cs.LO
A Formalization of Abstract Rewriting in Agda
We present a constructive formalization of Abstract Rewriting Systems (ARS) in the Agda proof assistant, focusing on standard results in term rewriting. We define a taxonomy of concepts related to termination and confluence and investigate the relationships between them and their classical counterparts. We identify, and eliminate where possible, the use of classical logic in the proofs of standard ARS results. Our analysis leads to refinements and mild generalizations of classical termination and confluence criteria. We investigate logical relationships between several notions of termination, arising from different formulations of the concept of a well-founded relation. We illustrate general applicability of our ARS development with an example formalization of the lambda calculus.
Read the full abstract
Classical Analysis and ODEs
Sharp Eigenfunction Bounds on the Torus for large $p$
We prove the discrete restriction conjecture holds with no loss when $p>\frac{2d}{d-4}$ and $d\geq 5$. That is, we show optimal $L^p$ bounds for eigenfunctions of the Laplacian on the square torus for large values of $p$. This improves the results of Bourgain and Demeter. Our proof method is a refinement of the circle method approach previously used to establish results with a subpolynomial loss. This represents the first sharp $L^p$ bounds for eigenfunctions on the torus since the work of Cooke and Zygmund. We present applications to bounds for spectral projectors and the additive energy of integer lattice points on higher dimensional spheres. These results are similarly sharp. We also prove results with a logarithmic loss that hold in a wider range of $p$.
Read the full abstract
Analysis of PDEs
Long-time dynamics of a bulk-surface convective Cahn–Hilliard system: Pullback attractors and convergence to equilibrium
We study the long-time dynamics of a bulk-surface convective Cahn–Hilliard system describing phase separation processes with bulk-surface interaction. The presence of convection terms leads to a non-autonomous dynamical system and prevents the associated free energy from being a Lyapunov functional, which makes the analysis of the asymptotic behavior considerably more challenging. First, we establish an instantaneous regularization property for weak solutions. Next, interpreting the evolution as a continuous two-parameter process, we prove the existence of a minimal pullback attractor. Finally, under suitable decay assumptions on the velocity fields, we show that every solution converges as $t\to\infty$ to a single steady state. The proof of this convergence relies on the Łojasiewicz–Simon inequality combined with customized decay estimates that compensate for the lack of a monotone energy functional.
Read the full abstract
Analysis of PDEs
Preservation of F-convexity under the heat flow
We introduce the notion of F-convexity as a general extension of power convexity. We characterize the F-convexities preserved under the heat flow in the n-dimensional Euclidean space, and identify the strongest and the weakest ones among them. We also characterize the F-convexities preserved under the Dirichlet heat flow in convex domains.
Read the full abstract
Logic
Forcing with random variables in bounded arithmetics and set theory
We analyse the Boolean-valued random forcing $B_{M,\Omega}$ in bounded arithmetics developed in Krajicek (Forcing with random variables and proof complexity, vol. 382, Cambridge University Press, 2011) from the perspective of the forcing in set theory. We observe that under the assumption that $M$ is a non-standard $\omega_1$-saturated model of true arithmetics of size $\omega_1$, and $\Omega \in M$ is a non-standard number, $B_{M,\Omega}$ is isomorphic to the probability (random) algebra corresponding to the product measure space on $2^{\omega_1}$ (and hence does not depend on $M$ and $\Omega$). Thus, in a well-defined sense, the forcing $B_{M,\Omega}$ adds a "random integer" to the model $M$, using a non-separable algebra corresponding to $2^{\omega_1}$. If $G$ is a generic filter for $B_{M,\Omega}$ over a transitive model of set theory $V$, we naturally define in $V[G]$ two-valued generic extensions $M[G]^{R}$ of $M$ which correspond to Boolean-valued models in Krajicek's book (where $R$ ranges over collections of random variables which function as names for new integers). We study the relationship between the linear order $(M,<)$ and its extensions $(M[G]^R,<)$, proving several results on the extent of the mutual density of new integers in $M[G]^{R}$ and the "ground-model" integers in $M$. At the end, we discuss some advantages and limitations of interpreting forcing in bounded arithmetics (and other weak theories) in the framework of set-theoretic forcing, providing an alternative to an axiomatic approach to forcing in bounded arithmetics formulated by Atserias and Müller in Partially definable forcing and bounded arithmetic, Archive for Mathematical Logic 54 (2015), 1-33.
Read the full abstract
Probability
Random interlacements on transient weighted graphs: 0-1 laws and FKG inequality
We study some properties of the random interlacement model on a transient weighted graph, which was introduced by A. Teixeira in ["Interlacement percolation on transient weighted graphs", Augusto Teixeira, Electronic Journal of Probability (2009)]. We give a simple proof of the FKG-property and discuss the occurrence of several 0-1 laws for non-local events. We show in particular a 0-1 law for some increasing non-local events, without any assumption.
Read the full abstract
Algebraic Geometry
The Chow motive of LSV hyper-Kälher manifolds
Let $X$ be a smooth cubic fourfold over $\C$ and let $\pi : \sJ_U \to U$, with $ U \subset (\P^5)^*$, be the Lagrangian fibration whose fibres are the smooth hyperplane sections $Y_ H = X \cap H$, with $H \in U$. There always exists a (not unique) smooth compactification $\bar \sJ \to (\P^5)^*$ which is a hyper-Kälher manifold of OG10 type. Since two different compactifications are birationally equivalent their Chow motives are isomorphic. For a general $X$ a geometrical construction of a smooth compactification $\sJ(X)$ with irreducible fibres has been described in [LSV]. In this note we prove that the Chow motive $h(\sJ(X)) $ is a direct summand of the (twisted) motive of $X^5$ and therefore is is of abelian type if $h(X)$ is of abelian type.We describe a 10 -dimensional family $\sF$ of cubics $X$ such that the compactification $\sJ(X)$ is unique, smooth, with irreducible fibres, and the Chow motive $h( \sJ(X) )$ is of abelian type.
Read the full abstract
Geometric Topology
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.