Related papers: A Diagrammatic Equation for Oriented Planar Graphs

Graph isomorphism problem is a known hard problem. In this paper, a novel randomized algorithm is proposed for this problem which is very simple and fast. It solves the graph isomorphism problem with running time O(n^2.373) for any pair of…

The conformal mapping approach is a well established technique for solving the Euler equations for potential flows with one spatial dimension. In this work, we extend this framework to problems with a weakly transversal dependence and, by…

In Gurau and Keppler 2022 (arXiv:2207.01993), a relation between orthogonal and symplectic tensor models with quartic interactions was proven. In this paper, we provide an alternative proof that extends to polynomial interactions of…

We give two algorithms to compute linear determinantal representations of smooth plane curves of any degree over any field. As particular examples, we explicitly give representatives of all equivalence classes of linear determinantal…

Mathematical modeling of gravitating configurations of physical fields is one of the priority directions of the modern theory of gravity. Most of the exact solutions constructed within the framework of the general relativity are static or…

In this paper we establish new renormalized oscillation theorems for discrete symplectic eigenvalue problems with Dirichlet boundary conditions. These theorems present the number of finite eigenvalues of the problem in arbitrary interval…

For a planar directed graph G, Postnikov's boundary measurement map sends positive weight functions on the edges of G onto the appropriate totally nonnegative Grassmann cell. We establish an explicit formula for Postnikov's map by…

We show that solving planning domains on binary variables with polytree causal graph is \NP-complete. This is in contrast to a polynomial-time algorithm of Domshlak and Brafman that solves these planning domains for polytree causal graphs…

This paper surveys some combinatorial aspects of Smith normal form, and more generally, diagonal form. The discussion includes general algebraic properties and interpretations of Smith normal form, critical groups of graphs, and Smith…

A plane graph is called a rectangular graph if each of its edges can be oriented either horizontally or vertically, each of its interior regions is a four-sided region and all interior regions can be fitted in a rectangular enclosure. Only…

We use the order complex corresponding to a symmetric matrix (defined by Giusti et al in 2015). In this note, we use it to define a class of models of random graphs, and show some surprising experimental results, showing sharp phase…

We present an algorithm that computes the girth of the intersection graph of $n$ given line segments in the plane in $O(n^{1.483})$ expected time. This is the first such algorithm with $O(n^{3/2-\varepsilon})$ running time for a positive…

An unsteady problem is considered for a space-fractional equation in a bounded domain. A first-order evolutionary equation involves the square root of an elliptic operator of second order. Finite element approximation in space is employed.…

We initiate a systematic study of non-planar on-shell diagrams in N=4 SYM and develop powerful technology for doing so. We introduce canonical variables generalizing face variables, which make the dlog form of the on-shell form explicit. We…

We present a numerical scheme that can be combined with any fixed boundary finite element based Poisson or Grad-Shafranov solver to compute the first and second partial derivatives of the solution to these equations with the same order of…

In this paper, we devise a scheme for kernelizing, in sublinear space and polynomial time, various problems on planar graphs. The scheme exploits planarity to ensure that the resulting algorithms run in polynomial time and use O((sqrt(n) +…

Given a graph G and k pairs of vertices (s_1,t_1), ..., (s_k,t_k), the k-Vertex-Disjoint Paths problem asks for pairwise vertex-disjoint paths P_1, ..., P_k such that P_i goes from s_i to t_i. Schrijver [SICOMP'94] proved that the…

We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an $n$-vertex planar graph and two planar straight-line drawings of the graph…

Traditional representations of graphs and their duals suggest the requirement that the dual vertices be placed inside their corresponding primal faces, and the edges of the dual graph cross only their corresponding primal edges. We consider…

Subexponential parameterized algorithms are known for a wide range of natural problems on planar graphs, but the techniques are usually highly problem specific. The goal of this paper is to introduce a framework for obtaining…