Related papers: Counting maps from a surface to a graph

In this note it is shown that, given a smooth minimal complex surface of general type S with p_g(S)=0, K^2_S=3, for which the bicanonical map is a morphism, then the degree of the bicanonical map of S is not equal to 3. This completes our…

We classify all the surfaces with p_g = q = 0 which admit an unramified covering which is isomorphic to a product of curves. Beyond the trivial case \PP^1 x \PP^1 we find 17 families which we explicitly describe. We reduce the problem to a…

For any algebraically closed field $K$ and any endomorphism $f$ of $\mathbb{P}^1(K)$ of degree at least 2, the automorphisms of $f$ are the M\"obius transformations that commute with $f$, and these form a finite subgroup of…

In this paper we continue the study of prime graphs of finite solvable groups. The prime graph, or Gruenberg-Kegel graph, of a finite group G has vertices consisting of the prime divisors of the order of G and an edge from primes p to q if…

Let $S$ be an orientable, connected surface with infinitely-generated fundamental group. The main theorem states that if the genus of $S$ is finite and at least 4, then the isomorphism type of the pure mapping class group associated to $S$,…

A residually nilpotent group is \emph{$k$-parafree} if all of its lower central series quotients match those of a free group of rank $k$. Magnus proved that $k$-parafree groups of rank $k$ are themselves free. We mimic this theory with…

An abstract simplicial complex $\mathbf{F}$ is a non-uniform hypergraph without isolated vertices, whose edge set is closed under taking subsets. The extremal number $\mathrm{ex}(n,\mathbf{F})$ is the maximum number of edges in an…

We prove a tropical analogue of the theorem of Hurwitz: a leafless metric graph of genus $g \ge 2$ has at most $12$ automorphisms when $g = 2$; $2^g g!$ automorphisms when $g \ge 3$. These inequalities are optimal; for each genus, we give…

We prove a rigidity result for cocycles from higher rank lattices to $\mathrm{Out}(F_N)$ and more generally to the outer automorphism group of a torsion-free hyperbolic group. More precisely, let $G$ be either a product of connected higher…

It is shown, that the mapping class group of a surface of the genus g > 1 admits a faithful representation into the matrix group GL (6g-6, Z). The proof is based on a categorical correspondence between the Riemann surfaces and the so-called…

Let G be a connected, compact, semisimple Lie group. It is known that for a compact closed orientable surface $\Sigma$ of genus $l >1$, the order of the group $H^2(\Sigma,\pi_1(G))$ is equal to the number of connected components of the…

A countable graph is ultrahomogeneous if every isomorphism between finite induced subgraphs can be extended to an automorphism. Woodrow and Lachlan showed that there are essentially four types of such countably infinite graphs: the random…

It has been recently shown that any graph of genus g>0 can be stochastically embedded into a distribution over planar graphs, with distortion Olog (g+1)) [Sidiropoulos, FOCS 2010]. This embedding can be computed in polynomial time, provided…

For every integer $g \,\geq\, 2$ we show the existence of a compact Riemann surface $\Sigma$ of genus $g$ such that the rank two trivial holomorphic vector bundle ${\mathcal O}^{\oplus 2}_{\Sigma}$ admits holomorphic connections with…

Given a finite group $G,$ we denote by $\Delta(G)$ the graph whose vertices are the elements $G$ and where two vertices $x$ and $y$ are adjacent if there exists a minimal generating set of $G$ containing $x$ and $y.$ We prove that…

An independent set in a graph is a set of pairwise non-adjacent vertices, and alpha(G) is the size of a maximum independent set in the graph G. A matching is a set of non-incident edges, while mu(G) is the cardinality of a maximum matching.…

In this paper, we study the category of modules over the Smith algebra which are free of finite rank over the unital polynomial subalgebra generated by the Cartan element $h$ and obtain families of such simple modules of arbitrary rank. In…

Independent sets play a key role into the study of graphs and important problems arising in graph theory reduce to them. We define the monomial ideal of independent sets associated to a finite simple graph and describe its homological and…

As a generalization of the free semigroup algebras considered by Davidson and Pitts, and others, the second author and D.W. Kribs initiated a study of reflexive algebras associated with directed graphs. A free semigroupoid algebra L_G is…

We are concerned with orderable groups and particularly those with orderings invariant not only under multiplication, but also under a given automorphism or family of automorphisms. Several applications to topology are given: we prove that…