Differential Geometry
The Shortest Geodesic Flower on a Manifold with Locally Convex Ends and Finite Volume
Isabel Beach
Suppose $M$ is a complete, non-compact $n$-dimensional Riemannian
manifold with locally convex ends and finite volume. We prove that $M$ admits a non-trivial geodesic net with one vertex, at most $(n+2)(n+1)/2$ edges, and total length at most $$(n+2)(n+1)(n/2)\operatorname{vol}(M)^{1/n}.$$ This is a quantitative version of a result of G. R. Chambers, Y. Liokumovich, A. Nabutovsky and R. Rotman.
Read the full abstract ▾
Mathematical Physics
M.C. Baldiotti and R. Fresneda
This paper investigates scaling
symmetry in thermodynamics by unifying constrained
Hamiltonian dynamics with
symplectic and contact geometries. Through the mathematical processes of contactization and symplectization, we demonstrate that fixing an extended global scale variable effectively recovers the standard thermodynamic description in terms of scale-invariant quantities. The
geometric formalism is illustrated by establishing the diffeomorphism between the Lagrangian submanifolds of ideal and van der Waals gases. Finally, applying this framework to a Schwarzschild black hole reveals that breaking the scale
symmetry between internal energy and
entropy is a fundamental physical requirement to accommodate non-isothermal dynamics.
Read the full abstract ▾
Dynamical Systems
Bifurcations and Structural Stability of Generic PC-HC Families
Alexey Dorovskiy
In this paper the structural stability of generic families of vector fields of the PC-HC class on the two-dimensional sphere $S^2$ is proved. A classification of these families up to moderate equivalence in neighborhoods of their large bifurcation supports is presented, based on such invariants as the configuration and the characteristic set. The realization lemma is proved. Furthermore, bifurcation diagrams for the considered class of families are constructed.
Read the full abstract ▾
Combinatorics
Cover-free families on graphs
Prangya Parida and Lucia Moura
A family of subsets of a $t$-set is a \emph{$d$-cover-free family} or $d$-CFF if no subset in the family is contained in the union of any $d$ other subsets. Let $t(d, n)$ denote the minimum $t$ for which there exists a $d$-CFF on a $t$-set with $n$ subsets. Since a $1$-CFF is the same as a Sperner family, using Sperner's
theorem, we get $t(1, n) \sim \log_{2}(n)$ as $n$ grows. Erdös, Frankl, and Füredi (JCTA, 1982) proved that $3.106\log_{2}(n) < t(2,n) < 5.512\log_{2}(n)$. This paper focuses on generalizing $1$-CFF and $2$-CFF using a graph $G$ where vertices correspond to subsets in the set system. A $G$-Sperner$(t, n)$ is a family of subsets of a $t$-set such that each edge of $G$ specifies a pair of subsets not contained in each other, where as a $G$-CFF$(t, n)$ is a family of subsets of a $t$-set such that it is $G$-Sperner and the union of a pair of subsets corresponding to each edge of $G$ does not contain any other subset in the family. Let $t_s(G)$ and $t(G)$ denote the minimum $t$ for which there exist a $G$-Sperner$(t, n)$ and a $G$-CFF$(t, n)$, respectively. In this way, $t_s(K_n) = t(1, n)$ and $t(K_n) = t(2, n)$. Firstly, we prove $t_s(G) = t(1, \chi(G))$ for any simple graph $G$ and provide various upper and lower bounds for $t(G)$. The trivial bound, $t(1, n) \leq t(G) \leq t(2, n)$ holds for any simple graph $G$ with no isolated vertex, with the lower bound tight for an infinite family of
star graphs and the upper bound tight for complete graphs. We study when these bounds can be improved and give better constructive upper bounds for families of graphs such as
stars, paths, cycles, wheels, and windmill graphs. In particular, a construction based on mixed-radix Gray codes yields $\log_{2}(n) \leq t(P_n) \leq t(C_n) \leq 1.893\log_{2}(n) + \mathcal{O}(1)$ where $P_n$ and $C_n$ are paths and cycles with $n$ vertices.
Read the full abstract ▾
Group Theory
Subperiodic groups and bounded automorphisms of periodic graphs
Igor A. Baburin
A subperiodic group is a group of motions of $d$-dimensional Euclidean space $\mathbb R^d$ which contains a translation
lattice $\mathbb Z^r$ of rank $r < d$ as a subgroup of finite index. Cayley graphs of subperiodic groups are used to illustrate the concept of bounded
automorphisms (particularly of finite order), i.e. those when the distance between a graph vertex and its image has an upper bound. The description of subperiodic groups in dimension 3 in terms of subgroup structure and abstract group isomorphism types [75 crystallographic rod groups ($r=1$) and 80 layer groups ($r=2$) belong to 32 and 34 types, respectively] allows for a convenient characterization of bounded
automorphisms of their Cayley graphs. An easy-to-compute set of invariants is developed for recognizing the isomorphism types of crystallographic groups in $\mathbb R^3$ from finite presentations which makes use of only the number of nonconjugate subgroups up to a given finite index $n$ ($n \leq 12$ for rod groups, $n \leq 8$ for layer groups, and $n \leq 24$ for space groups), and how many of them are normal. A criterion is proven that if a finite (inverse-closed) generating set of a group $G$ is stabilized by conjugation by a nontrivial element of finite order in $G$, then the respective Cayley graph possesses nontrivial bounded
automorphisms of finite order. This criterion is applied to three-periodic sphere-packing graphs. Subperiodic groups in $\mathbb R^4$ with a three-dimensional translation
lattice are used to systematically derive
embeddings of three-periodic ladder graphs in $\mathbb R^3$.
Read the full abstract ▾
Combinatorics
Relative accessibility for graphs
Joseph Paul MacManus
We relativise the Thomassen–Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative accessibility in terms of a certain subring of the Boolean ring of the graph, and apply this to show that our definition agrees with the usual algebraic notion of relative accessibility in finitely generated groups. This implies, in particular, that relative accessibility is a quasi-isometry invariant amongst finitely generated groups, when the quasi-isometry coarsely preserves the left cosets of the peripheral subgroups. We also deduce a relative variant of Hamann's accessibility
theorem on graphs with finitely generated cycle spaces.
Read the full abstract ▾
Combinatorics · Cross-listed from hep-th
Anatoly Dymarsky
We consider a model of 3d
quantum gravity defined by $n$ copies of a rational Virasoro TQFT with central charge $1/2$, summed over all 3d
topologies. This theory is holographically dual to an ensemble of all 2d CFTs with central charge $c=n/2$ and
chiral algebra that includes $Vir_{1/2}^n$. We perform the sum over
topologies and evaluate the partition function of the bulk theory. We then confirm the
holographic duality by matching it to the boundary ensemble for small $n$. We proceed to consider the limit of a large central charge, in which the bulk theory simplifies and condenses to an Abelian phase. In this regime, the model manifests many features expected in semiclassical 3d
quantum gravity. In particular, inclusion of all 3d
topologies in the bulk sum cures the negativity of the density of states evaluated by the
torus partition function. The model also exhibits a Hawking-Page transition, an exponentially suppressed wormhole amplitude, and provides a toy example of the
holographic code. We discuss these aspects in detail and conclude with lessons for semiclassical
quantum gravity.
Read the full abstract ▾
Algebraic Topology
Singular multivalued homology
Alejandro O. Majadas-Moure
Let $X$ be a compact, Hausdorff topological space. Then $H^M_n(X)=0$ for all $n>0$, where $H_n$ is the multivalued analogue of singular homology. The case $n=1$ is already known [8].
Optimization and Control · Cross-listed from cs.LO
Ensuring Logic in the Fog: Sound POMDP Synthesis with LTL Objectives
Can Zhou, Yulong Gao and Pian Yu
Synthesising autonomous
agents that can navigate uncertain environments while adhering to complex temporal constraints remains a fundamental challenge. While Linear Temporal Logic (LTL) provides a rigorous
language for specifying such tasks, the inherent undecidability of qualitatively verifying LTL satisfaction in partially observable Markov decision processes renders quantitative synthesis difficult, especially when designing reliable reward signals for approximate solvers. In this paper, we bridge this gap with a novel, sound reward-shaping mechanism that dynamically generates belief-dependent rewards grounded in certified LTL satisfaction. By integrating this mechanism into an enhanced Monte Carlo Planning framework, we empower
agents to navigate the `fog' of partial observability with a search process focused on maximising verifiable success. Our experiments demonstrate that this approach not only thrives in scenarios where existing solvers fail but also maintains effectiveness and scalability across diverse
benchmark domains.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Recurrent Transformer-Based Near- and Far-Field THz Wideband Channel Estimation for UM-MIMO
Dmitry Artemasov, Alexander Shmatok, Kirill Andreev et al. (+3 more)
The integration of terahertz communications and ultra-massive multiple-input multiple-output (UM-
MIMO) systems in 6G networks is motivated by their ability to enable unprecedented data rates, mitigate spectrum congestion, and enhance overall network performance. However, the enlarged
antenna apertures and higher carrier frequencies in these systems increase the Rayleigh distance, causing users to span both the near-field and conventional far-field regions. Accurate spatial precoding thus requires exact channel estimation at the base station - a task made more challenging by the hybrid coexistence of near- and far-field effects and the limited number of digital chains available in hybrid beamforming architectures. In this paper, we propose a block recurrent
transformer model to address this challenge. We demonstrate that a single
transformer block equipped with state
memory can be trained once and then iteratively applied for hybrid-field channel estimation. Furthermore, we train the model such that it generalizes to wireless channels with varying scatterer distances, different numbers of propagation paths, and wideband operation. Simulation results show that the proposed method achieves performance gains of approximately 5 dB and 7.5 dB in normalized mean squared error (NMSE) over state-of-the-art solutions in narrowband and wideband scenarios, respectively.
Read the full abstract ▾
All authors Dmitry Artemasov, Alexander Shmatok, Kirill Andreev, Alexey Frolov, Manjesh K. Hanawal, Nikola Zlatanov
Geometric Topology
Chewing gums, snakes and candle cakes
Benedetta Facciotti, Marta Mazzocco and Nikita Nikolaev
The aim of these lecture notes, based on lectures given by the second author at the CIME school in Cetraro, is to illustrate a range of ideas surrounding higher Teichmuller spaces of Riemann surfaces with marked boundaries through explicit and computationally tractable examples. After reviewing the classical Teichmuller space of
hyperbolic Riemann surfaces with boundary and its combinatorial description in terms of Thurston shear coordinates on a fat-graph, we explain how the bordered cusped Teichmuller space arises as a confluent limit when two boundary components in the Riemann surface collide via the so-called chewing-gum move giving rise to a candle cake. We then revisit these constructions from the Fock-Goncharov perspective, explaining snake calculus for transport
matrices in PSL_n(R) and explain how the chewing gum move is the inverse of amalgamation. Rather than focusing on formal proofs, our goal is to illustrate the underlying
theorems and constructions in a concrete and intuitive way.
Read the full abstract ▾
Statistics Theory
Non-asymptotic quantisation of spherically symmetric distributions
Luc Pronzato and Anatoly Zhigljavsky
Zador's celebrated
theorem is a cornerstone of optimal quantisation, establishing both the weak limit of the empirical distribution of an $n$-point optimal quantiser in $R^d$ and the decay rate of the associated $L_s$-mean quantisation error. However, for large dimensions $d$, observing this asymptotic behaviour demands an astronomically large sample size $n$, which grows super-exponentially with $d$. Through a detailed analysis of the quantisation problem for spherically symmetric distributions, we demonstrate that for moderate $n$ random quantisers uniformly distributed on a sphere of suitable radius $r$ achieve exceptional performance. The expected distortion, expressed as a triple integral, can be computed with arbitrary precision, and the optimal radius $r$ can be efficiently determined numerically. Leveraging results from extreme-value theory, we derive approximations for $r$, particularly in scenarios where $n$ scales with $d$. Depending on the growth rate of $n$, $r$ may either converge to zero or approach a limiting value that is independent of $s$.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Multiport Antenna Q-factor
Vojtech Neuman, Miloslav Capek and Lukas Jelinek
This article proposes an estimate of multiport
antenna bandwidth based on a generalization of a single-port Q-factor. The explicit derivation is based on converting the stored energy
matrix to its port equivalent and on the port parameters themselves. The work discusses the bandwidth dependencies on feeding and matching. Derived formulas are shown to utilize the total active reflection coefficient and allow for a single-frequency bandwidth evaluation. Examples comprising two different dipole arrays and electrically large patch
antenna arrays validate the theory.
Read the full abstract ▾
Probability
Central limit theorem for the homozygosity of the hierarchical Pitman-Yor process
Shui Feng and J. E. Paguyo
The hierarchical Pitman-Yor process is a discrete random measure used as a prior in
Bayesian nonparametrics. It is motivated by the study of groups of clustered data exhibiting power law behavior. Our focus in this paper is on the Gaussian behavior of a family of statistics, namely the power sum symmetric
polynomials for the vector of weights of the process, as the concentration parameters tend to infinity. We establish a central limit
theorem and obtain explicit representations for the asymptotic variance, with the latter clearly showing the impact of each component in the hierarchical structure. These results are crucial for understanding the asymptotic behavior of the sampling formulas associated with the process. In comparison with the known results for the hierarchical Dirichlet process, the results for the hierarchical Pitman-Yor process are mathematically more challenging and structurally more revealing of power law behavior.
Read the full abstract ▾
Information Theory
An Improved Lower Bound on Support Size of Capacity-Achieving Inputs for the Binomial Channel: Extended version
Mohammadamin Baniasadi, Antonino Favano, Luca Barletta et al. (+1 more)
We study the binomial channel and the structure of its capacity-achieving input and output distributions. It is known that the capacity-achieving input distribution is discrete and supported on finitely many points. The best previously known bounds show that the support size of the capacity-achieving distribution is lower-bounded by a term of order $\sqrt n$ and upper-bounded by a term of order $n/2$, where $n$ is the number of trials. In this work, we derive a new lower bound on the support size of order $\sqrt{n\log\log n}$, up to explicit constants. The proof consists of three main steps. First, we derive new upper and lower bounds on the capacity with a gap that vanishes as $n\to\infty$, which yields $C(n)=\frac12\log\frac{n\pi}{2e}+o(1)$. Second, we show that the Beta-binomial output distribution induced by the reference input $X_r\sim\mathrm{Beta}(1/2,1/2)$ is asymptotically optimal: it approaches the capacity-achieving output distribution in relative
entropy and, after a comparison step, in $\chi^2$ divergence. Third, we prove a quantitative $\chi^2$ approximation lower bound showing that this Beta-binomial output cannot be approximated too well by the output induced by a $K$-point input. Combining these ingredients forces the capacity-achieving input distribution to have at least order $\sqrt{n\log\log n}$ mass points.
Read the full abstract ▾
All authors Mohammadamin Baniasadi, Antonino Favano, Luca Barletta, Alex Dytso
Mathematical Physics · Cross-listed from hep-th
A note on universality in refined Chern-Simons theory
Andrei Mironov and Ruben Mkrtchyan
We discuss various forms of refinements of Vogel's universality in Chern-Simons theory. While the original universality applies to arbitrary simple Lie groups, its counterpart in refined Chyrn-Simons theory is restricted to simply laced Lie groups.
Mathematical Physics
Large $N$ factorization of families of tensor trace-invariants
Sylvain Carrozza, Johann Chevrier and Luca Lionni
It was recently proven that, in contrast to their
matrix analogues, the moments of a real Gaussian tensor of size N do not in general factorize over their connected components in the asymptotic large N limit. While the original proof of this rather surprising result was not constructive, explicit examples of non-factorizing moments, which are expectation values of trace-invariants, have since then been discovered. We explore further aspects of this problem, with a focus on Haar-distributed (or Gaussian) complex random tensors, which are more directly relevant to
quantum information. We start out by exhibiting an explicit example of non-factorizing trace-invariant, thereby filling a gap in the recent literature. We then turn to the opposite question: that of finding interesting families of trace-invariants that do in fact factorize at large N. We establish three main
theorems in this regard. The first one provides a sufficient combinatorial bound ensuring large N factorization, that is also simple enough to be applicable to various cases of practical relevance. Our second main result shows that the expectation value of any compatible trace-invariant is dominated by certain tree-like combinatorial structures at large N, which we refer to as tree-like dominant pairings. Our third main
theorem establishes that any trace-invariant admitting tree-like dominant pairings does actually factorize at large N. In this way, we are able to prove that various families of trace-invariants that have been previously studied in the literature do factorize at large N. We apply our findings to the theory of multipartite
quantum entanglement: to any trace-invariant is associated a multipartite generalization of Rényi
entanglement entropy, whose typical expectation value in the uniform random
quantum state can be explicitly computed assuming large N factorization.
Read the full abstract ▾
Symplectic Geometry
On the growth rate of Reeb orbit on star-shaped hypersurfaces
Rafael Fernandes and Joao Pering
In this article, we study the growth rate of Reeb orbits on fiberwise
star-shaped hypersurfaces in the cotangent bundle of a closed
manifold. We prove that under a suitable topological condition on the base
manifold the Reeb flow on any such hypersurface carries infinitely many simple closed orbits. Moreover, the number of simple Reeb orbits with period at most T grows at least like the
prime numbers, that is, like T/log(T). The topological condition we assume is the existence of a non-nilpotent class in the homology of the free loop space of the
manifold, with respect to the Chas-Sullivan product, lying in a connected component associated to a non-torsion class in the first homology of the
manifold. In particular, for any Riemannian metric on a
manifold satisfying such a topological condition, the number of geometrically distinct closed geodesics with length at most l grows at least like l/log(l). We also prove, using
symplectic homology, that if a Liouville domain of dimension at least 4 with vanishing first Chern class admits a Reeb symplectically degenerate maximum representing a non-torsion first homology class of the domain, then the number of simple Reeb orbits with period at most T grows at least like T/log(T).
Read the full abstract ▾
Statistics Theory
A proximal gradient algorithm for composite log-concave sampling
Linghai Liu and Sinho Chewi
We propose an
algorithm to sample from composite log-concave distributions over $\mathbb{R}^d$, i.e., densities of the form $\pi\propto e^{-f-g}$, assuming access to gradient evaluations of $\alpha_f$-convex $f$ and a restricted Gaussian oracle (RGO) for $\alpha_g$-convex $g$, where $\alpha_g \ge 0$. The latter requirement means that we can easily sample from the density $\text{RGO}_{g,h,y}(x) \propto \exp(-g(x) -\frac{1}{2h}||y-x||^2)$, which is the sampling analogue of the proximal operator for $g$. If $f + g$ is $\alpha$-convex and $f$ is $\beta$-smooth, our sampler achieves $\varepsilon$ error in total variation distance using $\widetilde{\mathcal O}(\kappa \sqrt d \log^4(1/\varepsilon))$ oracle calls where $\kappa := 1 \vee \beta/\alpha$, with $0\le \alpha_g \le \beta$ and $\alpha := \alpha_f + \alpha_g > 0$, which matches prior state-of-the-art results for the case $g=0$. We further extend our results to cases where (1) $\pi$ is non-log-concave but satisfies a Poincaré or log-Sobolev inequality, and (2) $f$ is non-smooth but Lipschitz.
Read the full abstract ▾
Rings and Algebras
Trace ideals and uniserial modules
Dolors Herbera and Pavel Pří hoda
We thoroughly investigate the trace ideals of projective modules over the endomorphism ring of a uniserial module. After the work of Dubrovin and Puninski, it is known that this class of rings provides examples of trace ideals of projective right modules that are not trace ideals of projective left modules. In this paper we further investigate when this happens, giving an intrinsic description of such trace ideals and their properties. We also use the theory associated to lifting projective modules modulo a trace ideal to give an alternative approach to Puninski's construction of a direct summand of a serial module that is not serial.
Read the full abstract ▾
Information Theory
Simultaneously Minimizing Storage and Bandwidth Under Exact Repair With Quantum Entanglement
Lei Hu, Mohamed Nomeir, Alptug Aytekin et al. (+1 more)
We study exact-regenerating codes for
entanglement-assisted distributed storage systems. Consider an $(n,k,d,\alpha,\beta_{\mathsf{q}},B)$ distributed system that stores a file of $B$ classical symbols across $n$ nodes with each node storing $\alpha$ symbols. A data collector can recover the file by accessing any $k$ nodes. When a node fails, any $d$ surviving nodes share an entangled state, and each of them transmits a
quantum system of $\beta_{\mathsf{q}}$ qudits to a newcomer. The newcomer then performs a measurement on the received
quantum systems to generate its storage. Recent work [1] showed that, under functional repair where the regenerated content may differ from that of the failed node, there exists a unique optimal regenerating point that \emph{simultaneously minimizes both storage $\alpha$ and repair bandwidth $d \beta_{\mathsf{q}}$} when $d \geq 2k-2$. In this paper, we show that, under exact repair, where the newcomer reproduces exactly the same content as the failed node, this optimal point remains achievable. Our construction builds on the classical product-
matrix framework and the Calderbank-Shor-Steane (CSS)-based stabilizer formalism.
Read the full abstract ▾
All authors Lei Hu, Mohamed Nomeir, Alptug Aytekin, Sennur Ulukus
Functional Analysis
Strongly Integrable Operator-Valued Functions, Generated Vector Measures and Compactness of Integrals
Miloš Arsenović, Mihailo Krstić, Matija Milović et al. (+1 more)
Gel'fand integral of a family of compact operators on a
Hilbert space is not always compact, even with additional property of positivity and commutativity. We prove that integrals of a family, consisting of compact operators, in the space $L_{s}^1(\Omega,\mu,\mathcal{B}(X, Y))$ of strongly integrable families are compact whenever $X$ does not contain an isomorphic copy of $\ell^1$. In addition, we prove an integral inequality for spectral radius $$r\left(\int_\Omega\mathscr{A} \,d\mu\right)\leqslant\int_\Omega r(\mathscr{A}_t)\,d\mu(t)$$ for a mutually commuting family $\mathscr{A}$ in $L_s^1(\Omega,\mu,\mathcal{B}(X))$, which generalizes a recent result obtained under a stronger assumption of Bochner integrability. We prove also approximation results in $L_s^1(\Omega,\mu,\mathcal{B}(X))$ in the case $X$ has finite dimensional Schauder decomposition. All these results are based on a key
theorem of this paper which states that every function in $L_{s}^1(\Omega,\mu, \mathcal{B}(X, Y))$ generates a countably additive, in operator norm, $\mathcal{B}(X, Y)$-valued measure whenever $X^*$ does not contain an isomorphic copy of $c_0$.
Read the full abstract ▾
All authors Miloš Arsenović, Mihailo Krstić, Matija Milović, Stefan Milošević
Dynamical Systems
Optimal Scheduling of Dengue Vector Control
Aram Vajdi, Lee W. Cohnstaedt, Caterina M. Scoglio et al. (+1 more)
Dengue transmission is shaped by the population dynamics of the Aedes aegypti mosquito, making vector control a central strategy for disease mitigation. The impact of interventions such as larvicide, adulticide, and breeding-site reduction depends critically on their timing under fluctuating environmental conditions. We build on a high-fidelity, non-Markovian mechanistic model of the Aedes life cycle that captures stage-structured, temperature-dependent developmental delays, and mortality, and extend it to incorporate multiple vector control measures. Rather than using continuous abstract control amplitudes as in standard optimal control formulations, we introduce intervention-specific temporal profiles that better reflect operational practice. We then develop an adjoint-based gradient descent framework to compute the optimal timing of a sequence of interventions by minimizing the time-dependent dengue reproduction number, R0. Numerical simulations based on seasonal temperature data from Miami, Florida, show that appropriately timed combinations of interventions can substantially suppress transmission risk, with outcomes strongly influenced by seasonal temperature variation and intervention duration. We further propose
embedding the resulting optimization framework within a Model Predictive Control architecture, yielding a closed-loop approach for real-time, surveillance-driven vector management under environmental and operational uncertainty.
Read the full abstract ▾
All authors Aram Vajdi, Lee W. Cohnstaedt, Caterina M. Scoglio, Heman Shakeri
Classical Analysis and ODEs
$\ell^{p}$ improving estimates for multilinear forms motivated by distance graphs
Eyvindur Palsson and Jennifer Smucker
We undertake a systematic study of the mapping properties of forms based on distance graphs in $\mathbb{Z}^{d}$ to see how the structure of a graph, $G$, affects the $\ell^{p}$ improving estimates of the form, $\Lambda_{G}$, based on $G$. This extends previous work on $\ell^{p}$ improving properties for the spherical averaging operator, which corresponds to a distance graph of a single distance. We obtain $\ell^{p}$ improving estimates for the collection of forms based on all graphs with 2, 3, and 4 vertices, as well as chains and simplexes of any size in $\mathbb{Z}^{d}$. Surprisingly, certain mapping properties only seem to depend on the number of vertices in the graph, not its structure, and forms based on subgraphs of a graph, $G$, do not necessarily inherit all mapping properties from $G$.
Read the full abstract ▾
Optimization and Control
Stochastic block coordinate and function alternation for multi-objective optimization and learning
Trang H. Tran and Luis Nunes Vicente
Multi-objective optimization is central to many engineering and machine learning applications, where multiple objectives must be optimized in balance. While multi-gradient based optimization methods combine these objectives in each step, such methods require computing gradients with respect to all variables at every iteration, resulting in high computational costs in large-scale settings. In this work, we propose a framework that simultaneously alternates the optimization of each objective and the (
stochastic) gradient update with respect to each variable block. Our framework reduces per-iteration computational cost while enabling exploration of the Pareto front by allocating a prescribed number of gradient steps to each objective. We establish rigorous convergence guarantees across several
stochastic smooth settings, including convex, non-convex, and Polyak-Lojasiewicz conditions, recovering classical convergence rates of single-objective methods. Numerical experiments demonstrate that our framework outperforms non-alternating methods on multi-target regression and produces a competitive Pareto front approximation, highlighting its computational efficiency and practical effectiveness.
Read the full abstract ▾
Differential Geometry
A min-max gap characterization of minimal foliations on the torus
Hoan Nguyen
We extend an energy introduced by Mather to the setting of Almgren-Pitts min-max theory and obtain a parametric, higher-dimensional analogue of Mather's variational barrier theory for twist maps and geodesics on
tori. We use this energy to establish several criteria for the existence of foliations of the $n$-
torus by minimal hypersurfaces. We show that for a generic metric, whenever a lamination by area-minimizing hypersurfaces of the $n$-
torus contains a gap, there exists a minimal hypersurface inside the gap that is not area-minimizing. This hypersurface is a higher-dimensional analogue of the secondary minimax orbit appearing in Aubry-Mather theory.
Read the full abstract ▾
Combinatorics · Cross-listed from cs.LG
Learning Minimally Rigid Graphs with High Realization Counts
Oleksandr Slyvka, Jan Rubeš, Rodrigo Alves et al. (+1 more)
For minimally rigid graphs, the same edge-length data can admit multiple realizations (up to translations and rotations). Finding graphs with exceptionally many realizations is an extremal problem in
rigidity theory, but exhaustive search quickly becomes infeasible due to the super-exponential growth of the number of candidate graphs and the high cost of realization-count evaluation. We propose a reinforcement-learning approach that constructs minimally rigid graphs via 0- and 1-extensions, also known as Henneberg moves. We optimize realization-count invariants using the Deep Cross-
Entropy Method with a policy parameterized by a Graph Isomorphism Network encoder and a permutation-equivariant extension-level action head. Empirically, our method matches the known optima for planar realization counts and improves the best known bounds for spherical realization counts, yielding new record graphs.
Read the full abstract ▾
All authors Oleksandr Slyvka, Jan Rubeš, Rodrigo Alves, Jan Legerský
Numerical Analysis
A Least-Squares Weak Galerkin Method for Second-Order Elliptic Equations in Non-Divergence Form
Chunmei Wang and Shangyou Zhang
This article proposes a novel least-squares weak Galerkin (LS-WG) method for second-order
elliptic equations in non-divergence form. The approach leverages a locally defined discrete weak Hessian operator constructed within the weak Galerkin framework. A key feature of the resulting
algorithm is that it yields a symmetric and positive definite linear system while remaining applicable to general polygonal and polyhedral meshes. We establish optimal-order error estimates for the approximation in a discrete $H^2$-equivalent norm. Finally, comprehensive numerical experiments are presented to validate the theoretical analysis and demonstrate the efficiency and robustness of the method.
Read the full abstract ▾
Optimization and Control · Cross-listed from stat.ML
Model-based Bootstrap of Controlled Markov Chains
Ziwei Su, Imon Banerjee and Diego Klabjan
We propose and analyze a model-based bootstrap for transition kernels in finite controlled Markov chains (CMCs) with possibly nonstationary or history-dependent control policies, a setting that arises naturally in offline reinforcement learning (RL) when the behavior policy generating the data is unknown. We establish distributional consistency of the bootstrap transition
estimator in both a single long-chain regime and the episodic offline RL regime. The key technical tools are a novel bootstrap law of large numbers (LLN) for the visitation counts and a novel use of the martingale central limit
theorem (CLT) for the bootstrap transition increments. We extend bootstrap distributional consistency to the downstream targets of offline policy evaluation (OPE) and optimal policy recovery (OPR) via the delta method by verifying Hadamard differentiability of the Bellman operators, yielding asymptotically valid confidence intervals for value and $Q$-functions. Experiments on the RiverSwim problem show that the proposed bootstrap confidence intervals (CIs), especially the percentile CIs, outperform the episodic bootstrap and plug-in CLT CIs, and are often close to nominal ($50\%$, $90\%$, $95\%$) coverage, while the baselines are poorly calibrated at small sample sizes and short episode lengths.
Read the full abstract ▾
Mathematical Physics
An analytical approach to calculating stationary PDFs for reflected random walks with an application to BESS-based ramp-rate control
Carlos Colchero, Diego Jiménez-Arreguín, Álvaro Herrera et al. (+2 more)
A Wiener-
Hopf-type integral equation for the stationary PDF of a reflected random walk is derived rigorously based on modern probability theory, and an application to battery energy storage systems (BESS), specifically the sizing of the inverter, is discussed in depth. The methodological steps include the construction of a Markov kernel, the derivation of a Fredholm integral equation of the second kind for the PDF of the BESS power, and an analytical solution of the equation based on a Neumann series. The analytical results were compared against numerical solutions obtained with the Nystrom method, as well as against the results of an algorithmic simulation using simulated input time series. The use of truncated versions of the analytic solution allows for the construction of simplified design rules for the power systems practitioner. General insights into inverter sizing criteria of storage systems for ramp-rate control of variable renewable energy (VRE) sources such as wind and
solar are provided.
Read the full abstract ▾
All authors Carlos Colchero, Diego Jiménez-Arreguín, Álvaro Herrera, Jorge E. Pérez-García, Oliver Probst