相关论文: On the center of the Hurwitz graph

Among other things, it is shown that for every pair of positive integers $r$, $d$, satisfying $1<r<d\leq 2r$, and every finite simple graph $H,$ there is a connected graph $G$ with diameter $d$, radius $r$, and center $H.$

Hurwitz numbers enumerate branched morphisms between Riemannn surfaces with fixed numerical data. They represent important objects in enumerative geometry that are accessible by combinatorial techniques. In the past decade, many variants of…

For a given group $G$ the orientably regular maps with orientation-preserving automorphism group $G$ are used as the vertices of a graph $\O(G)$, with undirected and directed edges showing the effect of duality and hole operations on these…

Two classical concepts of centrality in a graph are the median and the center. The connected notions of the status and the radius of a graph seem to be in no relation. In this paper, however, we show a clear connection of both concepts, as…

The set of factorizations of permutations in to $m$ transpositions of some symmetric group $\mathcal{S}_n$ is naturally in bijection with the set of graphs of order $n$ and size $m$ with both edges and vertices labeled. We define a notion…

Let $G$ be a finite group. Define a graph on the set $G^{\#} = G \setminus \{ 1 \}$ by declaring distinct elements $x,y\in G^{\#}$ to be adjacent if and only if $\langle x,y\rangle$ is cyclic. Denote this graph by $\Delta(G)$. The graph…

The family of graphs of reduced words of a certain subcollection of permutations in the union $\cup_{n\geq 4}\frak{S}_{n}$ of symmetic groups is investigated. The subcollection is characterised by the hook cycle type $(n-2,1,1)$ with…

Motivated by the problem of Hurwitz equivalence of $\Delta ^2$ factorization in the braid group, we address the problem of Hurwitz equivalence in the symmetric group, obtained by projecting the $\Delta ^2$ factorizations into $S_n$. We get…

We derive a closed-form expression for all genus 1 Hurwitz numbers, and give a simple new graph-theoretic interpretation of Hurwitz numbers in genus 0 and 1. (Hurwitz numbers essentially count irreducible genus g covers of the sphere, with…

Hurwitz numbers with completed cycles are standard Hurwitz numbers with simple branch points replaced by completed cycles. In fact, simple branch points correspond to completed $2$-cycles. Okounkov and Pandharipande have established the…

We shall consider the product of complex random matrices from the independent complex Ginibre ensembles. The product includes complex matrices $Z_i, Z_i^\dagger, \, i = 1, \ldots, n$ and $2n$ sources (complex matrices $C_i$ and $C_i^*$).…

We develop the geometry of Hurwitz continued fractions, a major tool in understanding the approximation properties of complex numbers by ratios of Gaussian integers. Based on a thorough study of the geometric properties of Hurwitz continued…

The center, median and the security center are three central parts defined for any connected graph whereas the characteristic set, subtree core and core vertices are three central parts defined for trees only. We extend the concept of the…

This survey grew out of notes accompanying a cycle of lectures at the workshop Modern Trends in Gromov-Witten Theory, in Hannover. The lectures are devoted to interactions between Hurwitz theory and Gromov-Witten theory, with a particular…

The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

Let $R$ be a complete discrete valuation ring of equal characteristic $p>0$. Given a $\mathbb{Z}/p$-Galois cover of a formal disc over $R$, one can derive from it a semi-stable model for which the specializations of branch points are…

A circle graph is an intersection graph of a set of chords of a circle. We describe the unavoidable induced subgraphs of circle graphs with large treewidth. This includes examples that are far from the `usual suspects'. Our results imply…

Graphs are fundamental tools for modeling pairwise interactions in complex systems. However, many real-world systems involve multi-way interactions that cannot be fully captured by standard graphs. Hypergraphs, which generalize graphs by…

The classical Hurwitz numbers of degree n together with the Hurwitz numbers of the seamed surfaces of degree n give rise to the Klein topological field theory. We extend this construction to the Hurwitz numbers of all degrees at once. The…