Differential Geometry
Linear representations of manifolds
Rongbiao Thomas Wang, Lek-Heng Lim and Ke Ye
A finite-dimensional linear representation of a group or an
algebra may be regarded as a map into a space of
matrices, endowing abstract elements with coordinates, and encoding algebraic operations as
matrix products. With this in mind, we define a linear representation of a $\mathsf{G}$-
manifold $\mathcal{M} $ as a map into a space of
matrices, representing points as
matrices and the $\mathsf{G}$-action as
matrix products. We show that this generalizes group representations to any $\mathsf{G}$-
manifold that may not have a group structure, with homogeneous spaces $\mathsf{G}/\mathsf{H}$ an important special case; and in this case it also generalizes Cartan
embeddings of symmetric spaces to more general $\mathsf{G}/\mathsf{H}$. To demonstrate the utility of such
manifold representations, we use them to provide effective bounds for Mostow-Palais $\mathsf{G}$-equivariant
embeddings of $\mathsf{G}$-
manifolds into $\mathsf{G}$-modules $\mathbb{V}$. Unlike Whitney and Nash
embeddings, Mostow-Palais
embeddings have no known effective bounds; before our work, it was only known that $\dim \mathbb{V} < \infty$ if $\mathsf{G}$ is compact. We will give explicit values for $\dim \mathbb{V}$ and show that our bounds are sharp. Furthermore, our method is constructive, giving explicit expressions for these minimal-dimensional Mostow-Palais
embeddings.
Read the full abstract ▾
Combinatorics
On the computations of the Cullis' determinant
Alexander Guterman and Andrey Yurkov
The Cullis' determinant is a generalization of the ordinary determinant for rectangular
matrices. It is defined as the alternating sum of maximal minors of a given
matrix. In this paper we express the Cullis' determinant of a
matrix $X$ as the Pfaffian of the
matrix obtained from $X$ by
matrix multiplication and transposition. Relying on this result, we present an efficient
polynomial-time division-free
algorithm for calculating the Cullis' determinant of a given
matrix with entries belonging to the commutative ring. We provide an asymptotical analysis of its arithmetical complexity in comparison to the definition-based
algorithm. In addition, we derive formulas for horizontal expansion of the Cullis' determinant which complements the existing formula for Laplace expansion along the columns of a
matrix.
Read the full abstract ▾
Combinatorics
Commutative Semifields from bijections of the Desarguesian plane
Faruk Göloğlu and Lukas Kölsch
The Menichetti-Kaplansky
theorem states that a finite semifield that is three-dimensional over its center is either a field or a twisted field of Albert. This implies that a quadratic homogeneous bijection of $\mathbb{P}^2(\mathbb{F}_q)$ is equivalent to a Dembowski-Ostrom monomial. In this paper, we give a large class of semiquadratic homogeneous bijections of $\mathbb{P}^2(\mathbb{F}_q)$ that are inequivalent to Dembowski-Ostrom monomials. Using these bijections, we construct a large family of commutative semifields that are non-isotopic to finite fields or twisted fields, which in turn give rise to a large family of non-Desarguesian commutative semifield planes. Semiquadratic homogeneous bijections of $\mathbb{P}^1(\mathbb{F}_q)$ have been classified only recently by the first-named author, and Ding and Zieve with the result that all such bijections are either equivalent to Dembowski-Ostrom monomials or degenerate. We demonstrate that this is not the case for $\mathbb{P}^2(\mathbb{F}_q)$.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Predictive Inference via Kernel Density Estimates
Torey Hilbert
Kernel density estimation is a widely used nonparametric approach to estimate an unknown distribution. Recent work in
Bayesian predictive inference has considered
stochastic processes formed by specifying the predictive distribution for the next data point given all observed data such that the resulting predictive distributions converge weakly almost surely. We study two kernel based prediction rules: the classic kernel density
estimator, and a recursive version previously introduced for online problems. We show that both processes converge weakly almost surely, which opens the door for new
Bayesian interpretations of kernel density estimation. Surprisingly, the process based on the classic kernel density estimates converges to a compactly supported measure, while the recursive version converges to a non-compactly supported measure.
Read the full abstract ▾
Category Theory · Cross-listed from quant-ph
Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
Dichuan Gao, Razin A. Shaikh and Aleks Kissinger
We introduce Graphical Algebraic Geometry (GAG), a family of diagrammatic
languages extending the Graphical Linear
Algebra programme. We construct several
languages within this family and prove that they are universal and complete for the corresponding (co)span semantics of commutative
algebras and affine varieties. This framework provides clear graphical representations of algebraic structures – such as
polynomials, ideals, and varieties – enabling intuitive yet rigorous diagrammatic
reasoning. We showcase two practical viewpoints on GAG. First, we show that instances of counting constraint satisfaction problem (#CSP) are recast as rewrite problems of closed diagrams in GAG. This means that deciding rewritability in GAG is #P-hard, and GAG can be viewed as a complete and compositional rewrite system for networks of
polynomial constraints. Second, we characterize the qudit ZH calculus, a diagrammatic
language for
quantum computation, as an extension of Graphical Algebraic Geometry. This establishes the correspondence that Graphical Algebraic Geometry is to the ZH calculus what Graphical Linear
Algebra is to the ZX calculus. Using this construction, we show that computing amplitudes in qudit ZH requires only a constant number of queries to a GAG oracle.
Read the full abstract ▾
Number Theory · Cross-listed from quant-ph
From Hilbert's Tenth Problem to Quantum Speedup: Explicit Oracles for Bounded Diophantine Systems
Gabriel Escrig and M. A. Martin-Delgado
Solving non-linear Diophantine systems lies at the mathematical core of integer optimization and cryptography. While the general unbounded problem is undecidable, even over bounded integer domains it remains classically intractable in the worst case. In this work, we introduce a fully reversible
quantum algorithmic framework tailored to solve arbitrary
polynomial Diophantine equations over bounded integer domains. The core of our approach is the explicit, gate-level synthesis of an evaluation oracle for amplitude amplification. By coherently evaluating
polynomial constraints via in-place two's complement arithmetic and routing operations into a single recycled accumulator, this garbage-free strategy achieves a compact and scalable synthesis of the underlying non-linear arithmetic. Through analytical derivations and empirical
circuit simulations, we prove that the overall spatial complexity is bounded by $q = \mathcal{O}((n + d^2)\log_2 N)$ logical
qubits for $n$ variables, maximum degree $d$, and interval length $N$. The non-Clifford Toffoli depth is upper-bounded by $\mathcal{O}(q^2)$. This structural scaling exponent remains invariant to the variable count, modulated linearly only by the coefficients' Hamming weights. By moving beyond abstract black-box assumptions, this explicit architectural synthesis guarantees that the necessary
quantum arithmetic acts as a bounded
polynomial overhead. This ensures a quadratic speedup over classical exhaustive search, whether retrieving a unique assignment or dynamically enumerating an unknown number of solutions.
Read the full abstract ▾
Mathematical Physics · Cross-listed from hep-th
Protected operators in non-local defect CFTs from AdS
Jiaxin Qiao
For a local
quantum field theory in anti-de Sitter space with conformal boundary conditions but without dynamical
gravity, the boundary theory is generically a non-local conformal field theory. Such theories can support conformal defects, but the standard local-CFT arguments based on a boundary stress tensor and conserved currents do not apply. We argue that, under general assumptions, displacement and tilt operators nevertheless exist and have protected
quantum numbers. The mechanism is a Goldstone-type phenomenon in AdS: defect-induced
symmetry breaking on the boundary is spontaneous from the viewpoint of the local bulk theory, whose Ward identities enforce the corresponding protected defect operators. We illustrate the mechanism in weakly coupled defect RG flows, long-range Landau–Ginzburg models, 4D Maxwell theory, and Yang–Mills theory in AdS.
Read the full abstract ▾
Logic · Cross-listed from cs.LO
A foundational characterization of Hoare Logic
Daniel Leivant
We show that a partial-correctness assertion about an iterative program is provable in Hoare Logic iffit is provable in standard second-order logic with comprehension restricted to first-order predicates. This equivalence was claimed twice in the past, both with faulty proofs, and seems to be the first foundational characterization of Hoare Logic.
Read the full abstract ▾
Numerical Analysis
ViT-K: A Few-Shot Learning Model for Coupled Fluid-Porous Media Flows with Interface Conditions
Mengjia Chen, Changxin Qiu, Zhiping Mao et al. (+1 more)
The numerical simulation of interaction between free flow and porous media, governed by coupled Stokes/Navier–Stokes–Darcy flows, is critical for understanding fluid filtration and physiological transport, yet it is hindered by the high computational cost of resolving interface heterogeneities and the instability of long-term predictions. While deep learning offers surrogate modeling potential, existing frameworks often suffer from exponential error accumulation and poor convergence in multi-physics regimes. To address these limitations, we propose ViT-K, a novel few-shot learning model designed to learn the spatiotemporal
evolution of coupled flows from sparse
datasets. The ViT-K framework effectively reconstructs the global flow physics on a low-dimensional
manifold by combining
Vision Transformers (ViT) to capture heterogeneous interfacial features with the Koopman operator to linearize temporal dynamics. By lifting nonlinear dynamics into a globally linear observable space, the ViT-K model provides stability by design, ensuring that prediction errors grow linearly rather than exponentially over time. This theoretical property enables reliable long-term extrapolation even in small-sample regimes. Numerical experiments on
benchmark coupled systems demonstrate that ViT-K not only captures complex interface physics with high fidelity but also exhibits exceptional robustness against measurement noise by acting as an implicit spectral filter. The proposed method significantly outperforms traditional solvers in inference speed while maintaining physical consistency, offering a robust paradigm for real-time multiphysics
forecasting.
Read the full abstract ▾
All authors Mengjia Chen, Changxin Qiu, Zhiping Mao, Menghui Xu
Number Theory
Fields where torsion forms decompose
M. Archita and Karim Johannes Becher
Over a real field which is an extension of transcendence degree 1 of a hereditarily pythagorean base field, every quadratic form which is torsion decomposes into an orthogonal sum of 2-dimensional torsion forms. This is obtained from a more general study of weakly isotropic forms over henselian valued fields and over function fields in one variable.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ML
What is Learnable in Valiant's Theory of the Learnable?
Steve Hanneke, Anay Mehrotra, Grigoris Velegkas et al. (+1 more)
Valiant's 1984 paper is widely credited with introducing the PAC learning model, but it, in fact, introduced a different model: unlike PAC learning, the learner receives only positives, may issue membership queries, and must output a hypothesis with no false positives. Prior work characterized variants, including the case without queries. We revisit Valiant's original model and ask: *Which classes are learnable in it?* For every finite domain, including Valiant's Boolean-hypercube setting, we show that a class is learnable if and only if every realizable positive sample can be certified by a poly-size adaptive query-compression scheme. This is a new variant of sample compression where the learner certifies samples via a short interaction with the membership oracle. Our characterization shows that learnability in Valiant's model is strictly sandwiched between learnability in the PAC model and the variant of Valiant's model without membership queries. This is one of the rare cases where introducing membership queries changes the set of learnable classes, and not just the sample or computational complexity. Next, we study the natural extension of the model to arbitrary domains. While we do not obtain an exact characterization, our techniques readily generalize and show that the same strict sandwiching persists. Finally, we show that $d$-dimensional halfspaces, which are not learnable without queries, are learnable with queries: we give a $\mathrm{poly}(d) \tilde{O}(1/\epsilon)$ sample and $\mathrm{poly}(d) \mathrm{polylog}(1/\epsilon)$ query
algorithm, and prove that at least $\Omega(d)$ samples or queries are necessary. To our knowledge, this is the first
algorithm for halfspaces in Valiant's model. Together, these results uncover a surprisingly rich theory behind Valiant's original notion of learnability and introduce ideas that may be of independent interest in learning theory.
Read the full abstract ▾
All authors Steve Hanneke, Anay Mehrotra, Grigoris Velegkas, Manolis Zampetakis
Analysis of PDEs
Finite-time blow-up in an elementary model of the 3D Navier-Stokes equations
Stan Palasek
We demonstrate finite-time blow-up in a simple, realistic shell model of the 3D Navier-Stokes equations, equipped with "smooth" (i.e., rapidly decaying in frequency) initial data and forcing. Previously studied models either exhibit a turbulent cascade that regularizes the three-dimensional viscous dynamics, or rely on highly artificial interactions not transparently realized in the true Euler nonlinearity. We also treat the inviscid, unforced case and obtain singularity formation just above the energy level. We conclude with a discussion of the prospects for
embedding the behavior of the dyadic model into the full Euler and Navier-Stokes equations.
Read the full abstract ▾
Algebraic Geometry
Graphs of Hecke operators in mixed ramification
Rudrendra Kashyap and Vladyslav Zveryk
We study Hecke operators on
moduli spaces of ramified $G$-bundles using the combinatorial
language of Hecke graphs. We introduce a general notion of $\mathcal H$-ramification in the spirit of parahoric ramification, which depends on a choice of a divisor and subgroups of $G$ at every point of the divisor. Building on our previous work, we prove that, under mild regularity conditions, the action of a Hecke operator in the deep cusp of $\mathrm{Bun}_G$ in a highly complex ramification mimics an action in a much simpler ramification. This reduces the study to a smaller number of cases which, in particular, involve divisors supported at no more than two points. We demonstrate our methods by computing various examples for $G=\mathrm{PGL}_2$ and computing the dimensions of spaces of Hecke eigenforms for generic
eigenvalues. We connect the obtained dimension formulas with the known results from the theory of Eisenstein series.
Read the full abstract ▾
Dynamical Systems
Stability analysis of Richardson models with delay for confrontation between two countries
Teresa Faria and Anatoliy A.Martynyuk
This article proposes a non-autonomous mathematical model with delay for confrontation between two countries, and examines the stability of its
equilibrium state. Our criteria for stability take into account the influence of the factor of hostility between countries. For the autonomous case, the asymptotic stability is studied in a comprehensive way, and the
Hopf bifurcations occurring as the delay crosses some critical values are described. For the non-autonomous model, conditions ensuring the global asymptotic stability for both the linear approximation and the nonlinear system are established. The framework of special solutions for delay differential equations is also applied.
Read the full abstract ▾
Differential Geometry
On the Lie Foliation structure of Walker Manifolds
Ameth Ndiaye
We study Walker
manifolds, that is, pseudo-Riemannian
manifolds $(M^n,g)$ admitting a null parallel distribution $\D$ of rank $r\leq\frac{n}{2}$. We show that $\D$ always integrates to a $G$-Lie foliation $\F_\D$, where $G$ is the simply connected Lie group with Lie
algebra equal to the structure
algebra $\g_\D$ of $\D$. The transverse holonomy group of $(M,g)$ coincides with the image of the holonomy morphism $h:\pi_1(M)\to G$. We prove that $\mathrm{Ric}(X,\cdot)=0$ for all $X\in\Gamma(\D)$, and show that in dimension~$3$ the model group is always $\R$, while in dimension~$4$ with rank~$2$ the structure
algebra is always abelian. A local classification distinguishes the abelian, nilpotent, and solvable cases, and a
rigidity theorem shows that a minimal nilpotent Walker foliation of dimension~$4$ cannot be deformed into a non-nilpotent solvable one.
Read the full abstract ▾
Dynamical Systems
Load Identification in Bistable Spacecraft Booms via Parametric Data-Driven Modeling
Deven H. Mhadgut, Austin Phoenix, Serkan Gugercin et al. (+3 more)
Bistable tape spring booms are used on spacecraft for their ability to self-deploy using stored strain energy. However, their uncontrolled deployment can induce mechanical shocks that are variable as a function of material properties and temperature, and may damage sensitive satellite components and disrupt attitude control. Because traditional Finite Element Analysis (FEA) struggles to accurately capture this highly nonlinear behavior, we solve the inverse problem to estimate these loads from dynamic response measurements. Previous data-driven approaches using Vector Fitting required time-consuming retesting for every specific load level due to the boom's load-dependent dynamic behavior. To overcome this limitation, we introduce a parametric data-driven framework where a parametric transfer-function model of a composite tape spring boom is developed using force and velocity measurements. The parametric Adaptive Antoulas-Anderson
algorithm (p-AAA) is used to construct a single parametric (multivariate) transfer function capable of capturing the nonlinear response of the boom to load amplitude. To evaluate the proposed framework, the boom is excited at its base at 15 distinct load levels using a single-axis reference input signal. Results demonstrate that the single parametric model outperformed the best discrete non-parametric case, reducing the total relative force estimation error for the reference signal by nearly 38%. For experimental validation, the boom is subjected to sinusoidal, triangular and square signals. The cross validation results further supported this generalized performance. Collectively, these results show that the proposed parametric model accurately reconstructs input forces from velocity measurements alone, offering a solution for onboard diagnostics in future space missions.
Read the full abstract ▾
All authors Deven H. Mhadgut, Austin Phoenix, Serkan Gugercin, Samantha Parry Kenyon, Jonathan Black, Linus Balicki
Geometric Topology
Brieskorn spheres and rational homology ball symplectic fillings
Antonio Alfieri, Alberto Cavallo and Irena Matkovič
Given a canonically oriented Brieskorn sphere $Y=\Sigma(a_1,...,a_n)$, we confirm some statements conjectured by Gompf. More specifically, we obstruct the existence of rational homology ball
symplectic fillings for any contact structure on $-Y$ if $n=3$, and when there is no half convex Giroux torsion for $n>3$. Furthermore, we show that the same result holds for the Milnor fillable structure on $Y$ with the possible exception of $\Sigma(3,4,5),$ $\Sigma(2,5,7)$ and $\Sigma(2,3,6k+1)$ for $k\geq1$. Along the way, we determine every canonically oriented Brieskorn sphere with vanishing correction term carrying at most two fillable structures, up to isotopy.
Read the full abstract ▾
Algebraic Geometry
Tilt-stability on singular schemes and Bogomolov-Gieseker-type inequalities
Zhiyu Liu and Tianle Mao
We generalize the framework of tilt-stability to singular schemes and formulate the generalized Bogomolov-Gieseker inequality
conjecture of Bayer-Macrì-Toda for singular threefolds. We also develop relative versions of these constructions, generalizing corresponding results in [BLM+21]. Along the way, we establish Bogomolov-Gieseker-type inequalities for semistable sheaves on any projective scheme. By extending previous techniques, we verify the
conjecture for all Fano threefolds with canonical Gorenstein $\mathbb{Q}$-factorial singularities and a series of singular Calabi-Yau threefolds. Furthermore, we construct stability conditions on the relative Kuznetsov components associated with families of singular Fano threefolds, thereby proving a singular analogue of a
conjecture of Kuznetsov-Shinder.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.DS
Min-Max Optimization Requires Exponentially Many Queries
Martino Bernasconi, Matteo Castiglioni, Andrea Celli et al. (+1 more)
We study the query complexity of min-max optimization of a nonconvex-nonconcave function $f$ over $[0,1]^d \times [0,1]^d$. We show that, given oracle access to $f$ and to its gradient $\nabla f$, any
algorithm that finds an $\varepsilon$-approximate stationary point must make a number of queries that is exponential in $1/\varepsilon$ or $d$.
Read the full abstract ▾
All authors Martino Bernasconi, Matteo Castiglioni, Andrea Celli, Alexandros Hollender
Mathematical Physics · Cross-listed from hep-th
An algebra of proper observables at null infinity: Dirac brackets, Memory and Goldstone probes
Rodrigo Andrade e Silva and Simone Speziale
We develop a rigorous evaluation of Dirac brackets for classical observables on the phase space of radiative gravitational modes at null infinity that naturally incorporates
memory effects. Considering the Ashtekar-Streubel phase space, with boundary conditions in time given by vanishing news and purely electric shear, and taking into account the infinite dimensionality of the phase space, we identify the
algebra of proper observables (understood as functions on phase space that can be associated with smooth
symplectic flows). We show that the action of supertranslation charges generate the correct transformations on the shear. We also show that the conventional definition of the “Goldstone mode” adopted in the literature cannot be associated with a proper observable, but nevertheless there exists an infinite family of proper observables, which we call Goldstone probes, that are capable of measuring the Goldstone mode. We notice that there are no Goldstone probes constructed only out of the shear or the news, providing a possible explanation for why attempts to construct a (separable)
Hilbert space with different
memory states have failed so far. Finally, we derive formulas for distributional Dirac brackets between local shear and news, and show that they contain non-local corrections.
Read the full abstract ▾
Mathematical Physics
Irregular SLE(4) martingales and isomonodromic deformations
Harini Desiraju, Aleksandra Korzhenkova and Eveliina Peltola
We consider non-Fuchsian monodromy preserving deformations on a Riemann sphere. The associated isomonodromic deformation parameters on this surface comprise the positions of the singularities, together with the Birkhoff (spectral) invariants owing to the presence of irregular singularities. Our first main result is the derivation of the Loewner
evolution of these isomonodromic deformation parameters. Using this result, we construct martingale observables for Schramm-Loewner
evolution (SLE(4)) processes in the presence of double poles. Geometrically, the expressions contain the pre-Schwarzian and Schwarzian of the Loewner
evolution, arising from conformal covariance of the observable. Furthermore, we characterize these SLE(4) observables uniquely in terms of confluent BPZ equations of a CFT with central charge c=1.
Read the full abstract ▾
Metric Geometry
The Symmetric Mahler Inequality in Dimension Three via Admissible Shadow Systems
Shibing Chen, Yuanyuan Li, Dongmeng Xi et al. (+1 more)
The three-dimensional symmetric Mahler inequality states that, for every origin-symmetric convex body \(K=-K\subset \mathbb{R}^3\), \[ \VP(K)= |K|\,|K^\circ|\geq \frac{32}{3}. \] It was recently proved by Iriyeh–Shibata \cite{IS2020}, and a shorter proof was later given by Fradelizi–Hubard–Meyer–Roldán-Pensado–Zvavitch \cite{FHMRZ}. Both proofs combine ingenious equipartition arguments of algebraic-topological origin with delicate
geometric estimates inspired by Meyer's argument for unconditional bodies. In this paper, we give a new proof of this inequality using a purely
geometric approach, based on what we call symmetric admissible shadow systems. This is a natural extension of the new techniques developed in our proof of the three-dimensional non-symmetric Mahler
conjecture \cite{CLXX-Mahler}.
Read the full abstract ▾
All authors Shibing Chen, Yuanyuan Li, Dongmeng Xi, Zhefeng Xu
Algebraic Geometry
A Derived Legendrian Category for Shifted Contact Stacks
Efe İzbudak and Kadri İlker Berktav
For every integer $s$ and every $n \geq 1$, we construct a symmetric monoidal $(\infty,n)$-category $\mathrm{Leg}_n^s$ whose objects are $s$-shifted contact derived Artin stacks and whose $i$-morphisms are $i$-fold Legendrian correspondences. The construction is based on the fact that an $s$-shifted contact structure on a derived Artin stack $X$ is an $s$-shifted
symplectic structure on $X$ relative to $B\mathbb{G}_m$, twisted by the weight-one line bundle, and that Legendrian structures are the corresponding relative Lagrangian structures. This lets us obtain the $(\infty,n)$-categories $\mathrm{Leg}_n^s$ as twisted forms over $B\mathbb{G}_m$ of the $(\infty,n)$-categories of iterated Lagrangian correspondences of Calaque, Haugseng and Scheimbauer, with the fiber product over $B\mathbb{G}_m$ as tensor product. For an $s$-shifted contact stack $X$, we then obtain the derived Legendrian category $\mathcal{F}_{c}(X)$. Its objects are Legendrian morphisms into $X$, and its mapping categories are categories of Legendrians in derived Legendrian intersections, which carry $(s-1)$-shifted contact structures. The AKSZ construction gives oriented extended topological field theories with values in $\mathrm{Leg}_n^s$, as well as shifted contact structures on the quotient mapping stacks $[\mathrm{Map}(Y,\widetilde X)/\mathbb{G}_m]$. Our definitions of contact and Legendrian structures agree with those of Berktav where both are defined, for every shift.
Read the full abstract ▾
Functional Analysis
Superharmonically Weighted Dirichlet Spaces
H. Bahajji-El Idrissi, O. El-Fallah, Y. Elmadani et al. (+1 more)
In this paper, we consider weighted Dirichlet spaces $\cD_\omega$, where $\omega$ is a positive superharmonic weight on the unit disc $\DD$. These spaces include the standard weighted Dirichlet spaces $\cD_\alpha$ and appear in the description of their invariant subspaces. Our goal is to study the spaces $\cD_\omega$. We show that an explicit description of invariant subspaces reduces to the description of those generated by a bounded outer function, and then to the problem of describing cyclic functions, known as the Brown–Shields
conjecture. We develop tools, analogous to those used in the harmonic case, that are needed to treat this problem for superharmonically weighted Dirichlet spaces $\cD_\omega$. In particular, we obtain a formula for the Dirichlet integral of outer functions of Carleson–Richter–Sundberg type, estimates for the norm of the reproducing kernel of $\cD_\omega$, and several properties on the capacity associated with $\cD_\omega$. Using these tools, we provide a description of invariant subspaces when the measure $\Delta \omega$ is finite measure or if the $\supp(\Delta \omega)\cap \TT$ is countable, where $\TT$ denotes the unit circle. Finally, we prove that a smooth outer function $f \in \cD_\alpha$ such that $\cZ (f) $ is "regular" is cyclic in $\cD_\alpha$ if and only if $c_{\alpha }(\cZ(f))= 0$.
Read the full abstract ▾
All authors H. Bahajji-El Idrissi, O. El-Fallah, Y. Elmadani, A. Hanine
Analysis of PDEs
Uniqueness of synchronized stationary equilibria in the Kuramoto mean field game
Sebastian Munoz
The stationary Kuramoto mean field game models a population of phase oscillators that form synchronized Nash
equilibria above a critical interaction strength. We prove that the synchronized branch is a unique smooth family of Nash
equilibria emerging from the uniform state at the bifurcation: at each supercritical interaction strength the synchronized
equilibrium is unique up to rotation of the
torus, and converges smoothly to the uniform distribution as the interaction parameter decreases to the critical threshold. Both follow from our main technical result: the scalar self-consistency map is strictly concave, settling a
conjecture of Carmona, Cormier, and Soner. The proof decomposes the second derivative of the self-consistency map into two sign-indefinite moments of the
equilibrium–a cubic moment and a gradient moment–and controls their signs through sharp shape estimates for the value function, a pointwise
geometric-mean monotonicity that determines the sign of the cubic moment via a cosine-skewness inequality, and a reflection argument combined with a correlation inequality for the gradient moment.
Read the full abstract ▾
Optimization and Control
Affiliated operators for classical and quantum control
Dimitrios Giannakis and Gage Hoefer
Using techniques from the theory of von Neumann
algebras, we propose a framework for addressing questions of controllability of bilinear systems on infinite dimensional
Hilbert spaces. In the setup, we assume only that the drift and control terms arising in a bilinear control system are affiliated with a von Neumann
algebra of finite type acting on the same
Hilbert space. When the control terms satisfy basic norm bound conditions, we prove existence of time-optimal controls. In the more general setting where all operators may be unbounded, we show how the dynamical Lie
algebra for the system is still well-defined and may be used to check approximate controllability of the system in question. We discuss how this approach can be applied to classical dynamical systems through the Koopman operator formalism, and investigate potential candidates for the von Neumann
algebra which may guide the choice of controls. We illustrate how an affiliation relation naturally arises in both classical and
quantum control systems with a few examples.
Read the full abstract ▾
Probability · Cross-listed from cs.CC
Symmetric Bounded Indistinguishability: Hypergeometric Smoothing and Hahn Polynomials
Christopher Williamson
A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduce this concept and study how far apart $t$-wise marginals can be under an assumption of $(k,\delta)$-wise indistinguishability. We consider symmetric distributions and obtain a new upper bound that unifies and improves previous bounds and applies across a wider range of parameters. In particular, prior works failed to rule out the existence of constants $0<c<c'<1$ so that there is a pair of $(cn,0)$-wise indistinguishable distributions where the $c'n$-wise marginals have statistical distance $\Omega(1)$. Our upper bound shows that the $c'n$-wise marginals must be exponentially close for all $c$ and $c'$. Our upper bound is accompanied with a nearly matching lower bound when $\delta=0$ and also yields new results in the case $\delta>0$ or when $t/n$ tends to 1. Our approach is to exploit the behaviour of the orthogonal Hahn
polynomials under hypergeometric sampling and marginalisation operations. As a secondary contribution, we provide nearly matching upper and lower bounds on the maximum possible distance between a pair of $(k,\delta)$-wise indistinguishable distributions and the nearest pair of $(k,0)$-wise indistinguishable distributions.
Read the full abstract ▾
Combinatorics
A combinatorial model for the canonical join complex of alt $\nu$-Tamari lattices
Matthias Müller
Alt $\nu$-Tamari
lattices constitute a remarkable family of
lattices associated with
lattice paths that broadly generalize the Dyck and Tamari
lattices. To systematically study the structural properties of this family, we introduce a combinatorial model that realizes the canonical join complex of alt $\nu$-Tamari
lattices. Serving as a universal tool, this model allows us to prove vertex decomposability, establish an explicit shelling order, and reveal the underlying homology of the canonical join complex of alt $\nu$-Tamari
lattices.
Read the full abstract ▾
Information Theory · Cross-listed from cs.LG
High-Rate Quantized Matrix Multiplication II
Or Ordentlich and Yury Polyanskiy
This is the second part of the work investigating quantized
matrix multiplication (MatMul). In part I we considered the case of calibration-free quantization, whereas here we discuss the setting where covariance
matrix $\Sigma_X$ of the columns of the second factor is available. This setting arises in the ubiquitous task of weight-only post-training quantization of LLMs. Weight-only quantization is related to the problem of weighted mean squared error (WMSE) source coding, whose classical (reverse) waterfilling solution dictates how one should distribute rate between coordinates of the vector. We show how waterfilling can be used to improve practical LLM quantization
algorithms (GPTQ), which at present allocate rate equally. A recent scheme (known as “WaterSIC”) that only uses scalar INT quantizers is analyzed and its high-rate performance is shown to be (a) basis free (i.e., characterized by the determinant of $\Sigma_X$ and, thus, unlike existing schemes, is immune to applying random rotations); and (b) within a multiplicative factor of $\frac{2\pi e}{12}$ (or 0.25 bit/entry) of the information-theoretic distortion limit. GPTQ's performance, in turn, is affected by the choice of basis, but for a random rotation and actual $\Sigma_X$ from Llama-3-8B we find it to be within 0.1 bit (depending on the layer type) of WaterSIC, suggesting that GPTQ with random rotation is also near optimal, at least in the high-rate regime.
Read the full abstract ▾
Numerical Analysis · Cross-listed from cs.CE
Elastica++: A high-performance, multiphysics framework for large interacting assemblies of Cosserat rods
Tejaswin Parthasarathy, Seung Hyun Kim, Songyuan Cui et al. (+1 more)
Soft, slender structures are ubiquitous in natural and engineered systems, with broad application potential from biomimetic materials to soft robotics. However, there is a notable lack of computational tools that simultaneously preserve high-fidelity continuum rod mechanics, scale to large interacting ensembles, and remain flexible across diverse biophysical settings. Here we introduce Elastica++, an open-source, high-performance implementation of the Cosserat-rod model for large-scale simulations of slender-body dynamics. Elastica++ combines performance-oriented kernels with shared-
memory parallelism to sustain teraflop-scale throughput despite complex discretization domains and physical interactions. The framework further interoperates with external numerical solvers, supporting efficient multiphysics workflows. We demonstrate robustness and breadth through case studies spanning passive nest-like metamaterials, collective active-matter dynamics, cilia carpets, soft
magnetic microrobots, and schooling swimmers. Elastica++ thus provides a missing foundation for high-throughput studies of emergent behavior in interacting assemblies of elastic slender structures.
Read the full abstract ▾
All authors Tejaswin Parthasarathy, Seung Hyun Kim, Songyuan Cui, Mattia Gazzola