相关论文: Roots of Dehn twists about separating curves

Let De_n be the simplicial complex of squarefree positive integers less than or equal to n ordered by divisibility. It is known that the asymptotic rate of growth of its Euler characteristic (the Mertens function) is closely related to deep…

We generalize a theorem of D. Rohrlich concerning root numbers of elliptic curves over the field of rational numbers. Our result applies to curves of all higher genera over number fields. Namely, under certain conditions which naturally…

Let $N_{g}$ denote the closed non-orientable surface of genus $g$ and let ${\mathcal M} _g$ denote the mapping class group of $N_{g}$. Let ${\mathcal T} _g$ denote the twist subgroup of ${\mathcal M} _g$ which is the subgroup of ${\mathcal…

Graph matching aims to find the latent vertex correspondence between two edge-correlated graphs and has found numerous applications across different fields. In this paper, we study a seeded graph matching problem, which assumes that a set…

In this work we consider a given root of a family of n-degree polynomials as a one-variable function that depends only on the independent term. Then we prove that this function satisfies several ordinary differential equations (ODE). More…

Seeds of sunflowers are often modelled by the map $n\longmapsto \varphi_\theta(n)=\sqrt{n}e^{2i\pi n\theta}$ leading to a roughly uniform repartition with two consecutive seeds separated by the divergence angle $2\pi\theta$ for $\theta$ the…

A configuration of pebbles on the vertices of a graph is solvable if one can place a pebble on any given root vertex via a sequence of pebbling steps. The pebbling number of a graph G is the minimum number pi(G) so that every configuration…

A treedepth decomposition of an undirected graph $G$ is a rooted forest $F$ on the vertex set of $G$ such that every edge $uv\in E(G)$ is in ancestor-descendant relationship in $F$. Given a weight function $w\colon V(G)\rightarrow…

Phylogenetic networks are rooted, labelled directed acyclic graphs which are commonly used to represent reticulate evolution. There is a close relationship between phylogenetic networks and multi-labelled trees (MUL-trees). Indeed, any…

We characterize classes of graphs closed under taking vertex-minors and having no $P_n$ and no disjoint union of $n$ copies of the $1$-subdivision of $K_{1,n}$ for some $n$. Our characterization is described in terms of a tree of radius $2$…

Let $\Sigma$ be a compact oriented surface. The Dehn twist along every simple closed curve $\gamma \subset \Sigma$ induces an automorphism of the fundamental group $\pi$ of $\Sigma$. There are two possible ways to generalize such…

The Dehn function measures the area of minimal discs that fill closed curves in a space; it is an important invariant in analysis, geometry, and geometric group theory. There are several equivalent ways to define the Dehn function, varying…

In the critical beta-splitting model of a random $n$-leaf rooted tree, clades are recursively (from the root) split into sub-clades, and a clade of $m$ leaves is split into sub-clades containing $i$ and $m-i$ leaves with probabilities…

An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph $G$, denoted by $rc(G)$, is the smallest number of colors that…

Let $X$ be a Hausdorff compact space and $C(X)$ be the algebra of all continuous complex-valued functions on $X$, endowed with the supremum norm. We say that $C(X)$ is (approximately) $n$-th root closed if any function from $C(X)$ is…

This article provides a decidable criterion for when a subgroup of Out(Fr) generated by two Dehn twists consists entirely of polynomially growing elements, answering an earlier question of the author.

A rooted tree $\vec{R}$ is a rooted subtree of a tree $T$ if the tree obtained by replacing the directed edges of $\vec{R}$ by undirected edges is a subtree of $T$. We study the problem of assigning minimum number of colors to a given set…

We study structural properties of trees grown by preferential attachment. In this mechanism, nodes are added sequentially and attached to existing nodes at a rate that is strictly proportional to the degree. We classify nodes by their depth…

We obtain a finite generating set for the level 2 twist subgroup of the mapping class group of a closed non-orientable surface. The generating set consists of crosscap pushing maps along non-separating two-sided simple loops and squares of…

Let X be a normal affine algebraic variety with regular action of a torus \TT and T\subset\TT be a subtorus. We prove that each root of X with respect to T can be obtained by restriction of some root of X with respect to \TT. This allows to…