Mathematical Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Monday 23 March
Dimensional analysis, especially Buckingham's $\pi$ theorem, reduces the number of variables by rewriting a relation in terms of dimensionless quantities. When variables are tied by definitions, constitutive laws, or other constraints, however, eliminating variables in advance can be awkward. We formulate dimensional analysis with constraints as linear algebra in logarithmic variables. Dimensional transformations and constraints are represented by subspaces, the effective number of independent dimensionless quantities is characterized by their intersection, and a matrix representation yields a systematic redundancy elimination procedure. Examples from falling motion, drag force, and stock-market indicators illustrate the scope and limitations of the method.
Information Theory
Ultrafast microwave sensing and automatic recognition of dynamic objects in open world using programmable surface plasmonic neural networks
The evolution toward next-generation intelligent sensing requires microwave systems to move beyond static detection and achieve high-speed and adaptive perception of dynamic scenes. However, the existing microwave sensing systems have bottlenecks owing to their sequential digital processing chain, limiting the refresh rates to hundreds of hertz, while the existing integrated microwave processors are lack of programmable and scalable capabilities for robust and open-world deployment. To break the bottlenecks, here we report a programmable surface plasmonic neural network (P-SPNN) that enables real-time microwave sensing and automatic recognition of dynamic objects in open-world environment. With a perception latency of 25 ns and a refresh rate exceeding 10 kHz, the P-SPNN system operates more than two orders of magnitude faster than the conventional millimeter-wave sensors, while achieving an energy efficiency of 17 TOPS per W. With 288 programmable phase-modulated neurons, we demonstrate real time and robust classification of persons and cars with 91-97% accuracy in the open road scenarios. By further integrating beam-scanning function, P-SPNN enables multi-dimensional spatial temporal frequency sensing without the digital preprocessing. These results establish P-SPNN as a programmable, scalable, and low-power platform for high-speed perception tasks in realistic world, with broad implications for autonomous driving, intelligent sensing, and next-generation artificial intelligence hardware.
Read the full abstract
Algebraic Geometry
On the discriminant locus of a generic projection
For a smooth projective variety $X\subseteq \mathbb P^N$ over an algebraically closed field of char $0$, we show that the discriminant locus of a generic projection of $X$ is projectively dual to a general linear section of the dual variety, and deduce a purity statement for the discriminant. Over $\mathbb C$, we also show that the fundamental group of the complement of the branch divisor arising from generic projection of a normal hypersurface surjects onto a braid group via braid monodromy.
Read the full abstract
Optimization and Control
Optimal local linear convergence of Nesterov's accelerated gradient method for $C^2$ functions under the Polyak–Łojasiewicz inequality
In this work, we establish that Nesterov's accelerated gradient method, applied to $C^2$ functions satisfying the Polyak–Łojasiewicz inequality around local minimizers, achieves the optimal local linear convergence rate $\rho=\frac{\sqrt{3L+\mu}-2\sqrt{\mu}}{\sqrt{3L+\mu}}+\varepsilon$, where $\varepsilon$ is an arbitrarily small constant. Our analysis requires neither higher-order smoothness beyond $C^2$ of the objective function nor any additional geometric regularity of the submanifold of local minimizers. The key novelty lies in a two-stage argument: we first establish a coarse yet valid local linear convergence rate and then, building upon this a priori convergence guarantee, obtain a refined characterization of the linearized iteration operator, which yields the optimal rate. As a result, we only need to slightly strengthen the standard $C^{1,1}$ assumption, which is commonly required in theoretical analyses of linear convergence for first-order methods, to $C^2$ smoothness. Moreover, the same analytical framework allows us to recover, under identical conditions, the optimal local exponential convergence rate $\sqrt{\mu}$ for the continuous-time Heavy Ball dynamics. Finally, a representative numerical experiment corroborates our theoretical findings.
Read the full abstract
Numerical Analysis
A surrogate-Bayesian algorithm for scatterer shape identification from phaseless data
This work addresses the reconstruction of a scatterer's shape from phaseless far field-intensity data arising from multiple incident waves interacting with the scatterer. We formulate the reconstruction as a statistical inverse scattering problem and adopt a Bayesian inference framework, which can readily be used to compute statistical moments for quantification of uncertainties in the shape reconstruction that arise from noise in the data due to measurement constraints. The shape of the scatterer is represented by a spline-based prior, with Bayesian parameters defined at the spline's knots. To efficiently evaluate the Bayesian likelihood across thousands of sampling points, we develop the intensity property inspired neural network (IPINN) surrogate. This surrogate incorporates the Helmholtz equation in the unbounded domain, exterior to each sampled scatterer, along with the radiation condition at infinity, enabling fast and accurate simulation of the acoustic far-field intensity. Importantly, the IPINN surrogate is trained independently of the observed data and requires only a single incident wave for training. We demonstrate that this surrogate approach yields a speed-up of several orders of magnitude. The resulting IPINN-Bayesian framework offers an efficient solution for shape reconstruction in unbounded domains with multiple incident wave boundary conditions, while exactly enforcing the radiation condition. Numerical experiments confirm the efficiency and effectiveness of the proposed algorithm.
Read the full abstract
Number Theory
Beyond Endoscopy for $\mathrm{GL}(3, \mathbb{Q})$: Isolation of the residual spectrum via Poisson Summation
We extend to $\mathrm{GL}(3,\mathbb Q)$ the Poisson-summation method developed by Altuğ for $\mathrm{GL}(2,\mathbb Q)$ in Beyond Endoscopy. For a fixed prime and a family of factorizable test functions, we isolate the contribution of the trivial representation from the regular elliptic part of the trace formula and obtain an explicit expansion of \[ \mathrm{I}_{\mathrm{ell}}(f^{p,k})-\mathrm{Tr}(\mathbf{1}(f^{p,k})). \] We rewrite the finite orbital integrals in terms of an overorder zeta function attached to the monogenic cubic orders defined by the characteristic polynomials. Its identification with Yun's zeta function supplies the functional equation needed for an approximate functional equation. A periodicity theorem then makes Poisson summation in the two polynomial coefficients possible. The zero frequency is governed by Kloosterman-type sums and a Dirichlet series that admits a uniform evaluation. The residues at the origin recover the trace of the trivial representation and one third of the trace of the normalized representation induced from the trivial character of the Borel subgroup.
Read the full abstract
Optimization and Control
Theorem of Alternative for Extended Homogeneous Linear System and its Application in Conic Optimization
In this paper, we develop a new framework for constructing infeasible-start primal-dual methods for Conic Optimization. Our approach can be seen as a straightforward consequence of Gordan Theorem of Alternative. Given by the target upper bound $\epsilon > 0$ for the duality gap as the only input parameter, we form an auxiliary convex problem of minimizing barrier function with linear equality constraints. Its solution can be easily transformed to the requested output. This function can be minimized by different schemes of Unconstrained Optimization, with possible quadratic convergence in the end of the process. In our paper, we analyze the Damped Newton Method and a short-step path-following scheme. For both of them, we prove polynomial-time complexity results. Our methods are able to benefit from the hot-start opportunities. We can ensure the residual of the linear equality constraints in the primal and dual problems to be at the level of machine accuracy, independently on the accuracy parameter $\epsilon$.
Read the full abstract
Optimization and Control · Cross-listed from cs.LG
Multinoulli Extension: A Lossless Continuous Relaxation for Partition-Constrained Subset Selection
Identifying the most representative subset for a close-to-submodular objective while satisfying the predefined partition constraint is a fundamental task with numerous applications in machine learning. However, the existing distorted local-search methods are often hindered by their prohibitive query complexities and the rigid requirement for prior knowledge of difficult-to-obtain structural parameters. To overcome these limitations, we introduce a novel algorithm titled Multinoulli-SCG, which not only is parameter-free, but also can achieve the same approximation guarantees as the distorted local-search methods with significantly fewer function evaluations. More specifically, when the objective function is monotone $\alpha$-weakly DR-submodular or $(\gamma,\beta)$-weakly submodular, our Multinoulli-SCG algorithm can attain a value of $(1-e^{-\alpha})\text{OPT}-\epsilon$ or $(\frac{\gamma^{2}(1-e^{-(\beta(1-\gamma)+\gamma^2)})}{\beta(1-\gamma)+\gamma^2})\text{OPT}-\epsilon$ with only $O(1/\epsilon^{2})$ function evaluations, where OPT denotes the optimal value. The cornerstone of our Multinoulli-SCG algorithm is an innovative continuous-relaxation framework named Multinoulli Extension(ME), which can effectively convert the discrete subset selection problem subject to partition constraints into a solvable continuous maximization focused on learning the optimal multinoulli priors across the concerned partition. In sharp contrast with the well-established multi-linear extension for submodular subset selection, a notable advantage of our proposed ME is its intrinsic capacity to provide a lossless rounding scheme for any set function. Furthermore, based on our proposed ME, we also present two novel online algorithms, namely, Multinoulli-OSCG and Multinoulli-OSGA, for the unexplored online subset selection problems over partition constraints.
Read the full abstract
Number Theory
Zero-free regions inspired by work of Heath-Brown
We prove a new explicit zero-free region for the Riemann zeta-function, drawing substantially on Heath-Brown's seminal work on Linnik's constant. Using these ideas we are able to prove that $\zeta(\sigma + it)\ne 0$ whenever $t\geq 3$ and $\sigma \geq 1- 1/(4.896\log t)$.
Number Theory
The Littlewood-Richardson rule for Schur $P$-, $Q$-multiple zeta functions
The Schur $P$-, $Q$-multiple zeta functions were defined by Nakasuji and Takeda inspired by the tableau representation of Schur $P$-, $Q$-functions. While a product of two Schur $P$-functions expands as a linear combination of Schur $P$-functions, we obtain a similar expansion formula for the Schur $P$-multiple zeta functions by taking summation over the symmetric group permutating all the variables. We also introduce a expansion formula of skew Schur $Q$-multiple zeta functions by taking summation over the symmetric group. Furthermore, this skew type formula can be refined by restricting the symmetric group to its specific subgroup.
Read the full abstract
Numerical Analysis
On Sampling Methods for Inverse Biharmonic Scattering Problems in Supported Plates
We study the inverse problem of qualitatively recovering a supported cavity in a thin elastic plate governed by the flexural (biharmonic) wave equation, using far-field pattern measurements. We derive a reciprocity principle and a factorization of the far-field operator for the supported plate boundary conditions, and we analyze its range properties to justify both the linear sampling method (LSM) and the direct sampling method (DSM). Numerical experiments assess the performance of LSM and DSM under noise, a limited amount of data, multiple scattering, and variations in the Poisson's ratio. The results show that both methods robustly recover the obstacle's location and convex hull, with DSM offering improved stability and reduced computational cost.
Read the full abstract
Analysis of PDEs
Maximal inequalities and the decay of Fourier transforms of measures
It is shown that Schrödinger maximal inequalities over fractals are equivalent to the $L^2$ decay rates of Fourier transforms of fractal measures over the paraboloid. A similar connection is shown between the wave equation and cone averages. One implication is well-known and follows from the Kolmogorov-Seliverstov-Plessner method, but the other implication is nontrivial and relies on a variant of the Marstrand projection theorem. The idea of the proof is to insert an extra averaging parameter into a proof of Lucà and Rogers, which used a quantitative ergodic lemma instead of the Marstrand projection theorem. Lucà and Rogers gave a second proof of Bourgain's necessary condition $s\geq \frac{n}{2(n+1)}$ for Schrödinger solutions in $\mathbb{R}^{n+1}$ to converge pointwise a.e. back to the initial data as time tends to zero. One application of the main theorem in this article is a proof of Bourgain's necessary condition which does not use ergodic theory or number theory.
Read the full abstract
Representation Theory
Holographic operators for the tensor products of the spaces of holomorphic functions on Hermitian symmetric spaces of tube type
We consider a tensor product of two spaces of holomorphic functions on a Hermitian symmetric space of tube type. Then generically this is decomposed into a direct sum of irreducible subrepresentations. In this manuscript, we construct the intertwining operator (holographic operator) from each irreducible summand to the tensor product as an integral operator. This gives a generalization of the result by Kobayashi–Pevzner (2020).
Read the full abstract
Number Theory
The de Rham and the syntomic logarithm
We define and study an integral refinement of the inverse of the Bloch-Kato exponential map which we call the de Rham logarithm. Our main tool to analyze the de Rham logarithm is the syntomic logarithm, a certain limit construction based on the theory of filtered prismatic cohomology initiated by Antieau, Krause and Nikolaus. We use the syntomic logarithm to prove a version of the Beilinson fibre square for all quasicompact, quasiseparated derived formal schemes. We also use our techniques to prove Conjecture $C_{EP}(\bq_p(n))$ of Fontaine and Perrin-Riou for all local fields $K/\bq_p$ and to compute the correction factor $C(X,n)$ introduced by Flach and Morin in their reformulation of the Bloch-Kato Tamagawa number conjecture for the Zeta function of a smooth projective scheme $X$ over a number ring.
Read the full abstract
Complex Variables
Zeros of Laurent multiple orthogonal polynomials on the unit circle
We investigate two distinct formulations of Laurent multiple orthogonal polynomials on the unit circle, introduced in arXiv:2410.12094 and arXiv:2601.04783 respectively. For the first formulation, we prove that all zeros lie strictly within the complex open unit disk for any Angelesco or AT system. For the second formulation, we establish normality of all indices of the form $(\bm{n};\bm{n})$, $(\bm{n}+\bm{e}_j;\bm{n})$, and $(\bm{n};\bm{n}+\bm{e}_j)$ for any Angelesco or AT system, thereby enabling the full application of the Szegő mapping and Geronimus relations from arXiv:2601.04783 in the multiple orthogonality setting.
Read the full abstract
Probability
Stein's method and the modular behavior of Eulerian numbers
The Eulerian number A(n,k) counts permutations of n symbols with exactly k descents. Motivated by problems in cryptography, several authors have studied the proportion of permutations whose number of descents lies in a fixed congruence class mod b, and its convergence to 1/b. We give two proofs of explicit error bounds for this convergence, one using Stein's method for translated Poisson approximation and one using Fourier analysis. The error bound using Fourier analysis yields exponentially decaying error bounds for fixed b, which generalises the already known case b=2; however, it makes use of a special representation due to Tanny (1973). In contrast, Stein's method only yields polynomially decaying error bounds, but we hope it has potential for generalisation beyond the present setting.
Read the full abstract
Algebraic Geometry
A perturbative algorithm for flat F-manifolds associated with Landau-Ginzburg models
We develop a perturbative algorithm for constructing formal flat $F$-manifold structures on the cohomologies of dGBV (differential Gerstenhaber-Batalin-Vilkovisky) algebras associated with Landau-Ginzburg models. As an application, this approach provides a perturbative construction of formal flat $F$-manifold structures on two important objects: the Jacobian algebra of a homogeneous polynomial with an isolated singularity at the origin, and the primitive cohomology of smooth projective Calabi-Yau complete intersections.
Read the full abstract
Mathematical Physics · Cross-listed from hep-th
Symmetries of non-maximal supergravities with higher-derivative corrections
We consider hidden symmetries arising from U-duality in the dimensional reduction of non-maximal higher-derivative supergravities to three dimensions. In particular, we consider the $G_{2(2)}$ symmetry of minimal five-dimensional supergravity and the $O(d+p+1,d+1)$ symmetry of bosonic and heterotic string theory on $T^d$. Using a group theory argument, we show that the higher-derivative corrections explicitly break all hidden symmetry enhancements. As special cases, this also implies that higher-derivative corrections prevent the symmetry enhancement to $SL(3,\mathbb R)$ in pure five-dimensional gravity and $O(4,4)$ in the STU model.
Read the full abstract
Representation Theory
Grassmannian cluster subcategories and positroid varieties
A class of subcategories GP $B$ of the Grassmannian cluster category CM $C_{k, n}$ was constructed by Jensen–King–Su from certain superorders $B$ of $C_{k, n}$, which they showed are in bijection with Grassmannian positroids of type $(k, n)$. We prove that GP $B$ admits a cluster substructure of CM $C_{k, n}$, giving rise to a cluster algebra $A_{clu}$. This naturally raises questions regarding the relationship of $A_{clu}$ to $C[Gr(k, n)]$ and to the coordinate ring of the positroid variety associated to $B$. Using the cluster substructure, we show that the ice Gabriel quiver $Q^\circ_U$ of a cluster tilting object $U\in$ GP $B$, consisting of rank one modules, is a subquiver of $Q^\circ_T$ with $T$ a cluster tilting object in CM $C_{k, n}$ containing $U$ as a summand. We also deduce that $A_{clu}$ is a subalgebra of $C[Gr(k, n)]$. Moreover, applying a result of Canakci–King–Pressland on the Gabriel quiver $Q_U$ in the case where $B$ is connected (i.e., has no repeated direct summands), we deduce that $Q^\circ_U$, for arbitrary $B$, coincides with the quiver constructed by Muller-Speyer from a plabic graph whose face labels agree with the indices of the indecomposable summands of $U$. Consequently, the localised algebra $(A_{clu})_B$ is isomorphic to the cluster algebra $A_{MS}$ of Muller-Speyer. We then construct bases for certain subalgebras and for an ideal of $C[Gr(k, n)]$, and apply these to prove that $(A_{clu})_B$ is naturally isomorphic to the coordinate ring of the open positroid variety. As a consequence, we obtain a new proof of Galashin–Lam's Theorem, identifying $A_{MS}$ with the coordinate ring of the open positroid variety, which was originally conjectured by Muller-Speyer. In the connected case, we note also that Pressland gave a categorification of the cluster structure following Galashin-Lam.
Read the full abstract
Numerical Analysis
Local linear stability of dual-pairing summation-by-parts methods for nonlinear conservation laws
A recent study by Gassner et al. [J. Sci. Comput. 90:79 (2022)] demonstrates that local energy stability–that is, ensuring the asymptotic numerical growth rate does not exceed the continuous growth rate–is crucial for achieving accurate numerical simulations of nonlinear conservation laws. While nonlinear entropy stability is necessary for numerical stability (i.e., ensuring the boundedness of nonlinear numerical solutions), local energy stability is essential to prevent unresolved high-frequency wave modes from dominating the simulation. Currently, it remains an open question whether high-order numerical methods for nonlinear conservation laws can be simultaneously entropy-stable and locally energy-stable. In this work, we examine the local energy-stability properties of recently developed entropy-stable, high-order accurate dual-pairing (DP) SBP methods, as introduced by Duru et al. [arXiv: 2411.06629], for nonlinear conservation laws. Our analysis indicates that the entropy-stable volume upwind filter inherent in these methods can ensure local energy stability. This approach offers a novel numerical strategy for designing reliable high-order methods for nonlinear conservation laws that are provably entropy-stable and locally energy-stable. The theoretical findings are supported by numerical experiments involving the inviscid Burgers equation and nonlinear shallow water equations, in 1D and 2D. Furthermore, we present accurate numerical simulations of 2D barotropic shear instability, with fully developed turbulence, demonstrating the efficiency of the DP SBP method in resolving turbulent scales.
Read the full abstract
Classical Analysis and ODEs
Local Bernstein theory, and lower bounds for Lebesgue constants
Classical (or “global”) Bernstein theory establishes sharp control on entire functions of exponential type that are bounded and real-valued on the real axis. We localize some of this theory to rectangular regions $\{ x+iy: x \in I, 0 \leq y \leq y_0 \}$, showing that Bernstein-type bounds with acceptable errors can continue to hold for functions holomorphic in such rectangles, bounded and real-valued on the lower edge of the rectangle, at most exponentially large on the upper edge, and at most double exponentially large on the vertical sides. As a consequence of these bounds, we are able to localize the Erdős lower bound $\sup_{x \in [-1,1]} \lambda(x) \geq \frac{2}{\pi} \log n - O(1)$ on the Lebesgue constant of interpolation on $C([-1,1])$ to shorter intervals $I$ than $[-1,1]$, answering a question of Erdős and Turán. By using suitably weighted versions of the residue theorem, we also obtain the asymptotically sharp lower bound $\int_I \lambda(x)\ dx \geq \frac{4|I|}{\pi^2} \log n - o(\log n)$ for integral variants of such constants, answering a further question of Erdős.
Read the full abstract
Sunday 22 March
General Mathematics
Derivative Type Mapping Theorem for the Interpolative Berinde Weak Contraction in Metric Spaces with Application
Olatinwo [3] introduced contractive definitions of the derivative type, and gave a new characterization of the Banach contraction principle, and fixed point theorems for contractions defined implicitly. On the other hand Ampadu et.al [4] introduced derivative type contractions in the setting of multiplicative metric spaces. In this paper, we have obtained a fixed point theorem of the derivative type for interpolative Berinde weak contractive mappings [2] in the setting of metric spaces. An examples is given to illustrate the main result of the paper. Finally, we apply our result to the Fredholm integral equation
Read the full abstract
Analysis of PDEs
On some 1D nonlocal models with coefficients changing sign
In this work, we study one-dimensional nonlocal elliptic transmission problems with piecewise constant coefficients that may change sign across an interface. In the local setting, we recall the T-coercive structure of the problem and characterize the critical contrast case. In the nonlocal setting, we focus on a simplified configuration in which the cross-interaction coefficient vanishes. Under this assumption, we prove a weak T-coercivity result for the global fractional problem and introduce a reconstructed formulation based on an explicit interface lifting. Then, we consider a simplified finite element discretization of the reconstructed model and prove its convergence toward the classical local transmission problem as the fractional parameter $s\to 1^-$ and the mesh size $h\to 0^+$. Numerical simulations in 1D illustrate the stability and consistency of the method, and a preliminary two-dimensional extension is presented as an exploratory perspective.
Read the full abstract
Analysis of PDEs
Transition Time for Weak Singularities of the Navier-Stokes Equations
This paper constructs a rigorous mathematical framework for investigating laminar-turbulent transition induced by weak singularities of incompressible Navier-Stokes (NS) equations. By integrating the energy identity of Leray weak solutions with the singularity criterion $\left\lVert \boldsymbol{u} \right\rVert_{H_0^1(\Omega)}\to0$, a closed analytical form of the laminar-turbulent transition characteristic time is derived. The theoretical scaling $t_{\text{trans}}\sim\nu/U^2$ (equivalent to $t_{\text{trans}}\sim t_c/\text{Re}$) is verified to be consistent with classical experimental observations in shear flows. This work reveals that laminar-turbulent transition is dominated by the local regularity collapse of Leray weak solutions rather than global viscous diffusion, and provides a novel theoretical interpretation for the onset of turbulence from the perspective of NS equation weak singularities.
Read the full abstract
Probability
Toeplitz matrices from permutation displacements and the triangular kernel
Toeplitz matrices arise naturally in harmonic analysis, operator theory, and numerical analysis. In this note we investigate Toeplitz matrices whose coefficients depend on the matrix size through a scaled kernel $a_k=f(k/n)$. We show that the empirical mean of their eigenvalues converges to a weighted integral of $f$, where the weight $1-|x|$ reflects the density of diagonals in Toeplitz matrices. We then introduce a combinatorial construction associating a Toeplitz matrix to a permutation via its displacement counts. For a uniformly random permutation, the expected matrix converges to the Toeplitz matrix generated by the triangular kernel $1-|x|$. Interestingly, the triangular kernel also appears as the covariance function of the integrated Brownian motion, providing a probabilistic interpretation of the same operator. Finally, we analyze the integral operator with kernel $(1-|x-y|)$ on $[0,1]$ and determine its eigenfunctions and eigenvalues explicitly. This operator describes the limiting spectral structure associated with the averaged Toeplitz matrices arising from permutation displacements. These results highlight a natural bridge between Toeplitz matrix theory, permutation statistics, and classical integral operators.
Read the full abstract
Information Theory · Cross-listed from cond-mat.stat-mech
Breakdown of Perturbative Expansions and Exact Algebraic Absorption of Finite-Size Fluctuations in Statistical Mechanics
In statistical mechanics, evaluating finite-size macroscopic fluctuations typically relies on Edgeworth expansions. However, these perturbative methods append additive polynomial corrections that break down in the large deviation regime, yielding unphysical negative probabilities. We propose a structural resolution: rather than relying on additive polynomials, we absorb finite-size skewness using a globally stable $q$-deformed framework. By introducing a dynamic scaling law $1-q_n = O(n^{-1})$ for the nonextensivity parameter, we prove this $q$-deformed framework captures macroscopic higher-order fluctuations in independent and identically distributed (i.i.d.) systems. Specifically, this algebraic tuning absorbs third-order skewness while guaranteeing probability density nonnegativity across the entire domain. Furthermore, the $k$-th degree term of this $q$-logarithmic expansion corresponds to the $O(n^{1-k/2})$ asymptotic order of classical $(k+1)$-th moment Edgeworth corrections. This correspondence functions as a stable resummation of divergent asymptotic expansions, establishing a mathematical bridge between finite-size i.i.d. fluctuations and the Tsallis statistics governing complex systems.
Read the full abstract
Mathematical Physics · Cross-listed from quant-ph
Geometric Quantum Mechanics in a Symplectic Framework: Metric-Affine Extensions and Deformed Quantum Dynamics
We present a geometric formulation of quantum mechanics based on the symplectic structure of the projective Hilbert space. Building upon the standard Kähler framework, we introduce an extension in which the symplectic structure is allowed to couple to a metric-affine background geometry, leading to a deformation of the Hamiltonian flow on the state space. We show that, under suitable conditions, the deformed structure remains symplectic and defines a well-posed Hamiltonian system. The formulation reduces to standard Schrödinger dynamics in the limit where the geometric deformation vanishes. Explicit analytical examples are constructed to illustrate the effect of the deformation. In particular, curvature-dependent deformations lead to a rescaling of Hamiltonian flows, while torsion-induced contributions produce direction-dependent corrections. In addition, geometric phases acquire corrections determined by the deformed symplectic structure. These results provide a mathematically consistent framework for exploring geometric modifications of quantum evolution induced by background curvature and affine structure.
Read the full abstract
History and Overview of Mathematics
The winding number of a closed curve around a point
In this expository note we present an elementary direct rigorous definition and the simplest properties of the winding number. This definition is simpler than the one given in some textbooks. We show how to compute the winding number easily: using additivity or counting the (signed) intersection points. In the language of the winding number, we present an elementary formulation and proof of the low-dimensional case of the Borsuk–Ulam theorem. An English version is followed by a Russian version.
Read the full abstract
General Topology
A note on asymptotic behaviors and topological properties of two smooth real-valued functions and several graphs associated to them
This is a note on the graphs of two smooth real-valued functions in the plane with no intersection and the natural map onto the region surrounded by them with the canonical projection to the line composed, yielding its Reeb space. The Reeb space of a real-valued function on a topological space is the set of all connected components of all level sets and topologized naturally. Such spaces have been fundamental and strong tools in theory of Morse functions and its generalization and variants, since the former half of the 20th century. They are graphs for tame functions such as Morse(-Bott) functions. The author has launched and has been studying this problem since 2020s, interested in Reeb spaces of smooth or non-analytic non-proper functions. For smooth closed manifolds and nice compact spaces, topological properties and combinatorial ones on Reeb spaces have been investigated by Gelbukh, Saeki, and so on.
Read the full abstract
Classical Analysis and ODEs
Spectral synthesis on Riemannian manifolds
We study spectral synthesis for measures supported on thin subsets of compact Riemannian manifolds. We prove that under natural non-concentration conditions, such measures admit quantitative spectral synthesis, with explicit stability bounds. We show that this phenomenon depends strongly on the underlying geometry. On the torus, synthesis holds under broad assumptions, while on the sphere we establish rigidity results demonstrating that synthesis can fail in a sharp sense. As consequences, we obtain quantitative approximation results and uncertainty principles for functions with thin spectral support. These results provide a unified framework connecting spectral synthesis, geometric structure, and stability on compact manifolds.