Related papers: Windmills of the minds: an algorithm for Fermat's …
In the light of a recently derived evolution equation for genetic algorithms we consider the schema theorem and the building block hypothesis. We derive a schema theorem based on the concept of effective fitness showing that schemata of…
A foundational theory of compositional categorical rewriting theory is presented, based on a collection of fibration-like properties that collectively induce and intrinsically structure the large collection of lemmata used in the proofs of…
A biform theory is a combination of an axiomatic theory and an algorithmic theory that supports the integration of reasoning and computation. These are ideal for specifying and reasoning about algorithms that manipulate mathematical…
We introduce a new combinatorial object called tower diagrams and prove fundamental properties of these objects. We also introduce an algorithm that allows us to slide words to tower diagrams. We show that the algorithm is well-defined only…
This is a tutorial for the many-worlds theory by Everett, which includes some of my personal views. It has two main parts.The first main part shows the emergence of many worlds in a universe consisting of only a Mach-Zehnder interferometer.…
We examine a class of geometric theorems on cyclic 2n-gons. We prove that if we take n disjoint pairs of sides, each pair separated by an even number of polygon sides, then there is a linear combination of the angles between those sides…
We propose two new proofs of the Pythagorean theorem via area rearrangement arguments starting from very simple geometric configurations. The constructions depend on an angular parameter, each choice of which yields a proof. For specific…
We give a new proof of the Gibbard-Satterthwaite Theorem. We construct two topological spaces: one for the space of preference profiles and another for the space of outcomes. We show that social choice functions induce continuous mappings…
The Tribonacci sequence $\mathbb{T}$ is the fixed point of the substitution $\sigma(a,b,c)=(ab,ac,a)$. In this note, we get the explicit expressions of all squares, and then establish the tree structure of the positions of repeated squares…
Two-dimensional patterns are used in many research areas in computer science, ranging from image processing to specification and verification of complex software systems (via scenarios). The contribution of this paper is twofold. First, we…
In our work we give the examples using Fermat's Last Theorem for solving some problems from algebra, geometry and number theory
When doubly-affine matrices such as Latin and magic squares with a single non-zero eigenvalue are powered up they become constant matrices after a few steps. The process of compounding squares of orders m and n can then be used to generate…
The pursue of what are properties that can be identified to permit an automated reasoning program to generate and find new and interesting theorems is an interesting research goal (pun intended). The automatic discovery of new theorems is a…
We give an explicit formulae for obtaining the translation symmetries in the cartesian product $X^N$, where $N$ is some positive integer and $X$ is some finite set. Moreover, we obtain some fundamental results from elementary number theory.
A generalization of the Vandermonde matrices which arise when the power basis is replaced by the Said-Ball basis is considered. When the nodes are inside the interval (0,1), then those matrices are strictly totally positive. An algorithm…
The most efficient known method for solving certain computational problems is to construct an iterated map whose fixed points are by design the problem's solution. Although the origins of this idea go back at least to Newton, the clearest…
The present paper is both a review on the Feynman problem, and an original research presentation on the relations between Fermionic theories and qubits theories, both regarded in the novel framework of operational probabilistic theories.…
A unified, consistent and simple view of the Faraday law of induction is presented, which consists of two points: discriminating the lab- from the rest-frame electric field and understanding it is the impossibility for both fields to vanish…
The windowed quadratic phase Fourier transform (WQPFT) combines the localization capabilities of windowed transforms with the phase modulation structure of the quadratic phase Fourier transform (QPFT). This paper investigates fundamental…
We construct closed forms that generate with repetitions all Mersenne primes, respectively all Fermat primes, all twin-prime pairs and all Sophie Germain primes. Also, we construct closed forms that count all Mersenne primes between $0$ and…