Related papers: Qin's Algorithm, Continued Fractions and 2-dimensi…
Finite dimensional modular Lie superalgebras over algebraically closed fields with indecomposable Cartan matrices are classified under some technical, most probably inessential, hypotheses. If the Cartan matrix is invertible, the…
This paper proposes a general algorithm called Store-zechin for quickly computing the permanent of an arbitrary square matrix. Its key idea is storage, multiplexing, and recursion. That is, in a recursive process, some sub-terms which have…
We describe a simple method that produces automatically closed forms for the coefficients of continued fractions expansions of a large number of special functions. The function is specified by a non-linear differential equation and initial…
We develop a theory of the field of double Laurent series, iterated Laurent series, and Malcev-Neumann series that applies to most constant term evaluation problems. These include (i) MacMahon's partition analysis, counting solutions of…
Typical arguments for results like Kleene's Second Recursion Theorem and the existence of self-writing computer programs bear the fingerprints of equational reasoning and combinatory logic. In fact, the connection of combinatory logic and…
This paper presents a novel approach to Chinese characters through the lens of physics, network analysis, and natural systems. Computational analysis of over 6,000 characters identified 422 elemental characters as fundamental building…
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular division. The presented algorithms are…
A Lagrange Theorem in dimension 2 is proved, for a particular two-dimensional algorithm, with a very natural geometrical definition. Dirichlet-type properties for the convergence of the algorithm are also proved. These properties procced…
Based on the nine-palace diagram, we establish the systematical geometric theory of arithmetic, which can realize the arithmetical addition, subtraction, multiplication, division and other operations thoroughly in the mind. In this paper,…
We find a new approach to computing the remainder of a polynomial modulo $x^n-1$; such a computation is called modular enumeration. Given a polynomial with coefficients from a commutative $\mathbb{Q}$-algebra, our first main result…
The feasibility of studying, numerically, properties of infinite volume QCD-like theories in the large $N$ limit using coherent state variational methods is reassessed. An entirely new implementation of this approach is described,…
Recently, there has been observed an interesting correspondence between supersymmetric quiver gauge theories with four supercharges and integrable lattice models of statistical mechanics such that the two-dimensional spin lattice is the…
We study leading singularities of scattering amplitudes which are obtained as residues of an integral over a Grassmannian manifold. We recursively do the transformation from twistors to momentum twistors and obtain an iterative formula for…
We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…
Lattices are very important objects in the effort to construct cryptographic primitives that are secure against quantum attacks. A central problem in the study of lattices is that of finding the shortest non-zero vector in the lattice.…
Bayesian probabilistic numerical methods are a set of tools providing posterior distributions on the output of numerical methods. The use of these methods is usually motivated by the fact that they can represent our uncertainty due to…
There is a class of statistical problems that arises in several contexts, the Lattice QCD problem of particle physics being one that has attracted the most attention. In essence, the problem boils down to the estimation of an infinite…
The connection between simple Lie algebras and their Yangian algebras has a long history. In this work, we construct finite-dimensional representations of Yangian algebras $\mathsf{Y}(\mathfrak{sl}_{n})$ using the quiver approach. Starting…
A new method that enables easy and convenient discretization of partial differential equations with derivatives of arbitrary real order (so-called fractional derivatives) and delays is presented and illustrated on numerical solution of…
We introduce here a rewrite system in the group of unimodular matrices, \emph{i.e.}, matrices with integer entries and with determinant equal to $\pm 1$. We use this rewrite system to precisely characterize the mechanism of the Gaussian…