相关论文: A computer proof of a polynomial identity implying…

In perturbative calculations, e.g., in the setting of Quantum Chromodynamics (QCD) one aims at the evaluation of Feynman integrals. Here one is often faced with the problem to simplify multiple nested integrals or sums to expressions in…

This paper discusses a classical simulation to compute the partition function (or free energy) of generic one-dimensional quantum many-body systems. Many numerical methods have previously been developed to approximately solve…

We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…

We explain how to encode an algebraic series by finite data and how to do effective arithmetic on the level of these encodings. The reasoning is based on the Newton-Puiseux algorithm and an effective equality test for algebraic series.…

An identity is proved connecting two finite sums of inverse tangents. This identity is discretized version of Jacobi's imaginary transformation for the modular angle from the theory of elliptic functions. Some other related identities are…

Applying the $q$-Zeilberger algorithm, we establish a unified $q$-analogue of the (C.2) and (G.2) supercongruences of Van Hamme, which can be viewed as a refinement of several previously known results. As consequences, we obtain a…

We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…

The partition function $p(n)$, which counts the number of partitions of a positive integer $n$, is widely studied. Here, we study partition functions $p_S(n)$ that count partitions of $n$ into distinct parts satisfying certain congruence…

The partition functions $P(n,m,p)$, the number of integer partitions of $n$ into exactly $m$ parts with each part at most $p$, and $Q(n,m,p)$, the number of integer partitons of $n$ into exactly $m$ distinct parts with each part at most…

Formal, automated theorem proving has long been viewed as a challenge to artificial intelligence. We introduce here a new approach to computer theorem proving, one that employs specialized language models for Lean4 proof generation combined…

Recent theoretical results confirm that quantum theory provides the possibility of new ways of performing efficient calculations. The most striking example is the factoring problem. It has recently been shown that computers that exploit…

We show that, in many cases, there are infinitely many sets of partitions corresponding to a single analytical Rogers-Ramanujan type identity. This means that a single analytical Rogers-Ramanujan type identity implies the existence of…

We provide both human and computer (even better collaboration between the two) proofs to four recent American Mathematical Monthly problems, namely problem 11897, problem 11899, problem 11916, and problem 11928. We also show that problem…

Computers are good at evaluating finite sums in closed form, but there are finite sums which do not have closed forms. Summands which do not produce a closed form can often be ``fixed'' by multiplying them by a suitable polynomial. We…

In most text books on number theory Wilson Theorem is proved by applying Lagrange theorem concerning polynomial congruences.Hardy and Wright also give a proof using cuadratic residues. In this article Wilson theorem is derived as a…

We consider a special class of binomial sums involving harmonic numbers and we prove three identities by using the elementary method of the partial fraction decomposition. Some applications to infinite series and congruences are given.

In $2003$, Alladi, Andrews and Berkovich proved a four-parameter partition identity lying beyond a celebrated identity of G\"ollnitz. Since then it has been an open problem to extend their work to five or more parameters. In part I of this…

We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David…

Euler's partition identity states that the number of partitions of $n$ into odd parts is equal to the number of partitions of $n$ into distinct parts. Strikingly, Straub proved in 2016 that this identity also holds when counting partitions…

The aim of this paper is to present a general algebraic identity. Applying this identity, we provide several formulas involving the q-binomial coefficients and the q-harmonic numbers. We also recover some known identities including an…