相关论文: The finite tiling problem is undecidable in the hy…
We consider Hamilton Jacobi Bellman equations in an inifinite dimensional Hilbert space, with quadratic (respectively superquadratic) hamiltonian and with continuous (respectively lipschitz continuous) final conditions. This allows to study…
There are several well-known characterizations of the sphere as a regular surface in the Euclidean space. By means of a purely synthetic technique, we get a rigidity result for the sphere without any curvature conditions, nor completeness…
Cao & Yuan obtained a Blichfeldt-type result for the vertex set of the edge-to-edge tiling of the plane by regular hexagons. Observing that every Archimedean tiling is the union of translates of a fixed lattice, we take a more general…
We discuss questions of isospectrality for hyperbolic orbisurfaces, examining the relationship between the geometry of an orbisurface and its Laplace spectrum. We show that certain hyperbolic orbisurfaces cannot be isospectral, where the…
In this paper, we prove that it is undecidable whether a set of two polycubes can tile $\mathbb{Z}^3$ by translation. The proof involves a new technique that allows us to simulate two disconnected polycubes with two connected polycubes. By…
We completely characterize the condition when a tile structure provides an unextendible product basis (UPB), and construct UPBs of different large sizes in $\mathbb{C}^m\otimes\mathbb{C}^n$ for any $n\geq m\geq 3$. This solves an open…
A famous problem in discrete geometry is to find all monohedral plane tilers, which is still open to the best of our knowledge. This paper concerns with one of its variants that to determine all convex polyhedra whose every cross-section…
A first step in investigating colour symmetries of periodic and nonperiodic patterns is determining the number of colours which allow perfect colourings of the pattern under consideration. A perfect colouring is one where each symmetry of…
It is still not known whether a solution to the incompressible Euler equation, endowed with a smooth initial value, can blow-up in finite time. In [{\em Comm. Math. Phys.}, 378:557--568, 2020] it has been shown that, if it exists, such a…
We extend the discontinuous Galerkin (DG) framework to the analysis of first-order hyperbolic and advection-dominated problems posed on implicitly defined surfaces. The focus will be on the hyperbolic part, which is discretised using a…
We carry out a systematic investigation on floating bodies in real space forms. A new unifying approach not only allows us to treat the important classical case of Euclidean space as well as the recent extension to the Euclidean unit…
An h-tiling on a finite simplicial complex is a partition of its geometric realization by maximal simplices deprived of several codimension one faces together with possibly their remaining face of highest codimension. In this last case, the…
The algebraic intersection type unification problem is an important component in proof search related to several natural decision problems in intersection type systems. It is unknown and remains open whether the algebraic intersection type…
A graph G is a (Euclidean) unit disk graph if it is the intersection graph of unit disks in the Euclidean plane $\mathbb{R}^2$. Recognizing them is known to be $\exists\mathbb{R}$-complete, i.e., as hard as solving a system of polynomial…
Consider an ergodic unimodular random one-ended planar graph $\G$ of finite expected degree. We prove that it has an isometry-invariant locally finite embedding in the Euclidean plane if and only if it is invariantly amenable. By "locally…
We present and prove a topological characterization of geodesic laminations on hyperbolic surfaces of finite type.
It is well known that for many semilinear parabolic equations there is a global attractor which has a cell complex structure with finite dimensional cells. Additionally, many semilinear parabolic equations have equilibria with finite…
We solve a problem of R. Nandakumar by proving that there is no tiling of the plane with pairwise noncongruent triangles of equal area and equal perimeter. We also show that no convex polygon with more than three sides can be tiled with…
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show that this is also the case when restricting the…
A field $K$ in a ring language $\mathcal{L}$ is finitely undecidable if $\mbox{Cons}(\Sigma)$ is undecidable for every nonempty finite $\Sigma \subseteq \mbox{Th}(K; \mathcal{L})$. We adapt arguments originating with Cherlin-van den…