Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2007.02146

Representations of coefficients of power series in classical statistical mechanics. Their classification and complexity criteria

G. I. Kalmykov
View original source ↗Read source document ↗Export metadata ↓

Abstract

It is declared that the aim of simplifying representations of coefficients of power series of classical statistical mechanics is to simplify a process of obtaining estimates of the coefficients using their simplified representations. The aim of the article is: to formulate criteria for the complexity (from the above point of view) of representations of coefficients of the power series of classical statistical mechanics and to demonstrate their application by examples of comparing the Ree-Hoover representations of virial coefficients (briefly -- the RH representations) with such representations of power series coefficients that are based on the conception of the frame classification of labeled graphs (the abbreviation -- FC). To solve these problems, mathematical notions were introduced (such as a basic product, a basic integral, a basic linear combination, a basic linear combination with coefficients of insignificant complexity(the abbreviation -- BLC with CIC) and the classification of representations of the coefficients of power series of classical statistical mechanics is proposed. In the classification, the class of BLC's with CIC is the most important. It includes all the above representations of the coefficients of power series of classical statistical mechanics. Three criteria are formulated for estimate the comparative complexity of BLC's with CIC. These criteria are ordered by their accuracy. Based on each of these criteria, a criterion for the comparative complexity of finite sets of BLC's with CIC is constructed. The constructed criteria are ordered by their accuracy. The application of all the constructed criteria is demonstrated by examples of comparing RH representations with the representations of the power series coefficients based on the concept FC. The obtained results are presented in the tables and commented.

Explore related subjects

math-phmath.MP

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

G. I. Kalmykov. 2020-07-04. Representations of coefficients of power series in classical statistical mechanics. Their classification and complexity criteria. https://arxiv.org/abs/2007.02146

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Why we should condition denoising diffusion generative models on windows of past observations

Data assimilation (DA) is, traditionally, a cycling process that relies on time-dependent priors to propagate information from past observations to future cycles. Using denoising diffusion generative modeling for DA is challenging because standard approaches use a fixed training data set, which in turn leads to a static prior that ignores information from past observations. Because past observations are ignored, DA systems with static priors lead to larger posterior errors than cycling DA systems. Incorporating time-dependent priors into generative models, however, requires expensive and frequent retraining. Motivated by linear systems theory - where the dependence of a prediction of a Kalman filter on past observations decays exponentially - we condition diffusion models on short windows of past observations. Specifically, we describe training procedures for two frameworks: a diffusion DA system predicting the current state given a set of past observations, and a diffusion ``direct observation prediction'' (DOP) system, predicting future observations given a set of past observations. Using a canonical linear system, we show that both systems can achieve the minimal posterior error characteristic of a fully-cycled DA/DOP system, without re-training, provided the time windows are long enough. The linear setup ensures analytical tractability, avoids confounding neural network training errors, and confirms that conditioning on windows of past observations is required for efficient and accurate diffusion-based DA or DOP.

math-ph↗
arXiv2026

The kinematic structures and the inertial geometry of a moving charge

We ask how much of the geometry a charged particle moves in is fixed by its motion, and how much a particle must bring. We ask of a symplectic structure only that it relate velocity to momentum as Hamilton's equations do, and we ask it of every energy at once. In particular, we show that the structures meeting that demand are the canonical one and its twists by a closed two-form of the base. A field provides the two-form, a particle the multiplier before it, which we identify constitutively with its charge. Thus, a single energy governs a family of structures, and each particle takes the one its charge fixes. We then ask what a particle must bring to be given a momentum, and we show that the degree of that map settles the degree at which a field enters Newton's Second Law. An antisymmetric bilinear form returns no Lorentz force, whilst a Randers metric returns one --- a length whose difference from a Riemannian one is linear in the velocity. Moreover, we find that metric already within the twisted structure, as its primitive over a level of the free energy, and its law of transport to be nonlinear, no affine connection being known to serve. Under an indefinite signature the length parts from the dynamics, and the extremals turn from shortest to longest. On the round sphere a monopole flux leaves no such metric, whilst the transport remains and prequantisation, given a unit of action, restricts the charge to a lattice. In this manner, we conclude that each charge-to-mass ratio receives a geometry of its own, so that by a functionalist criterion none of them is the spacetime of a charged particle.

math-ph↗