Related papers: Trigonometry of The Gold-Bug
The author presents two tricks to accelerate depth-first search algorithms for a class of combinatorial puzzle problems, such as tiling a tray by a fixed set of polyominoes. The first trick is to implement each assumption of the search with…
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
Given a series of photographs taken during a Go game, we describe the techniques we successfully employ for pinpointing the grid lines of the Go board and for tracking their small movements between consecutive photographs; then we discuss…
A number of recent works in E-print arXiv have addressed the foundation of gauge gravitation theory again. As is well known, differential geometry of fibre bundles provides the adequate mathematical formulation of classical field theory,…
The goal of this paper is to give a purely geometric proof of a theorem by Branko Gr\"unbaum concerning configuration of triangles coming from the classical Napoleon's theorem in planar Euclidean geometry.
An edge tessellation is a tiling of the plane generated by reflecting a polygon in its edges. We prove that a polygon generating an edge tessellation is one the following eight types: a rectangle; an equilateral, 60-right, isosceles right,…
This paper presents some considerations about the Goldbach's conjecture (GC). The work is based on elementary results of the number theory and it provides a constructive method that permits, given an even integer, to find at least a pair of…
We construct the quaternion algebra [10] "geometrically" by a three dimensional analogue of the classic two dimensional geometric description of the complex field. The algebraic description of the multiplication operation in three…
This paper investigates the problem of determining a binary-valued function through a sequence of strategically selected queries. The focus is an algorithm called Generalized Binary Search (GBS). GBS is a well-known greedy algorithm for…
See hep-th/9903228.
An amusing connection between Ford circles, Fibonacci numbers, and golden ratio is shown. Namely, certain tangency points of Ford circles are concyclic and involve Fibonacci numbers. They form four circles that cut the x-axis at points…
The concept of number and its generalization has played a central role in the development of mathematics over many centuries and many civilizations. Noteworthy milestones in this long and arduous process were the developments of the real…
A solid wooden cube fragments into pieces as we sequentially drill holes through it randomly. This seemingly straightforward observation encompasses deep and nontrivial geometrical and probabilistic behavior that is discussed here.…
In this paper, we present our heuristic solutions to the problems of finding the maximum and minimum area polygons with a given set of vertices. Our solutions are based mostly on two simple algorithmic paradigms: greedy method and local…
This is an introduction to geometric algebra, an alternative to traditional vector algebra that expands on it in two ways: 1. In addition to scalars and vectors, it defines new objects representing subspaces of any dimension. 2. It defines…
Positively graded algebras are fairly natural objects which are arduous to be studied. In this article we query quotients of non-standard graded polynomial rings with combinatorial and commutative algebra methods.
The graphical balls-into-bins process is a generalization of the classical 2-choice balls-into-bins process, where the bins correspond to vertices of an arbitrary underlying graph $G$. At each time step an edge of $G$ is chosen uniformly at…
We study the classical game of peg solitaire when diagonal jumps are allowed. We prove that on many boards, one can begin from a full board with one peg missing, and finish with one peg anywhere on the board. We then consider the problem of…
It is demonstrated that iterative repeating of some simple geometric construction leads unavoidably in the limit to the golden ratio. The procedure appears to be quickly convergent regardless of a ratio of initial elements sizes. This could…
A generic orthotope is an orthogonal polytope whose tangent cones are described by read-once Boolean functions. The purpose of this note is to develop a theory ofEhrhart polynomials for integral generic orthotopes. The most remarkable part…