Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userLaminations of a graph on a pair of pants
56
0
0.0
(
0
)
Authors
Sanjay Ramassamy
Ask ChatGPT about the research
No Arabic abstract
A lamination of a graph embedded on a surface is a collection of pairwise disjoint non-contractible simple closed curves drawn on the graph. In the case when the surface is a sphere with three punctures (a.k.a. a pair of pants), we first identify the lamination space of a graph embedded on that surface as a lattice polytope, then we characterize the polytopes that arise as the lamination space of some graph on a pair of pants. This characterizes the image of a purely topological version of the spectral map for the vector bundle Laplacian for a flat connection on a pair of pants. The proof uses a graph exploration technique akin to the peeling of planar maps.
rate research
Read More
We resolve the fate of the two original apparent horizons during the head-on merger of two non-spinning black holes, showing that these horizons exist for a finite amount of time before they individually turn around and move backward in time. This completes the understanding of the pair of pants diagram for the apparent horizon. Our result is facilitated by a new method for locating marginally outer trapped surfaces (MOTSs) based on a generalized shooting method. We also discuss the role played by the MOTS stability operator in discerning which among a multitude of MOTSs should be considered as black hole boundaries.
Using tropical geometry, Mikhalkin has proved that every smooth complex hypersurface in $mathbb{CP}^{n+1}$ decomposes into pairs of pants: a pair of pants is a real compact $2n$-manifold with cornered boundary obtained by removing an open regular neighborhood of $n+2$ generic hyperplanes from $mathbb{CP}^n$. As is well-known, every compact surface of genus $ggeqslant 2$ decomposes into pairs of pants, and it is now natural to investigate this construction in dimension 4. Which smooth closed 4-manifolds decompose into pairs of pants? We address this problem here and construct many examples: we prove in particular that every finitely presented group is the fundamental group of a 4-manifold that decomposes into pairs of pants.
It is well-known that the Pachner graph of $n$-vertex triangulated $2$-spheres is connected, i.e., each pair of $n$-vertex triangulated $2$-spheres can be turned into each other by a sequence of edge flips for each $ngeq 4$. In this article, we study various induced subgraphs of this graph. In particular, we prove that the subgraph of $n$-vertex flag $2$-spheres distinct from the double cone is still connected. In contrast, we show that the subgraph of $n$-vertex stacked $2$-spheres has at least as many connected components as there are trees on $lfloorfrac{n-5}{3}rfloor$ nodes with maximum node-degree at most four.
The principal ratio of a connected graph $G$, $gamma(G)$, is the ratio between the largest and smallest coordinates of the principal eigenvector of the adjacency matrix of $G$. Over all connected graphs on $n$ vertices, $gamma(G)$ ranges from $1$ to $n^{cn}$. Moreover, $gamma(G)=1$ if and only if $G$ is regular. This indicates that $gamma(G)$ can be viewed as an irregularity measure of $G$, as first suggested by Tait and Tobin (El. J. Lin. Alg. 2018). We are interested in how stable this measure is. In particular, we ask how $gamma$ changes when there is a small modification to a regular graph $G$. We show that this ratio is polynomially bounded if we remove an edge belonging to a cycle of bounded length in $G$, while the ratio can jump from $1$ to exponential if we join a pair of vertices at distance $2$. We study the connection between the spectral gap of a regular graph and the stability of its principal ratio. A naive bound shows that given a constant multiplicative spectral gap and bounded degree, the ratio remains polynomially bounded if we add or delete an edge. Using results from matrix perturbation theory, we show that given an additive spectral gap greater than $(2+epsilon)sqrt{n}$, the ratio stays bounded after adding or deleting an edge.
For a graph whose vertex set is a finite set of points in $mathbb R^d$, consider the closed (open) balls with diameters induced by its edges. The graph is called a (an open) Tverberg graph if these closed (open) balls intersect. Using the idea of halving lines, we show that (i) for any finite set of points in the plane, there exists a Hamiltonian cycle that is a Tverberg graph; (ii) for any $n$ red and $n$ blue points in the plane, there exists a perfect red-blue matching that is a Tverberg graph. Using the idea of infinite descent, we prove that (iii) for any even set of points in $mathbb R^d$, there exists a perfect matching that is an open Tverberg graph; (iv) for any $n$ red and $n$ blue points in $ mathbb R^d $, there exists a perfect red-blue matching that is a Tverberg graph.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
