Related papers: On singularity confinement for the pentagram map
A meromorphic quadratic differential on a compact Riemann surface defines a complex projective structure away from the poles via the Schwarzian equation. In this article we first prove the analogue of Thurston's Grafting Theorem for the…
Positive geometries were introduced by Arkani-Hamed--Bai--Lam as a method of computing scattering amplitudes in theoretical physics. We show that a positive geometry from a polytope admits a log resolution of singularities to another…
We characterize all permutations which realize as the $z$-monodromies of faces in connected simple finite graphs embedded in surfaces whose duals are also simple.
There are several approaches to study occurrences of consecutive patterns in permutations such as the inclusion-exclusion method, the tree representations of permutations, the spectral approach and others. We propose yet another approach to…
The pseudo-integrable barrier billiard invented by Hannay and McCraw [J. Phys. A 23, 887 (1990)] -- rectangular billiard with line-segment barrier placed on a symmetry axis -- is generalized. It is proven that the flow on invariant surfaces…
The notion of monodromy was introduced by J. J. Duistermaat as the first obstruction to the existence of global action coordinates in integrable Hamiltonian systems. This invariant was extensively studied since then and was shown to be…
We study a class of complex polynomial equations on a finite graph with a view to understanding how holistic phenomena emerge from combinatorial structure. Particular solutions arise from orthogonal projections of regular polytopes,…
If a graph $G_M$ is embedded into a closed surface $S$ such that $S \backslash G_M$ is a collection of disjoint open discs, then $M=(G_M,S)$ is called a {\em map}. A {\em zigzag} in a map $M$ is a closed path which alternates choosing, at…
We prove that any weakly triholomorphic map from a compact hyperk\"ahler surface to an algebraic K3 surface defined by a homogeneous polynomial of degree 4 in $\mathbb{C}P^3$ has only isolated singularities.
We study the problem of reconfiguring odd matchings, that is, matchings that cover all but a single vertex. Our reconfiguration operation is a so-called flip where the unmatched vertex of the first matching gets matched, while consequently…
We classify combinations of isolated singularities that can occur on complex cubic threefolds generalizing analogous results for cubic surfaces due to Schl\"{a}fli and Bruce--Wall. In addition, we provide concise combinatorial description…
We present an exact and complete algorithm to isolate the real solutions of a zero-dimensional bivariate polynomial system. The proposed algorithm constitutes an elimination method which improves upon existing approaches in a number of…
This is a short note that explains a problem on polynomial maps over finite fields for non-experts. The problem is: Do there exist odd polynomial automorphisms over the finite fields with 4,8,16,32,64,... elements? The explanation is very,…
It is well-known that every 3-connected planar graph has a unique planar embedding on the sphere. We study the extension to triangulated 1-planar graphs, T1P graphs for short, which admit an embedding in which each edge is crossed at most…
A combinatorial tiling of the sphere is naturally given by an embedded graph. We study the case that each tile has exactly five edges, with the ultimate goal of classifying combinatorial tilings of the sphere by geometrically congruent…
Random contractions (sub-unitary random matrices) appear naturally when considering quantized chaotic maps within a general theory of open linear stationary systems with discrete time. We analyze statistical properties of complex…
The random $2$-dimensional simplicial complex process starts with a complete graph on $n$ vertices, and in every step a new $2$-dimensional face, chosen uniformly at random, is added. We prove that with probability tending to $1$ as…
We study the isolated partial Hadamard matrices, under the assumption that the entries are roots of unity, or more generally, under the assumption that the combinatorics comes from vanishing sums of roots of unity. We first review the…
The combinatorial structure of a d-dimensional simple convex polytope can be reconstructed from its abstract graph [Blind & Mani 1987, Kalai 1988]. However, no polynomial/efficient algorithm is known for this task, although a polynomially…
We examine a family of 3-point mappings that include mappings solvable through linearization. The different origins of mappings of this type are examined: projective equations and Gambier systems. The integrable cases are obtained through…