Related papers: Automatic Solving of Cubic Diophantine Equations I…
In this paper, we explore several threads arising from our recent joint work on arithmetic holonomy bounds, which were originally devised to prove new irrationality results based on the method of Ap\'ery limits. We propose a new method to…
In a recent article, Apagodu and Zeilberger (http://arxiv.org/abs/1606.03351)discuss some applications of an algorithm for finding and proving congruence identities (modulo primes) of indefinite sums of many combinatorial sequence. At the…
Ramanujan's lost notebook contains many mock theta functions and mock theta function identities not mentioned in his last letter to Hardy. For example, we find the four tenth-order mock theta functions and their six identities. The six…
MacMahon introduced partition analysis in his book ``Combinatory Analysis'' as a computational technique for solving problems related to systems of linear Diophantine equations and inequalities. This paper aims to develop a fundamental…
Following Bridgeman, we demonstrate several families of infinite dilogarithm identities associated with Fibonacci numbers, Lucas numbers, convergents of continued fractions of even periods, and terms arising from various recurrence…
The 3-domatic number problem asks whether a given graph can be partitioned intothree dominating sets. We prove that this problem can be solved by a deterministic algorithm in time 2.695^n (up to polynomial factors). This result improves the…
We discuss some aspects of the theory of recognition of two-dimensional shapes by means of fingerprints of Jordan curves. An interesting approach to problems on shape recognition suggested by P.~Ebenfelt, D.~Khavinson, and H.~Shapiro and…
In a fundamental paper [Phys. Rev. Lett. 78, 325 (1997)] Grover showed how a quantum computer can find a single marked object in a database of size N by using only O(N^{1/2}) queries of the oracle that identifies the object. His result was…
The direct or algorithmic approach for the Jacobian problem, consisting of the direct construction of the inverse polynomials is proposed. The so called principle and derived Jacobi conditions are proposed and discussed. The algorithmic…
We investigate pairs of diagonal cubic equations with integral coefficients. For a class of such Diophantine systems with 11 or more variables, we are able to establish that the number of integral solutions in a large box is at least as…
We use representations and differentiation algorithms of posets, in order to obtain results concerning unsolved problems on figurate numbers. In particular, we present criteria for natural numbers which are the sum of three octahedral…
Ramanujan graphs are graphs whose spectrum is bounded optimally. Such graphs have found numerous applications in combinatorics and computer science. In recent years, a high dimensional theory has emerged. In this paper these developments…
In arXiv:0912.1346, four quantum dilogarithm identities containing infinitely many factors are proposed as wall-crossing formula for refined BPS invariant. We give algebraic proof of these identities using the formula for universal R-matrix…
The theory of supercharacters, recently developed by Diaconis-Isaacs and Andre, can be used to derive the fundamental algebraic properties of Ramanujan sums. This machinery frequently yields one-line proofs of difficult identities and…
The Rogers-Ramanujan identities have been studied from the viewpoints of combinatorics, number theory, affine Lie algebras, statistical mechanics, and quantum field theory. This note connects the Rogers-Ramanujan identities with the finite…
Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied,…
Dyson famously provided combinatorial explanations for Ramanujan's partition congruences modulo $5$ and $7$ via his rank function, and postulated that an invariant explaining all of Ramanujan's congruences modulo $5$, $7$, and $11$ should…
In this paper we give a computer proof of a new polynomial identity, which extends a recent result of Alladi and the first author. In addition, we provide computer proofs for new finite analogs of Jacobi and Euler formulas. All computer…
We present a general algorithm for solving all two-variable polynomial Diophantine equations consisting of three monomials. Before this work, even the existence of an algorithm for solving the one-parameter family of equations…
Quantum adiabatic algorithm is of vital importance in quantum computation field. It offers us an alternative approach to manipulate the system instead of quantum gate model. Recently, an interesting work arXiv:1805.10549 indicated that we…