General Mathematics
On the Constructive Dimension Spectrum of Polynomials
Prajval Koul and Satyadev Nandakumar
Recently, Stull [18], [17] resolved a long-standing open problem posed by Lutz, on whether the set of effective Hausdorff dimensions of points on a straight line in $\mathbb{R}^2$ – the effective dimension spectrum of the line – contains a unit interval. This question is related to problems in classical fractal geometry like the Kakeya
conjecture and Furstenberg sets. Stull posed an open question on the dimension spectra of
polynomial curves. For the first result, with new techniques which adapt the theory of classical real root-finding of
polynomials to the current setting, we show that the dimension spectra of every
polynomial curve contains at least two points. This answers an open question posed by Stull [18], [17]. We use the main result to construct a class of
polynomials which have width strictly greater than 1, answering a second problem stated in [18],[17]. Stull [18] resolved the dimension spectrum
conjecture for planar lines, showing that it contains a unit interval. For the second result, we resolve the
conjecture for a subfamily of
polynomials whose coefficients form a "low" dimension point in $\mathbb{R}^{d+1}$.
Read the full abstract ▾
Information Theory · Cross-listed from q-bio.NC
Information as Maximum-Caliber Deviation: A bridge between Integrated Information Theory and the Free Energy Principle
Alexander Kearney
The Free Energy Principle (FEP) is a leading framework for mathematically modeling self-organization and learning, while Integrated Information Theory (IIT) is a computational ontology of consciousness oriented around irreducible cause and effect. While conceptual unifications have been proposed and appear to be supported by empirical findings, the absence of a rigorous mathematical mapping places upper bounds on their precision and testability. This work proposes that information can be defined as the deviation $\psi$ of realized dynamics from a constrained maximum-caliber (MaxCal) path ensemble over a finite time horizon. Under this definition, each of the cause/effect repertoires central to IIT 3.0 emerge directly from MaxCal variational principles, allowing IIT's phenomenological calculus to be re-derived from constrained
entropy-maximization (CMEP). This framework supplies a theoretical bridge to active inference, which is mathematically dual to CMEP under Langevin dynamics, and offers a principled route for extending IIT to new dynamical regimes. When the approach is applied under the Central Limit
Theorem (CLT) for Markov chains and via large deviations theory (LDT) to Ising models, information $\psi$ is shown to be equivalent to prediction error under accompanying predictive coding models. This may hold relevance to the “hill-shaped trajectory” of $\Phi$ observed in neuronal cultures adapting to sensory inputs. Together, these results provide a physically and mathematically grounded rationale for studying the convergence of FEP, IIT, and thermodynamic frameworks of cognition such as recent work grounding consciousness in violations of the Fluctuation-Dissipation
Theorem (FDT).
Read the full abstract ▾
General Mathematics
Discontinuity at the fixed point in suprametric spaces
Nicola Fabiano, Sedigheh Barootkoob and Hossein Lakzian
The aim of this paper is to generalize some fixed point
theorems in the class of convex contraction of order $m$ on a complete suprametric space. Then, we will prove that the class of convex contraction of order m is strong enough to generate a fixed point on a complete suprametric spaces but do not force the mapping to be continuous at the fixed point, and it can be replaced by relatively weaker conditions of $k$-continuity or $T$-orbitally lower semi-continuous. On this way a new and distinct solution to the open problem of Rhoades (Contemp Math 72:233-245,1988) is found. In sequel, we will prove some fixed point results in the setting suprametric spaces which are generalizations of the results regarding Sehgal, Ćirić and Fisher's quasi-contraction. Some examples and application will be approved our results.
Read the full abstract ▾
Dynamical Systems
Non-Monotone Response Modules and Cascades from the EML Operator for Reduced Models of Biological Dynamics
Amir Erez
Standard saturating response functions, such as the Hill function, are monotone and therefore cannot represent recruitment-induced overshoot or adaptive transients with a single block. Reproducing such non-monotone responses from saturating primitives requires at least a difference of two blocks with opposing amplitudes, doubling the static-block parameter count. Here, building on a recent mathematical result that a single binary operator, EML, generates all standard elementary functions, we use EML as a structured grammar for reduced nonlinear ODEs. This yields an activation-suppression module that captures overshoot directly. We validate the framework in three settings. First, on PKA-R relocalization data, the EML grammar discovers a reduced surrogate consistent with established mechanistic biology. Second, on Rho-GTPase recruitment data, an exhaustive search over EML expression trees selects the same compositional form across all four perturbation-response traces. Third, a 50-state simulated network is compressed by an EML cascade acting as a fixed temporal basis. Thus we demonstrate the power and potential of EML for reduced models of biological dynamics.
Read the full abstract ▾
Optimization and Control · Cross-listed from cs.LG
Analytic Bridge Diffusions for Controlled Path Generation
Michael Chertkov
Most modern bridge-
diffusion methods achieve finite-time transport by specifying an interpolation, Schrodinger-bridge, or
stochastic-control objective and then learning the associated score or drift field with a neural network. In contrast, we identify a restricted but sufficiently broad analytically solvable class in which, for a deterministic source and a Gaussian-mixture target, the score and all intermediate marginals are explicit and protocol objectives of the type used in this paper can be differentiated without inner
stochastic simulation loops. We recast the classical linear–quadratic–Gaussian
stochastic-control structure as a transport problem of the Path Integral
Diffusion type. Linear dynamics, Gaussian noise, and quadratic running costs reduce the bridge calculation to a
matrix Riccati cascade, while the terminal state cost is replaced by a prescribed Gaussian-Mixture terminal probability density. Linear Quadratic – Gaussian Mixture – Path Integral
Diffusion (LQ-GM-PID) thereby turns bridge
diffusion from terminal target matching alone into an analytically controlled laboratory for path shaping. We demonstrate this on a 2D corridor task, a 2D multi-entrance task, and a high-dimensional study reaching d=32 and M=16 terminal modes in separate scaling sweeps. We position LQ-GM-PID as an analytically solvable reference model in which score approximations, path-shaping objectives, and protocol-learning procedures can be tested against explicit quantities.
Read the full abstract ▾
Statistics Theory
Entropic Strict Minimum Message Length and Its Connections to PAC-Bayes and NML
Enes Makalic and Daniel F. Schmidt
We introduce entropic strict minimum message length (SMML), a risk-sensitive generalization of strict minimum message length coding. The proposed criterion replaces expected two-part codelength under the prior predictive distribution with an exponential certainty equivalent, thereby defining a one-parameter family of coding rules that interpolates between
Bayesian average-case coding and worst-case minimax coding. We show that ordinary SMML is recovered in the risk-neutral limit, while the extreme risk-sensitive limit yields a minimax codelength criterion. Applying the same entropic soft maximum to regret relative to the oracle maximum likelihood codelength recovers the normalized maximum likelihood (NML) minimax-regret principle. We further prove that entropic SMML admits a variational characterization as a Kullback–Leibler-regularized worst-case expected codelength, giving it a PAC–Bayes-type interpretation. We establish joint \(n\)–\(\tau\) asymptotics that identify how the risk parameter must scale with sample size in order to recover
Bayesian average-case, intermediate robust, and worst-case minimax coding behavior. For regular exponential families, the fixed-codebook partition remains affine in sufficient-statistic space, while the codepoints satisfy a tilted moment-matching condition and admit an interpretation as tilted Bregman centroids. These results position entropic SMML as an information theoretic bridge between MML, PAC–Bayes, and MDL.
Read the full abstract ▾
Information Theory · Cross-listed from quant-ph
Separability from Multipartite Measures
Chen-Te Ma and Ma-Ke Yuan
We show that multi-invariants provide necessary and sufficient criteria for full separability in finite-dimensional multipartite systems. For tripartite three-
qubit states, the third-order negativity gives an exact criterion for full separability for both pure and mixed states. We then extend the framework to four-
qubit pure states, whose full characterization requires eighteen independent real parameters. We identify eighteen independent
entanglement measures, consisting of six bipartite, eight tripartite, and four quadripartite measures, with the third-order negativity serving as a key separability criterion. Finally, we generalize the construction to multipartite qudit systems and discuss an application to conformal field theory.
Read the full abstract ▾
Probability
An analytic approach to the finite R-transform
Octavio Arizmendi and Katsunori Fujie
We revisit Marcus' finite free analogue of Voiculescu $R$-transform from an analytic viewpoint. By relating the finite free
Fourier transform to the Laplace transform, we study the finite $R$-transform through logarithmic potentials and Legendre transforms. Under suitable assumptions, we prove that the finite $R$-transform of a
polynomial differs from the Voiculescu $R$-transform of its empirical root distribution by $O(N^{-1})$. As an application, we obtain an analytic proof of the convergence of finite free additive convolution to free additive convolution.
Read the full abstract ▾
Group Theory
Some families of locally graded groups with finitely many orbits under automorphisms
Alex Carrazedo Dantas and Jucélia Ferreira de Sousa
In this work, we study three families of locally graded groups with finitely many orbits under
automorphisms. We prove that: (i) a residually finite group with finitely many orbits under
automorphisms is locally finite and has finite exponent; (ii) a finitely generated locally graded group with finitely many orbits under
automorphisms is finite; and (iii) the Mal'cev $\mathbb{Q}$-completion of an $r$-generated free nilpotent group of class $c$ has finitely many orbits under
automorphisms if and only if either $r = 2$ and $c = 3$, or $c \leq 2$
Read the full abstract ▾
Statistics Theory · Cross-listed from econ.EM
Fast Monte-Carlo
Irene Aldridge
This paper proposes an
eigenvalue-based small-sample approximation of the celebrated Markov Chain Monte Carlo that delivers an invariant steady-state distribution that is consistent with traditional Monte Carlo methods. The proposed
eigenvalue-based methodology reduces the number of paths required for Monte Carlo from as many as 1,000,000 to as few as 10 (depending on the simulation time horizon $T$), and delivers comparable, distributionally robust results, as measured by the Wasserstein distance. The proposed methodology also produces a significant variance reduction in the steady-state distribution.
Read the full abstract ▾
Numerical Analysis
On the Practical Impact of Local Linear Instabilities in Entropy-Stable Schemes
Alex Bercik and David W. Zingg
Local linear instability refers to the linearized discrete operator exhibiting perturbation growth exceeding that of the corresponding continuous linearized problem. In the context of nonlinear
entropy-stable discretizations, we argue that local linear instabilities should be interpreted as a source of numerical error whose practical impact is often negligible compared with other discretization errors. For split-form discretizations of the variable-coefficient linear advection equation, such as those resulting from linearizations of
entropy-stable discretizations of the Burgers equation, perturbations can indeed exhibit unphysical modal growth. However, we demonstrate that this growth satisfies physically interpretable bounds and is typically small. Furthermore, through modified-equation analysis and numerical experiments, we show that the growth is dominated by highly oscillatory and boundary-localized unphysical modes, and can therefore be readily controlled by small amounts of numerical dissipation. More generally, this modal perturbation growth does not extend directly to nonlinear two-point-flux discretizations of the type used in
entropy-stable discretizations of the Euler equations. Floquet analysis demonstrates that unstable spectra of frozen-baseflow Jacobians need not lead to unstable perturbation growth. Using the
geometric flux for the variable-coefficient linear advection equation, we derive a sharp perturbation growth bound predicting negligible growth, then show analogous behaviour for the logarithmic flux numerically. Finally, we argue that robustness issues observed for
entropy-stable schemes in density-wave problems are better attributed to poor near-
vacuum behaviour of the logarithmic mean than to local linear instabilities. Overall, our results suggest that local linear instabilities do not pose a practical obstacle to the use of high-order
entropy-stable schemes.
Read the full abstract ▾
Differential Geometry
Geometric Reductions of the $G_2$-Hilbert Functional via Circle Actions
Julieth Saavedra
In this paper, we study critical points and gradient flows of the $G_2$–
Hilbert functional on a
manifolds with free $\mathbb S^1$–actions. We analyze $\mathbb S^1$–invariant $G_2$–structures under the constant fiber-length non-Kähler transverse ansatz, reducing the variational problem to the $6$–dimensional quotient and we also consider a Gibbons–Hawking-type ansatz with varying fiber length and derive the formal negative $L^2$–gradient flow. We conclude that the unnormalized flow admits only trivial stationary configurations: flat connection, scalar-flat base metric, and constant fiber length.
Read the full abstract ▾
Group Theory
Higher Commutativity in Finite Groups: Exact Asymptotics and Finite Spectrum
Vadim E. Levit and Robert Shwartz
For a finite group G, we study the higher commuting probabilities, namely the probabilities that r randomly chosen elements of G commute pairwise, together with the corresponding numbers of simultaneous conjugacy classes of commuting r-tuples. We prove an exact dominant asymptotic for the number of homomorphisms from the free abelian group of rank r to G. The exponential base is the maximum order of an abelian subgroup of G, and the leading coefficient is the number of abelian subgroups of that order. As a consequence, the r-th root of the higher commuting probability tends to this maximum abelian-subgroup order divided by the order of G, while the r-th root of the orbit count tends to the maximum abelian-subgroup order itself. We also prove that the associated rank-generating series is rational and has a finite Dirichlet-spectrum expansion supported on abelian subgroup indices. This spectrum yields a finite linear recurrence, a finite-rank Hankel
matrix, and an inverse finite-spectrum
theorem: the tail of the hierarchy determines the full abelian-index spectrum. For split abelian extensions, we express the dominant base through fixed-subgroup geometry, and for abelian acting quotients, we obtain an exact subgroup-
lattice formula. In the cyclic and coprime cases, this gives closed formulas for all spectral coefficients.
Read the full abstract ▾
Statistics Theory
Sharp regret-Hellinger bounds for Gaussian empirical Bayes via polynomial approximation
Jiafeng Chen and Yihong Wu
A central problem in the theory of empirical Bayes is to control the regret (excess risk) of a learned Bayes rule by the Hellinger distance between the estimated and true marginal densities. In the normal means model, the classical result of Jiang and Zhang (2009) achieves this only after regularizing the Bayes rule and incurs an extraneous cubic logarithmic factor through a delicate recursive argument. This paper introduces a new technique, based on
polynomial approximation and Bernstein-type inequalities for weighted $L_2$ norms, that bounds the unregularized regret directly. The method is conceptually simpler and yields sharper, sometimes optimal, regret bounds. For compactly supported priors, we prove the sharp bound that the regret is $O(\epsilon^2 \frac{\log(1/\epsilon)}{\log\log(1/\epsilon)})$, where $\epsilon$ is the Hellinger distance between the marginal densities. The same method also extends to priors with exponential tails. Conversely, we show that regularization is genuinely necessary for heavy-tailed priors under only bounded moment assumptions. As statistical consequences, we obtain improved regret bounds for the nonparametric maximum likelihood
estimator (NPMLE). Notably, for compactly supported priors, by determining the optimal Hellinger rate of mixture density estimation, we show that the optimal regret for sample size $n$ scales as $\Theta(\frac{1}{n}(\frac{\log n}{\log\log n})^2)$, attained by the NPMLE within a $\log\log n$ factor.
Read the full abstract ▾
Dynamical Systems
Realizing Saddle-Node Bifurcations from Finite Data
Konstantin Mischaikow and Aakash Parikh
Given a finite set of data generated by an unknown ordinary differential equation it is impossible to exactly determine the associated vector field, and hence, bifurcation theory tells us that it is impossible, in general, to correctly characterize the underlying dynamics. In this paper, we bypass the effort of obtaining an analytic approximation of the vector field, and we adopt an approach based on Occam's razor: identify the simplest robust characterization of the dynamics that is compatible with the given data. Our fundamental assumption is that the data allows for the construction of an isolating block over a parameter space whose homological Conley index is consistent with a saddle-node bifurcation. Our main result establishes that, for phase spaces of dimension greater than or equal to 6, the original vector field can be smoothly deformed into a canonical model exhibiting exactly one structurally stable saddle-node bifurcation. Crucially, this deformation leaves the vector field unaltered outside the isolating block, ensuring strict compatibility with the observed data.
Read the full abstract ▾
Combinatorics
Faster Mixing for Triangulations via Transport Flows
Vedat Levi Alev, Daniel Frishberg, Michail Sarantis et al. (+1 more)
We prove an $\widetilde O(n^2)$ bound for the relaxation time and the log-Sobolev time (inverse log-Sobolev constant) of the classical triangulation flip chain on a convex $(n+2)$-gon, implying a mixing time of $\widetilde O(n^2)$. The previous state of the art for the mixing time of this chain, due to Eppstein and Frishberg, was $\widetilde O(n^3)$, while the best known lower bound on the mixing time, due to Molloy, Reed, and Steiger, is $\Omega(n^{3/2})$. Our relaxation time bound makes significant progress towards Aldous' conjectured bound of $\Theta(n^{3/2})$ for the relaxation time. We improve upon the analysis of Eppstein and Frishberg by further developing the framework of transport flows introduced in the work of Chen et al. In this light, our results can be seen as a more efficient way of using combinatorial decompositions to obtain functional inequalities for Markov chains. We hope our ideas will find other applications in the future.
Read the full abstract ▾
All authors Vedat Levi Alev, Daniel Frishberg, Michail Sarantis, Prasad Tetali