Related papers: Euler-genus distributions of cubic Halin graphs

We say that a $k$-uniform hypergraph $C$ is a Hamilton cycle of type $\ell$, for some $1\le \ell \le k$, if there exists a cyclic ordering of the vertices of $C$ such that every edge consists of $k$ consecutive vertices and for every pair…

Delta-matroid theory is often thought of as a generalization of topological graph theory. It is well-known that an orientable embedded graph is bipartite if and only if its Petrie dual is orientable. In this paper, we first introduce the…

In recent years, there has been significant progress in the theory of orthogonal polynomials on algebraic curves, particularly on genus 1 surfaces. In this paper, we focus on elliptic orthogonal polynomials and establish several of their…

In this paper, we give graphs whose topological index are exactly equal to the number $u_n$, satisfying the three term recurrence relation $$ u_n=a u_{n-1}+b u_{n-2}\quad(n\ge 2)\quad u_0=0\quad\hbox{and}\quad u_1=u\,, $$ where $a$, $b$ and…

The number of planar Eulerian maps with n edges is well-known to have a simple expression. But what is the number of planar Eulerian orientations with n edges? This problem appears to be difficult. To approach it, we define and count…

In this paper we give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian graph of bounded treewidth. The problems of counting ETs are known to be #P-complete for general graphs (Brightwell…

A variety of descent and major-index statistics have been defined for symmetric groups, hyperoctahedral groups, and their generalizations. Typically associated to pairs of such statistics is an Euler--Mahonian distribution, a bivariate…

The history of gene families -- which are equivalent to event-labeled gene trees -- can to some extent be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes.…

In this study we introduce a second type of higher order generalised geometric polynomials. This we achieve by examining the generalised stirling numbers $S(n; k;\alpha;\beta;\gamma)$ [Hsu & Shiue,1998] for some negative arguments. We study…

In this paper tackle the problem of computing the ranks of certain eulerian magnitude homology groups of a graph G. First, we analyze the computational cost of our problem and prove that it is #W[1]-complete. Then we develop the first…

We compute the rational Chow class of the locus of genus 2 curves admitting a d-to-1 map to a genus 1 curve, recovering a result of Faber-Pagani when d=2. The answer exhibits quasi-modularity properties similar to those in the Gromov-Witten…

We compute the number of equivalence classes of nonperiodic covering cycles of given length in a non oriented connected graph. A covering cycle is a closed path that traverses each edge of the graph at least once. A special case is the…

We propose an efficient algorithm for matching two correlated Erd\H{o}s--R\'enyi graphs with $n$ vertices whose edges are correlated through a latent vertex correspondence. When the edge density $q= n^{- \alpha+o(1)}$ for a constant $\alpha…

We study an $\ell$-adic Galois analogue of the distribution formulas for polylogarithms with special emphasis on path dependency and arithmetic behaviors. As a goal, we obtain a notion of certain universal Kummer-Heisenberg measures that…

An Euler tour in a hypergraph is a closed walk that traverses each edge of the hypergraph exactly once, while an Euler family is a family of closed walks that jointly traverse each edge exactly once and cannot be concatenated. In this…

We prove that the genus polynomials of the graphs called iterated claws are real-rooted. This continues our work directed toward the 25-year-old conjecture that the genus distribution of every graph is log-concave. We have previously…

We introduce a new method of expressing a $k$-graph $C^*$-algebra as a Cuntz-Pimsner algebra. Kumjian, Pask, and Sims have done this directly, using a linking algebra approach and a $(k-1)$-graph algebra. This can be iterated downward. Our…

In this article we start a systematic study of the bi-Lipschitz geometry of lamplighter graphs. We prove that lamplighter graphs over trees bi-Lipschitzly embed into Hamming cubes with distortion at most~$6$. It follows that lamplighter…

Certain generalization of Euler numbers was defined in 1935 by Lehmer using cubic roots of unity, as a natural generalization of Bernoulli and Euler numbers. In this paper, Lehmer's generalized Euler numbers are studied to give certain…

In this paper the elliptic genus for a general Calabi-Yau fourfold is derived. The recent work of Kawai calculating N=2 heterotic string one-loop threshold corrections with a Wilson line turned on is extended to a similar computation where…