Mathematical Physics · Cross-listed from cond-mat.str-el
The $\mathbb{Z}_N^{\times 3}$ symmetry protected boundary modes in two-dimensional Potts paramagnets
Hrant Topchyan
We construct and analyze a class of one-dimensional boundary
Hamiltonians arising from two-dimensional
symmetry-protected topological phases with $\mathbb{Z}_N^{\times 3}$
symmetry on a triangular
lattice. Using a
cohomology-based transformation, the
lattice models for the edge modes are explicitly obtained, and their structure is shown to be governed by the arithmetic properties of $N$. For
prime $N$, the boundary theory admits a formulation in terms of mutually commuting Temperley-Lieb
algebras. For the composite values of $N$, the models exhibit hierarchical or factorized structures. We demonstrate that the phases can be understood in terms of primary models augmented by local defect degrees of freedom that partition the system into independent segments. Finally, the global
symmetry is realized on the boundary in a non-on-site and anomalous manner, directly realizing the corresponding 't Hooft anomaly.
Read the full abstract ▾
Mathematical Physics · Cross-listed from quant-ph
Quantum walk on a random comb
François David and Thordur Jonsson
We study continuous time
quantum walk on a random comb graph with infinite teeth. Due to localization effects along the spine, the walk cannot go to infinity in the spine direction, while it can escape to infinity along the teeth of the comb. Starting from an initial vertex, the walk has a nonzero probability to stay trapped in a finite region. These results are obtained by studying the spectrum and eigenstates of the random
Hamiltonian for the graphand analysing its properties. We use both analytic and numerical methods, many of which come from the theory of Anderson localization in one dimension.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Soft projections for robust data-driven control
András Sasfi, Jaap Eising and Florian Dörfler
We consider data-based predictive control based on behavioral systems theory. In the linear setting this means that a system is described as a subspace of trajectories, and predictive control can be formulated using a projection onto the intersection of this behavior and a constraint set. Instead of learning the model, or subspace, we focus on determining this projection from data. Motivated by the use of regularization in data-enabled predictive control (DeePC), we introduce the use of soft projections, which approximate the true projector onto the behavior from noisy data. In the simplest case, these are equivalent to known regularized DeePC schemes, but they exhibit a number of benefits. First, we provide a bound on the approximation error consisting of a bias and a variance term that can be traded-off by the regularization weight. The derived bound is independent of the true system order, highlighting the benefit of soft projections compared to low-dimensional subspace estimates. Moreover, soft projections allow for intuitive generalizations, one of which we show has superior performance on a case study. Finally, we provide update formulas for soft projectors enabling the efficient adaptation of the proposed data-driven control methods in the case of streaming data.
Read the full abstract ▾
Combinatorics
Hamiltonicity of inhomogeneous random graphs
Frederik Garbe, Jan Hladký and Simón Piga
We provide a complete characterization of those graphons $W$ for which the inhomogeneous random graph \(\G(n,W)\) is asymptotically almost surely
Hamiltonian. The characterization involves three conditions. Two of them constitute the characterization of $\G(n,W)$ being a.a.s.\ connected, as was shown recently by Hladký and Viswanathan. The third condition captures a
geometric obstacle which prevents $\G(n,W)$ from having perfect fractional matchings. A prominent feature of the positive direction of our proof is the use of weak* limits to translate the absence of the above
geometric obstacle into favourable matching properties of a regularization of $\G(n,W)$.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.DM
Enumerating Two-Orbit Graphs
David Seka and Stefan Szeider
We present an approach to enumerate graphs whose
automorphism group has exactly two orbits. Our method exploits the observation that we can enumerate all graphs whose
automorphism group contains a given this permutation group. We obtain the relevant groups via Goursat's lemma. In order to scale the enumeration, we employ additional optimizations that prune irrelevant groups. In total, we enumerate, for the first time, all connected two-orbit graphs of up to 27 vertices, totaling 10,094,721 graphs, pushing the state of the art well beyond what direct enumeration methods can achieve.
Read the full abstract ▾
Numerical Analysis
MultiWave: A computational laboratory for adaptive numerical methods approximating hyperbolic balance laws
Adrian Kolb and Aleksey Sikstel
The MultiWave C++-framework for adaptive numerical methods approximating
hyperbolic balance laws is presented. MultiWave has been designed as a computational laboratory where new mathematical concepts can be quickly implemented and tested. Starting from the mathematical background and proceeding to the low-level implementation details, the realisation of a discontinuous Galerkin method with multiresolution-based grid adaptation is demonstrated. The design choices, in particular regarding the modularity that allows one to extend the code reusing existing infrastructure, is discussed. Scaling studies on a distributed-
memory machine show that the framework retains its efficiency up to large rank counts, and that multiresolution-based adaptivity reduces the cost per time step by orders of magnitude compared to the uniform-grid computation at the order of accuracy of the full reference discretisation.
Read the full abstract ▾
Probability
On some extensions of generalized counting processes
Lyudmyla Sakhno and Artem Storozhuk
We study different fractional extensions of the Poisson process and generalized counting processes by introducing time-change represented by the inverse to the sums of stable and tempered stable subordinators. We state the governing equations for probability distributions and probability generating functions which involve fractional derivatives of different orders. Closed form expressions for probability distributions and probability generating functions are also provided for several considered models.
Read the full abstract ▾
Numerical Analysis
The functional impact of myofiber macroscopic organization and disarray in computational models of the murine heart
Carlo Guastamacchia, Roberto Piersanti, Francesco Giardini et al. (+5 more)
A major challenge in computational models of cardiac electromechanics is the reconstruction of myocardial fiber architecture, as direct in vivo measurements of fiber orientation are not feasible. Consequently, rule-based methods are commonly adopted as surrogates. This study investigates the respective roles of macroscopic fiber architecture and microscopic fiber disarray in cardiac electromechanical simulations. A high-fidelity biventricular electromechanical model of a murine heart was developed using a high-resolution myocardial fiber field obtained via mesoscopic optical imaging, which serves as a reference ground truth. A spatial smoothing strategy is introduced to decouple macroscopic fiber organization from local disarray, and the resulting responses are also compared with those obtained using a rule-based fiber field. The results show that passive mechanics and electrophysiological activation are only weakly affected by fiber disarray, with global chamber compliance and activation times remaining largely unchanged across different fiber descriptions. In contrast, active mechanics is highly sensitive to fiber architecture. Moderate regularization of the experimentally measured fiber field enhances the ventricular pumping efficiency of the computational model by reducing microscopic disarray while preserving the macroscopic helical organization, whereas excessive smoothing or rule-based fiber reconstructions lead to unphysiologically strong or inefficient contraction. Within this framework, two commonly adopted surrogate strategies to account for fiber disarray are investigated: a reduction of the effective cross-bridge stiffness in the active tension model, and the introduction of controlled misalignment between active tension and the local fiber direction. Overall, the results reveal important limitations of commonly adopted surrogate approaches for modeling fiber disarray.
Read the full abstract ▾
All authors Carlo Guastamacchia, Roberto Piersanti, Francesco Giardini, Raffaele Coppini, Cecilia Ferrantini, Luca Dede', Leonardo Sacconi, Francesco Regazzoni
Representation Theory
A Categorification of Subword Complexes and Its Hall Algebra
Mikhail Gorsky and Zijun Li
Bergeron and Ceballos defined a
Hopf algebra structure on equivalence classes of subword complexes. We introduce a category of subword complexes, endow it with a proto-exact-like structure, and show that the corresponding dual
Hall Hopf algebra is isomorphic to the
algebra of Bergeron-Ceballos. We prove that the full subcategory of root-independent objects is proto-abelian in the sense of Dyckerhoff. We give a categorical lift of flips in subword complexes. We consider a version of a category of formal direct sums of subobjects for a root-independent subword complex and interpret it in terms of quivers. If the corresponding quiver is a tree, the category is endowed with a proto-exact structure. We show that its
Hall algebra is isomorphic to the
Hall algebra of the category of representations of this quiver over $\mathbb{F}_1$. Under certain conditions, a flip corresponds to changing a proto-exact structure while keeping the category the same up to isomorphism, which corresponds to a non-trivial
automorphism of the
Hall algebra. In type $A$, this leads to a realization of the nilpotent part of the universal enveloping
algebra and its
automorphisms.
Read the full abstract ▾
Statistics Theory · Cross-listed from astro-ph.CO
Curvature-Conditioned Measures for Cosmological Peak Statistics: A Transport-Geometric Framework
Tsutomu T. Takeuchi
We develop a transport-
geometric theory of cosmological peak statistics based on optimal transport and
entropy geometry. The density field is treated as a probability measure in Wasserstein space, and its local structure is characterized by a logarithmic
curvature tensor obtained as the localized response of an
entropy functional. Peaks are thereby defined as positive-
curvature stationary points, and their abundance is formulated as a curvatureconditioned measure on local tensor space. In the Gaussian-linear limit, this measure admits a finite-dimensional closure in terms of the spectral moments of the density field. The resulting peak abundance reduces exactly to the classical BBKS formula, identifying BBKS as a solvable Gaussian closure of a more general
geometric structure. This formulation separates peak statistics into three fundamental ingredients: the probability distribution of local variables, the positive-
curvature constraint, and the induced
geometric measure. The theory extends naturally beyond the Gaussian approximation. Nonlinear
evolution appears as a deformation of the logarithmic
curvature geometry, while
primordial non-Gaussianity is interpreted as a deformation of the
curvature-conditioned measure itself. We further formulate two- and three-point peak statistics as higher-order
curvature-conditioned measures and show that the resulting hierarchy can be organized as response functions to long-wavelength background modes, with conventional peak bias emerging as the lowest-order response coefficient. These results provide a unified description linking optimal transport,
curvature geometry, peak statistics, and cosmological observables, and establish a systematic framework for studying nonlinearity, scale dependence,
primordial non-Gaussianity, and higher-order peak correlations.
Read the full abstract ▾
Dynamical Systems · Cross-listed from q-bio.QM
Analytical characterisation of the Mi- and To-phases in HeMiTo dynamics: exponential growth and logistic saturation of toxic prion-like proteins
Johannes G. Borgqvist
Prion-like propagation of misfolded
proteins is a key mechanism underlying the progression of neurodegenerative diseases such as Alzheimer's disease. In previous work, we introduced the HeMiTo framework, describing these prion-like dynamics for a class of heterodimer models in terms of three phases: the healthy (He), mixed (Mi), and toxic (To) phases. While the He-phase was characterised analytically, the Mi-phase was described numerically and the To-phase was inferred from linear stability arguments. In this work, we provide a complete analytical characterisation of the Mi- and To-phases for our class of heterodimer models. We derive exact inner solutions governing the Mi-phase and match them with outer solutions from the He-phase, explaining the concave-like behaviour of the healthy species and establishing explicit conditions for exponential growth of the toxic species with a mechanistically interpretable growth rate. Furthermore, we formalise a quasi steady-state reduction near the toxic steady state and show that the dynamics reduce to a logistic growth equation, linking exponential growth to saturation. Together, these results provide a unified and mechanistic description of prion-like dynamics across all phases of disease progression and establish a foundation for predictive modelling of biomarker trajectories.
Read the full abstract ▾
Numerical Analysis
Error Estimates for Nitsche's Method on Approximate Domains
Mats G. Larson, Karl Larsson and Shantiram Mahata
We derive a priori error estimates for Nitsche's method applied to
elliptic problems on approximate domains. Such approximations arise, for example, in unfitted finite element methods, data-driven simulations, and evolving domain problems, where the computational domain does not coincide exactly with the physical one. We quantify
geometric errors in terms of boundary location and normal perturbations and carry out the analysis in an abstract CutFEM framework under standard stability assumptions. In the energy norm, we obtain an estimate exhibiting an $h^{-1/2}$ amplification of the boundary location error. We then prove a refined $H^1$-seminorm estimate that removes this amplification, yielding a sharper bound with additive contributions from boundary location and normal errors. Finally, we establish an optimal order $L^2$-error estimate based on a refined duality argument, where the geometry contribution appears as a separate additive term, decoupled from the mesh size $h$. The results reveal a fundamental distinction between the norms: the energy norm amplifies boundary location errors while remaining insensitive to normal perturbations, the $H^1$-seminorm separates location and normal errors, and the $L^2$-norm is insensitive to normal perturbations. This provides a clear characterization of how
geometric approximation affects convergence in Nitsche-based finite element methods, with particular relevance for unfitted discretizations.
Read the full abstract ▾
Information Theory · Cross-listed from cond-mat.stat-mech
Statistical Physics of Coding for the Integers
Neri Merhav
We study a paradigm of coding for compression of the natural numbers via the
zeta distribution and develop a statistical-mechanical interpretation, both in terms of Hagedorn systems and a Bose gas with energy levels given by logarithms of
prime numbers. We also propose a simple coding scheme for the
zeta distribution that nearly achieves the ideal code length. For block coding of vectors of natural numbers, we derive the micro-canonical
entropy function and demonstrate its asymptotic linearity implying that its behavior is analogous to that of a Hagedorn system. We also derive the large deviations rate function, and provide a formula for the best coding parameter in the large deviations sense. We show that due the Hagedorn-type phase transition there is only partial equivalence of ensembles, due to the degeneration of the domain of the partition function.
Read the full abstract ▾
Numerical Analysis
Finite-Budget Convergence and Chaos-Aware Stopping Criteria for Time-Parallel Methods
Giancarlo Antonino Antonucci, Raphael Andreas Hauser, Debasmita Samaddar et al. (+1 more)
Time-parallel
algorithms, such as Parareal, are well understood for linear problems, but their convergence analysis for nonlinear, chaotic systems remains limited. This paper introduces a theoretical framework for analysing time-decomposition methods as local contraction mappings with a finite iteration budget. We derive a finite-budget guarantee linking the initial error, convergence rate, and iteration count through a
geometric outer–inner-ball condition. We apply this framework to Parareal, deriving explicit estimates for the convergence factor on nonlinear problems. A frozen-Jacobian expansion separates tableau mismatch from Jacobian drift; actual Runge–Kutta maps admit short-window contraction under uniform neighbourhood hypotheses. First-batch defects estimate the initial error, and sampled actual-map derivatives give practical budget predictions covering all six tested weighted-error crossings; guarantees require uniform bounds. For chaos-aware stopping, we introduce a proximity function that weights the interface defects (the jumps between chunks) and bounds weighted trajectory error. Numerical experiments on the logistic, Lorenz-63, and Lorenz-96 systems assess early acceptance. With accurate coarse propagation, the chaotic tests typically take two or three fine batches, and accurate prefixes can extend beyond exact chunks. In an independent Lorenz-63 test with inadequate coarse propagation, Lyapunov stopping reduces energy-estimation error relative to coarse-only at lower modelled cost than standard stopping and meets the prescribed adequacy test. Its gain over the zero-correction first fine batch is not significant, however, and a less costly intermediate-step serial solver meets the accuracy limit. An independent Lorenz-96 test finds no clear energy-error improvement. Statistical fidelity is assessed separately from weighted acceptance.
Read the full abstract ▾
All authors Giancarlo Antonino Antonucci, Raphael Andreas Hauser, Debasmita Samaddar, James Buchanan
Statistics Theory · Cross-listed from stat.OT
Debiased Estimators in High-Dimensional Regression: A Review and Replication of Javanmard and Montanari (2014)
Benjamin Smith
High-dimensional statistical settings ($p \gg n$) pose fundamental challenges for classical inference, largely due to bias introduced by regularized
estimators such as the LASSO. To address this, Javanmard and Montanari (2014) propose a debiased
estimator that enables valid hypothesis testing and confidence interval construction. This report examines their debiased LASSO framework, which yields asymptotically normal
estimators in high-dimensional settings. The key theoretical results underlying this approach are presented. Specifically, the construction of an optimized debiased
estimator that restores asymptotic normality, which enables the computation of valid confidence intervals and $p$-values. To evaluate the claims of Javanmard and Montanari, a subset of the original simulation study and the real-data analysis is presented. The original empirical analysis is extended to the desparsified LASSO, which is referenced but not implemented in the original study. The results demonstrate that while the debiased LASSO achieves reliable coverage and controls Type I error, the LASSO projection
estimator can offer improved power in idealized low-signal settings without compromising error rates. The results reveal a trade-off: the LASSO projection
estimator performs well in low-signal settings, while Javanmard and Montanari's method is more robust to complex correlations, improving precision and signal detection in real data.
Read the full abstract ▾
Mathematical Physics
Dynkin diagrams, generalized Nahm sums and 2d CFTs
Kaiwen Sun and Haowu Wang
A folklore
conjecture states that the Nahm sum associated with a pair of Dynkin diagrams of type $ADET$ is a modular function. In this paper, we extend this
conjecture to Dynkin diagrams of type $ABCDEFGT$ in the context of generalized Nahm sums. The modular Nahm sums are closely related to the characters of 2d rational conformal field theories. In this work, we identify many specific generalized Nahm sums with characters of some well-studied 2d CFTs. For example, we find that the generalized Nahm sums associated with $(T_1, C_r)$ and $(T_1,D_r)$ correspond to the supersymmetric Virasoro minimal models $\mathrm{SM}(4r+6, 4)$ and $\mathrm{SM}(8r+4, 2)$, respectively.
Read the full abstract ▾
Mathematical Physics
Spectral sum rules on a $d$–sphere
Paolo Amore
We derive spectral sum rules for inverse powers of the
eigenvalues of the Helmholtz equation on a $d$-sphere in the presence of an arbitrary density. By adopting a rigorous renormalization scheme, we remove the divergent contributions of the zero mode and obtain exact expressions for the sum rules without requiring an explicit determination of the
eigenvalues, which is generally impossible. As an application, we derive explicit sum rules for the density $\Sigma(\Omega) = 1 + \kappa Y_{1,\vec{0}}(\Omega)$ in $d=3,4,5$ dimensions and compare them with numerical estimates obtained by approximating the low-lying part of the spectrum with the Rayleigh–Ritz method and the high-energy part with Weyl's formula.
Read the full abstract ▾
Analysis of PDEs
Sharp local sparsity of regularized optimal transport
Alberto González-Sanz, Rishabh S. Gvalani and Lukas Koch
In recent years, the use of
entropy-regularized optimal transport with $L^p$-type
entropies has become increasingly popular. In this setting, the solutions are sparse, in the sense that the support of the regularized optimal coupling, $\mathrm{supp}(\pi_\varepsilon)$, shrinks to the support of the original optimal transport problem as $\varepsilon \to 0$. The main open question concerns the rate of this convergence. In this paper, we obtain sharp local results away from the boundary. We prove that the supports $\mathrm{supp}(\pi_\varepsilon(\cdot \mid x))$ of the conditional measures, $\pi_\varepsilon(\cdot \mid x)$, behave like balls of radius $\varepsilon^\frac 1 {d(p-1)+2}$. This allows us to show that the regularized potentials are uniformly strongly convex and to derive the rate of convergence of these potentials toward their unregularized limit. Our results generalize the results of (González-Sanz and Nutz, SIAM J.~Math.~Anal.) and (Wiesel and Xu, Ibid.) to the multivariate case and beyond the case of self-transport.
Read the full abstract ▾
Analysis of PDEs
Fokker-Planck analysis and invariant laws for a continuous-time stochastic model inspired by Adam
Kaj Nyström
We study a degenerate
stochastic system inspired by bias-corrected Adam. The system arises as the continuous-time limit of an explicitly modified recursion in which the squared-gradient update is replaced by a prescribed second-moment closure. We construct an entrance solution at the singular initial time and prove convergence of the modified recursion on finite time intervals away from zero. Bias correction enters through time-dependent coefficients which converge to constants as time tends to infinity. For a smooth objective with globally Lipschitz gradient and radial dissipativity at infinity, we prove existence and uniqueness of an invariant probability measure for the autonomous system under either $b<4a$ or $\gamma L_f\le a(\sigma/\sqrt2+\varepsilon)/4$. Here $L_f$ is the Lipschitz constant of the gradient, $a,b$ are the relaxation rates, $\gamma$ is the learning-rate parameter, and $\sigma,\varepsilon$ are the noise and regularization parameters. The proof combines an exponential Lyapunov function with compact-set minorization obtained from explicit control paths and a regular endpoint map. Under an exponential Lyapunov moment condition, we obtain exponential convergence in weighted total variation and in the squared $2$-Wasserstein distance of the complete state. The invariant law has finite moments of every order, and qualitative total variation convergence holds for every initial probability law. The time-inhomogeneous process converges weakly to the same invariant law. We formulate the associated Fokker-Planck equation for probability measures and establish local hypoellipticity and smoothness of the invariant density where $\operatorname{Diag}(\nabla f)D^2f$ is invertible. A quadratic example shows that a uniform exponential convergence estimate requires a prefactor growing exponentially in the initial position along a specified family of states.
Read the full abstract ▾
Quantum Algebra
Deformations of mixed associators in module categories
Matthieu Faitg, Azat M. Gainutdinov, Christoph Schweigert et al. (+1 more)
We set up a cochain complex $C^\bullet_{\mathrm{mix}}(\mathcal{M})$ whose
cohomology controls deformations of the mixed associator of a module category $\mathcal{M}$ over a $\Bbbk$-linear monoidal category $\mathcal{C}$. We show that $C^\bullet_{\mathrm{mix}}(\mathcal{M})$ is isomorphic to the Davydov-Yetter (DY) complex of the representation functor $\rho : \mathcal{C} \to \mathrm{End}(\mathcal{M})$. Using our previous results on DY
cohomology (arXiv:2411.19111), we prove that if $\mathcal{C}$ and $\mathcal{M}$ are finite then the
cohomology $H^\bullet_{\mathrm{mix}}(\mathcal{M})$ is isomorphic to the relative Ext groups $\mathrm{Ext}^\bullet_{\mathcal{Z}(\mathcal{C}),\mathcal{C}}(\boldsymbol{1},\mathcal{A}_{\mathcal{M}})$ for the usual adjunction between the Drinfeld center $\mathcal{Z}(\mathcal{C})$ and $\mathcal{C}$, where $\mathcal{A}_{\mathcal{M}}$ is the so-called adjoint
algebra of $\mathcal{M}$. This allows us to give a dimension formula for $H^n_{\mathrm{mix}}(\mathcal{M})$ in terms of certain Hom spaces in $\mathcal{Z}(\mathcal{C})$, and also to prove that $H^{>0}_{\mathrm{mix}}(\mathcal{C}) = 0$. We also show that the
algebra $\mathcal{A}_{\mathcal{M}}$ is the “full center” of an
algebra in $\mathcal{C}$ realizing $\mathcal{M}$. We furthermore establish a generalized version of Ocneanu
rigidity for monoidal functors with coefficients, and provide its application to general (non-exact and non-finite) $\mathcal{C}$-module categories over a fusion category $\mathcal{C}$ such that $\dim(\mathcal{C}) \neq 0$. We spell out these results for module categories defined by finite-dimensional comodule
algebras over finite-dimensional
Hopf algebras. Examples based on comodule
algebras over Sweedler's
Hopf algebra are worked out in detail and yield new continuous families of inequivalent non-exact module categories.
Read the full abstract ▾
All authors Matthieu Faitg, Azat M. Gainutdinov, Christoph Schweigert, Jan-Ole Willprecht
Combinatorics
Minors of plane digraphs
Maria Chudnovsky and Paul Seymour
A digraph $H$ is a “semi-strong minor” of another, $G$, if a subdivision of $H$ can be obtained from a subdigraph of $G$ by contracting strongly-connected subdigraphs to single vertices. We will define a width measure of “plane” digraphs (that is, drawn in the plane) based on a kind of branch-composition, and show that for every plane digraph $H$, all plane digraphs not containing $H$ as a semi-strong minor have bounded width, while plane digraphs in general have unbounded width.
Read the full abstract ▾
Optimization and Control · Cross-listed from eess.SY
Min-Max Grassmannian Optimization for Online Subspace Tracking
Shreyas Bharadwaj, Bamdev Mishra, Cyrus Mostajeran et al. (+3 more)
We propose GeRoST (Geometrically Robust Subspace Tracking), an online subspace tracking
algorithm that models uncertainty in a subspace using a Grassmannian ball. We derive an exact scalar dual for the worst-case subspace problem, establish conditions for a unique worst-case subspace and a Riemannian gradient, and characterize the minimum radius needed to cover a dimensional extension of the target subspace. Each update uses either a spectral direction computed in a reduced subspace or the gradient of the window reconstruction loss. Our numerical experiments show that GeRoST achieves lower mean post-fault prediction error than GREAT in system identification. In
video separation, it achieves higher precision and a better precision–recall balance, as measured by the F$_1$ score, than both GREAT and GRASTA at the reported thresholds, with lower recall and longer runtime.
Read the full abstract ▾
All authors Shreyas Bharadwaj, Bamdev Mishra, Cyrus Mostajeran, Alberto Padoan, Jeremy Coulson, Ravi Banavar
Number Theory
The Lang-Trotter conjecture on average for genus-$2$ curves with $S_3$ reduced automorphism group
Chihiro Ando and Shushi Harashita
For an
elliptic curve $E$ over $\mathbb{Q}$ without complex multiplication, Lang and Trotter conjectured that the number of
primes $p <X$ at which $E$ has a supersingular reduction is asymptotically equal to $c\sqrt{X}/\log X$, where $c>0$ is a constant depending only on $E$. While it remains an open question, an average estimation related to the Lang-Trotter
conjecture was established by Fouvry and Murty. This result is called the Lang-Trotter
conjecture on average. We extend the Lang-Trotter
conjecture to curves of genus $2$ and obtain a similar result to the Lang-Trotter
conjecture on average for the family of curves $C_{\lambda}:y^2=x(x-1)(x-{\lambda})(x-(\lambda-1)/{\lambda})(x-1/ (1-\lambda))$. These curves are characterized as curves of genus $2$ with reduced
automorphism group containing symmetric group $S_3$.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.CV
Multicentric thrombus segmentation using an attention-based recurrent network with gradual modality dropout
Sofia Vargas-Ibarra, Vincent Vigneron, Hichem Maaref et al. (+1 more)
Detecting and delineating tiny targets in 3D
brain scans is a central yet under-addressed challenge in medical imaging.In ischemic stroke, for instance, the culprit thrombus is small, low-contrast, and variably expressed across modalities(e.g., susceptibility-weighted T2 blooming,
diffusion restriction on DWI/ADC), while real-world multi-center dataintroduce domain shifts, anisotropy, and frequent missing sequences. We introduce a methodology that couples an
attention-based recurrent
segmentation network (UpAttLLSTM), a training schedule that progressively increases the difficulty of hetero-modal learning, with gradual modality dropout, UpAttLLSTM aggregates context across slices via recurrent units (2.5D) and uses
attention gates to fuse complementary cues across available sequences, making it robust to anisotropy and class imbalance. Gradual modality dropout systematically simulates site heterogeneity,noise, and missing modalities during training, acting as both augmentation and regularization to improve multi-center generalization. On a monocentric cohort, our approach detects thrombi in >90% of cases with a Dice score of 0.65. In a multi-center setting with missing modalities, it achieves-80% detection with a Dice score around 0.35. Beyond stroke, the proposed methodology directly transfers to other small-lesion tasks in 3D medical imaging where targets are scarce, subtle, and modality-dependent
Read the full abstract ▾
All authors Sofia Vargas-Ibarra, Vincent Vigneron, Hichem Maaref, Sonia Garcia-Salicetti
Numerical Analysis
Lax convergence theorems and error estimates of a finite element method for the incompressible Euler system
Mária Lukáčová-Medviďová and Bangwei She
In this paper, we present convergence
theorems for numerical solutions of the incompressible Euler equations. The first result is the Lax-Wendroff-type
theorem, while the second can be formulated in the framework of the Lax equivalence
theorem. To illustrate their application, we study a finite element method that uses a pair of $RT_0/P_0$ elements to approximate the velocity and pressure, respectively. Applying the concept of the relative energy, we derive the convergence rates of our numerical method using two different approaches. Finally, we validate the theoretical convergence results through numerical experiments.
Read the full abstract ▾
Logic
Goodstein at the Second Threshold: An Independence Result for $ID_2$
Oriola Gjetaj and Andreas Weiermann
The classical Goodstein process, defined via hereditary base-$k$ exponential normal form, is a well-known example of a principle unprovable in Peano Arithmetic. In this paper, we generalize this framework by constructing a new Goodstein process based on the Hardy hierarchy. We develop an ordinal notation system utilizing a two-step collapsing procedure, which yields a proof-theoretic ordinal of $\psi_0\psi_1(\varepsilon_{\Omega_2+1})$. By defining $k$-normal forms for natural numbers within this system, we introduce a Goodstein-type process and demonstrate that the theory of non-iterated positive inductive definitions for two operators ($ID_2$) cannot prove its termination. This result establishes a new independence result at the second proof-theoretic threshold, further extending the reach of Goodstein-type principles beyond the Bachmann-Howard level.
Read the full abstract ▾
Functional Analysis
Coherent frames with zero Beurling density
Ingrid Beltita and Jordy Timo van Velthoven
We show the existence of a coherent frame in the orbit of a connected, simply connected unimodular solvable Lie group of exponential growth for which the lower Beurling density of its index set is zero.
Numerical Analysis
A remark on an error analysis for classical and learned Tikhonov regularization schemes
Arne Behrens, Meira Iske, Ming Jiang et al. (+2 more)
This paper presents an error analysis of classical and learned Tikhonov regularization schemes for inverse problems. We first demonstrate, both theoretically and numerically, that using a fixed regularization parameter across varying noise levels-which is a common miss-specification in practice-has only a mild impact on the reconstruction error. As a special case, we then investigate scenarios where the true data resides in an unknown finite-dimensional subspace. Here, our results lead to an empirically supported strategy for estimating the unknown dimension based on numerical experiments. Finally, we examine the approach that motivated this study: a method where a sparsity-promoting term is learned from denoising tasks and subsequently applied to general inverse problems via a simple heuristic parameter selection. The corresponding error analysis is initially developed using classical concepts and subsequently refined through a more detailed investigation of the discretized setting.
Read the full abstract ▾
All authors Arne Behrens, Meira Iske, Ming Jiang, Peter Maass, Sebastian Neumayer
Probability
Computable sufficient conditions for comparing stochastic reaction networks with mass-action or monotone kinetics
Daniele Cappelletti, Giulio Cuniberti and Paola Siri
Stochastic reaction networks are mathematical models with a wide range of applications in biochemistry, ecology, and epidemiology, and are often complex to analyze. Except for some special cases, it is generally difficult to predict how the abundances of all considered species evolve over time. A possible approach to address this issue is to develop tools to compare the model under study with a similar one whose behavior is better understood. The main contribution of our work is to provide direct and computable conditions that can be used to ensure the existence of an ordered coupling between two
stochastic reaction networks with monotone kinetics and to identify which parameter changes in a given model lead to an increase or decrease in the count of certain species. We also make available an
algorithm that implements our theory, and we illustrate it with several applications.
Read the full abstract ▾
Algebraic Geometry
Truncated Grassmannians, blow-ups along Schubert varieties and collineations
Evgeny Feigin
Truncated Grassmannians are defined as closures of orbits of abelian unipotent groups acting on the degree truncations of projectivized wedge powers. We show that such truncations in a more general setup show up in the description of the blow-ups of general flag varieties along Schubert subvarieties. We work out the case of Grassmannians in detail. In particular, we show that our blow-ups are members of a larger family of varieties projecting onto Grassmannians, and describe the fibers of these projections via the spaces of collineations.
Read the full abstract ▾