相关论文: Grid polygons from permutations and their enumerat…

Graph kernels are kernel methods measuring graph similarity and serve as a standard tool for graph classification. However, the use of kernel methods for node classification, which is a related problem to graph representation learning, is…

By a poly-line drawing of a graph G on n vertices we understand a drawing of G in the plane such that each edge is represented by a polygonal arc joining its two respective vertices. We call a turning point of a polygonal arc the bend. We…

A fusion boundary-plasma domain is defined by axisymmetric magnetic surfaces where the geometry is often complicated by the presence of one or more X-points; and modeling boundary plasmas usually relies on computational grids that account…

A linear Gr-category is a category of finite-dimensional vector spaces graded by a finite group together with natural tensor product. We classify the braided monoidal structures of a class of linear Gr-categories via explicit computations…

Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones in parameterized complexity, namely the Graph Minors Project, color coding, and the recent development of techniques for obtaining kernelization…

Venn diagrams are a graphical way to represent a set system. Each of the n sets is represented by a simple closed curve. The n curves subdivide the plane into 2^n open connected regions, each of which represents the intersection of its…

We study the problem of simultaneous geometric embedding of two paths without self-intersections on an integer grid. We show that minimizing the length of the longest edge of such an embedding is NP-hard. We also show that we can minimize…

A permutation of the elements of a graph is a {\it construction sequence} if no edge is listed before either of its endpoints. The complexity of such a sequence is investigated by finding the delay in placing the edges, an {\it opportunity…

Polygon representation learning is essential for diverse applications, encompassing tasks such as shape coding, building pattern classification, and geographic question answering. While recent years have seen considerable advancements in…

A method of modeling data with gaps by a sequence of curves has been developed. The new method is a generalization of iterative construction of singular expansion of matrices with gaps. Under discussion are three versions of the method…

This paper is the second part of a two-part paper investigating the structure and properties of dyadic polygons. A dyadic polygon is the intersection of the dyadic subplane $D^2$ of the real plane $R^2$ and a real convex polygon with…

Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…

Sudoku grids can be thought of as graphs where the vertices are the squares of the grid, and edges join vertices in the same row, column, or sub-grid. A Sudoku puzzle corresponds to a partial proper coloring of the Sudoku graph. We provide…

Geometric torsions are torsions of acyclic complexes of vector spaces which consist of differentials of geometric quantities assigned to the elements of a manifold triangulation. We use geometric torsions to construct invariants for a…

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objects naturally generalizes the class of disks, lines, ellipsoids, and even convex polygons. We consider geometric…

The coordinate projective line over a field is seen as a groupoid with a further `projection' structure. We investigate conversely to what extent such an, abstractly given, groupoid may be coordinatized by a suitable field constructed out…

Untangling is a process in which some vertices of a planar graph are moved to obtain a straight-line plane drawing. The aim is to move as few vertices as possible. We present an algorithm that untangles the cycle graph C_n while keeping at…

An enumeration kernel as defined by Creignou et al. [Theory Comput. Syst. 2017] for a parameterized enumeration problem consists of an algorithm that transforms each instance into one whose size is bounded by the parameter plus a…

Polygons are compound geometric objects, but when trying to understand the expected behavior of a large collection of random polygons -- or even to formalize what a random polygon is -- it is convenient to interpret each polygon as a point…

We investigate edge-intersection graphs of paths in the plane grid, regarding a parameter called the bend-number. I.e., every vertex is represented by a grid path and two vertices are adjacent if and only if the two grid paths share at…