Related papers: Automatic Solving of Cubic Diophantine Equations I…
Nonuniform Deterministic Finite Automata (NUDFA) over monoids were invented by Barrington to study boundaries of nonuniform constant-memory computation. Later, results on these automata helped to indentify interesting classes of groups for…
Rubik's Cube is one of the most famous combinatorial puzzles involving nearly $4.3 \times 10^{19}$ possible configurations. Its mathematical description is expressed by the Rubik's group, whose elements define how its layers rotate. We…
Motivated by the recent work of William Y.C. Chen, in which he presents a way to solve cubic equations by considering the identity of Sylvester, we investigate the solutions obtained in this way. It leads us to a unified expression of the…
By employing the classical tools from the theory of $q$-series and theta functions, new fascinating identities on different continued fractions can be achieved. In this article, we use the product expansion of Jacobi's theta function to…
Ramanujan's Master Theorem is a decades-old theorem in the theory of Mellin transforms which has wide applications in both mathematics and high energy physics. The unconventional method of Ramanujan in his proof of the theorem left…
Each of Ramanujan's series for $\frac{1}{\pi}$ is of the form $$ \sum_{n=0}^{\infty} z^n \frac{ (a_{1})_{n} (a_{2})_{n} (a_{3})_{n} }{ (b_{1})_{n} (b_{2})_{n} (b_{3})_{n} } (c_{1} n + c_2) $$ for rational parameters such that the difference…
The paper introduces a connectionist network approach to find numerical solutions of Diophantine equations as an attempt to address the famous Hilbert's tenth problem. The proposed methodology uses a three layer feed forward neural network…
These notes represent an extended version of a talk I gave for the participants of the IMO 2009 and other interested people. We introduce diophantine equations and show evidence that it can be hard to solve them. Then we demonstrate how one…
In 1997, Y. Ohno empirically stumbled on an astoundingly simple identity relating the number of cubic rings $h(D)$ of a given discriminant $D$, over the integers, to the number of cubic rings $h'(D)$ of discriminant $-27D$ in which every…
Andrews and Bressoud, Alladi and Gordon, and others, have proven, in a number of papers, that the coefficients in various arithmetic progressions in the series expansions of certain infinite $q$-products vanish. In the present paper it is…
The product sides of the Rogers--Ramanujan identities and alike often appear to be "transparently modular" (functions). The old work by Rogers (1894) and recent work by Rosengren make use (somewhat implicitly) of this fact for proving the…
Gaussian polynomial, which is also known as $q$-binomial coefficient, is one of the fundamental concepts in the theory of partitions. Zeilberger provided a combinatorial proof of Gaussian polynomial, which is called Algorithm Z by Andrews…
We derive explicit formulas for the resultants and discriminants of classical quasi-orthogonal polynomials, as a full generalization of the results of Dilcher and Stolarsky (2005) and Gishe and Ismail (2008). We consider a certain system of…
Ramanujan (1916) expressed quotients of certain q-series as polynomials of Eisenstein series of degree 2, 4, 6 and derived the famous Ramanujan's differential equations. We continue this research with the variants of Eisenstein-type series…
Inspired by a famous formula of Ramanujan for odd zeta values, we prove an analogous formula involving the Hurwitz zeta function. We introduce a new integral kernel related to the Hurwitz zeta function, generalizing the integral kernel…
Nobody has discovered any perfect cuboid and there is no formula to deliver all possible Euler bricks. During investigations of famous open problems regarding the perfect cuboid and Euler brick; I have found new important conjectures on…
We prove a polynomial continued fraction identity for the constant $-\pi/4$, conjectured by the Ramanujan Machine project. The proof proceeds by explicitly solving the underlying second-order linear difference equation. We derive a…
In a handwritten manuscript published with his lost notebook, Ramanujan stated without proofs forty identities for the Rogers-Ramanujan functions. We observe that the functions that appear in Ramanujan's identities can be obtained from a…
Ramanujan made many beautiful and elegant discoveries in his short life of 32 years, and one of them that has attracted the attention of several mathematicians over the years is his intriguing formula for $\zeta(2n+1)$. To be sure,…
We introduce an efficient way, called Newton algorithm, to study arbitrary ideals in C[[x,y]], using a finite succession of Newton polygons. We codify most of the data of the algorithm in a useful combinatorial object, the Newton tree. For…