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

We study the regularity of the roots of complex monic polynomials $P(t)$ of fixed degree depending smoothly on a real parameter $t$. We prove that each continuous parameterization of the roots of a generic $C^\infty$ curve $P(t)$ (which…

The paper considers the behaviour of the number of paths of length $N$ on graphs with two heavy roots. Such vertices can be entropic traps. Numerical analysis is carried out for graphs with different degrees of root vertices. In the…

For every polynomial f of degree n with no double roots, there is an associated family C(f) of harmonic algebraic curves, fibred over the circle, with at most n-1 singular fibres. We study the combinatorial topology of C(f) in the generic…

We give new upper bounds on the stable commutator lengths of Dehn twists in mapping class groups and new lower bounds on the stable commutator lengths of Dehn twists in hyperelliptic mapping class groups. In particular, we show that the…

Deligne cohomology can be viewed as a differential refinement of integral cohomology, hence captures both topological and geometric information. On the other hand, it can be viewed as the simplest nontrivial version of a differential…

The generalized Dehn twist along a closed curve in an oriented surface is an algebraic construction which involves intersections of loops in the surface. It is defined as an automorphism of the Malcev completion of the fundamental group of…

A $(\delta\geq k_1,\delta\geq k_2)$-partition of a graph $G$ is a vertex-partition $(V_1,V_2)$ of $G$ satisfying that $\delta(G[V_i])\geq k_i$ for $i=1,2$. We determine, for all positive integers $k_1,k_2$, the complexity of deciding…

We describe a subdivision algorithm for isolating the complex roots of a polynomial $F\in\mathbb{C}[x]$. Given an oracle that provides approximations of each of the coefficients of $F$ to any absolute error bound and given an arbitrary…

Degree one twisting of Deligne cohomology, as a differential refinement of integral cohomology, was established in previous work. Here we consider higher degree twists. The Rham complex, hence de Rham cohomology, admits twists of any odd…

An identifying code $C$ of a graph $G$ is a dominating set of $G$ such that any two distinct vertices of $G$ have distinct closed neighbourhoods within $C$. These codes have been widely studied for over two decades. We give an improvement…

We give a small generating set for the twist subgroup of the mapping class group of a non-orientable surface by Dehn twists. The difference between the number of the generators and a lower bound of numbers of generators for the twist…

Let $k$ be an algebraically closed field of characteristic $p>0$ and $C$ a connected nonsingular projective curve over $k$ with genus $g \geq 2$. This paper continues the work begun by Lehr and Matignon, namely the study of "big actions",…

We introduce an operation that measures the self intersections of paths on a surface. As applications, we give a criterion of the realizability of a generalized Dehn twist, and derive a geometric constraint on the image of the Johnson…

We give a new improvement over Newton's method for root-finding, when the function in question is doubly differentiable. It generally exhibits faster and more reliable convergence. It can be also be thought of as a correction to Halley's…

This note is devoted to a trick which yields almost trivial proofs that certain complexes associated to topological surfaces are connected or simply connected. Applications include new proofs that the complexes of curves, separating curves,…

We provide a new approach to studying the moduli space of curves via Morse theory and hyperbolic geometry, by introducing a family of Morse functions on the moduli space $\overline{\mathcal{M}}_{g,n}$ of stable curves of genus $g$ with $n$…

Fix a sequence c=(c_1,...,c_n) of non-negative integers with sum n-1. We say a rooted tree T has child sequence c if it is possible to order the nodes of T as v_1,...,v_n so that for each 1 <= i <= n, v_i has exactly c_i children. Let T be…

We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…

We establish tight lower and upper bounds on the number of edges in traceable graphs in several classes of dense graphs. A graph is traceable if it has a Hamiltonian path. We show that the bound is: - quadratic for the class of graphs of…

We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some point it had at least r active neighbors, for a threshold r…