Related papers: Long-diagonal pentagram maps
Completely integrable finite dimensional Hamiltonian systems are well understood thanks to the work of Liouville and Arnold. On the other hand, the Lax Pair formulation of the KdV equation marks the beginning of the extension of the…
In 1996 Seo proved that two appropriate pairs of current and voltage data measured on the surface of a planar homogeneous object are sufficient to determine a conductive polygonal inclusion with known deviating conductivity. Here we show…
We extend recent work of Gurel-Gurevich--Jerison--Nachmias (2020) and Bou-Rabee--Gwynne (2024) by showing that as the mesh of our lattice tends to $0$, we have a polynomial rate of convergence for the Dirichlet problem on orthodiagonal maps…
We give an algorithm for finding conformal mappings onto the upper half-plane and conformal modules of some types of polygons. The polygons are obtained by stretching along the real axis polyominoes i.e., polygons which are connected unions…
The $k$-vertex disjoint paths problem is one of the most studied problems in algorithmic graph theory. In 1994, Schrijver proved that the problem can be solved in polynomial time for every fixed $k$ when restricted to the class of planar…
This paper is devoted to tetrahedron maps, which are set-theoretical solutions to the Zamolodchikov tetrahedron equation. We construct a family of tetrahedron maps on associative rings. We show that matrix tetrahedron maps presented in…
We prove a shape theorem for internal diffusion limited aggregation on mated-CRT maps, a family of random planar maps which approximate Liouville quantum gravity (LQG) surfaces. The limit is an LQG harmonic ball, which we constructed in a…
On a geometrical view, the conception of map geometries are introduced, which is a nice model of the Smarandache geometries, also new kind of and more general intrinsic geometry of surface. Results convinced one that map geometries are…
In this paper we prove the existence of a solution to the Dirichlet problem for harmonic maps into a geodesic ball on which the squared distance function from the origin is strictly convex. This improves a celebrated theorem obtained by S.…
This paper develops the metric theory of simultaneous inhomogeneous Diophantine approximation on a planar curve with respect to multiple approximating functions. Our results naturally generalize the homogeneous Lebesgue measure and Hausdor?…
In a planar L-drawing of a directed graph (digraph) each edge e is represented as a polyline composed of a vertical segment starting at the tail of e and a horizontal segment ending at the head of e. Distinct edges may overlap, but not…
The Lax pair representation in Fourier space is used to obtain a list of integrable scalar evolutionary equations with quadratic nonlinearity. The famous systems of this type such as KdV, intermediate long-wave equation (ILW), Camassa-Holm…
The pentagram map has been studied in a series of papers by Schwartz and others. Schwartz showed that an axis-aligned polygon collapses to a point under a predictable number of iterations of the pentagram map. Glick gave a different proof…
We study conformal maps from multiply connected domains in the extended complex plane onto lemniscatic domains. Walsh proved the existence of such maps in 1956 and thus obtained a direct generalization of the Riemann mapping theorem to…
This paper considers a simple geometric construction, called the Pentagram map. The pentagram map, performed on N-gons, gives rise to a birational mapping on the space of all N-gons. This paper finds what conjecturally are all the…
We consider the propagation of short waves which generate waves of much longer (infinite) wave-length. Model equations of such long wave-short wave resonant interaction, including integrable ones, are well-known and have received much…
It was shown by Nachbin in 1950 that an $n$-dimensional normed space $X$ is injective or equivalently is an absolute 1-Lipschitz retract if and only if $X$ is linearly isometric to $l_\infty^n$ (i.e., $\mathbb{R}^n$ endowed with the…
In the maximum independent set of convex polygons problem, we are given a set of $n$ convex polygons in the plane with the objective of selecting a maximum cardinality subset of non-overlapping polygons. Here we study a special case of the…
Paul Erd\H{o}s and R. Daniel Mauldin asked a series of questions on certain types of polygons of area $1$, the vertices of which can be found in every planar set of infinite Lebesgue measure. We address two of these questions, one on cyclic…
We show that the edges of any $d$-regular graph can be almost decomposed into paths of length roughly $d$, giving an approximate solution to a problem of Kotzig from 1957. Along the way, we show that almost all of the vertices of a…