Logic · Cross-listed from cs.AI
da Costa and Tarski meet Goguen and Carnap: a novel approach for ontological heterogeneity based on consequence systems
Gabriel Rocha
This paper presents a novel approach for ontological heterogeneity that draws heavily from Carnapian-Goguenism, as presented by Kutz, Mossakowski and Lücke (2010). The approach is provisionally designated da Costian-Tarskianism, named after da Costa's Principle of Tolerance in Mathematics and after Alfred Tarski's work on the concept of a consequence operator. The approach is based on the machinery of consequence systems, as developed by Carnielli et al. (2008) and Citkin and Muravitsky (2022), and it introduces the idea of an extended consequence system, which is a consequence system extended with ontological axioms. The paper also defines the concept of an extended development graph, which is a graph structure that allows ontologies to be related via morphisms of extended consequence systems, and additionally via other operations such as fibring and splitting. Finally, we discuss the implications of this approach for the field of applied ontology and suggest directions for future research.
Read the full abstract ▾
Functional Analysis
Reproducing Kernel Hilbert Spaces on Banach Completions of Virtual Persistence Diagram Groups
Charles Fanning and Mehmet Aktas
Persistent homology maps a simplicial complex filtered by elements in $\mathbb R$ to finite formal sums of elements of $\mathbb R_{\leq}^{2} = \{ (b,d) \in \mathbb R^2 \cup \{ \infty \} \mid b < d \}$ called (finite) persistence diagrams. This map is stable with respect to the $p$–Wasserstein distance for all $p \in \left[1, + \infty \right]$. Bubenik and Elchesen extend the free translation-invariant commutative Lipschitz monoid of finite persistence diagrams $D(X,A) = D(X)/D(A)$ on arbitrary metric pairs $(X,d,A)$ with $A \subset X$ onto the free translation-invariant abelian Lipschitz group of virtual persistence diagrams $K(X,A) = K(X)/K(A)$ as an isometric
embedding $D(X,A) \hookrightarrow K(X,A)$ via the Grothendieck group completion. They prove that the $p$-Wasserstein distance is translation invariant on $D(X,A)$ if and only if $p=1$ and define the unique translation-invariant
embedding of $W_1[d]$ into $K(X,A)$ as $\rho.$ When $K(X,A)$ is locally compact abelian, translation-invariant kernels can be constructed via positive-definite functions and Bochner's
theorem on the Pontryagin dual. We prove that, for the metric
topology induced by $\rho$, the group $(K(X,A),\rho)$ is locally compact if and only if it is discrete, equivalently when the pointed metric space $(X/A,d_1,[A])$ is uniformly discrete, and hence this approach fails outside that case. Assuming instead that $(X/A,d_1,[A])$ is separable and not uniformly discrete, we develop a translation-invariant kernel theory for non–locally compact virtual persistence diagram groups. The group $K(X,A)$ embeds isometrically into its canonical
Banach-space linearization $B=\widehat V(X,A)\cong\mathcal F(X/A,d_1)$, and each bounded symmetric positive operator $Q\colon B\to B^\ast$ determines a translation-invariant Gaussian kernel $k(x,y)=\exp\!\left(-\tfrac12\,\langle Q(x-y),x-y\rangle_{B,B^\ast}\right).$
Read the full abstract ▾
Analysis of PDEs
Multi-Sink Solutions to the Self-Similar Euler Equations
Hyungjun Choi and Matei P. Coiculescu
We construct examples and provide a classification of self-similar solutions to the two-dimensional incompressible Euler equations whose pseudo-velocity fields possess more than one stagnation point. These solutions are also homogeneous steady states of the Euler equations. In contrast, we prove that any homogeneous self-similar solution with bounded vorticity away from the origin necessarily admits only a single stagnation point, located at the origin. The solutions we construct develop velocity cusps along rays from the origin, and this allows for additional stagnation points of the pseudo-velocity field.
Read the full abstract ▾
Optimization and Control
Revisiting transportation problems under Monge costs with applications to the Discrete Ordered Median Problem
Stefan Nickel, Justo Puerto, Simon Ramoser et al. (+1 more)
We investigate the classical Hitchcock-Koopmans Transportation Problem under the assumption that the cost
matrix satisfies the Monge property. In this setting, we derive compact formulas for optimal dual solutions based on the northwest-corner rule. As an application illustrating how these formulas yield structural insight while enhancing computational performance, we consider a broad class of facility location problems. In particular, the expressions are used within a Benders decomposition framework to derive novel mixed-integer linear programming formulations for the Discrete Ordered Median Problem with non-increasing weights. Numerical experiments validate that the resulting formulations achieve state-of-the-art performance and exhibit strong robustness across a wide range of instances.
Read the full abstract ▾
All authors Stefan Nickel, Justo Puerto, Simon Ramoser, Alberto Torrejon
Numerical Analysis · Cross-listed from cs.CE
SoliDualSPHysics: An extension of DualSPHysics for solid mechanics with hyperelasticity, plasticity, and fracture
Mohammad Naqib Rahimi and George Moutsanidis
We introduce SoliDualSPHysics, a novel open-source and GPU-accelerated software that extends DualSPHysics to enable the numerical simulation of hyperelastic, finite-strain plastic, and brittle fracture behavior in deformable solids within a unified smoothed particle hydrodynamics (SPH) software framework. The software implements a total Lagrangian formulation for solid mechanics that allows direct application of external loads and boundary conditions, enabling independent solid mechanics simulations. Brittle fracture is modeled through a phase-field approach coupled with SPH, allowing crack initiation, propagation, and branching under dynamic loading without explicit crack tracking, ad hoc crack-path criteria, or local refinement. The framework also supports user-defined mathematical expressions to prescribe time- and space-dependent quantities, complementing the solid and fracture extensions and enhancing flexibility across existing and future DualSPHysics applications. Leveraging DualSPHysics' native CPU/GPU parallel architecture, the software achieves substantial computational acceleration for large-scale simulations, and the implementation is verified and validated against
benchmark numerical problems and experimental data, demonstrating accuracy, robustness, and favorable scaling performance. Comprehensive implementation details and user documentation are provided to ensure reproducibility and to support further development by the community. The framework and source code are freely available through a public GitHub repository.
Read the full abstract ▾
Operator Algebras
$C^*$-correspondences for ordinal graphs
Benjamin Jones
We introduce a family of $C^*$-correspondences $X_\alpha$ naturally associated to every ordinal graph $\Lambda$. When $\Lambda$ is a directed graph, $X_0$ is isomorphic to the usual $C^*$-correspondence associated to a graph. We show that ordinal graphs satisfying a weak assumption have the property that the $C^*$-
algebra of $\Lambda_{\alpha + 1}$ is isomorphic to the Cuntz-Pimsner
algebra of $X_\alpha$. As a consequence, the $C^*$-
algebra of $\Lambda$ may be constructed starting from $c_0(\Lambda_0)$ by iteratively applying the Cuntz-Pimsner construction and inductive limits. We apply this result to strengthen the author's previous Cuntz-Krieger uniqueness
theorem.
Read the full abstract ▾
Numerical Analysis
A structure-preserving discretisation of SO(3)-rotation fields for finite Cosserat micropolar elasticity
Lucca Schek, Peter Lewintan, Wolfgang Müller et al. (+5 more)
We introduce a new method, dubbed
Geometric Structure-Preserving Interpolation ($\Gamma$-
SPIN) to preserve physics-constraints inherent in the material parameter limits of the finite-strain Cosserat micropolar model. The method advocates to interpolate the Cosserat rotation tensor using geodesic elements, which maintain objectivity and correctly represent
curvature measures. At the same time, it proposes relaxing the interaction between the rotation tensor and the deformation tensor to alleviate locking effects. This relaxation is achieved in two steps. First, the regularity of the Cosserat rotation tensor is reduced by interpolating it into the Nédélec space. Second, the resulting field is projected back onto the Lie-group of rotations. Together, these steps define a lower-regularity projection-based interpolation. The construction allows the discrete Cosserat rotation tensor to match the polar part of the discrete deformation tensor. This ensures stable behaviour in the asymptotic regime as the Cosserat couple modulus tends to infinity, which constrains the model towards its couple-stress limit. We establish the consistency, stability, and optimality of the proposed method through several
benchmark problems. The study culminates in a demonstration of its efficacy on a more intricate curved domain, contrasted with outcomes obtained from conventional interpolation techniques.
Read the full abstract ▾
All authors Lucca Schek, Peter Lewintan, Wolfgang Müller, Ingo Muench, Andreas Zilian, Stéphane P. A. Bordas, Patrizio Neff, Adam Sky
Dynamical Systems
Ergodic invariant measures of order preserving random dynamical systems on the real line are Dirac measures
Hans Crauel
It is well known that ergodic invariant measures for order preserving two-sided time random dynamical systems(RDS) on the real line $\mathbb R$ are Dirac. In the present note this is shown to hold also for one-sided time RDS.
Combinatorics
Half-periodicity of Zamolodchikov periodic cluster algebras
Ariana Chin
In 2007, Fomin and Zelevinsky introduced the bipartite belt, a sequence of bipartite mutations whose exchange relations form a discrete dynamical system. Periodicity of this system is known as Zamolodchikov periodicity. In our previous work we have classified all Zamolodchikov periodic cluster
algebras, but behavior halfway through the period was still unknown. This so-called half-periodicity was conjectured by Kuniba–Nakanishi–Suzuki for $Y$-systems of finite type Cartan
matrices, and was proved by Inoue–Iyama–Keller–Kuniba–Nakanishi for tensor products of two simply-laced Dynkin diagrams. In this paper, we prove that for any Zamolodchikov periodic cluster
algebra, the form at the half-period is a permutation of the cluster variables of order at most two.
Read the full abstract ▾
Numerical Analysis · Cross-listed from physics.comp-ph
Code-Verification Techniques for Particle-in-Cell Simulations with Direct Simulation Monte Carlo Collisions
Brian A. Freno, William J. McDoniel, Christopher H. Moore et al. (+1 more)
Particle-in-
cell methods with
stochastic collision models are commonly used to simulate collisional
plasma dynamics, with applications ranging from hypersonic flight to
semiconductor manufacturing. Code verification of such methods is challenging due to the interaction between the spatial- and temporal-discretization errors, the statistical sampling noise, and the
stochastic nature of the collision
algorithm. In this paper, we introduce our code-verification approaches to apply the method of manufactured solutions to
plasma dynamics, and we derive expected convergence rates for the different sources of discretization and statistical error. For the particles, we incorporate the method of manufactured solutions into the equations of motion. We manufacture the particle distribution function and inversely query the cumulative distribution function to obtain known particle positions and velocities at each time step. In doing so, we avoid modifying the particle weights, eliminating risks from potentially negative weights or modifications to weight-dependent collision
algorithms. For the collision
algorithm, we average independent outcomes at each time step and we derive a corresponding manufactured source term for the velocity change for each particle. By having known solutions for the particle positions and velocities, we are able to compute the error in these quantities directly instead of attempting to compute differences in distribution functions. These approaches are equally valid for particle-in-
cell simulations with Monte Carlo collisions and direct simulation Monte Carlo simulations of neutral gas flows. We demonstrate the effectiveness of our approaches in three dimensions for different couplings between the particles and field, with and without binary elastic collisions, and with and without coding errors.
Read the full abstract ▾
All authors Brian A. Freno, William J. McDoniel, Christopher H. Moore, Neil R. Matula
Algebraic Geometry
Triangular tensor networks, pencils of matrices and beyond
Alessandra Bernardi and Fulvio Gesmundo
We study tensor network varieties associated with the triangular graph, with a focus on the case where one of the physical dimensions is 2. This allows us to interpret the tensors as pencils of
matrices. We provide a complete characterization of these varieties in terms of the Kronecker invariants of pencils. We determine their dimension, identifying the cases for which the dimension is smaller than the expected parameter count. We provide necessary conditions for membership in these varieties, in terms of the geometry of classical determinantal varieties, coincident root loci and plane cubic curves. We address some extensions to arbitrary graphs.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Exact Solutions to Matrix Models and String Theories: The Local Construction
Jasper Kager, João Rodrigues, Ricardo Schiappa et al. (+2 more)
Exact nonperturbative solutions to hermitian one-
matrix models, their topological string duals, as well as their double-scaling limits to multicritical and minimal string theories, may be obtained via the use of resurgent transseries. These solutions are generically resonant, entailing both
eigenvalues and anti-
eigenvalues, or, equivalently, both D-branes and negative-tension D-branes – but are otherwise intricate to write down, having been previously addressed on a case-by-case approach. This work shows how there is a general and rather compact way to write down all these exact and fully nonperturbative transseries solutions in closed-form, immediately starting from the spectral geometry of the
matrix model or string theory at hand, in the form of a discrete
Fourier or Zak transform for their partition functions. This structure is inherently associated to the existence of anti-
eigenvalues or negative-tension D-branes. The validity of these solutions is testable across all values of the parameters – from weak to strong 't Hooft coupling, from small to large N; equivalently, from semi-classical to deeply
quantum regimes – and many such nonperturbative tests are performed against diverse examples ranging from
matrix models to non-critical strings, fully validating our analytical and exact expressions. In particular, anti-
eigenvalues or negative-tension D-branes are absolutely required to find sharp numerical matches. In order to study these solutions globally across their phase diagrams, however, complete non-linear Stokes data is still needed – which will be addressed in a complementary follow-up paper.
Read the full abstract ▾
All authors Jasper Kager, João Rodrigues, Ricardo Schiappa, Maximilian Schwick, Noam Tamarin
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Hidden Twisted Sectors and Exponential Degeneracy in Root-of-Unity XXZ Heisenberg Chains
Yongao Hu, Felix Gerken and Thore Posske
Recently, product states have been identified as simple-structured eigenstates of XXZ Heisenberg
spin models in arbitrary dimensions, occurring at anisotropy values corresponding to certain roots of unity. Yet, the product states typically only span parts of a larger degenerate eigenspace. Here, we classify this eigenspace in the one-dimensional periodic XXZ chain at all roots of unity $q$, where $q^2$ is an $\ell$-th primitive root of unity. For commensurate chain lengths $N$ with $q^N=1$, we prove that the minimal degeneracy is $2^{N/\ell}\ell$ using the representation theory of the affine Temperley-Lieb (aTL)
algebra. For the incommensurate case, we derive analogous exponential lower bounds of $2^{2\lfloor\frac{N}{2\ell}\rfloor+1}$ if $N$ is even and $2^{2\lfloor \frac{N}{2\ell}+\frac{1}{2}\rfloor}$ if $N$ is odd and $q^\ell=1$. Our proof employs the morphisms between aTL modules discovered by Pinet and Saint-Aubin and emphasizes the importance of exact sequences and hidden twisted boundary condition sectors that mediate the degeneracy. In the case of commensurate chain lengths, we connect to the Fabricius-McCoy string construction of all Bethe roots of the degenerate subspace, which previously uncovered parts of our results. We corroborate our results numerically and demonstrate that the lower bound is saturated for chain lengths $N\leq20$. Our work demonstrates for a concrete system how the interplay of the Bethe ansatz, aTL representation theory, and twisted boundary conditions explains degeneracy connected to long-lived product states, stimulating research towards generalization to higher dimensions. Exponential degeneracy could boost applications of
spin chains as
quantum sensors.
Read the full abstract ▾
Optimization and Control
On propagation of chaos for the Fisher-Rao gradient flow in entropic mean-field optimization
Petra Lazić, Linshan Liu and Mateusz B. Majka
We consider a class of optimization problems on the space of probability measures motivated by the mean-field approach to studying neural networks. Such problems can be solved by constructing continuous-time gradient flows that converge to the minimizer of the energy function under consideration, and then implementing discrete-time
algorithms that approximate the flow. In this work, we focus on the Fisher-Rao gradient flow and we construct an interacting particle system that approximates the flow as its mean-field limit. We discuss the connection between the energy function, the gradient flow and the particle system and explain different approaches to smoothing out the energy function with an appropriate kernel in a way that allows for the particle system to be well-defined. We provide a rigorous proof of the existence and uniqueness of thus obtained kernelized flows, as well as a propagation of chaos result that provides a theoretical justification for using the corresponding kernelized particle systems as approximation
algorithms in entropic mean-field optimization.
Read the full abstract ▾
Information Theory · Cross-listed from stat.ML
Mixture-of-Experts under Finite-Rate Gating: Communication–Generalization Trade-offs
Ali Khalesi and Mohammad Reza Deylam Salehi
Mixture-of-Experts (MoE) architectures decompose prediction tasks into specialized expert sub-networks selected by a gating mechanism. This letter adopts a communication-theoretic view of MoE gating, modeling the gate as a
stochastic channel operating under a finite information rate. Within an information-theoretic learning framework, {we specialize a mutual-information generalization bound and develop a rate-distortion characterization $D(R_g)$ of finite-rate gating, where $R_g:=I(X; T)$, yielding (under a standard empirical rate-distortion optimality condition) $\mathbb{E}[R(W)] \le D(R_g)+\delta_m+\sqrt{(2/m)\, I(S; W)}$. }The analysis yields capacity-aware limits for communication-constrained MoE systems, and numerical simulations on synthetic multi-expert models empirically confirm the predicted trade-offs between gating rate, expressivity, and generalization.
Read the full abstract ▾
Logic
Corrigendum & Addendum to: Variations on a Visserian theme
Ali Enayat
We revisit the proof of solidity of KM (Kelley-Morse theory of classes), as presented in the 2016 paper "Variations on a Visserian theme", so as to indicate the role of the scheme of class collection in the proof.
Mathematical Physics · Cross-listed from quant-ph
Fundamental questions on robustness and accuracy for classical and quantum learning algorithms
Nana Liu
This chapter introduces and investigates some fundamental questions on the relationship between accuracy and robustness in both classical and
quantum classification
algorithms under noisy and
adversarial conditions. We introduce and clarify various definitions of robustness and accuracy, including corrupted-instance robustness accuracy and prediction-change robustness, distinguishing them from conventional accuracy and robustness measures. Through theoretical analysis and toy models, we establish conditions under which trade-offs between accuracy and robustness accuracy arise and identify scenarios where such trade-offs can be avoided. The framework developed highlights the nuanced interplay between model bias, noise characteristics, and perturbation types, including relevant and irrelevant perturbations. We explore the implications of some of these results for incompatible noise,
adversarial quantum perturbations, the no free lunch
theorem, and suggest future methods to examine these problems from the lens of dynamical systems.
Read the full abstract ▾
Group Theory · Cross-listed from cs.LG
Rethinking Diffusion Models with Symmetries through Canonicalization with Applications to Molecular Graph Generation
Cai Zhou, Zijie Chen, Zian Li et al. (+7 more)
Many generative tasks in chemistry and science involve distributions invariant to group
symmetries (e.g., permutation and rotation). A common strategy enforces invariance and equivariance through architectural constraints such as equivariant denoisers and invariant priors. In this paper, we challenge this tradition through the alternative canonicalization perspective: first map each sample to an orbit representative with a canonical pose or order, train an unconstrained (non-equivariant)
diffusion or flow model on the canonical slice, and finally recover the invariant distribution by sampling a random
symmetry transform at generation time. Building on a formal quotient-space perspective, our work provides a comprehensive theory of canonical
diffusion by proving: (i) the correctness, universality and superior expressivity of canonical generative models over invariant targets; (ii) canonicalization accelerates training by removing
diffusion score complexity induced by group mixtures and reducing conditional variance in flow matching. We then show that aligned priors and optimal transport act complementarily with canonicalization and further improves training efficiency. We instantiate the framework for molecular graph generation under $S_n \times SE(3)$
symmetries. By leveraging
geometric spectra-based canonicalization and mild positional encodings, canonical
diffusion significantly outperforms equivariant baselines in 3D molecule generation tasks, with similar or even less computation. Moreover, with a novel architecture Canon, CanonFlow achieves state-of-the-art performance on the challenging GEOM-DRUG
dataset, and the advantage remains large in few-step generation.
Read the full abstract ▾
All authors Cai Zhou, Zijie Chen, Zian Li, Jike Wang, Kaiyi Jiang, Pan Li, Rose Yu, Muhan Zhang, Stephen Bates, Tommi Jaakkola
Algebraic Geometry
The projective coinvariant algebra, Young invariants and bigraded coordinate rings of Segre embeddings
Balázs Szendrői
This paper studies a flat degeneration P_n of the classical coinvariant
algebra R_n, a bigraded Artinian Gorenstein
algebra that arises from the coordinate ring of the Segre
embedding of the n-fold self-product of the projective line. The Frobenius character of P_n is computed by a natural bigraded refinement of the classical Lusztig–Stanley formula for the character of the coinvariant
algebra. Young invariants in P_n get related to coordinate rings of general Segre
embeddings of products of projective spaces; their bigraded
Hilbert polynomials get expressed in terms of major-descent generating functions of words in multisets. Relations to the diagonal coinvariant
algebra, cohomological interpretations including
quantum cohomology, and Garsia-Stanton-style bases are also explored.
Read the full abstract ▾
Operator Algebras
Growth conditions for topological freeness
Nazmul Alam, Joseph Gondek, Mehrdad Kalantar et al. (+1 more)
Given a finitely generated group $\Gamma$, a non-trivial element $g\in \Gamma$, and a minimal action $\Gamma\curvearrowright \mathcal{X}$ on a compact space $\mathcal{X}$, with amenable neighborhood stabilizers, we prove sufficient conditions in terms of various growth/decay functions for topological freeness of the action of $g$ on $\mathcal{X}$. We apply our results to the case of the Furstenberg boundary action of $\Gamma$, to conclude C*-simplicity under (sub-)rapid decay conditions. In this context, we also give a description of the support of stationary states on the reduced C*-
algebra of $\Gamma$.
Read the full abstract ▾
All authors Nazmul Alam, Joseph Gondek, Mehrdad Kalantar, Randy Pham
Information Theory · Cross-listed from cs.LG
Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
Daniil Dmitriev, Zhihan Huang and Yuting Wei
Diffusion models over discrete spaces have recently shown striking empirical success, yet their theoretical foundations remain incomplete. In this paper, we study the sampling efficiency of score-based discrete
diffusion models under a continuous-time Markov chain (CTMC) formulation, with a focus on $\tau$-leaping-based samplers. We establish sharp convergence guarantees for attaining $\varepsilon$ accuracy in Kullback-Leibler (KL) divergence for both uniform and masking noising processes. For uniform discrete
diffusion, we show that the $\tau$-leaping
algorithm achieves an iteration complexity of order $\tilde O(d/\varepsilon)$, with $d$ the ambient dimension of the target distribution, eliminating linear dependence on the vocabulary size $S$ and improving existing bounds by a factor of $d$; moreover, we establish a matching algorithmic lower bound showing that linear dependence on the ambient dimension is unavoidable in general. For masking discrete
diffusion, we introduce a modified $\tau$-leaping sampler whose convergence rate is governed by an intrinsic information-theoretic quantity, termed the effective total correlation, which is bounded by $d \log S$ but can be sublinear or even constant for structured data. As a consequence, the sampler provably adapts to low-dimensional structure without prior knowledge or algorithmic modification, yielding sublinear convergence rates for various practical examples (such as hidden Markov models, image data, and random graphs). Our analysis requires no boundedness or smoothness assumptions on the score
estimator beyond control of the score
entropy loss.
Read the full abstract ▾
Differential Geometry · Cross-listed from cs.MA
Distributed Quantum Gaussian Processes for Multi-Agent Systems
Meet Gandhi and George P. Kontoudis
Gaussian Processes (GPs) are a powerful tool for probabilistic modeling, but their performance is often constrained in complex, large-scale real-world domains due to the limited expressivity of classical kernels.
Quantum computing offers the potential to overcome this limitation by
embedding data into exponentially large
Hilbert spaces, capturing complex correlations that remain inaccessible to classical computing approaches. In this paper, we propose a Distributed
Quantum Gaussian Process (DQGP) method in a multi-
agent setting to enhance modeling capabilities and scalability. To address the challenging non-Euclidean optimization problem, we develop a Distributed consensus Riemannian Alternating Direction Method of Multipliers (DR-ADMM)
algorithm that aggregates local
agent models into a global model. We evaluate the efficacy of our method through numerical experiments conducted on a
quantum simulator in classical hardware. We use real-world, non-stationary elevation
datasets of NASA's Shuttle Radar Topography Mission and synthetic
datasets generated by
Quantum Gaussian Processes. Beyond modeling advantages, our framework highlights potential computational speedups that
quantum hardware may provide, particularly in Gaussian processes and distributed optimization.
Read the full abstract ▾
Optimization and Control
ALiA: Adaptive Linearized ADMM
Uijeong Jang, Kaizhao Sun, Wotao Yin et al. (+1 more)
We propose ALiA, a novel adaptive variant of the alternating direction method of multipliers (ADMM). Specifically, ALiA is a variant of function-linearized proximal ADMM (FLiP ADMM), which generalizes the classical ADMM by leveraging the differentiable structure of the objective function, making it highly versatile. Notably, ALiA features an adaptive stepsize selection scheme that eliminates the need for backtracking linesearch. Motivated by recent advances in adaptive gradient and proximal methods, we establish point convergence of ALiA for convex and differentiable objectives. Furthermore, by introducing negligible computational overhead, we develop an alternative stepsize selection scheme for ALiA that improves the convergence speed both theoretically and empirically. Extensive numerical experiments on practical
datasets confirm the accelerated performance of ALiA compared to standard FLiP ADMM. Additionally, we demonstrate that ALiA either outperforms or matches the practical performance of existing adaptive methods across problem classes where it is applicable.
Read the full abstract ▾
All authors Uijeong Jang, Kaizhao Sun, Wotao Yin, Ernest K Ryu
Probability
Random geometric graphs with smooth kernels: sharp detection threshold and a spectral conjecture
Cheng Mao, Yihong Wu and Jiaming Xu
A random
geometric graph (RGG) with kernel $K$ is constructed by first sampling latent points $x_1,\ldots,x_n$ independently and uniformly from the $d$-dimensional unit sphere, then connecting each pair $(i,j)$ with probability $K(\langle x_i,x_j\rangle)$. We study the sharp detection threshold, namely the highest dimension at which an RGG can be distinguished from its Erdős–Rényi counterpart with the same edge density. For dense graphs, we show that for smooth kernels the critical scaling is $d = n^{3/4}$, substantially lower than the threshold $d = n^3$ known for the hard RGG with step-function kernels \cite{bubeck2016testing}. We further extend our results to kernels whose signal-to-noise ratio scales with $n$, and formulate a unifying
conjecture that the critical dimension is determined by $n^3 \mathop{\rm tr}^2(\kappa^3) = 1$, where $\kappa$ is the standardized kernel operator on the sphere. Departing from the prevailing approach of bounding the Kullback-Leibler divergence by successively exposing latent points, which breaks down in the sublinear regime of $d=o(n)$, our key technical contribution is a careful analysis of the posterior distribution of the latent points given the observed graph, in particular, the overlap between two independent posterior samples. As a by-product, we establish that $d=\sqrt{n}$ is the critical dimension for non-trivial estimation of the latent vectors up to a global rotation.
Read the full abstract ▾
Analysis of PDEs
Invariant Gibbs dynamics for the hyperbolic sinh-Gordon model
Justin Forlano and Younes Zine
We study the
hyperbolic defocusing sinh-Gordon model with parameter $\beta^2>0$ and its associated Gibbs dynamics on the two-dimensional
torus. We establish global well-posedness of the model for a certain range of parameters $\beta^2>0$ with the corresponding Gibbs measure initial data and prove invariance of the Gibbs measure under the flow, thereby resolving a question posed by Oh, Robert, and Wang (2019). Our physical space approach hinges on developing a novel $L^\infty$-based well-posedness theory for wave equations with exponential-type nonlinearities, going beyond the classical $L^2$-based framework. This refinement allows us to fully leverage structural properties of Gaussian multiplicative chaos. As a by-product of our method, we also obtain an improved well-posedness theory for the
hyperbolic Liouville model.
Read the full abstract ▾
Geometric Topology
A formula for the Euler class of foliations
Alessandro V. Cigna
Given a cooriented branched surface $\mathcal B$ fully carrying a foliation $\mathcal F$, we use the dual graph of $\mathcal B$ to define a simplicial 1-cycle $\Gamma_m(\mathcal B)$ representing the Poincaré dual of the Euler class of $\mathcal F$ relative to the boundary. As an example, we complete the classification of which homology classes in the Whitehead link exterior are realisable as relative Euler classes of taut foliations. We also show how our formula generalises previous results of Lackenby and Dunfield. Finally, we observe that cooriented branched surfaces whose complement is a union of balls satisfy a Combinatorial Transverse Surface
Theorem, in the sense of Landry–Minsky–Taylor.
Read the full abstract ▾
Algebraic Geometry
On the Topology of T-manifolds of Higher Codimension
Enzo Pasquereau
This paper undertakes the study of the
topology of T-
manifolds of arbitrary codimension obtained by combinatorial patchworking with real phase structure as described by Brugallé, López de Medrano and Rau (2024). We prove new bounds on the number of connected components of T-curves and T-surfaces. For sufficiently high codimension, this improves the results of Brugallé, López de Medrano and Rau (2024). In addition, we present a new description of patchworking à la Viro for T-
manifold of codimension 2. We use this method to construct a family of maximal real algebraic curves in $\mathbb RP^3$.
Read the full abstract ▾
Combinatorics
Large expander subgraphs in high genus triangulations
Tanguy Lions and Baptiste Louf
We prove that random triangulations of high genus contain very large expander subgraphs, answering a question of Benjamini. Our approach relies on new general criteria for arbitrary graphs to contain large expander subgraphs.
Statistics Theory · Cross-listed from stat.ME
Block Empirical Likelihood Inference for Longitudinal Generalized Partially Linear Single-Index Models
Tianni Zhang, Yuyao Wang, Yu Lu et al. (+1 more)
Generalized partially linear single-index models (GPLSIMs) provide a flexible and interpretable semiparametric framework for longitudinal outcomes by combining a low-dimensional parametric component with a nonparametric index component. For repeated measurements, valid inference is challenging because within-subject correlation induces nuisance parameters and variance estimation can be unstable in semiparametric settings. We propose a profile estimating-equation approach based on spline approximation of the unknown link function and construct a subject-level block empirical likelihood (BEL) for joint inference on the parametric coefficients and the single-index direction. The resulting BEL ratio statistic enjoys a Wilks-type chi-square limit, yielding likelihood-free confidence regions without explicit sandwich variance estimation. We also discuss practical implementation, including constrained optimization for the index parameter, working-correlation choices, and bootstrap-based confidence bands for the nonparametric component. Simulation studies and an application to the epilepsy longitudinal study illustrate the finite-sample performance.
Read the full abstract ▾
All authors Tianni Zhang, Yuyao Wang, Yu Lu, Mengfei Ran
Rings and Algebras
Claus Hertling and Khadija Larabi
The full
lattices in a finite dimensional commutative ${\mathbb Q}$-
algebra form a commutative
semigroup. In the case of an algebraic number field the top part of a certain quotient
semigroup is the class group. For a separable
algebra some basic results, especially the Jordan-Zassenhaus
theorem, are known for this quotient
semigroup. This paper considers also
algebras which are not separable. It studies the commutative
semigroup of full
lattices in such an
algebra and also the quotient
semigroup. This leads in this commutative, but not separable situation to a certain extension of the Jordan-Zassenhaus
theorem. One application concerns $GL_n({\mathbb Z})$-conjugacy classes of regular integer $n\times n$
matrices.
Read the full abstract ▾