New string singularities enable quantum teleportation of massive particles.
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Trend · papers per month
Unified framework for photon and massive particle hypersurfaces in stationary spacetimes.
5D SCFTs can have confining vacua with strings and unbroken symmetries.
We report a statistical analysis of the Island ECN (NASDAQ) order book. We determine the static and dynamic properties of this system, and then analyze them from a physicist's viewpoint using an equivalent particle system obtained by treating orders as massive particles and price as position. We identify the fundamenta…
The paper studies how test particles' mass and charge vary in Kaluza-Klein models.
Massive fermions help understand index theorems without chiral symmetry.
The Dirac equation for massive free electrically neutral spin 1/2 particles in a gravitation field is considered. The secondary quantization procedure is applied to it and the Hilbert space of multiparticle quantum states is constructed.
We consider the Cauchy problem for the massive Dirac equation in the non-extreme Kerr-Newman geometry outside the event horizon. We derive an integral representation for the Dirac propagator involving the solutions of the ODEs which arise in Chandrasekhar's separation of variables. It is proved that for initial data in…
Smooth deformations of a Minkowski type metric in a four-dimensional space-time manifold are considered. Deformations of the basic spin-tensorial fields associated with this metric are calculated and their application to calculating the energy-momentum tensor of a massive spin 1/2 particle is shown.
We prove that, in the non-extreme Kerr-Newman black hole geometry, the Dirac equation has no normalizable, time-periodic solutions. A key tool is Chandrasekhar's separation of the Dirac equation in this geometry. A similar non-existence theorem is established in a more general class of stationary, axisymmetric metrics …
In a flat space, the global topology of comoving space can induce a weak acceleration effect similar to dark energy. Does a similar effect occur in the case of the Poincare dodecahedral space S^3/I^*? Does the effect distinguish the Poincare space from other well-proportioned spaces? The residual acceleration effect in…
We construct stationary flat three-dimensional Lorentzian manifolds with singularities that are obtained from Euclidean surfaces with cone singularities and closed one-forms on these surfaces. In the application to (2+1)-gravity, these spacetimes correspond to models containing massive particles with spin. We analyse t…
In this paper we develop a Morse Theory for timelike geodesics parameterized by a constant multiple of proper time. The results are obtained using an extension to the timelike case of the relativistic Fermat Principle, and techniques from Global Analysis on infinite dimensional manifolds. In the second part of the pape…
We investigate 3-dimensional globally hyperbolic AdS manifolds containing "particles", i.e., cone singularities along a graph . We impose physically relevant conditions on the cone singularities, e.g. positivity of mass (angle less than on time-like singular segments). We construct examples of such manifolds, d…
Separates Dirac equation on 2D product spaces and black hole horizons.
We study the physics of globally consistent four-dimensional supersymmetric M-theory compactifications on manifolds constructed via twisted connected sum; there are now perhaps fifty million examples of these manifolds. We study a rich example that exhibits gauge symmetry and a spectrum o…
Minkowski space is the local model of 3 dimensionnal flat spacetimes. Recent progress in the description of globally hyperbolic flat spacetimes showed strong link between Lorentzian geometry and Teichm{ü}ller space. We notice that Lorentzian generalisations of conical singularities are useful for the endeavours of desc…
Adaptive ML learns complex time-varying systems without new data.
New MCMC method speeds up quantum physics simulations by a factor of 100.
We use minimal (or CMC) surfaces to describe 3-dimensional hyperbolic, anti-de Sitter, de Sitter or Minkowski manifolds. We consider whether these manifolds admit ``nice'' foliations and explicit metrics, and whether the space of these metrics has a simple description in terms of Teichmüller theory. In the hyperbolic s…
It is believed by the majority today that the efficient market hypothesis is imperfect because of market irrationality. Using the physical concepts and mathematical structures of quantum mechanics, we construct an econophysics framework for the stock market, based on which we analogously map massive numbers of single s…
Deep learning reduces training overhead in massive MIMO systems.
By using Stationary-to-Randers correspondence (SRC), a characterization of light and time-convexity of the boundary of a region of a standard stationary (n+1)-spacetime is obtained, in terms of the convexity of the boundary of a domain in a Finsler n or (n+1)-space of Randers type. The latter convexity is analyzed in d…
New framework improves fraud prediction with incremental data balancing for massive data streams.
A computer vision approach improves neutral particle detection in particle flow algorithms.
Study examines the excluded area between two-dimensional hard particles, identifying key factors affecting its magnitude.
Jointly estimates flow fields and particle properties from Lagrangian data.
Estimates log-likelihood of interacting particle systems using virtual particles.
This paper optimizes functions of probability measures using particle gradient descent for displacement convex functions.
Differentiable resampling improves particle filter performance.
New sampling method improves on particle-optimization techniques.
CNNs improve positioning accuracy in massive MIMO systems.
A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.
Optimal weights improve particle-based approximations of discrete distributions.
Particle MCMC involves using a particle filter within an MCMC algorithm. For inference of a model which involves an unobserved stochastic process, the standard implementation uses the particle filter to propose new values for the stochastic process, and MCMC moves to propose new values for the parameters. We show how p…
Topaz uses neural networks to pick particles from cryoEM images efficiently.
Optimizes particle filtering for non-stationary environments.
Improved particle approximation for mean-field neural networks.
A new particle filter avoids resampling to improve state estimation in high dimensions.
Deep nets with massive data learn spatially sparse functions.
We introduce a new sequential Monte Carlo algorithm we call the particle cascade. The particle cascade is an asynchronous, anytime alternative to traditional particle filtering algorithms. It uses no barrier synchronizations which leads to improved particle throughput and memory efficiency. It is an anytime algorithm i…
Random orthogonalization improves FL in massive MIMO systems without CSI.
Paper uses averaging from many particle filters to approximate posterior predictive distributions.
This paper studies when particle filtering is efficient for planning in partially observed systems.
Interacting particle methods are increasingly used to sample from complex and high-dimensional distributions. These stochastic particle integration techniques can be interpreted as an universal acceptance-rejection sequential particle sampler equipped with adaptive and interacting recycling mechanisms. Practically, the…
Cryo-electron microscopy (cryo-EM) is an emerging experimental method to characterize the structure of large biomolecular assemblies. Single particle cryo-EM records 2D images (so-called micrographs) of projections of the three-dimensional particle, which need to be processed to obtain the three-dimensional reconstruct…
Improved particle filters enhance vehicle tracking accuracy.
New algorithm trains latent diffusion models using interacting particles.