Related papers: Solving Sangaku With Traditional Techniques
Contribution of Indian Mathematics since Vedic Period has been recognised by the Historians. Pingala (200 BC) in his book on 'Chandashaastra', a text related to the description and analysis of meters in poetic work, describes algorithms…
Motivated by a question in origami, we consider sets of points in the complex plane constructed in the following way. Let $L_\alpha(p)$ be the line in the complex plane through $p$ with angle $\alpha$ (with respect to the real axis). Given…
Regular classical solutions of pure SU(3) gauge theories, in Minkowsky spacetime, are computed in the Landau gauge. The classical fields have an intrinsic energy scale and produce quark confinement if interpreted in the sense of a…
The mathematical structure of the widely popular Sudoku puzzles is akin to typical hard constraint satisfaction problems that lie at the heart of many applications, including protein folding and the general problem of finding the ground…
A breakthrough took place in the von Neumann algebra theory when the Tomita-Takesaki theory was established around 1970. Since then, many important issues in the theory were developed through 1970's by Araki, Connes, Haagerup, Takesaki and…
We use Bernstein's presentation of the Iwahori-Matsumoto Hecke algebra to obtain a simple proof of the Satake isomorphism and, in the same stroke, compute the center of the Iwahori-Matsumoto Hecke algebra.
The rules of Sudoku are often specified using twenty seven \texttt{all\_different} constraints, referred to as the {\em big} \mrules. Using graphical proofs and exploratory logic programming, the following main and new result is obtained:…
This paper establishes a rigorous geometrical framework for spherical origami, origami using spherical sheets based on spherical geometry. Two settings are treated: origami restricted to the unit sphere ($\mathbb{S}^2$), and…
Origami is an ancient art that continues to yield both artistic and scientific insights to this day. In 2012, Buhler, Butler, de Launey, and Graham extended these ideas even further by developing a mathematical construction inspired by…
Japanese tatami mats are often arranged so that no four mats meet. This local restriction imposes a rich combinatorial structure when applied to monomino-domino coverings of rectilinear grids. We describe a modular, mechanical game board,…
In this short paper we present an algorithm for finding a solution to a generalized Sudoku.
We give a simple proof of that determining solvability of Shisen-Sho boards is NP-complete. Furthermore, we show that under realistic assumptions, one can compute in logarithmic time if two tiles form a playable pair. We combine an…
Quantum Computing is considered as the next frontier in computing, and it is attracting a lot of attention from the current scientific community. This kind of computation provides to researchers with a revolutionary paradigm for addressing…
In the Escherization problem, given a closed figure in a plane, the objective is to find a closed figure that is as close as possible to the input figure and tiles the plane. Koizumi and Sugihara's formulation reduces this problem to an…
The classical ``computation'' methods in Algebraic Topology most often work by means of highly infinite objects and in fact +are_not+ constructive. Typical examples are shown to describe the nature of the problem. The Rubio-Sergeraert…
Lie-Trotter-Suzuki product formulas are ubiquitous in quantum mechanics, computing, and simulations. Approximating exponentiated sums with Jordan product formulas are investigated in the setting of JB-algebras. We show that the Suzuki type…
This work examines the problem to describe an efficient algorithm for obtaining $n^2 \times n^2$ Sudoku matrices. For this purpose, we define the concepts of $n\times n$ $\Pi_n$-matrix and disjoint $\Pi_n$-matrices. The article, using the…
Saddle point problems have been attracting people's attention in recent years. To solve large and sparse saddle point problems, Uzawa type algorithms were proposed. The main contribution of this paper is to present a new Uzawa-exact type…
We study a regularized version of the Landau equation, which was recently introduced in~\cite{CHWW20} to numerically approximate the Landau equation with good accuracy at reasonable computational cost. We develop the existence and…
Solving math word problems is a challenging task that requires accurate natural language understanding to bridge natural language texts and math expressions. Motivated by the intuition about how human generates the equations given the…