Related papers: Blow-up trick in Combinatorics
In here, I present a series of combinatorial equalities derived using a graph based approach. Different nodes in the graphs are visited following probabilistic dynamics of a moving dot. The results are presented in such a way that the…
Blowups of vorticity for the three- and two- dimensional homogeneous Euler equations are studied. Two regimes of approaching a blowup points, respectively, with variable or fixed time are analysed. It is shown that in the $n$-dimensional…
Bidirected graphs are a common generalisation of directed graphs where arcs can also be incoming to both their incident nodes, or outgoing from both their incident nodes. Such arcs allow a walk to change direction. Some algorithms can…
A matching of a graph is a subset of edges no two of which share a common vertex, and a maximum matching is a matching of maximum cardinality. In a $b$-matching every vertex $v$ has an associated bound $b_v$, and a maximum $b$-matching is a…
For a nonlinear diffusion equation on graphs whose nonlinearity violates the Lipschitz condition, we prove short-time solution existence and characterize global well-posedness by establishing sufficient criteria for blow-up phenomena and…
Double-pushout rewriting is an established categorical approach to the rule-based transformation of graphs and graph-like objects. One of its standard results is the construction of concurrent rules and the Concurrency Theorem pertaining to…
A graph is a split graph if its vertex set can be partitioned into a clique and a stable set. A split graph is unbalanced if there exist two such partitions that are distinct. Cheng, Collins and Trenk (2016), discovered the following…
Gluing is a cut and paste construction where the dynamics of a map in a given domain is replaced by a different one, under the condition that the two agree along the gluing curve. Here we consider two polynomials with a finite…
We analyze the blowup (finite-time singularity) in inviscid shell models of convective turbulence. We show that the blowup exists and its internal structure undergoes a series of bifurcations under a change of shell model parameter. Various…
The edge blow-up of a graph $F$ is the graph obtained from replacing each edge in $F$ by a clique of the same size where the new vertices of the cliques are all different. In this article, we concern about the Tur\'an problem for the edge…
We extend the formula for the Chern classes of blow-ups of algebraic varieties due to Porteous and Lascu-Scott, and of symplectic and complex manifolds due to Geiges and Pasquotto, to the blow-ups of almost complex manifolds. Our approach…
Graph matching, also known as network alignment, refers to finding a bijection between the vertex sets of two given graphs so as to maximally align their edges. This fundamental computational problem arises frequently in multiple fields…
The existence of stable periodic orbits and chaotic invariant sets of singularly perturbed problems of fast-slow type having Bogdanov-Takens bifurcation points in its fast subsystem is proved by means of the geometric singular perturbation…
Graph embedding aims at learning a vector-based representation of vertices that incorporates the structure of the graph. This representation then enables inference of graph properties. Existing graph embedding techniques, however, do not…
In graph theory a partition of the vertex set of a graph is called equitable if for all pairs of cells all vertices in one cell have an equal number of neighbours in the other cell. Considering the implications for the adjacency matrix one…
In this paper we consider a system of equations that describes a class of mass-conserving aggregation phenomena, including gravitational collapse and bacterial chemotaxis. In spatial dimensions strictly larger than two, and under the…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
We study a random graph model in continuous time. Each vertex is partially copied with the same rate, i.e.\ an existing vertex is copied and every edge leading to the copied vertex is copied with independent probability $p$. In addition,…
In card-based cryptography, a deck of physical cards is used to achieve secure computation. A shuffle, which randomly permutes a card-sequence along with some probability distribution, ensures the security of a card-based protocol. The…
We tackle the problem of graph transformation with a particular focus on node cloning. We propose a new approach to graph rewriting where nodes can be cloned zero, one or more times. A node can be cloned together with all its incident…