Related papers: A new solution for the two dimensional dimer probl…
In a graph, a perfect matching cut is an edge cut that is a perfect matching. Perfect Matching Cut (PMC) is the problem of deciding whether a given graph has a perfect matching cut, and is known to be NP-complete. We revisit the problem and…
Twin-width is a graph parameter introduced in the context of first-order model checking, and has since become a central parameter in algorithmic graph theory. While many algorithmic problems become easier on arbitrary classes of bounded…
Let $G$ be a connected graph with vertex set $V(G)=\{v_1,v_2,...,v_{\nu}\}$, which may have multiple edges but have no loops, and $2\leq d_G(v_i)\leq 3$ for $i=1,2,...,\nu$, where $d_G(v)$ denotes the degree of vertex $v$ of $G$. We show…
We continue our study of matrix models of dually weighted graphs. Among the attractive features of these models is the possibility to interpolate between ensembles of regular and random two-dimensional lattices, relevant for the study of…
The Euler-Poisson system is a fundamental two-fluid model to describe the dynamics of the plasma consisting of compressible electrons and a uniform ion background. In the 3D case Guo first constructed a global smooth irrotational solution…
The author gives an alternative and simple proof of the global existence of smooth solutions to the Cauchy problem for wave maps from the 1+2-dimensional Minkowski space to an arbitrary compact smooth Riemannian manifold without boundary,…
The combinatorial mutation of polygons, which transforms a given lattice polygon into another one, is an important operation to understand mirror partners for two-dimensional Fano manifolds, and the mutation-equivalent polygons give…
We present a new duality theory for non-convex variational problems, under possibly mixed Dirichlet and Neumann boundary conditions. The dual problem reads nicely as a linear programming problem, and our main result states that there is no…
A method for detecting and approximating fault lines or surfaces, respectively, or decision curves in two and three dimensions with guaranteed accuracy is presented. Reformulated as a classification problem, our method starts from a set of…
Our aim is to find a general approach to the theory of classical solutions of the Garnier system in $n$-variables, ${\cal G}_n$, based on the Riemann-Hilbert problem and on the geometry of the space of isomonodromy deformations. Our…
The decision problem of perfect matchings in uniform hypergraphs is famously an NP-complete problem. It has been shown by Keevash--Knox--Mycroft [STOC, 2013] that for every $\varepsilon>0$, such decision problem restricted to $k$-uniform…
We construct topological defects in two-dimensional classical lattice models and quantum chains. The defects satisfy local commutation relations guaranteeing that the partition function is independent of their path. These relations and…
We classify the Lie point symmetries for the 2+1 nonlinear generalized Kadomtsev-Petviashvili equation by determine all the possible f(u) functional forms where the latter depends. For each case the one-dimensional optimal system is…
We construct perfect t-embeddings for regular hexagons of the hexagonal lattice, providing the first example, and hence proving existence, for graphs with an outer face of degree greater than four. The construction is in terms of the…
Given an integer $k$ and a graph where every edge is colored either red or blue, the goal of the exact matching problem is to find a perfect matching with the property that exactly $k$ of its edges are red. Soon after Papadimitriou and…
In this paper, we study the relations between the numerical structure of the optimal solutions of a convex programming problem defined on the edge set of a simple graph and the stability number (i.e. the maximum size of a subset of pairwise…
Given two $k$-graphs $H$ and $F$, a perfect $F$-packing in $H$ is a collection of vertex-disjoint copies of $F$ in $H$ which together cover all the vertices in $H$. In the case when $F$ is a single edge, a perfect $F$-packing is simply a…
We study asymptotics of perfect matchings on a large class of graphs called the contracting square-hexagon lattice, which is constructed row by row from either a row of a square grid or a row of a hexagonal lattice. We assign the graph…
Perfect Matching-Cut is the problem of deciding whether a graph has a perfect matching that contains an edge-cut. We show that this problem is NP-complete for planar graphs with maximum degree four, for planar graphs with girth five, for…
The notion of duality -- that a given physical system can have two different mathematical descriptions -- is a key idea in modern theoretical physics. Establishing a duality in lattice statistical mechanics models requires the construction…