Mathematical Physics
Papers
Fresh from arXiv, typeset properly. Highlighted words trade on the market.
Tuesday 24 March
In order to quantize systems involving second-class constraints, one should use Dirac bracket instead of Poisson bracket. Furthermore, one can specify a star product in which the term linear in $\hbar$ is proportional to the Dirac bracket. In this way an oscillator system in a deformed fermionic phase space is analyzed and the corresponding energy level and Wigner functions are evaluated according to scheme of deformation quantization. We also study the entanglement entropy induced by the deformation of the fermionic phase space.
Mathematical Physics · Cross-listed from physics.chem-ph
Exact density-functional theory as parallel ensemble variational hierarchies: from Lieb's formulation to Kohn-Sham theory
Exact density-functional theory is recast here as two parallel exact ensemble variational hierarchies: an interacting hierarchy rooted in Lieb's ensemble formulation and a noninteracting hierarchy rooted in exact noninteracting ensemble theory. In optimization terms, $N$-representability is primal feasibility, Legendre-Fenchel duality equates the primal and dual values, $v$-representability is dual attainment, and the Hohenberg-Kohn theorem gives uniqueness, modulo constants, of an attained local potential. The Kohn-Sham construction couples the interacting density-space optimality condition to a compatible noninteracting dual realization on their common $N$-representable density domain. State-class restrictions yield the Levy-Lieb and single-determinant branches, while fractional particle number and fractional occupations lead naturally to piecewise linearity, one-sided chemical potentials, Janak-type relations, and the derivative discontinuity. This organization locates the exactness of Kohn-Sham theory in the preservation of the interacting density-space optimization together with its compatible noninteracting realization, without implying a general many-body spectral interpretation of Kohn-Sham eigenvalues.
Read the full abstract
Numerical Analysis · Cross-listed from stat.ME
Kinetic Langevin Splitting Schemes for Constrained Sampling
Constrained sampling, the task of generating samples from a distribution restricted to a convex set, is an important problem in computational statistics. In this paper, we propose new unadjusted sampling algorithms obtained by applying the symmetric BAOAB and ABOBA splittings, of the kinetic Langevin dynamics, to a penalized surrogate of the constrained target. This also includes their stochastic gradient versions. Since the Hessian of the penalized surrogate is discontinuous across the boundary of the constraint set, analyses relying on a Lipschitz Hessian do not apply. We therefore develop an analysis based only on strong convexity and smoothness, proving one-step Wasserstein contraction schemes, non-asymptotic Wasserstein bounds of both schemes and complexity bounds. The resulting complexities for the stochastic gradient versions improve substantially on traditional Euler-type discretizations. Numerical experiments verify our theory, which is tested on a toy problem and Bayesian constrained regression problem. Overall, the splitting schemes demonstrate stability at step sizes several times larger than Euler-type methods, require five to seventeen times fewer gradient evaluations for a given accuracy.
Read the full abstract
Number Theory
Uniform boundedness of small points on abelian varieties over function fields
Let $k$ be a field of characteristic $0$ and let $K = k(B)$ be the function field of a geometrically irreducible projective curve $B$ over $k$. Let $A/K$ be a $g$-dimensional abelian variety with $\mathrm{Tr}_{K/k}(A) = 0$. We prove that any $K$-rational torsion point $x$ of $A$ has order uniformly bounded in terms of $g$ and the gonality of $B$. We also prove a uniform lower bound on the Néron-Tate height $\widehat{h}_{A,L}(x)$ in terms of the stable Faltings height $h_{\mathrm{Fal}}(A)$ for any $K$-rational point $x$ whose forward orbit is Zariski dense, proving the Lang-Silverman conjecture over function fields of characteristic $0$.
Read the full abstract
Optimization and Control
Piecewise M-Stationarity and Convergence of a Bounding Algorithm for Mathematical Programs with Complementarity Constraints
This study explores B-stationarity condition for mathematical programs with complementarity constraints (MPCCs) and convergence of a Bounding Algorithm we proposed in [33]. Special attention is given to the cases with biactive complementarity constraints. First, we introduce the concept of piecewise M-stationarity and prove its equivalence to B-stationarity under MPCC-GCQ. Then, this concept is employed to propose a simplified B-stationarity verifica- tion. Finally, we investigate improved convergence properties of the Bounding Algorithm in [33]. Limit points of this method are shown to be C-stationary, based on the stationarity of an approaching sequence; moreover, they are piece-wise M-stationary (and therefore B-stationary), if an additional second-order condition is satisfied by the sequence.
Read the full abstract
Dynamical Systems
Dynamics of Kahan-Hirota-Kimura maps with rational invariant fibrations
We present a simple method to study the dynamics of planar Kahan-Hirota-Kimura (KHK) maps preserving rational fibrations. Using this approach, we show that integrable KHK maps may exhibit complex dynamics, even when obtained from vector fields with trivial behavior. As an application, we study the KHK map associated with a quadratic planar vector field with an isochronous center. This map preserves the original first integral and admits the vector field as a Lie symmetry. Moreover, for a dense set of values of the integration step, it is globally periodic and exhibits all possible periods except 2. We also provide evidence of non-integrability for KHK maps associated with other quadratic vector fields possessing isochronous centers. To overcome this issue, we introduce the notion of pseudo-KHK maps, as alternative integrable discretizations for vector fields with isochronous centers. These maps are constructed to preserve the first integrals of the original vector field and to ensure that the vector field itself is a Lie symmetry of the map. The construction can be extended to isochronous centers of degree greater than two.
Read the full abstract
Combinatorics
Eulerian polynomials and the alternating sum of excedances
Tangent numbers $T_{2n-1}$, which enumerate alternating permutations of odd length, play a prominent role in the Taylor series expansion of the tangent function $\tan(x)$. In this work, we adopt a combinatorial approach based on the excedance statistic of permutations, which allows us to interpret the coefficients of the tangent series in a structural and enumerative way. Using this framework, we establish a classical identity that relates the alternating sum of excedances to the hyperbolic tangent function. This perspective highlights deep connections with Eulerian polynomials, provides a combinatorial interpretation of tangent numbers, and links these sequences to Genocchi numbers and related arithmetic properties. The approach not only unifies analytic and combinatorial viewpoints but also opens the way to generalizations to other permutation statistics and families of specialized permutations.
Read the full abstract
Combinatorics
Frugal colourings of graphs via sparse hypergraph colouring
A proper colouring of a graph $G$ is $\beta$-frugal if every colour appears at most $\beta$ times in the neighbourhood of each vertex. Let $\chi_\beta(G)$ denote the minimum number of colours required for a $\beta$-frugal colouring of $G$. For a fixed frugality $\beta$, Hind et al. showed that $\chi_\beta(G) = \mathcal{O}(\Delta(G)^{1 + 1/\beta})$, and a bipartite construction of Alon certifies the tightness of this upper bound up to a constant factor. Using a sparse hypergraph colouring theorem of Li and Postle, we show that for all fixed $\beta \ge 2$ and $t\ge 2$, if $G$ excludes either $C_{2t}$ or $K_{\beta,t}$ as a subgraph, then $\chi_\beta(G) = \mathcal{O}(\Delta(G)^{1 + 1/\beta} / (\log\Delta(G))^{1/\beta})$. Furthermore, we show that these upper bounds are tight up to a constant factor due to the existence of graphs $G$ with arbitrarily large maximum degree $\Delta$ and girth such that $\chi_\beta(G) = \Omega(\Delta^{1 + 1/\beta} / (\log\Delta)^{1/\beta})$. Finally, we show that excluding an arbitrary bipartite subgraph does not necessarily reduce the order of growth of $\chi_\beta$, as there exist $K_{4^{\beta+1},4^{\beta+1}}$-free graphs $G$ with arbitrarily large maximum degree $\Delta$ such that $\chi_\beta(G) = \Omega(\Delta^{1 + 1/\beta})$.
Read the full abstract
Combinatorics
Letters of a given type in Catalan words: A continued fraction approach
Generating functions related to Catalan words and frequencies of digits are obtained using continued fractions. This is fast, elegant, and flexible. It follows the philosophy of Philippe Flajolet from 1980.
Mathematical Physics
Interfacial instability as a trigger for dryout inception in two-phase CO2 flow
Progress in particle physic leads to increasing in detector luminosity and a consequent increasing overheating induced by Joule effect. An effective cooling strategy is the exploitation of CO\textsubscript{2} heat latency in phase-change. An additional challenge, relevant to detectors for High Energy Particles, is the consequent geometrical constrain due to the limited space avialable for the cooling system within the detector arrangement, leading to the implementation of cooling system by means of millichannels. In this context, at relative high vapour quality the liquid phase exhibits annular flow, anticipating the dryout. Dryout is a critical condition where the heat transfer coefficient dramatically drops and dangerous temperature levels can be reached, potentially leading to catastrophic consequences. Experimental evidences reveal that its behavior in two-phase annular flows differs from conventional refrigerants and the fundamental inception-mechanism is not yet understood. This study aims at investigating the key new idea whereby dryout inception is triggered by instability of the liquid-vapour interface. A mathematical model for two-phase annular flow is presented and the stability of the interface between the two fluids is studied through the linear theory. The stability analysis reduces to solving a coupled forth-order differential eigenvalue problem that is treated numerically with an in-house code based on the Chebyshev-$\tau$ method. Numerical investigations identify a critical value for the vapour quality, named $x_{dry}$, that leads to interface instability. The resulting predictions on $x_{dry}$ are confirmed by experimental data collected from two independent experimental campaigns, validating the hypothesis that dryout inception is governed by interfacial instabilities.
Read the full abstract
Functional Analysis
Banach-Stone type theorems on uniformly continuous and lipschitz continuous pseudometrics
Algebraic Topology
A hypergraph model for the cyclic BV operad and its applications
A dg cyclic operad $BVHgraphs$ of hypergraphs is introduced which comes equipped with an explicit quasi-isomorphism $BV\rightarrow BVHgraphs$ from the { cyclic} operad $BV$ of Batalin-Vilkovisky algebras. A proof that the cohomology of $BVHgraphs$ equals $BV$ occupies most of this paper. We use this model to construct an explicit quasi-isomorphism $Chains(FFM_2) \rightarrow BVHgraphs$ from the chain operad of the cyclic operad $FFM_2$ of the compactified moduli spaces of genus zero curves with marked framed points to the dg cyclic operad $BVHgraphs$ which, combined with the main result mentioned above, gives a new proof of the cyclic formality of $FFM_2$.
Read the full abstract
Operator Algebras
A tautological continuous field of Roe bimodules
We generalize the notion of a continuous field of C*-algebras to that of Hilbert C*-bimodules. Given a partially ordered set $P$ and a monotonically non-decreasing family of ternary rings of operators (TROs) assigned to the points of $P$, we equip $P$ with a certain zero-dimensional Hausdorff topology and use a certain compactification $\gamma P$ to get the base space for a continuous field of Hilbert C*-bimodules over $\gamma P$. As a motivating example, we consider the set $D(X,Y)$ of coarse equivalence classes of metrics on the disjoint union of two metric spaces, $X$ and $Y$. Each such class gives rise to a uniform Roe bimodule, a TRO linking the uniform Roe algebras of $X$ and $Y$. The resulting family of TROs is non-decreasing with respect to the natural partial order on $D(X,Y)$ and thus yields a tautological continuous field of Hilbert C*-bimodules over $\gamma D(X,Y)$.
Read the full abstract
Information Theory · Cross-listed from cs.CR
Canonical Byte-String Encoding for Finite-Ring Cryptosystems
Ring-mapping protocols need a canonical byte-to-residue layer before any algebraic encryption step can begin. This paper isolates that layer and presents the base-m length codec, a canonical map from byte strings of length less than 2^64 to lists of residues modulo m. The encoder builds on and adapts an rANS-based system proposed by Duda. Decoding is exact for all moduli satisfying the paper's parameter bounds. Because the encoding carries the byte length in its fixed-width header, decoding is also tolerant to appended valid suffix digits. The paper is accompanied by a Rust implementation of the described protocol, a Lean 4 formalization of the abstract codec with machine-checked proofs, and performance benchmarks. The Lean 4 formalization establishes fixed-width prefix inversion and payload-state bounds below 2^64, stream-level roundtrip correctness, and that every emitted symbol is a valid residue modulo m. We conclude with a complexity analysis and a discussion of practical considerations arising in real-world use of the codec.
Read the full abstract
Quantum Algebra
Simple Yetter-Drinfeld modules over Generalized Liu algebras
Let $H$ be a generalized Liu algebra over an algebraically closed field $k$ of characteristic zero. We prove that all simple Yetter-Drinfeld modules over $H$ are finite-dimensional and present an explicit classification of these modules. Moreover, we completely determine which of them admit a finite-dimensional Nichols algebra.
Read the full abstract
Representation Theory
Cambrian lattices are fractionally Calabi-Yau via 2-cluster combinatorics
Reading constructed a Cambrian lattice $C_\Gamma$ for each oriented finite type Coxeter diagram $\Gamma$. We show that the derived category of representations of $C_\Gamma$ is fractionally Calabi-Yau for any $\Gamma$, confirming a conjecture of Chapoton. This extends a result of Rognerud for Cambrian lattices of type $A$ with linear orientation, better known as Tamari lattices. If $\Gamma$ is crystallographic, then $C_\Gamma$ is given by the lattice of torsion classes of any hereditary algebra $\Lambda$ of type $\Gamma$. In this case we introduce and study a class of intervals in $C_\Gamma$ whose combinatorics matches the combinatorics of $2$-cluster tilting objects in the 2-cluster category of $\Lambda$. This allows us to compute the Calabi-Yau dimension of $C_\Gamma$.
Read the full abstract
Representation Theory
The Large Affine Hecke Category is Calabi-Yau
We show that the large affine Hecke category defines an oriented, fully extended topological field theory. More generally, we establish conditions under which ind-coherent convolution categories define such theories, analogously to known results for finite Hecke categories and $D$-modules.
Read the full abstract
Number Theory
Bohr's Last Problem Under the Entirety Hypothesis: A Survey with Initial Reductions
Bohr's last problem (1952) asks whether every ordinary Dirichlet series with nonzero Lindelöf order function $\mu$ has $\mu'(\omega_\mu{-}0)\le-1$; a negative answer would imply Lindelöf for $\zeta$. Kahane (1989) refuted this with half-plane counterexamples. We study the refinement for series with entire continuation of order $\le 1$: the Analytic Lindelöf Hypothesis that $\mu$ is piecewise linear with integer slopes. Deforming the Mellin integral to the strip boundary reduces $\mu_L$ to a residue sum over singularities of the generating function on $|x|=1$, giving $\mu_L(\sigma)=\max(0,\tfrac12-\sigma+\rho)$. For classical $L$-functions this sum is the functional-equation dual, and bounding it is Lindelöf; for self-similar or random singularities it is a Rajchman Fourier transform. We show Kahane's half-plane examples fail entirety, his entire random examples have integer slopes a.s., and Lerch-Lindelöf implies ALH. Our central construction is the Cantor Dirichlet series $L(s)=\sum\hat\nu(n)n^{-s}$, with $\nu$ the ternary Cantor measure. Its Kaczorowski–Perelli twist spectrum is empty; we prove $\mu_L(\tfrac12)\le\tfrac18$ unconditionally via a Montgomery–Vaughan argument on the product variable $(m_1+\alpha)(m_2+\alpha)$, where a Vieta identity guarantees distinct frequencies. A Cantor-weighted Hurwitz second-moment conjecture would give $\mu_L(\tfrac12)=0$.
Read the full abstract
Number Theory
Counting points in thin sets: A survey
In the 1980's Serre asked how many points of bounded height can lie in a thin set. This has motivated significant research ever since, culminating in a series of recent breakthroughs. It is a good time to take stock of the central questions that have been resolved, and also to highlight remaining open questions. First, we survey recent progress on counting points of bounded height in the four types of thin sets, according to the projective/affine and type I/type II designations. Second, we turn to questions of uniformity. Famously, in the setting of type I thin sets, the best-known upper bound for the number of points of bounded height is independent of the maximum size, say $\|F\|$, of the coefficients of the polynomials that define the thin set; such an upper bound is called uniform. A uniform upper bound in the setting of type II thin sets is not known. For type II thin sets, we explore the dependence on $\|F\|$ via several strategies, and construct counterexamples that suggest the question of uniformity is quite subtle in the setting of type II thin sets.
Read the full abstract
Combinatorics
Graph Puzzles II.1: Counterexamples to Jain's Second Unit Vector Flows Conjecture
A $3$-dimensional nowhere-zero flow on a graph $G$ is a flow where each edge is assigned a $3$-dimensional vector with unit norm (which corresponds to the points of a $2$-dimensional unit sphere $S^2$). K. Jain posed two conjectures related to this idea. First one suggests that such a flow exists for all bridgeless graphs. The second conjecture states that we can assign values $\{-4,-3,-2,-1,1,2,3,4\}$ to the points of $S^2$, such that antipodal points get opposite values, and values of any three equidistant points on great circles sum to zero. If both conjectures would be true, together they would imply Tutte's 5-flow conjecture. We show 2 counterexamples to the second conjecture, by constructing sets of points each of which additionally requires values $\{-5, 5\}$. Github: https://github.com/gexahedron/unit-vector-flows
Read the full abstract
Metric Geometry
Geometry of Geometric Data Set II: Pyramid
The observable distance $d_{\mathrm{conc}}$ based on measure concentration and the box distance $\Box$ based on collapsing theory are extended to geometric data sets introduced by Hanika–Schneider–Stumme. On the set $\mathcal{D}$ of isomorphism classes of geometric data sets, $d_{\mathrm{conc}}$ is non-separable and $\Box$ is complete and non-separable. We introduce the class $\mathcal{D}/\mathcal{L}$ of $\mathcal{L}$-compact geometric data sets in $\mathcal{D}$, for a monoidal subfamily $\mathcal{L}$ of 1-Lipschitz functions $\operatorname{Lip}_1(\mathbb{R})$, and prove its $\Box$-completeness and separability. We then construct a natural compactification of $(\mathcal{D}/\mathcal{L}, d_{\mathrm{conc}})$ by means of \emph{$\mathcal{L}$-pyramids} when $\mathcal{L}$ contains the clipping family. We further prove a complete limit formula for the observable diameter of $\operatorname{Lip}_1(\mathbb{R})$-pyramids, and show that applying our construction to Hanika–Schneider–Stumme's embedding is compatible with the compactification and preserves the polynomial-time computability of the observable diameter.
Read the full abstract
Commutative Algebra
A Characterization of Edge Ideals with $reg(R/I(G)) = 3$
Let $G$ be a graph and $I(G)$ its edge ideal. In this paper, we give a complete characterization of the graphs $G$ for which $\reg(R/I(G)) = 3$.
Metric Geometry
Geometry of Geometric Data Set I
Hanika, Schneider, and Stumme introduced geometric data set as a generalization of metric measure space for the computation of the observable diameter, and extended the observable distance between metric measure spaces to that between geometric data sets. In this paper, we begin by proving the non-separability of the observable distance between geometric data sets. We then extend the box distance between mm-spaces to that between geometric data sets and prove its completeness and non-separability.
Read the full abstract
Dynamical Systems · Cross-listed from eess.SY
Time-Delay Systems with Discrete and Distributed delays: Discontinuous Initial Conditions and Reachability Sets
Time-invariant finite-dimensional systems, under reasonable continuity assumptions, exhibit the property that if solutions exist for all future times, the set of vectors reachable from a bounded set of initial conditions over bounded time intervals is also bounded. This property can be summarized as follows: forward completeness implies bounded reachability sets. By contrast, this property does not necessarily hold for infinite-dimensional systems in general, and time-delay systems in particular. Sufficient conditions for this property to hold that can be directly tested on the function defining the system dynamics are only known in the case of systems with pointwise (or discrete) delays. This paper develops novel sufficient conditions for the boundedness of the reachability sets of time-delay systems involving mixed pointwise and distributed delays. Broad classes of systems satisfying these conditions are identified.
Read the full abstract
Number Theory
Branches of Markoff $m$-triples with two $k$-Fibonacci components
We study infinite paths of Markoff $m$-triples, that is, solutions to the generalised Markoff equation \[ x^2+y^2+z^2=3xyz+m, \] with $m>0$, with at least two $k$-Fibonacci components. First, we obtain a complete classification of Markoff $m$-triples whose last two entries are $k$-Fibonacci numbers and that are not roots of any Markoff trees. We then prove that every such infinite path is contained in a branch, starting at a triple of the form \[ \left(\frac{F_k(4r)}{3F_k(2r)},\,F_k(\ell+2r),\,F_k(\ell+4r)\right), \] where $r$ is an odd integer, $\ell\in\{1,2,\ldots, 2r\}$ and $3\nmid k$. These branches are distributed among exactly $2r$ distinct trees.
Read the full abstract
Optimization and Control
Exponential Turnpike Theorems for Nonlinear Deterministic Meanfield Optimal Control Problems
In this article, we establish exponential turnpike theorems for a class of nonlinear deterministic meanfield optimal control problems. We carry out our analysis simultaneously in the so-called Lagrangian and Eulerian frameworks. In the Lagrangian setting, the problem is lifted to a Hilbert space of random variables, and we prove an exponential turnpike theorem by combining first-order optimality conditions, a second-order expansion of the lifted Hamiltonian, and an operator Riccati diagonalization argument. In the Eulerian setting, we derive intrinsic KKT conditions for the static constrained problem, and show how the Eulerian second-order hypotheses split into a horizontal part, transferred by unitary conjugation to the lifted space, and a vertical part which reduces to uniform pointwise stabilizability and detectability conditions on multiplication operators. This yields an exponential turnpike theorem in the Wasserstein space for optimal Pontryagin triples. Along the way, we %provide explicit the link between Wasserstein Hessians and their Lagrangian lifts, and provide several remarks clarifying the role of occupation measures, local Eulerian minimizers, and control constraints in our results.
Read the full abstract
Statistics Theory
A Theory of Nonparametric Covariance Function Estimation for Discretely Observed Data
We study nonparametric covariance function estimation for functional data observed with noise at discrete locations on a $d$-dimensional domain. Estimating the covariance function from discretely observed data is a challenging nonparametric problem, particularly in multidimensional settings, since the covariance function is defined on a product domain and thus suffers from the curse of dimensionality. This motivates the use of adaptive estimators, such as deep learning estimators. However, existing theoretical results are largely limited to estimators with explicit analytic representations, and the properties of general learning-based estimators remain poorly understood. We establish an oracle inequality for a broad class of learning-based estimators that applies to both sparse and dense observation regimes in a unified manner, and derive convergence rates for deep learning estimators over several classes of covariance functions. The resulting rates suggest that structural adaptation can mitigate the curse of dimensionality, similarly to classical nonparametric regression. We further compare the convergence rates of learning-based estimators with several existing procedures. For a one-dimensional smoothness class, deep learning estimators are suboptimal, whereas local linear smoothing estimators achieve a faster rate. For a structured function class, however, deep learning estimators attain the minimax rate up to polylogarithmic factors, whereas local linear smoothing estimators are suboptimal. These results reveal a distinctive adaptivity-variance trade-off in covariance function estimation.
Read the full abstract
Optimization and Control
Pruning for efficient deterministic global optimization over trained ReLU neural networks
Neural networks are increasingly used as surrogates in optimization problems to replace computationally expensive models. However, embedding ReLU neural networks in mathematical programs introduces significant computational challenges, particularly for large networks. This work investigates how pruning techniques can accelerate the solution of optimization problems with embedded neural networks, focusing on the mechanisms underlying the computational gains. We show that, besides problem size reduction, both unstructured and structured pruning tightens preactivation bounds. We conduct a comprehensive empirical study spanning three morphologies and four complexity levels, comparing magnitude-based weight and node pruning with structured perspective regularization (SPR). We test on both an illustrative test function and a chemical process flowsheet surrogate, using a commercial and an open-source solver. Pruning consistently improves the accuracy-runtime trade-off, with speedups spanning one to four orders of magnitude depending on the complexity of the unpruned network. The gains are attributed to three factors: (i) reduction in problem size, (ii) decrease in the number of integer variables, and (iii) tightening of big-M bounds. Weight pruning and SPR occupy most of the accuracy-runtime Pareto frontier, the latter enabling faster convergence at the mildest sparsity considered. The mechanisms transfer from the test function to the engineering case study, although the preferred technique and sparsity level might vary with the case study, and should be selected as part of surrogate development.
Read the full abstract
Analysis of PDEs
Kruskal-style algorithm for cubic Schrödinger equation molecule reduction
We are interested in the molecule reduction algorithm introduced by Deng and Hani. They use this algorithm to establish a rigidity theorem, which plays a central role in the kinetic-time derivation of the wave equation associated with the cubic Schrödinger equation. In the present article, we show that this algorithm is a graph traversal algorithm of Kruskal type, and we prove that it constructs a Kruskal spanning tree of the input molecule. This reveals the origin of the main tool for deriving kinetic equations which has also been used for the long time derivation of the Boltzmann equation.
Read the full abstract
Analysis of PDEs
Nonlinear Dynamics and Performance Optimization Based on Primary Resonance of an Electromechanically Coupled Magnetic Levitation Energy Harvester
This research paper explores the potential of nonlinear magnetic levitation systems for energy harvesting by developing a modified system that incorporates a more realistic energy harvesting circuit, enabling a better representation of practical operating conditions. Methodologically, approximate solutions for the system dynamics were obtained using the method of multiple scales, complemented by numerical simulations to capture parameter variations visualized through phase planes and parameter variation plots. The results demonstrate that by adjusting capacitance to induce internal and primary resonances, an extended detuning formulation (utilizing parameters sigma3 and sigma4) is innovatively introduced to capture the coupled dynamic interaction between the harvesting circuit and the mechanical system under diverse conditions. Periodic variations in circuit charge and intermediate magnet dis placement were thoroughly analyzed. Comparisons with legacy models demonstrate that the proposed coupling mechanism effectively suppresses undesirable nonlinear behaviors, such as chaos and multi-stability, resulting in a more stable and predictable energy harvesting process. Ultimately, a critical trade-off between energy harvesting efficiency and dynamical stability is identified, providing a valuable new design perspective for practical energy harvesting systems.