Related papers: Solving infinitary Rubik's cubes
We provide infinitely many solutions of a Dirichlet problem on balls.
Can a problem undecidable with classical resources be decidable with quantum ones? The answer expected is no; as both being Turing theories, they should not solve the Halting problem - a problem unsolvable by any Turing machine. Yet, we…
It is shown that the toy Turing Tumble, suitably extended with an infinitely long game board and unlimited supply of pieces, is Turing-Complete. This is achieved via direct simulation of a Turing machine. Unlike previously informally…
We determine all modular curves $X_0(N)/\langle w_d\rangle$ that admit infinitely many cubic points over the rational field $\mathbb{Q}$, when $N$ is square-free.
We interpret realizations of a graph on the sphere up to rotations as elements of a moduli space of curves of genus zero. We focus on those graphs that admit an assignment of edge lengths on the sphere resulting in a flexible object. Our…
This paper proposes an elementary solution to a special case of finding all perfect squares that can be written as sum of consecutive integer cubes. It is shown that there are no non-trivial solutions if the perfect square is a prime power,…
We investigate the motions of a bar structure consisting of two congruent tetrahedra, whose edges in their basic position form the face diagonals of a rectangular parallelepiped. The constraint of the motion is that the originally…
We study slowly rotating black hole solutions in the six independent theories of Einstein Quartic Gravity (EQG) in four dimensions. Unlike in the static case for which all six theories yield the same solution, for rotating black holes we…
We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…
The class of totally balanced games is a class of transferable-utility coalitional games providing important models of cooperative behavior used in mathematical economics. They coincide with market games of Shapley and Shubik and every…
We ask whether the only multiplicities in the spectrum of the clamped round plate are trivial, i.e., whether all existing multiplicities are due to the isometries of the sphere, or, equivalently, whether any eigenfunction is separated. We…
We show that a class of divergence-form elliptic problems with quadratic growth in the gradient and non-coercive zero order terms are solvable, under essentially optimal hypotheses on the coefficients in the equation. In addition, we prove…
In [6] we proved that the universal theory of infinite free lattices is (algorithmically) decidable, leaving open the problem of decidability of the full theory of an (infinite) free lattice. We solve this problem by proving that, for every…
We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…
Abstract argumentation frameworks (AFs) provide a formal setting to analyze many forms of reasoning with conflicting information. While the expressiveness of general infinite AFs make them a tempting tool for modeling many kinds of…
We study the reciprocal position of nine points in the plane, according to their collinearities. In particular, we consider the case in which the nine points are contained in an irreducible cubic curve and we give their classification. If…
We generalise surface cluster algebras to the case of infinite surfaces where the surface contains finitely many accumulation points of boundary marked points. To connect different triangulations of an infinite surface, we consider infinite…
Extending a result of R. de la Vega, we prove that an infinite homogeneous compactum has cardinality $\mathfrak{c}$ if either it is the union of countably many dense or finitely many arbitrary countably tight subspaces. The question if…
Many graph coloring proofs proceed by showing that a minimal counterexample to the theorem being proved cannot contain certain configurations, and then showing that each graph under consideration contains at least one such configuration;…
We identify many new solvable subcases of the general dynamical system characterized by two autonomous first-order ordinary differential equations with purely quadratic right-hand sides; the solvable character of these dynamical systems…