Related papers: Towards an automation of the circle method
The fractional Hamiltonian analysis of 1+1 dimensional field theory is investigated and the fractional Ostrogradski's formulation is obtained. The fractional path integral of both simple harmonic oscillator with an acceleration-squares part…
An accurate method to compute enclosures of Abelian integrals is developed. This allows for an accurate description of the phase portraits of planar polynomial systems that are perturbations of Hamiltonian systems. As an example, it is…
In this article, we study the arithmetic properties of the partition function $p_8(n)$, the number of 8-colour partitions of $n$. We prove several Ramanujan type congruences modulo higher powers of 2 for the function $p_8(n)$ by finding…
Recent results for rotations expressed as polynomials of spin matrices are derived here by elementary differential equation methods. Structural features of the results are then examined in the framework of biorthogonal systems, to obtain an…
Using the Magri method one defines an involutive family of Hamiltonians on Banach Lie-Poisson space iR+UL_res^1 (which contains the restricted Grassmannian as a symplectic leaf) and on its complexification C+L_res^1. The hierarchy of…
We celebrate the 100th anniversary of Srinivasa Ramanujan's election as a Fellow of the Royal Society, which was largely based on his work with G. H. Hardy on the asymptotic properties of the partition function. After recalling this…
This article considers the problem of solving a system of $n$ real polynomial equations in $n+1$ variables. We propose an algorithm based on Newton's method and subdivision for this problem. Our algorithm is intended only for nondegenerate…
We conjecture an algorithm to construct spin multipartitions and prove that all the level one Fock spaces using our combinatorics are modules over the quantum enveloping algebra.
Using equidistribution criteria, we establish divisibility by cyclotomic polynomials of several partition polynomials of interest, including $spt$-crank, overpartition pairs, and $t$-core partitions. As corollaries, we obtain new proofs of…
Hamiltonian simulation, i.e., simulating the real time evolution of a target quantum system, is a natural application of quantum computing. Trotter-Suzuki splitting methods can generate corresponding quantum circuits; however, a faithful…
We develop a new closed-form arithmetic and recursive formula for the partition function and a generalization of Andrews' smallest parts (spt) function. Using the inclusion-exclusion principle, we additionally develop a formula for the…
In this paper we find exact formulas for the numbers of partitions and compositions of an element into $m$ parts over a finite field, i.e. we find the number of nonzero solutions of the equation $x_1+x_2+...+x_m=z$ over a finite field when…
In this article we will derive a combinatorial formula for the partition function p(n). In the second part of the paper we will establish connection between partitions and q-binomial coefficients and give new interpretation for q-binomial…
In this paper, we utilize operational methods to obtain closed-form solutions for certain classes of integrals in the spirit of Ramanujan's Master Theorem and provide several analogs to it. Although the use of operational calculus makes the…
Recently, several mathematicians have investigated various partition functions with the goal of discovering Ramanujan-type congruences. One such function is $\overline{B}_{2^\alpha}(n)$, which represents the number of $2^\alpha-$regular…
We obtain the formula computing the number of isomorphic classes of ramification systems with characters over group $S_n$ ($n \not=6$) and their representatives.
We revisit a formula for the number of plane partitions due to Almkvist. Using the circle method, we provide modifications to his formula along with estimates of the errors. We show that the improved formula continues to be an asymptotic…
This article introduces recursive relations allowing the calculation of the number of partitions with constraints on the minimum and/or on the maximum fragment size.
These course notes are about computing modular forms and some of their arithmetic properties. Their aim is to explain and prove the modular symbols algorithm in as elementary and as explicit terms as possible, and to enable the devoted…
A formula for supershell partition functions, which play a major role in the Super Transition Array approach to radiative-opacity calculations, is derived as a functional of the distribution of energies within the supershell. It consists in…