Metric Geometry
Minimal Fillings of Finite Metric Spaces and Convex Polyhedra
A.O. Ivanov and A.A. Tuzhilin
Problem of minimal parametric generalized fillings of finite metric space $M$ (a version of optimal connection problem) leads to construction of a convex multidimensional polyhedra $W_G$ for each tree $G$ connecting $M$ chosen as type of the parametric filling. The weight of the parametric minimal filling can be found as maximum on $W_G$ of the special linear function corresponding to the distance vector of $M$. It is proved that the union of vertex sets of the polyhedra $W_G$ over all possible $G$ forms an extremal subset, i.e., coincides with the vertex set of its convex hull.
Read the full abstract ▾
Classical Analysis and ODEs
A simple proof that the Riesz projection is bounded on $L^p(\mathbb{T})$ for $1<p<\infty$
Ole Fredrik Brevig
Let $\mathbf{P}$ denote the Riesz projection on the unit circle $\mathbb{T}$ and suppose that $1<p<\infty$. We present a simple proof of the bound $\|\mathbf{P}f\|_p \leq \max(p,q) \|f\|_p$, where $f$ is in $L^p(\mathbb{T})$ and $p^{-1}+q^{-1}=1$. Our proof is a variation of a classical argument due to M. Riesz demonstrating that the
Hilbert transform is bounded on $L^p(\mathbb{T})$.
Read the full abstract ▾
Logic · Cross-listed from cs.CC
Measuring Decidability as Related to Busy Beaver Numbers
Gurpreet Tandi, Josue Gonzalez-Hendrix and Jonathan Brown
The theoretical existence of Busy Beaver numbers provides a new notion for decidability and corresponding heuristic for
conjectures. The minimum number of states in which a
conjecture can be modeled gives a classification of what logic system can describe said
conjecture. In this work, we construct explicit Turing machines that search for a solution to Brocard's problem greater than 7 and a Fermat
prime beyond the 4th which halt if and only if such a solution exists.
Read the full abstract ▾
Combinatorics
On the Hilton-Zhao vertex-splitting conjecture
Xuli Qi and Yanrui Feng
Let $G$ be a simple graph with order $n$, maximum degree $\Delta(G)$, and chromatic index $\chi'(G)$, respectively. A graph $G$ is edge-chromatic critical if $\chi'(H)<\chi'(G)$ for every proper subgraph $H$ of $G$. Assume that $G$ is an $n$-vertex connected regular Class $1$ graph, and let $G^*$ be obtained from $G$ by splitting one vertex into two vertices. Hilton and Zhao in 1997 proposed the vertex-splitting
conjecture: if $\Delta(G)>\frac{n}{3}$, then $G^*$ is edge-chromatic critical. Recently, Cao, Chen, and Shan (Discrete Math. 2022) verified the
conjecture for $\Delta(G)\ge\frac{3n}{4}$. In this paper, we confirm the
conjecture for $\Delta(G) \ge\frac{2n-2}{3}$.
Read the full abstract ▾
Statistics Theory · Cross-listed from stat.ME
Tests for constancy of model parameters Over time
Nils Lid Hjort and Alex J. Koning
Suppose that a sequence of data points follows a distribution of a certain parametric form, but that one or more of the underlying parameters may change over time. This paper addresses various natural questions in such a framework. We construct canonical monitoring processes which under the hypothesis of no change converge in distribution to independent Brownian bridges, and use these to construct natural goodness-of-fit statistics. Weighted versions of these are also studied, and optimal weight functions are derived to give maximum local power against alternatives of interest. We also discuss how our results can be used to pinpoint where and what type of changes have occurred, in the event that initial screening tests indicate that such exist. Our unified large-sample methodology is quite general and applies to all regular parametric models, including regression, Markov chains, and time series situations.
Read the full abstract ▾
Information Theory
Uniqueness on a Continuum: Quantifying Tonal Ambiguity Using Information Theory
Michael Seltenreich
We propose a continuous measure of tonal ambiguity that extends the established concept of uniqueness. While uniqueness is widely regarded as necessary for tonality, it cannot (i) discriminate among sets that possess it, (ii) capture hierarchical organization in modes of limited transposition, or (iii) account for temporal unfolding. To address these limitations, we introduce a companion measure, grounded in information theory, that quantifies tonal ambiguity on a continuous scale. The measure applies across pitch-class sets and tuning systems, expanding analytic coverage of tonal relationships and offering a practical tool for theory and analysis.
Read the full abstract ▾
Differential Geometry
The energy-momentum tensor of the Standard Model with applications to energy conditions
Volker Branding, Adam Lindström and Marko Sobak
The Standard Model of elementary particle physics is one of the most successful models of contemporary physics, its predictions being in full agreement with experiments. In this manuscript we consider the Lagrangian of the Standard Model as a
geometric variational problem on a globally
hyperbolic manifold and derive the associated energy-momentum tensor in a
geometric invariant way. As an application, we investigate the validity of various energy conditions that arise in general relativity.
Read the full abstract ▾
Information Theory · Cross-listed from eess.SP
Learning the Channel Gain from Anywhere to Anywhere via Cross-environment Transformer Estimators
Prasenjit Dhara and Daniel Romero
Channel-gain maps provide the channel gain between any two locations in a geographical region. They find numerous applications, from resource allocation and interference control to path planning for autonomous vehicles. Channel-gain map estimation (CGME) is considerably more challenging than conventional
radio map estimation (RME) because channel-gain maps are functions over a 6-dimensional input space. This calls for specialized methods, which currently rely on the (inaccurate)
radio tomographic model or require a prohibitively large number of measurements since they do not exploit any spatial structure. This paper overcomes this issue by leveraging spatial patterns that channel-gain maps exhibit across environments, as dictated by the laws of physics and typical environmental characteristics (e.g. building materials and layouts). Adopting a metalearning perspective, a
transformer-based
estimator is proposed to implicitly learn this common structure from measurements collected in multiple environments. This enables CGME in new environments from significantly fewer measurements (five times less in our experiments). To maximize learning efficiency, the
transformer is composed with a feature map that enforces the invariances of CGME, such as those following from reciprocity. Numerical experiments corroborate the merits of the proposed
estimator relative to existing methods.
Read the full abstract ▾
Geometric Topology
On extending results of Gluck and Warner on fibrations of spheres by great subspheres
Eric Yu
In this paper, we build upon the work of Gluck and Warner who showed in 1983 that the set of positively oriented fibrations of a 3-sphere by oriented great circles is in bijection with the set of distance-decreasing maps from the 2-sphere to itself. One approach to generalizing their result to higher-dimensional spheres involves understanding when exactly two
Hopf fibrations of $S^{2n-1}$ are guaranteed to agree on a fiber. We give a complete characterization of this phenomenon, and we discuss the barriers which prevent us from obtaining a fully general version of Gluck and Warner's result.
Read the full abstract ▾
Information Theory
Information-theoretic Limits of Learning and Estimation
Abbas El Gamal and Maxim Raginsky
Information theory plays a central role in establishing fundamental limits on what any learning or estimation
algorithm can – and cannot – achieve, regardless of computational power. In this chapter, we provide an introduction to these connections. End-of-chapter exercises makes the material suitable for both classroom use and self-study. We begin by introducing concentration inequalities along with the notions of covering and packing in metric spaces, and the associated concept of metric
entropy. These tools are essential for our analysis. We then introduce the learning-theoretic framework and derive upper bounds on generalization error in terms of metric
entropy, Rademacher complexity, and the VC dimension, as well as mutual information and relative
entropy. Finally we discuss the minimax estimation framework and establish lower bounds on minimax risk using Fano's inequality, yielding bounds in terms of relative
entropy and covering and packing numbers. This manuscript contains preprint of a chapter under consideration for inclusion in the forthcoming third edition of Cover and Thomas's Elements of Information Theory, posted with permission from Wiley. It would follow the chapter posted at arXiv:2605.02989 . The table of contents of the new edition can be found at: https://docs.google.com/document/d/1L-m4oQEJw1PJhoxBeMwrrBD8S_HmvzMEkPbYvS24980/edit?usp=sharing . For feedback, please contact abbas@ee.stanford.edu.
Read the full abstract ▾
General Mathematics
The Taylor Integral and a Generalization of the Discrete Fourier Transform
Athanasios Christou Micheas
We propose a new integral based on Taylor measures, study its properties extensively, and we illustrate that it includes many concepts from mathematics as special cases. In particular, the new integral emerges as a generalization of the discrete
Fourier transform, and we identify general conditions for it to be invertible when applied to any real or complex sequence. Applications to the mathematical sciences are also presented.
Read the full abstract ▾
Mathematical Physics · Cross-listed from cond-mat.stat-mech
Emergence of Tsallis Statistics from a Self-Referential Nonlinear Operator: A Variational Framework
Lucio Marassi
We develop a variational thermodynamic framework for statistical systems governed by a self-referential nonlinear operator Omega characterized by structural exponents alpha > 0, beta >= 0, a symmetric kernel K, and a self-coupling constant kappa >= 0. The central object is the self-consistency
entropy S[Psi] = -D_KL(Psi || Omega Psi), which vanishes at the fixed points of Omega and serves as a natural Lyapunov functional. Within the local kernel (mean-field) approximation, minimization of the free energy F = U - T S admits the Tsallis q-exponential distribution as an
equilibrium state, with the entropic index q = alpha + beta emerging directly from the fixed-point structure of the operator rather than being postulated. The framework yields a consistent thermodynamic description, including a generalized equation of state PV = (2 - q) T, response functions, and a critical temperature associated with spontaneous
symmetry breaking. The relation q = alpha + beta connects independently measurable structural exponents of the feedback mechanism to the observed tail index, providing a parameter-free criterion that distinguishes this approach from superstatistics, constrained
entropy maximization, and q-deformed formalisms. This work establishes an operator-theoretic foundation for nonextensive statistical mechanics in which nonlinear self-referential feedback naturally generates Tsallis statistics in the mean-field limit.
Read the full abstract ▾
General Mathematics
Linearization Problem for Third-Order ODEs with Four- and Five-Dimensional Lie Symmetry Algebras under Contact Transformations
Omar A. Abuloha, Marwan Aloqeili, Ahmad Y. Al-Dweik et al. (+1 more)
Using Cartan equivalence method, invariant coframes are constructed for two branches of rank one and zero, which characterize linearizable third-order ODEs under contact transformations with four- and five-dimensional Lie
symmetry algebras, respectively. A procedure for deriving the corresponding contact transformations is also presented, along with illustrative examples.
Read the full abstract ▾
All authors Omar A. Abuloha, Marwan Aloqeili, Ahmad Y. Al-Dweik, F. M. Mahomed
Statistics Theory · Cross-listed from econ.TH
An Axiomatic Foundation for Decisions with Counterfactual Utility
Benedikt Koch, Kosuke Imai and Tomasz Strzalecki
Counterfactual utilities evaluate decisions not only by the realized outcome under a given decision, but also by the counterfactual outcomes that would arise under alternative decisions. By generalizing the standard utility framework, they allow decision-makers to encode asymmetric criteria, such as avoiding harm and anticipating regret. Recent work, however, has raised fundamental concerns about the coherence and transitivity of counterfactual utilities. We address these concerns by extending the von Neumann-Morgenstern (vNM) framework to preferences defined on the extended space of all potential outcomes rather than realized outcomes alone. We show that expected counterfactual utility satisfies the vNM axioms on this extended domain, thereby admitting a coherent preference representation. We further examine how counterfactual preferences map onto the realized outcome space through menu-dependent and context-dependent projections. This axiomatic framework reconciles apparent inconsistencies highlighted by the Russian roulette example in the statistics literature and resolves the well-known Allais paradox from behavioral economics. We also derive an additional axiom required to reduce counterfactual utilities to standard utilities on the same potential outcome space, and establish an axiomatic foundation for additive counterfactual utilities, which satisfy a necessary and sufficient condition for point identification. Our results show that the use of asymmetric counterfactual utility functions is coherent regardless of whether individual potential outcomes are deterministic or
stochastic, and that a recent proposal involving
stochastic potential outcomes leads to ambiguities and inconsistencies.
Read the full abstract ▾
Differential Geometry
Variational reduction of homogenous Lagrangian systems
Javier Fernández, Sergio Grillo, Juan Carlos Marrero et al. (+1 more)
In this paper we show that a variational reduction procedure can be defined for Lagrangian systems subject to scaling
symmetries (i.e. Lagrangian systems defined by a homogenous Lagrangian function), in such a way that the trajectories of the system can be reconstructed up to quadratures from the critical points of the reduced variational principle. Also, we characterize the mentioned critical points in terms of a set of ordinary differential equations which are the scaling analogue of the Lagrange-Poincaré equations. Finally, we study if the homogeneous Lagrangian systems are naturally related or not with the Herglotz variational principle.
Read the full abstract ▾
All authors Javier Fernández, Sergio Grillo, Juan Carlos Marrero, Edith Padrón