Peer Revenue Play credits. Real papers.

Papers

Fresh from arXiv, typeset properly. Highlighted words trade on the market.

Mathematics

math Watch Mathematics (sign in to use)

Thursday 16 April

Numerical Analysis

Energy norm error estimates of a hybrid high-order method for the linear parabolic integro-differential equations on general meshes

We are concerned in designing a suitable numerical scheme based on the equal-order hybrid high-order (HHO) method for the linear parabolic integro-differential equations. The spatial discretization is made using the equal-order HHO method and subsequently we perform the stability analysis of the corresponding semi-discrete scheme. The convergence results are presented in suitably defined Bochner norms for the semi-discrete problem. Then a second-order temporal discretization is implemented on the time domain using a Crank-Nicolson scheme where the memory term is approximated using a composite trapezoidal quadrature rule. The stability of the resultant complete discrete schemes are analyzed followed by derivation of the error estimates of order $\mathcal{O}(\tau^{2}+h^{k+1})$, $k\ge 0$ is the degree of local polynomial approximation, in discrete $l^{2}(0,T;H^{1}(\Omega))$ and $l^{\infty}(0,T;H^{1}(\Omega))$ like norms. Numerical illustrations are performed on some polygonal meshes validating the theoretical estimates.
Read the full abstract

Probability

Renormalised two-point functions of CLE$_4$ gaskets

We first consider nested CLE$_4$ in a simply-connected domain and compute some exact renormalised probabilities: the probability that two points belong to the same CLE$_4$ gasket and the probability that two points belong to the outermost CLE$_4$ gasket. The resulting conformally covariant formulas have a non-trivial modular dependence, expressed explicitly in terms of Jacobi theta functions. We are guided by the conformal field theory of the Ashkin-Teller (AT) model, but our proofs are purely probabilistic using Brownian loop soups, gauge-twisted Gaussian free fields (GFFs) and the level line geometry of the 2D continuum GFF. More generally, we also calculate renormalised probabilities that two points belong to CLE$_4$ gaskets sampled in alternation with certain two-valued sets of the Gaussian free field. These quantities correspond to the two-point function of the conjectured scaling limit of the AT single spins on the critical line. At the decoupling point, our results recover the Ising model correlations; they also suggest a CLE$_4$-based continuum FK representation of the AT single-spin fields along a whole segment of the critical line.
Read the full abstract

Numerical Analysis

A post-processed higher-order multiscale method for nondivergence-form elliptic equations

We study the finite element approximation of linear second-order elliptic partial differential equations in nondivergence form with highly heterogeneous diffusion and drift coefficients. A generalized Cordes condition is imposed to guarantee that a suitably renormalized version of the nondivergence-form differential operator is near the Laplacian. Based on a stabilized symmetric formulation for the gradient that enables the use of $H^1$-conforming approximation spaces, we construct a multiscale method following the methodology of the localized orthogonal decomposition with coarse basis functions tailored to the heterogeneous coefficients. We employ a novel post-processing strategy to obtain higher-order convergence rates, overcoming previous limitations imposed by the low regularity of the load functional. Numerical experiments demonstrate the performance of the method.
Read the full abstract

Category Theory

Invertibility and parity in symmetric monoidal categories

We introduce a notion of parity for formal morphisms between invertible objects and use it to prove a corresponding coherence theorem. Parity is conceptually similar to the sign of underlying permutations, but not defined as such. To give complete details, this work includes a thorough treatment of the free permutative category on an invertible generator, its skeletal model, known as the super integers, and an equivalence between them classified by the pair of integers $\pm$1. Our approach is organized and clarified as an application of 2-monadic algebra, particularly the concept of flexibility and the Lack model structure. The final section contains a number of examples applying the main results.
Read the full abstract

Combinatorics

The 1-2-3 conjecture for polygonal tilings

The 1-2-3 conjecture has been solved positively in 2024 for finite graphs and by extension for infinite graphs which are locally finite. The solution is non-constructive, and finding explicit solutions for large (or infinite) graphs is very hard. By exploiting the extra structure present in many non-periodic tilings, we find explicit solutions for the Chair (all three vertex placements), Non-Pinwheel, Pinwheel, Half-hex, Ammann-Beenker (two versions), Penrose Rhomb, and the Domino tilings. We prove that for any fully periodic tiling of the plane there exists a fully periodic solution, and provide an algorithm for finding such a solution. We give solutions for the fully periodic square, triangle and hexagonal lattices.
Read the full abstract

Numerical Analysis

On the exponential rate of the condition number of Fourier submatrices and Vandermonde matrices

The discrete Fourier transform matrix is one of the most important matrices in linear algebra, and submatrices of it arise in a variety of applications. Though the discrete Fourier transform matrix is unitary, its submatrices can be exponentially ill-conditioned, an obstacle to accurate computation. This work resolves the exact rate of the exponential ill-conditioning for square submatrices with contiguous rows and columns. As a consequence, we obtain a tight upper bound of $2 G/\pi$ on the exponential rate for all submatrices with contiguous columns, or, equivalently, all Vandermonde submatrices with distinct support points, where $G$ is Catalan's constant. These results follow from a more general analysis of Vandermonde and Vandermonde-like matrices for which exact estimates for exponential ill-conditioning are developed in terms of logarithmic potentials.
Read the full abstract

Spectral Theory

Spectral Effects Of Heavy-Tailed Vertex Noise In Geometric Graphs

We characterize which local matrix structures saturate Weyl's eigenvalue perturbation bound for graph Laplacians under geometrically constrained vertex displacements. Geometric graphs with heavy-tailed vertex noise arise across sensor networks, biological imaging, and spatial omics, yet tractable predictions for noise-induced spectral error remain limited. We study geometric graphs abstracted from biophysical systems, incorporating clearance, planarity, and identifiability constraints that govern physically realizable embeddings. Within this constrained setting, we identify witness motifs, small subgraphs in maximally noise-sensitive geometric configurations, that dominate weighted-degree and graph Laplacian spectral perturbations under tempered power-law vertex displacements. This motif decomposition reduces global spectral sensitivity to a finite catalog of local extremal structures and identifies configurations that attain Weyl-tight bounds. We then lift these constrained-graph results to general straight-line embedded graphs in arbitrary dimension via local repair operations producing a constrained surrogate graph that preserves sensitivity-relevant structure. To quantify noise-induced spectral variation in both strong-oracle and weak-oracle regimes, we introduce stochastic co-spectrality (SC) and the stochastic spectral separation index (S3I), which characterize when observed spectral distances are noise-driven and when noise parameters are separable. Together, these results provide a principled pathway from local geometric noise to global spectral error in graph Laplacian matrices, enabling estimation of spectral fragility from graph structure without exhaustive eigenvalue computation or restrictive distributional assumptions beyond moment bounds.
Read the full abstract

All authors Ben Cardoen, Jeremy Budd, Enrico Amico, Ghassan Hamarneh, Fabian Spill

Numerical Analysis

Asymptotic gauge-invariant Hybrid High-Order method for magnetic Schrödinger equations

We introduce a Hybrid High-Order (HHO) method for the Schrödinger equation in the presence of a magnetic vector potential. In quantum mechanics, physical observables are invariant under continuous gauge transformations, which must be kept at the discrete level to avoid unphysical artifacts. To address this, we construct a discrete covariant gradient operator on arbitrary polyhedral meshes. We prove that the resulting discrete bilinear form guarantees gauge covariance asymptotically at the discrete level. The resulting scheme achieves optimal convergence rates and preserves a discrete Garding inequality, guaranteeing a stable ground state. The theoretical properties of the scheme are corroborated by numerical experiments, including the computation of the Fock-Darwin fundamental energy and replicating the Aharonov-Bohm effect.
Read the full abstract

Geometric Topology

Infinite-type Schottky groups and group actions on infinite-type surfaces

We introduce a certain class of purely loxodromic free Kleinian groups, called infinite-type Schottky groups, which are defined by a suitable collection of simple loops on the Riemann sphere, in a similar way as in the case of Schottky groups of finite rank. An infinite-type Schottky group $\Gamma$ admits a $\Gamma$-invariant connected component $\Omega_{\Gamma}$ of its region of discontinuity $\Omega(\Gamma)$, such that every other connected component of $\Omega(\Gamma) \setminus \Omega_{\Gamma}$ is a topological disc with trivial $\Gamma$-stabilizer, and $\Omega_{\Gamma}/\Gamma$ is an infinite-type Riemann surface without planar ends. Let $F$ be a torsion-free purely hyperbolic Fuchsian group of the first kind such that $\Sigma_{F}={\mathbb H}^{2}/F$ is an infinite-type Riemann surface with no planar ends. Then there exists an infinite-type Schottky group $\Gamma$ such that $\Sigma_{F}$ is isomorphic to $\Omega_{\Gamma}/F$ (retrosection theorem). If $G < {\rm Aut}(\Sigma_{F})$ acts freely and $\Sigma_{F}/G$ is of finite-type, then we observe that (i) the existence of some infinite Schottky $\Gamma$ such that $\Omega_{\Gamma}/\Gamma$ and $\Sigma_{F}$ are conformally equivalent and for which $G$ lifts to a group of automorphisms of $\Omega_{\Gamma}$, is equivalent to (ii) the existence of a $G$-invariant collection ${\mathcal F}$ of pairwise disjoint essential simple loops on $\Sigma_{F}$ such that each connected component of $\Sigma_{F} \setminus {\mathcal F}$ is a finite planar surface. This generalizes the situation for the case of closed Riemann surfaces and Schottky groups of finite rank.
Read the full abstract

Category Theory

Presenting Neural Networks via Coherent Functors

This paper develops a methodology for representing machine learning models as models of formal theories, grounded in the perspective that machine learning models are a form of database and that databases are models of theories in coherent logic. Two intermediate results support this approach: any functorial database schema has an associated $\kappa$-coherent theory whose models coincide with its instances, and data may be hard-coded into a coherent category such that any model of the resulting theory necessarily contains it. These tools are used to show that any dense feed-forward neural network architecture over the floating point numbers may be presented as a coherent category $G$ whose $Set$-models are the networks of that architecture, with inference arising as the precomposition functor $Coh(\iota, Set)$ along a coherent functor $\iota : RSpan(a_0, a_n) \rightarrow G$. This representation is extended to networks with weight and bias fixing and tying, encompassing sparse and convolutional architectures, via a 2-coequaliser construction in $Coh_\sim$. Taken together, these results recast neural network inference as an extension problem in the 2-category $Coh_\sim$ of coherent categories, supporting the interpretation of a network architecture as a formal hypothesis about the structure of data and of model training as a lifting of a dataset into a more constrained theory.
Read the full abstract

All authors Matthew Pugh, Jo Grundy, Corina Cirstea, Nick Harris

Algebraic Geometry

Tangent bundle of punctual Hilbert scheme and distinguishing products of varieties

We describe the indecomposable components of the tangent bundle of the punctual Hilbert scheme of a smooth projective surface. As an application, we prove a recent conjecture about classification of products of punctual Hilbert schemes of smooth projective surfaces. We also determine when two products of symmetric powers of a smooth variety can be isomorphic. As a key step in our proof, we give a new characterization of abelian varieties, which states that in dimension $\geq 2$, a smooth complex projective variety whose tangent bundle is trivial upto a line bundle twist is an abelian variety.
Read the full abstract

Functional Analysis

Tilings and coverings by balls in $\ell_1$

A famous result of Klee from 1981 is that the Banach space $\ell_1(\kappa)$ admits a disjoint tiling by balls of radius $1$, for all cardinals $\kappa$ with $\kappa^\omega =\kappa$. Klee also observed that the smallest cardinal in which such a tiling might exist is $\kappa= 2^{\aleph_0}$, leaving open the question whether, for $\kappa< 2^{\aleph_0}$, $\ell_1(\kappa)$ might admit a tiling by balls at all. Our main result answers this question in the negative, proving in particular that $\ell_1$ does not admit any tiling by balls. We also give a companion result about star-$n$-finite coverings by balls of $\ell_1(\kappa)$ and we give a construction of a star-finite tiling of $\mathcal{X} \oplus_\infty c_{00}$, for each space $\mathcal{X}$ whose dimension is at most countable.
Read the full abstract

All authors Carlo Alberto De Bernardi, Tommaso Russo, Şeyda Sezgek, Jacopo Somaglia

Geometric Topology

Diffeomorphism groups and gauge theory for families

This article provides a survey of gauge theory for families, with a particular focus on its applications to diffeomorphism groups of $4$-manifolds that were developed during the period 2021–2025.

2604.15087 · 16 Apr · 27 pages. To appear in Sugaku Expositions. This article is an English translation of a Japanese survey article. It is also a slightly expanded version of the proceedings article for the 2025 Georgia International Topology Conference entitled "Diffeomorphism groups of 4-manifolds and gauge theory for families."

Information Theory

Codes with Large Minimum Distance in Product Codes: Explicit Constructions and Bounds

Products of MDS codes are of major practical importance; for a recent example, they are used in Data Availability Sampling (DAS) in blockchain networks such as Celestia and as part of the Ethereum roadmap. This motivates us to consider subcodes of such codes with the goal of obtaining a larger minimum distance. In this paper, we present explicit constructions of subcodes of Reed–Solomon product codes, along with bounds on their minimum distance. In particular, they achieve an optimal or near-optimal dimension–distance tradeoff. For component codes of dimension $r$, our construction requires a field whose size is bounded linearly by the overall product code length, and attains the maximum possible minimum distance for subcode dimensions $r^2-1$, $r^2-2$, and all dimensions at most $2r-1$. Furthermore, we establish a new upper bound on the minimum distance of subcodes of the product of two codes with identical parameters.
Read the full abstract

Representation Theory

On local integrability results for $p$-adic reductive groups

We present a short proof, based on local character expansions, of the celebrated theorem of Harish-Chandra about local integrability of complex characters of $p$-adic reductive groups. The proof gives an algebraic incarnation of the local integrability that works for some coefficients different from $\mathbb{C}$, verifies local integrability in cases that appear not covered in the literature, and shows that a character is locally-$L^{\alpha}$ for some specified $\alpha>1$ as in [GGH23].
Read the full abstract

Optimization and Control

Duality attainment and strict feasibility of the generalized moment problem and its relaxations

The generalized moment problem (GMP) is an infinite dimensional linear problem over the cone of finite nonnegative Borel measures. When a GMP instance involves finitely many polynomial moment constraints, moment/sum-of-squares hierarchies provide a sequence of bounds converging to the optimal value. We consider GMP instances with measures supported over a compact basic semialgebraic set $X$. We study the case when $X$ has nonempty interior, and the case when $X$ is the vanishing set of prescribed polynomials forming a Gröbner basis of the ideal they generate, which we assume is real radical. Under a relative interior assumption, we show attainment of the infinite dimensional dual problem, and attainment of each associated finite dimensional sum-of-squares strengthening. For the latter we present two disjoint proofs. The first is obtained by adapting results regarding the closedness of quadratic modules, and the second builds on Csiszár's work on exponential density constructions to find a strictly feasible measure. Finally, we discuss the special case where $X$ is the product of spheres, and applications of our results to GMP instances arising from tensor optimization and quantum information theory.
Read the full abstract

Geometric Topology

Gauge theory for families

This article surveys gauge theory for families and its applications to the comparison between the diffeomorphism group and the homeomorphism group of $4$-manifolds, up to 2021.

2604.15071 · 16 Apr · 28 pages, to appear in Sugaku Expositions. This is an English translation of a Japanese survey article originally written in 2021, with only minimal modifications. Developments during the period 2021–2025 are covered in a separate survey article entitled "Diffeomorphism groups and gauge theory for families"

Statistics Theory

On general weighted cumulative residual (past) extropy of extreme order statistics

Weighted extropy has recently emerged as a flexible information measure for quantifying uncertainty, with particular relevance to order statistics. In this paper, we introduce and study a weighted cumulative analogue of extropy, extending the framework of weighted cumulative residual and cumulative past entropies to extreme order statistics. Specifically, we define the general weighted cumulative residual extropy (GWCREx) for the smallest order statistic and the general weighted cumulative past extropy (GWCPEx) for the largest order statistic, along with their dynamic versions. We show that these weighted measures and their dynamic counterparts uniquely characterize the underlying distribution. Moreover, we establish new characterization results for two widely used reliability models: the generalized Pareto distribution and the power distribution. The proposed framework provides a unified information-theoretic tool for analysing extreme lifetimes in reliability engineering and survival analysis.
Read the full abstract

Algebraic Geometry

Some lower bounds for the maximal number of A-singularities in algebraic surfaces. II

Algebraic surfaces in the complex projective space with a large number of A-type singularities have been presented in a recent paper. We extend the construction in order to obtain new lower bounds for the maximal number of A singularities in degree d complex surfaces.

Representation Theory

Distinguished Simple Supercuspidal Representations of $p$-adic $\text{GL}(n)$

Let $\text{E}/\text{F}$ be a quadratic extension of non-archimedean local fields with odd residual characteristic. In this paper, we give equivalent conditions for a simple supercuspidal representation $\pi$ of $\text{GL}(n, \text{E})$ to be distinguished by $\text{GL}(n, \text{F})$ in terms of its defining maximal simple type and twisted gamma factors. Furthermore, we prove that the collection of twisted gamma factors evaluated at $\frac{1}{2}$ between $\pi$ and all unitary, tamely ramified quasi-characters of $\text{E}^{\times}$ that are trivial on $\text{F}^{\times}$ is sufficient to determine whether $\pi$ is distinguished by $\text{GL}(n, \text{F})$.
Read the full abstract

Analysis of PDEs

On dispersive estimates for one-dimensional Klein-Gordon equations

We improve previous results on dispersive decay for 1D Klein- Gordon equation. We develop a novel approach, which allows us to establish the decay in more strong norms and weaken the assumption on the potential.

Number Theory

On the Number of Prime Factors of Consecutive Integers

We prove that there are infinitely many $n$ such that $\omega(n+k) \ll \log k$ for all integers $k \ge 2$. This improves on a result of Tao and Teräväinen (2025), who have $O(k)$ in place of $O(\log k)$. As corollaries, we make progress on a number of questions posed by Erdős. The proof is based on a quantitative refinement of the Tao-Teräväinen probabilistic argument, combining a refined sieve construction with upper bounds for high moments and the resulting tail estimates. Moreover, we formulate a conjecture on integers with many prime factors based on Cramér-type random models. Assuming this conjecture, the main bound is essentially sharp.
Read the full abstract

Combinatorics

A Hypergraph Container Method for Spread SAT: Approximation and Speedup

We develop a hypergraph container method for the Boolean Satisfiability Problem (SAT) via the newly developed container results [Campos and Samotij (2026)]. This provides an explicit connection between the extent of spread of clauses and the efficiency of container-based algorithms. Informally, the more evenly the clauses are distributed, the stronger the shrinking effect of the containers, which leads to faster algorithms for SAT. To quantify the extent of spread, we use a weighted point of view, in which a clause of size $s$ receives weight $p^s$ for some $0<p\le 1$.In this way, we introduce the notion of $(\lambda,p)_k$-structure for SAT formulas, where $\lambda$ is the spread parameter and $k$ is the maximum size of clauses. By the almost-independence property of containers, we prove that for formulas with $(\lambda,p)_k$-structures, one can distinguish between “unsatisfiable formulas” and “formulas satisfying at least a $(1-\delta)$-fraction of clauses” in sub-exponential time. This shows that sufficiently spread formulas are not worst-case instances for Gap-ETH. Moreover, we show that the speedup is directly controlled by the spread parameter $\lambda$, yielding faster exact algorithms for SAT formulas containing a $(\lambda,p)_k$-structure. This result extends previous work [Zamir (STOC 2023)] to the non-uniform case.
Read the full abstract

All authors Zicheng Han, Yupeng Lin, Jie Ma, Xiande Zhang

Complex Variables

On Caratheodory prime ends extension for unclosed Orlicz-Sobolev classes

We study problems related to continuous boundary extension of mappings of Orlicz-Sobolev classes in terms of prime ends. The results we obtain concern the case when the mappings are open, discrete, but not closed (not preserving the boundary of a domain). These results generalize the well-known results of Caratheodory on boundary extension of conformal mappings.
Read the full abstract

Operator Algebras

Noncommutative Geometry, Spectral Asymptotics, and Semiclassical Analysis

Semiclassical analysis and noncommutative geometry are two pillars of quantum theory. It is only recently that bridges between them have been emerging. In this monograph, we combine various techniques from functional analysis and spectral theory to obtain semiclassical Weyl laws and extensions of Connes' integration formula for a large class of noncommutative manifolds (i.e., spectral triples). These results generalize and simplify recent results of McDonald-Sukochev-Zanin. In particular, all the regularity assumptions and restrictions on dimension there are removed in our approach. Moreover, the Tauberian condition used by McDonald-Sukochev-Zanin is replaced by a weaker spectral theoretic condition, called Condition (W). That condition holds in fairly greater generality and significantly opens the scope of applicability of the main results. We also give Tauberian conditions that imply Condition (W). These Tauberian conditions are easier to check in practice than the Tauberian condition of McDonald-Sukochev-Zanin and are satisfied in numerous examples. The need for these conditions was highlighted by Alain Connes in an online seminar. The main results of this paper are illustrated by semiclassical Weyl laws and integration formulas in the settings of closed Riemannian manifolds and quantum tori. In the former settings we recover well-known semiclassical Weyl laws, as well as Weyl laws for Steklov eigenvalues. The only novelty is obtaining them from old results of Minakshisundaram-Pleijel on heat kernel asymptotics. In the setting of quantum tori, the semiclassical Weyl laws provide a positive answer to a conjecture of Edward McDonald and the author. The integration formulas are refinements of several previous analogues of Connes' integration formula for quantum tori.
Read the full abstract

Probability

A counter-example to persistence in generalised preferential attachment trees

Consider a generalised preferential attachment tree with attachment function $f$, that is a random tree, where at each time-step a node connects to an existing node $v$ with probability proportional to $f(\mathrm{deg}(v))$, where $\mathrm{deg}(v)$ denotes the degree of the node in the existing tree. We provide a counter-example to a conjecture of the author asserting that under the assumption $\sum_{j=1}^{\infty} \frac{1}{f(j)^2} < \infty$ there is a persistent hub in the model, that is, a single node that has the maximal degree for all but finitely many time-steps. The counter-example is a minor modification of a related counter-example due to Galganov and Ilienko.
Read the full abstract

Combinatorics

Gorenstein Simplices and Even Binary Self-Complementary Codes

It is known that if a Gorenstein simplex of dimension \(d\) and degree \(s\) is not a lattice pyramid, then \(d \leq 2s-1\). In this paper, we study the extremal case \(d=2s-1\). More precisely, we characterize Gorenstein simplices of dimension \(2s-1\) and degree \(s\) which are not lattice pyramids in terms of even binary self-complementary codes. As an application, combining this characterization with existing classification results on reflexive simplices, we classify Gorenstein simplices of degree \(3\) and \(4\). Equivalently, we classify polarized \(d\)-dimensional Gorenstein fake weighted projective spaces \((X,L)\) satisfying $-K_X=(d-2)L$ or $-K_X=(d-3)L$, where \(-K_X\) is the anticanonical divisor of \(X\) and \(L\) is a Cartier divisor on \(X\).
Read the full abstract

Optimization and Control · Cross-listed from eess.SY

On-Line Policy Iteration with Trajectory-Driven Policy Generation

We consider deterministic finite-horizon optimal control problems with a fixed initial state. We introduce an on-line policy iteration method, which, starting from a given policy, however obtained, generates a sequence of cost-improving policies and corresponding trajectories. Each policy produces a trajectory, which is used in turn to generate data for training the next policy. The method is motivated by problems that are repeatedly solved starting from the same initial state, including discrete optimization and path planning for repetitive tasks. For such problems, the method is fast enough to be used on-line. Under a natural consistency condition, we show that the sequence of costs of the generated policies is monotonically improving for the given initial state (but not necessarily for other states). We illustrate our results with computational studies from combinatorial optimization and 3-dimensional path planning for drones and a robot arm in the presence of obstacles. We also discuss briefly a stochastic counterpart of our algorithm. Our proposed framework combines elements of rollout and policy iteration with flexible trajectory-based policy representations, and applies to problems involving a single as well as multiple decision makers. It also provides a principled way to train neural network-based policies using trajectory data, while preserving monotonic cost improvement.
Read the full abstract

All authors Yuchao Li, Fei Chen, Yingke Li, Chuchu Fan, Dimitri Bertsekas

Analysis of PDEs

Singular traveling waves for the Euler-Poisson system

We consider the Euler-Poisson system for ions where the electrons are given by a Maxwell-Boltzmann distribution, and we investigate the existence of one-dimensional periodic traveling waves. More precisely, we first establish the existence of a smooth global branch of bifurcation emanating from a constant equilibrium. We then construct a singular traveling wave emerging as the limiting profile at the end of the global curve of bifurcation. Our analysis accommodates a wide class of pressure laws and provides a comprehensive characterization of both smooth and singular traveling waves. A central difficulty in this model arises from the exponential nonlinearity, induced by the nonlocal Poisson-Boltzmann equation, which prevents any explicit representation of the electron field in terms of the ion density. This poses significant obstacles compared to previous studies on related models, where such explicit formulas were crucial for global bifurcation arguments.
Read the full abstract

All authors Billel Guelmame, Taoufik Hmidi, Haroune Houamed, Frédéric Rousset

Number Theory · Cross-listed from quant-ph

Recurrence Time for Finite Quantum Systems

We study the time it takes for all states of a finite quantum system to return simultaneously to their original configuration. In particular, we define the recurrence time for a quantum system to be the time at which all time-evolved states are close to their initial configuration, and at least one state has deviated significantly during this interval. Considering finite-dimensional quantum systems evolving unitarily, we find bounds on this notion of recurrence time, for continuous time and discrete time, by using Dirichlet's approximation theorem. We show how the problem of finding a bound on recurrence time can be related to approximating the difference of real numbers by rationals. We present a mathematical result on the latter, which we then use to obtain tighter bounds on recurrence time.
Read the full abstract