相关论文: Harmonic morphisms and hyperelliptic graphs

Harmonic morphisms, maps which preserve Laplace's equation, are intimately connected to the topic of minimal submanifolds. In this article we first characterise harmonic morphisms between Riemannian manifolds as the weakly horizontally…

Evolution algebras are non-associative algebras inspired from biological phenomena, with applications to or connections with different mathematical fields. There are two natural ways to define an evolution algebra associated to a given…

The Gordian graph and H(2)-Gordian graphs of knots are abstract graphs whose vertex sets represent isotopy classes of unoriented knots, and whose edge sets record whether pairs of knots are related by crossing changes or H(2)-moves,…

We present a computational approach to general hyperelliptic Riemann surfaces in Weierstrass normal form. The surface is either given by a list of the branch points, the coefficients of the defining polynomial or a system of cuts for the…

In this paper we relate some classical normal forms for complex elliptic curves in terms of 4-point sets in the Riemann sphere. Our main result is an alternative proof that every elliptic curve is isomorphic as a Riemann surface to one in…

We investigate which topological spaces can be constructed as topological realisations of higher-rank graphs. We describe equivalence relations on higher-rank graphs for which the quotient is again a higher-rank graph, and show that…

We generalize the structure theorem of Robertson and Seymour for graphs excluding a fixed graph $H$ as a minor to graphs excluding $H$ as a topological subgraph. We prove that for a fixed $H$, every graph excluding $H$ as a topological…

Hypergraphs are a generalization of graphs in which edges can connect any number of vertices. They allow the modeling of complex networks with higher-order interactions, and their spectral theory studies the qualitative properties that can…

We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic. This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes. The main result is built…

In 1962, Erd\H{o}s proved that if a graph $G$ with $n$ vertices satisfies $$ e(G)>\max\left\{\binom{n-k}{2}+k^2,\binom{\lceil(n+1)/2\rceil}{2}+\left\lfloor \frac{n-1}{2}\right\rfloor^2\right\}, $$ where the minimum degree $\delta(G)\geq k$…

Let X be an irreducible smooth projective curve, of genus at least two, defined over an algebraically closed field of characteristic different from two. If X admits a nontrivial automorphism \sigma that fixes pointwise all the order two…

For a given pair of maps f,g:X->M from an arbitrary topological space to an n-manifold, the Lefschetz homomorphism is a certain graded homomorphism L:H(X)->H(M) of degree (-n). We prove a Lefschetz-type coincidence theorem: if the Lefschetz…

A graph is pseudo 2-factor isomorphic if all of its 2-factors have the same parity of number of cycles. Abreu et al. [J. Comb. Theory, Ser. B. 98 (2008) 432--442] conjectured that $K_{3,3}$, the Heawood graph and the Pappus graph are the…

In the present paper, we study bi-$f$-harmonic maps which generalize not only $f$-harmonic maps, but also biharmonic maps. We derive bi-$f$-harmonic equations for curves in the Euclidean space, unit sphere, hyperbolic space, and in…

Hypergraphs are useful mathematical models for describing complex relationships among members of a structured graph, while hyperdigraphs serve as a generalization that can encode asymmetric relationships in the data. However, obtaining…

We introduce the complete lifts of maps between (real and complex) Euclidean spaces and study their properties concerning holomorphicity, harmonicity and horizontal weakly conformality. As applications, we are able to use this concept to…

The symmetries described by Pin groups are the result of combining a finite number of discrete reflections in (hyper)planes. The current work shows how an analysis using geometric algebra provides a picture complementary to that of the…

We study edge-decompositions of highly connected graphs into copies of a given tree. In particular we attack the following conjecture by Bar\'at and Thomassen: for each tree $T$, there exists a natural number $k_T$ such that if $G$ is a…

The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs, such as the Higman-Sims graph, are graphs of maximal complexity among all graphs of the…

Let the join of two graphs be the union of two disjoint graphs connected by $j$ edges in a one-to-one manner. In previous work by Gyurov and Pinzon, which generalized the results of Badura and Rara, the determinant of the adjacency matrix…