English
Related papers

Related papers: Harmonic morphisms and hyperelliptic graphs

200 papers

Given two graphs G and H, we ask under which conditions there is a relation R that generates the edges of H given the structure of graph G. This construction can be seen as a form of multihomomorphism. It generalizes surjective…

Combinatorics · Mathematics 2012-10-18 Jan Hubicka , Jürgen Jost , Yangjing Long , Peter F. Stadler , Ling Yang

A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…

Combinatorics · Mathematics 2010-11-30 Robert Gray , Rognvaldur G. Moller

We give a classification of quadratic harmonic morphisms between Euclidean spaces (Theorem 2.4) after proving a Rank Lemma. We also find a correspondence between umbilical (Definition 2.7) quadratic harmonic morphisms and Clifford systems.…

dg-ga · Mathematics 2008-02-03 Ye-lin Ou , J. C. Wood

Let $\Sigma$ be a compact manifold without boundary whose first homology is nontrivial. Hodge decomposition of the incompressible Euler's equation in terms of 1-forms yields a coupled PDE-ODE system. The $L^2$-orthogonal components are a…

Mathematical Physics · Physics 2023-09-25 Clodoaldo Grotta-Ragazzo , Björn Gustafsson , Jair Koiller

A geometric graph is a simple graph G together with a straight line drawing of G in the plane with the vertices in general position. Two geometric realizations of a simple graph are geo-isomorphic if there is a vertex bijection between them…

Combinatorics · Mathematics 2024-06-13 Sally Cockburn , Yonghyun Song

On non-K\"ahler manifolds the notion of harmonic maps is modified to that of Hermitian harmonic maps in order to be compatible with the complex structure. The resulting semilinear elliptic system is {\it not} in divergence form. The case of…

Differential Geometry · Mathematics 2009-02-27 Hans-Christoph Grunau , Marco Kuehnel

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

Combinatorics · Mathematics 2023-07-25 Sarah Griffith

We consider a hierarchy of graph invariants that naturally extends the spectral invariants defined by F\"urer (Lin. Alg. Appl. 2010) based on the angles formed by the set of standard basis vectors and their projections onto eigenspaces of…

Computational Complexity · Computer Science 2025-05-06 V. Arvind , Frank Fuhlbrück , Johannes Köbler , Oleg Verbitsky

We show that if the two parts of a finite bipartite graph have the same degree sequence, then there is a bipartite graph, with the same degree sequences, which is symmetric, in that it has an involutive graph automorphism that interchanges…

Combinatorics · Mathematics 2014-07-07 Grant Cairns , Stacey Mendan

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

Combinatorics · Mathematics 2019-08-06 Yu Qing Chen , Teng Fang , Sanming Zhou

We study Hamiltonian diffeomorphisms on symplectic Euclidean spaces that are equal to non-degenerate linear maps at infinity. Under the assumption that there exists an isolated homologically nontrivial fixed point satisfying the twist…

Dynamical Systems · Mathematics 2025-11-05 Meng Li

We show that the groupoids of two directed graphs are isomorphic if and only if the two graphs are orbit equivalent by an orbit equivalence that preserves isolated eventually periodic points. We also give a complete description of the…

Dynamical Systems · Mathematics 2018-10-08 Toke Meier Carlsen , Marius Lie Winger

In an earlier paper the authors proved that limits of convergent graph sequences can be described by various structures, including certain 2-variable real functions called graphons, random graph models satisfying certain consistency…

Combinatorics · Mathematics 2009-02-10 László Lovász , Balázs Szegedy

Understanding feature-outcome associations in high-dimensional data remains challenging when relationships vary across subpopulations, yet standard methods assuming global associations miss context-dependent patterns, reducing statistical…

Methodology · Statistics 2025-11-20 Pawel Gajer , Jacques Ravel

We give a proof, using harmonic maps from disks to real trees, of Skora's theorem (Morgan-Otal (1993), Skora (1990), originally conjectured by Shalen): if G is the fundamental group of a surface of genus at least 2, then any small minimal…

Differential Geometry · Mathematics 2007-05-23 Benson Farb , Michael Wolf

We show that every connected graph can be approximated by a normal tree, up to some arbitrarily small error phrased in terms of neighbourhoods around its ends. The existence of such approximate normal trees has consequences of both…

Combinatorics · Mathematics 2021-02-05 Jan Kurkofka , Ruben Melcher , Max Pitz

First we survey and explain the strategy of some recent results that construct holomorphic $\text{sl}(2, \mathbb C)$-differential systems over some Riemann surfaces $\Sigma_g$ of genus $g\geq 2$, satisfying the condition that the image of…

Differential Geometry · Mathematics 2023-10-26 Indranil Biswas , Sorin Dumitrescu , Lynn Heller , Sebastian Heller , João Pedro dos Santos

Let $F$ be a non-Archimedean valued field, $\Sigma$ a closed Riemann surface of genus at least two, and $\Gamma$ its fundamental group. Building on the theory of equivariant harmonic maps into $\mathbb{R}$-trees, we study the…

Differential Geometry · Mathematics 2025-11-06 Jiahuang Chen , Siqi He

In this paper, we consider minimal graphs in the three-dimensional Riemannian manifold $M\times\mathbb{R}$. We mainly estimate the Gaussian curvature of such surfaces. We consider the minimal disks and minimal graphs bounded by two Jordan…

Differential Geometry · Mathematics 2022-07-12 David Kalaj

Let $H$ and $G$ be two finite graphs. Define $h_H(G)$ to be the number of homomorphisms from $H$ to $G$. The function $h_H(\cdot)$ extends in a natural way to a function from the set of symmetric matrices to $\mathbb{R}$ such that for…

Functional Analysis · Mathematics 2008-06-03 Hamed Hatami
‹ Prev 1 4 5 6 7 8 10 Next ›