Related papers: Solving infinitary Rubik's cubes
We present a nondeterministic model of computation based on reversing edge directions in weighted directed graphs with minimum in-flow constraints on vertices. Deciding whether this simple graph model can be manipulated in order to reverse…
The Fibonacci cube of dimension n, denoted as $\Gamma\_n$, is the subgraph of the hypercube induced by vertices with no consecutive 1's. The irregularity of a graph G is the sum of |d(x)-d(y)| over all edges {x,y} of G. In two recent paper…
We verify the infinitesimal inversive rigidity of almost all triangulated circle polyhedra in the Euclidean plane $\mathbb{E}^{2}$, as well as the infinitesimal inversive rigidity of tangency circle packings on the $2$-sphere…
For any positive integer $k$, we prove the existence of nontrivial $C^k$-smooth uniformly rotating solutions to the 2D incompressible Euler equations with compact spatial support. These solutions, which can be chosen to be small…
We settle an open problem regarding palindromes; that is, positive integers which are the same when written forwards and backwards. In particular, we prove that for any fixed base $b\geq 2$, there exist infinitely many square-free…
We consider combining the definition of a cardinal invariant and the notion of an infinite game. We focus on the splitting number $\mathfrak{s}$ since the corresponding cardinal invariants behave in an interesting way. We introduce three…
Based on earlier work on regular quantum graphs we show that a large class of scaling quantum graphs with arbitrary topology are explicitly analytically solvable. This is surprising since quantum graphs are excellent models of quantum chaos…
We explore a general method based on trees of elementary submodels in order to present highly simplified proofs to numerous results in infinite combinatorics. While countable elementary submodels have been employed in such settings already,…
Let $P_3(\mathbf{C}^{\infty})$ be the space of complex cubic polynomials in infinitely many variables. We show that this space is $\mathbf{GL}_{\infty}$-noetherian, meaning that any $\mathbf{GL}_{\infty}$-stable Zariski closed subset is cut…
In this paper, we study a class of semilinear nonlocal elliptic equations posed on settings without compact Sobolev embedding. More precisely, we prove the existence of infinitely many solutions to the fractional Brezis-Nirenberg problems…
We study rigidity/flexibility properties of global solutions to the thin obstacle problem. For solutions with bounded positive sets, we give a classification in terms of their expansions at infinity. For solutions with bounded contact sets,…
A long standing open problem in extremal graph theory is to describe all graphs that maximize the number of induced copies of a path on four vertices. The character of the problem changes in the setting of oriented graphs, and becomes more…
A circle domain $\Omega$ in the Riemann sphere is conformally rigid if every conformal map of $\Omega$ onto another circle domain is the restriction of a M\"{o}bius transformation. We show that two rigidity conjectures of He and Schramm are…
We present a solution of the algebraic version of Birkhoff Conjecture on integrable billiards. Namely we show that every polynomially integrable real bounded convex planar billiard with smooth boundary is an ellipse. We extend this result…
We are lifting classical problems from single instances to regular sets of instances. The task of finding a positive instance of the combinatorial problem $P$ in a potentially infinite given regular set is equivalent to the so called…
The ancient unsolved problem of congruent numbers has been reduced to one of the major questions of contemporary arithmetic: the finiteness of the number of curves over $\bf Q$ which become isomorphic at every place to a given curve. We…
In order to better understand the structure of closed collections of reversible gates, we investigate the lattice of closed sets and the maximal members of this lattice. In this note, we find the maximal closed sets over a finite alphabet.…
We study a family of sorting match puzzles on grids, which we call permutation match puzzles. In this puzzle, each row and column of a $n \times n$ grid is labeled with an ordering constraint -- ascending (A) or descending (D) -- and the…
On the twisted Fermat cubic, an elliptic divisibility sequence arises as the sequence of denominators of the multiples of a single rational point. We prove that the number of prime terms in the sequence is uniformly bounded. When the…
We show that transcendental curves in $\mathbb R^n$ (not necessarily compact) have few rational points of bounded height provided that the curves are well behaved with respect to algebraic sets in a certain sense and can be parametrized by…