相关论文: On the fibration of augmented link complements
Given a prime, alternating link diagram, we build a special cover of the link complement whose degree is bounded by a factorial function of the crossing number. It follows that a subgroup of the link group of that index embeds into…
We give an explicit description of a fibration of the complement of the closure of a homogeneous braid, understanding how each fiber intersects every cross-section of $S^3$.
We develop technics of birational geometry to study automorphisms of affine surfaces admitting many distinct rational fibrations, with a particular focus on the interactions between automorphisms and these fibrations. In particular, we…
A fibration of graphs is an homomorphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. Recently, it has been shown that graph fibrations are useful…
Persistent homology is a tool that can be employed to summarize the shape of data by quantifying homological features. When the data is an object in $\mathbb{R}^d$, the (augmented) persistent homology transform ((A)PHT) is a family of…
We enumerate the connected graphs that contain a number of edges growing linearly with respect to the number of vertices. So far, only the first term of the asymptotics and a bound on the error were known. Using analytic combinatorics, ie…
We consider fibrations by affine lines on smooth affine surfaces obtained as complements of smooth rational curves $B$ in smooth projective surfaces $X$ defined over an algebraically closed field of characteristic zero. We observe that…
We conjecture recurrence relations satisfied by the degrees of some linearizable lattice equations. This helps to prove linear growth of these equations. We then use these recurrences to search for lattice equations that have linear growth…
The main result of the paper is a boundedness for $n$-complements on algebraic surfaces. In addition, applications of this theorem to a classification of log Del Pezzo surfaces and of birational contractions for 3-folds are formulated.
We study holomorphic symplectic manifolds which are fibred by abelian varieties. This structure is a higher dimensional analogue of an elliptic fibration on a K3 surface. We investigate when a holomorphic symplectic manifold is fibred in…
We prove fibration theorems \`a la Milnor for differentiable real maps with non isolated critical values. We study the situation for maps with linear discriminant, and prove that the concept of d-regularity is the key point for the…
The Linear Arboricity Conjecture asserts that the linear arboricity of a graph with maximum degree $\Delta$ is $\lceil (\Delta+1)/2 \rceil$. For a $2k$-regular graph $G$, this implies $la(G) = k+1$. In this note, we utilize a network flow…
In this note we prove that alternating chainmail links are L-space links. The proof is inspired by corresponding proofs for double branched covers of alternating links. We also more generally show that flat augmented chainmail links are…
In this paper, we study the large-scale structure of dense regular graphs. This involves the notion of robust expansion, a recent concept which has already been used successfully to settle several longstanding problems. Roughly speaking, a…
We introduce and develop the theory of spectral networks in real contact and symplectic topology. First, we establish the existence and pseudoholomorphic characterization of spectral networks for Lagrangian fillings in the cotangent bundle…
We discuss, on general grounds, how two subgraphs of a given Feynman graph can overlap with each other. For this, we use the notion of connecting and returning lines that describe how any subgraph is inserted within the original graph.…
We investigate the bounds on algebraic connectivity of graphs subject to constraints on the number of edges, vertices, and topology. We show that the algebraic connectivity for any tree on $n$ vertices and with maximum degree $d$ is bounded…
We review Heisenberg homology of configurations in once bounded surfaces and extend the construction to the regular thickening of a finite graph with ribbon structure.
In this paper, we present some new results describing connections between the spectrum of a regular graph and its generalized connectivity, toughness, and the existence of spanning trees with bounded degree.
Quantifying the influence of microscopic details on the dynamics of development of the overall structure of a filamentous network is important in a number of biologically relevant contexts, but it is not obvious what order parameters can be…