相关论文: Lower Bound For Dilatations

We obtain new topological information about the local structure of collapsing under a lower sectional curvature bound. As an application we prove a new sphere theorem and obtain a partial result towards the conjecture that not every…

We investigate the structure of the characteristic polynomial det(xI-T) of a transition matrix T that is associated to a train track representative of a pseudo-Anosov map [F] acting on a surface. As a result we obtain three new polynomial…

We introduce a new technique, based on Gaussian maps, to study the possibility, for a given surface, to lie on a threefold as a very ample divisor with given normal bundle. We give several applications, among which one to surfaces of…

Let $M =\mathbb{H}^3/\Gamma$ be a finite-volume, noncompact hyperbolic 3-manifold. We show that the number of quasi-Fuchsian surface subgroups of $\Gamma$ (up to conjugacy and commensurability) of genus at most $g$ is bounded both above and…

Let $F',F$ be any two closed orientable surfaces of genus $g'>g\ge 1$, and $f:F\to F$ be any pseudo-Anosov map. Then we can "extend" $f$ to be a pseudo-Anosov map $f':F'\to F'$ so that there is a fiber preserving degree one map $M(F',f')\to…

Recently, Korkmaz established the lower bound of $3g - 2$ for the dimension of a faithful representation of the mapping class group of an orientable surface of genus $g \ge 3$. We raise this bound to $4g - 3$ in the setting of surfaces of…

In this paper we prove genus bounds for closed embedded minimal surfaces in a closed 3-dimensional manifold constructed via min-max arguments. A stronger estimate was announced by Pitts and Rubistein but to our knowledge its proof has never…

Let G be a subgraph-closed graph class with bounded maximum degree. We show that if G has balanced separators whose size is smaller than linear by a polynomial factor, then G has subexponential expansion. This gives a partial converse to a…

The doubly slice genus of a knot in the 3-sphere is the minimal genus among unknotted orientable surfaces in the 4-sphere for which the knot arises as a cross-section. We use the classical signature function of the knot to give a new lower…

We construct $n$-node graphs on which any $O(n)$-size spanner has additive error at least $+\Omega(n^{3/17})$, improving on the previous best lower bound of $\Omega(n^{1/7})$ [Bodwin-Hoppenworth FOCS '22]. Our construction completes the…

We define a generalization of Coxeter graphs and an associated Coxeter system and Coxeter mapping class. These can be used to construct periodic Coxeter mapping classes on surfaces with arbitrarily large genus, preserving lots of…

Consider a sequence of closed, orientable surfaces of fixed genus $g$ in a Riemannian manifold $M$ with uniform upper bounds on mean curvature and area. We show that on passing to a subsequence and choosing appropriate parametrisations, the…

We consider maps on genus-$g$ surfaces with $n$ (labeled) faces of prescribed even degrees. It is known since work of Norbury that, if one disallows vertices of degree one, the enumeration of such maps is related to the counting of lattice…

In this paper we improve the lower bound of Chatterjee et al.\ (ECCC 2019) to an $\Omega(n^2)$ lower bound for unlayered Algebraic Branching Programs. We also study the impact layerization has on Algebraic Branching Programs. We exhibit a…

We provide a new lower bound on the number of $(\leq k)$-edges of a set of $n$ points in the plane in general position. We show that for $0 \leq k \leq\lfloor\frac{n-2}{2}\rfloor$ the number of $(\leq k)$-edges is at least $$ E_k(S) \geq…

The Links-Gould invariant of links $LG^{2,1}$ is a two-variable generalization of the Alexander-Conway polynomial. Using representation theory of $U_{q}\mathfrak{gl}(2 \vert 1)$, we prove that the degree of the Links-Gould polynomial…

The $\textit{planar slope number}$ $psn(G)$ of a planar graph $G$ is the minimum number of edge slopes in a planar straight-line drawing of $G$. It is known that $psn(G) \in O(c^\Delta)$ for every planar graph $G$ of maximum degree…

We obtain improved lower bounds for additive spanners, additive emulators, and diameter-reducing shortcut sets. Spanners and emulators are sparse graphs that approximately preserve the distances of a given graph. A shortcut set is a set of…

We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and…

The bondage number $b(G)$ of a graph $G$ is the smallest number of edges whose removal from $G$ results in a graph with larger domination number. Recently Gagarin and Zverovich showed that, for a graph $G$ with maximum degree $\Delta(G)$…