Related papers: Algebraic degrees of stretch factors in mapping cl…

In this article, we continue the study of the action of subgroups of the mapping class group on the $SU(2)$-character variety. We prove the existence of a mapping class subgroup on the surface of genus $2$, containing infinitely many…

It is known that any planar graph with diameter D has treewidth O(D), and this fact has been used as the basis for several planar graph algorithms. We investigate the extent to which similar relations hold in other graph families. We show…

For each $m\ge 1$ and $p>2$ we characterize bounded simply connected Sobolev $L^m_p$-extension domains $\Omega\subset R^2$. Our criterion is expressed in terms of certain intrinsic subhyperbolic metrics in $\Omega$. Its proof is based on a…

For an undirected unweighted graph G = (V, E) with n vertices and m edges, let d(u, v) denote the distance from u in V to v in V in G. An (alpha, beta)-stretch approximate distance oracle (ADO) for G is a data structure that, given u, v in…

We show that, for any integer k > 5, the Sparse-Yao graph YY_{6k} (also known as Yao-Yao) is a spanner with stretch factor 11.67. The stretch factor drops down to 4.75 for k > 7.

The number of topologically different plane real algebraic curves of a given degree $d$ has the form $\exp(C d^2 + o(d^2))$. We determine the best available upper bound for the constant $C$. This bound follows from Arnold inequalities on…

We prove a strong general-purpose bound for the diameter of a finite group depending only on the diameters of its composition factors and the maximal exponent of a normal abelian section. There are a number of notable applications: (1) if…

For a connected graph $G$, let $\mu(G)$ denote the distance spectral radius of $G$. A matching in a graph $G$ is a set of disjoint edges of $G$. The maximum size of a matching in $G$ is called the matching number of $G$, denoted by…

Let CMSO denote the counting monadic second order logic of graphs. We give a constructive proof that for some computable function $f$, there is an algorithm $\mathfrak{A}$ that takes as input a CMSO sentence $\varphi$, a positive integer…

Suppose $S$ is a surface of genus $\ge 2 $, $f: S \to S$ is a surface homeomorphism isotopic to a pseudo-Anosov map $\alpha$ and suppose $\ti S$ is the universal cover of $S$ and $F$ and $A$ are lifts of $f$ and $\alpha$ respectively. We…

A $t$-spanner of a graph $G$ is a subgraph $H$ in which all distances are preserved up to a multiplicative $t$ factor. A classical result of Alth\"ofer et al. is that for every integer $k$ and every graph $G$, there is a $(2k-1)$-spanner of…

It was recently proved that every planar graph is a subgraph of the strong product of a path and a graph with bounded treewidth. This paper surveys generalisations of this result for graphs on surfaces, minor-closed classes, various…

Let $\mathcal{A}$ be an abelian length category containing a $d$-cluster tilting subcategory $\mathcal{M}$. We prove that a subcategory of $\mathcal{M}$ is a $d$-torsion class if and only if it is closed under $d$-extensions and…

Suppose for closed surfaces $M,N$ there exists a continuous map $f:M\to N$ of geometric degree $d>0$. Then $\chi(M)\le d\cdot\chi(N)$. This inequality was first proved by Kneser in case of orientable surfaces and by Edmonds for arbitrary…

We show that any pseudo-Anosov map that is a lift of pseudo-Anosov homeomorphism of a nonorientable surface has vanishing SAF invariant. We also provide a criterion to certify that a pseudo-Anosov map is not such a lift.

We characterise smooth curves in a smooth cubic threefold whose blow-ups produce a weak-Fano threefold. These are curves $C$ of genus $g$ and degree $d$, such that (i) $2(d-5) \le g$ and $d\le 6$; (ii) $C$ does not admit a 3-secant line in…

Many literatures consider the extended Reed-Solomon (RS) codes, including their dual codes and covering radii, but few focus on extended algebraic geometry (AG) codes of genus $g\ge1$. In this paper, we investigate extended AG codes and…

We give an algorithm to compute the stable lengths of pseudo-Anosovs on the curve graph, answering a question of Bowditch. We also give a procedure to compute all invariant tight geodesic axes of pseudo-Anosovs. Along the way we show that…

We prove the factoriality of a nodal hypersurface in $\mathbb{P}^{4}$ of degree $d$ that has at most $2(d-1)^{2}/3$ singular points, and factoriality of a double cover of $\mathbb{P}^{3}$ branched over a nodal surface of degree $2r$ having…

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…