Papers for

mathematical physicists

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Classical spin model shows stable states in two dimensions

A thermally and perturbatively stable classical spin model in two dimensions

Abstract: We show that the 2D classical spin model constructed in arXiv:2605.10943 hosts many metastable states at non-zero temperature which are stable to arbitrary Hamiltonian perturbations, providing the first such example. Our proof relies on a recursive application of the cluster expansion.

Thu 15 OctInformation Theory
The gist
Some materials can be thought of as tiny magnets arranged on a flat surface, where their interactions determine how the whole system behaves. Usually, these systems are sensitive to both temperature changes and small tweaks in their energy rules, causing instability. The authors build on previous work to show a model in two dimensions where many stable arrangements exist even when the temperature is above absolute zero and when the energy rules are changed a little. Their approach uses a mathematical technique called cluster expansion repeatedly to prove this stability. This is the first known example of such a robust classical spin system.
Open → 2610.22548v1

Complete reduction method speeds up telescoping in complex sum models

Complete Reductions and Idempotent Representations for $RΠΣ^*$-towers

Abstract: $RΠΣ^*$-extensions form a rich class of difference rings that provide a unified algebraic framework for modeling indefinite nested sums, transcendental products, and nested products over roots of unity structures that frequently appear in combinatorics, number theory, and particle physics. For a large subclass of these extensions whose ring of constants is a field, we introduce a complete reduction approach to resolve the telescoping problem without solving any difference equations. More precisely, we explicitly construct a complement to the subspace of differences over the constant field and develop an algorithm that decomposes any element of the extension into the sum of a difference and a component lying in this complement. Consequently, summability holds if and only if this complementary component is zero. This structural approach yields significant speed-ups for parameterized telescoping and, notably, creative telescoping for deriving linear recurrences of definite sums. Finally, we compute an explicit idempotent representation that extends existing telescoping algorithms and our complete reduction framework to the general class of $RΠΣ^*$-extensions, opening up previously untreatable classes of sums and products.

Mon 21 SeptSymbolic Computation
The gist
The paper deals with a complex math problem of breaking down very complicated sums and products into simpler pieces, a common challenge in combinatorics and physics. The authors present a new way to split these sums without solving difficult equations, making it easier to decide if a sum can be simplified or not. Their approach speeds up calculations that involve finding patterns or recurrences in sums, which can be useful whenever nested sums or products appear. They also extend their method to cover even broader cases that were not manageable before.
Open → 2609.24845v1