Related papers: Blow-up trick in Combinatorics
Consider a plane branch, that is, an irreducible germ of curve on a smooth complex analytic surface. We define its blow-up complexity as the number of blow-ups of points necessary to achieve its minimal embedded resolution. We show that…
Graph burning is a discrete time process which can be used to model the spread of social contagion. One is initially given a graph of unburned vertices. At each round (time step), one vertex is burned; unburned vertices with at least one…
Graph convolutions have gained popularity due to their ability to efficiently operate on data with an irregular geometric structure. However, graph convolutions cause over-smoothing, which refers to representations becoming more similar…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Graph learning methods have recently been receiving increasing interest as means to infer structure in datasets. Most of the recent approaches focus on different relationships between a graph and data sample distributions, mostly in…
Graph Neural Networks (GNNs) have received increasing attention due to their ability to learn from graph-structured data. However, their predictions are often not interpretable. Post-hoc instance-level explanation methods have been proposed…
We study the equational theory of the Weihrauch lattice with multiplication, meaning the collection of equations between terms built from variables, the lattice operations $\sqcup$, $\sqcap$, the product $\times$, and the finite…
Correlation clustering provides a method for separating the vertices of a signed graph into the optimum number of clusters without specifying that number in advance. The main goal in this type of clustering is to minimize the number of…
Graph pebbling is a game played on a connected graph G. A player purchases pebbles at a dollar a piece, and hands them to an adversary who distributes them among the vertices of G (called a configuration) and chooses a target vertex r. The…
The Burling sequence is a sequence of triangle-free graphs of increasing chromatic number. Each of them is isomorphic to the intersection graph of a set of axis-parallel boxes in $R^3$. These graphs were also proved to have other…
In this paper we discuss reconstruction problems for graphs. We develop some new ideas like isomorphic extension of isomorphic graphs, partitioning of vertex sets into sets of equivalent points, subdeck property, etc. and develop an…
This article shall serve as a quick reference for somebody who needs precise information on concepts and results related to resolution of singularities. As such, it is more a technical manual than a bedtime story. Topics which are covered:…
\textsc{Cops and Robber} is a game played on graphs where a set of \textit{cops} aim to \textit{capture} the position of a single \textit{robber}. The main parameter of interest in this game is the \textit{cop number}, which is the minimum…
Building on recently established enumerative connections between lambda calculus and the theory of embedded graphs (or "maps"), this paper develops an analogy between typing (of lambda terms) and coloring (of maps). Our starting point is…
We introduce the cohomological blow up of a graded Artinian Gorenstein (AG) algebra along a surjective map, which we term BUG (Blow Up Gorenstein) for short. This is intended to translate to an algebraic context the cohomology ring of a…
This work connects the idea of a "blow-up" of a quiver with that of injectivity, showing that for a class of monic maps $\Phi$, a quiver is $\Phi$-injective if and only if all blow-ups of it are as well. This relationship is then used to…
In this paper we address the problem of computing $\text{deg}(f^n)$, the degrees of iterates of a birational map $f:\mathbb{P}^N\rightarrow\mathbb{P}^N$. For this goal, we develop a method based on two main ingredients: the factorization of…
Graph pooling is a crucial operation for encoding hierarchical structures within graphs. Most existing graph pooling approaches formulate the problem as a node clustering task which effectively captures the graph topology. Conventional…
Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise…
The foldings of a connected graph $G$ are defined as follows. First, $G$ is a folding of itself. Let $G'$ be a graph obtained from $G$ by identifying two vertices at distance 2 in $G$. Then every folding of $G'$ is a folding of $G$. The…