Related papers: The Lonely Vertex Problem
We study surfaces in Euclidean space constructed by the sum of two curves or that are graphs of the product of two functions. We consider the problem to determine all these surfaces with constant Gauss curvature. We extend the results to…
Consider the unforced incompressible homogeneous Navier-Stokes equations on the $d$-torus $\mathbb{T}^d$ where $d\geq 4$ is the space dimension. It is shown that there exist nontrivial steady-state weak solutions $u\in L^{2}(\mathbb{T}^d)$.…
The paper characterizes the convex hull of the closure of the cone-volume set $C_\cv(U)$, consisting of all cone-volume vectors of polygons with outer unit normals vectors contained in $U$, for any finite set $U \subseteq \R^2, \pos(U) =…
A theorem of Howe states that every 3-dimensional lattice polytope $P$ whose only lattice points are its vertices, is a Cayley polytope, i.e. $P$ is the convex hull of two lattice polygons with distance one. We want to generalize this…
We give an application of a topological dynamics version of multidimensional Brown's lemma to tiling theory: given a tiling of an Euclidean space and a finite geometric pattern of points $F$, one can find a patch such that, for each scale…
Many algorithmic problems can be solved (almost) as efficiently in metric spaces of bounded doubling dimension as in Euclidean space. Unfortunately, the metric space defined by points in a simple polygon equipped with the geodesic distance…
We present an open problem about non-colliding freely moving hard disks in the Euclidean plane, together with related positive and negative partial results. The open problem is stated in a non-degenerate form: velocities are required to be…
We show that the shadow vertex simplex algorithm can be used to solve linear programs in strongly polynomial time with respect to the number $n$ of variables, the number $m$ of constraints, and $1/\delta$, where $\delta$ is a parameter that…
The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…
We study existence and uniqueness of bounded solutions to a fractional sublinear elliptic equation with a variable coefficient, in the whole space. Existence is investigated in connection to a certain fractional linear equation, whereas the…
In this paper, we prove that the general problem of tiling the hyperbolic plane with \`a la Wang tiles is undecidable.
We show that the problem to decide whether two (convex) polytopes, given by their vertex-facet incidences, are combinatorially isomorphic is graph isomorphism complete, even for simple or simplicial polytopes. On the other hand, we give a…
This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap's faces are quadrilaterals, with vertices…
The paper considers a class of Lagrangian surfaces in $\mathbb C^2$ with isolated singularities of the unfolded Whitney umbrella type. We prove that generically such a surface is locally polynomially convex near a singular point of this…
We briefly introduce several problems: (1) a generalization of the convex fair partition conjecture, (2) on non-trivial invariants among polyhedrons that can be formed from the same set of face polygons, (3) two questions on assembling…
This paper deals with $n$-dimensional algebras, over any field, which have only trivial derivation (automorphism) and simple algebras. It is shown that the corresponding sets of algebras are not empty and, in algebraically closed field…
We consider the number of domino tilings of an odd-by-odd rectangle that leave one hole. This problem is equivalent to the number of near-perfect matchings of the odd-by-odd rectangular grid. For any particular position of the vacancy on…
We study the problem of moving a vertex in an unstructured mesh of triangular, quadrilateral, or tetrahedral elements to optimize the shapes of adjacent elements. We show that many such problems can be solved in linear time using…
In this work, we consider a class of convex optimization problems in a real Hilbert space that can be solved by performing a single projection, i.e., by projecting an infeasible point onto the feasible set. Our results improve those…
Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases''…