Related papers: Correspondences without a Core

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…

It's known from from work of Hofer, Wysocki, and Zehnder [1996] and Bourgeois [2002] that in a contact manifold equipped with either a nondegenerate or Morse-Bott contact form, a finite-energy pseudoholomorphic curve will be asymptotic at…

We study the behaviour of $K_{r+1}$-free graphs $G$ of almost extremal size, that is, typically, $e(G)=ex(n,K_{r+1})-O(n)$. We show that such graphs must have a large amount of 'symmetry', in particular that all but very few vertices of $G$…

An integral homology theory on the category of undirected reflexive graphs was constructed in [2]. A geometrical method to understand behaviors of $1$- and $2$-simplices under differential maps of the theory was developed in [3] and led us…

In this paper, we recall an alternative proof of Merel's conjecture which asserts that a certain explicit correspondence gives the isogeny relation between the Jacobians associated to the normalizer of split and non-split Cartan subgroups.…

Given a permutation group acting on coordinates of $\mathbb{R}^n$, we consider lattice-free polytopes that are the convex hull of an orbit of one integral vector. The vertices of such polytopes are called \emph{core points} and they play a…

We enumerate chord diagrams without loops and without both loops and parallel chords. We show that the former ones describe Hamiltonian paths in $n$-dimensional octahedrons. The latter ones are also known as shapes. For labelled diagrams we…

We obtain explicit formulas for the number of non-isomorphic elliptic curves with a given group structure (considered as an abstract abelian group). Moreover, we give explicit formulas for the number of distinct group structures of all…

In this paper we study the existence of homomorphisms $G\to H$ using semidefinite programming. Specifically, we use the vector chromatic number of a graph, defined as the smallest real number $t \ge 2$ for which there exists an assignment…

In this note we study numerically the combinatorics of curves and geodesics on the torus with one boundary component. A potential computational difficulty is avoided by counting inside specific orbits of the mapping class group up to a…

For a graph $G,$ we denote the number of connected subgraphs of $G$ by $F(G)$. For a tree $T$, $F(T)$ has been studied extensively and it has been observed that $F(T)$ has a reverse correlation with Wiener index of $T$. Based on that, we…

An invaluable method for probing the physics of a quantum many-body spin system is a mapping to noninteracting effective fermions. We find such mappings using only the frustration graph $G$ of a Hamiltonian $H$, i.e., the network of…

The cycles are the only $2$-connected graphs in which any two nonadjacent vertices form a vertex cut. We generalize this fact by proving that for every integer $k\ge 3$ there exists a unique graph $G$ satisfying the following conditions:…

This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these graphs have arbitrary large chromatic number, while being…

This article establishes the algebraic covering theory of quandles. For every connected quandle we explicitly construct a universal covering, which in turn leads us to define the algebraic fundamental group as the automorphism group of the…

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…

For a curve $X$ of genus $>1$ defined over a finite field, we present a criterion which allows us to state the non existence of automorphisms of order a power of a rational prime. We show how this criterion can be used to determine the…

We give an explicit description of the homomorphism group H_n(p) of a strong type p in any stable theory under the assumption that for every non-forking extension q of p the groups H_i(q) are trivial for i at least 2 but less than n. The…

Let $f$ be a plane curve. We give a procedure based on Abhyankar's approximate roots to detect if it has a single place at infinity, and if so construct its associated $\delta$-sequence, and consequently its value semigroup. Also for fixed…

We study upper bounds on the order of automorphisms of non-singular curves $X$ satisfying at least one of the following hypothesis: 1) $X$ is an $m$-sheeted covering of exactly one non-singular curve of genus $\gamma$, where $m$ is prime;…