English
Related papers

Related papers: Arc-transitive maps with edge number coprime to th…

200 papers

If a map has k transitivity classes of vertices that are subject to the action of the automorphism group, it is said to be k-uniform. The classification of 1-uniform maps on the torus is known. In this article, we classify 2-uniform maps on…

Combinatorics · Mathematics 2023-01-26 Arnab Kundu , Dipendu Maity

We compute the Euler characteristic of the moduli space of quadratic rational maps with a periodic marked critical point of a given period.

Dynamical Systems · Mathematics 2025-01-24 Jan Kiwi

If $v$ is an eigenvector for eigenvalue $\lambda$ of a graph $X$ and $\alpha$ is an automorphism of $X$, then $\alpha(v)$ is also an eigenvector for $\lambda$. Thus it is rather exceptional for an eigenvalue of a vertex-transitive graph to…

Combinatorics · Mathematics 2024-11-20 Krystal Guo , Bojan Mohar

We enumerate and classify all the semi equivelar maps on the surface of $ \chi=-2 $ with up to 12 vertices. We also determine which of these are vertex-transitive and which are not.

Geometric Topology · Mathematics 2019-04-17 Debashis Bhowmik , Ashish Kumar Upadhyay

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…

Combinatorics · Mathematics 2025-04-11 Nicolas Bonichon , Mireille Bousquet-Mélou , Paul Dorbec , Claire Pennarun

We study the use of the Euler characteristic for multiparameter topological data analysis. Euler characteristic is a classical, well-understood topological invariant that has appeared in numerous applications, including in the context of…

Algebraic Topology · Mathematics 2021-02-17 Gabriele Beltramo , Rayna Andreeva , Ylenia Giarratano , Miguel O. Bernabeu , Rik Sarkar , Primoz Skraba

A graph is near-planar if it can be obtained from a planar graph by adding an edge. We show the surprising fact that it is NP-hard to compute the crossing number of near-planar graphs. A graph is 1-planar if it has a drawing where every…

Computational Geometry · Computer Science 2012-03-28 Sergio Cabello , Bojan Mohar

We study character varieties arising as moduli of representations of an orientable surface group into a reductive group $G$. We first show that if $G/Z$ acts freely on the representation variety, then both the representation variety and the…

Representation Theory · Mathematics 2025-02-12 Masoud Kamgarpour , GyeongHyeon Nam , Anna Puskás

We show that the extended based mapping class group of an infinite-type surface is naturally isomorphic to the automorphism group of the loop graph of that surface. Additionally, we show that the extended mapping class group stabilizing a…

Geometric Topology · Mathematics 2019-12-17 Anschel Schaffer-Cohen

We show a generalization of the crossing lemma for multi-graphs drawn on orientable surfaces in which pairs of edges are assumed to be drawn by non-homotopic simple arcs which pairwise cross at most $k$ times.

Combinatorics · Mathematics 2025-06-24 Alfredo Hubard , Hugo Parlier

We study the groups of automorphisms of rational algebraic surfaces that admit a relatively minimal pencil of curves of arithmetic genus one over an algebraically closed field of arbitrary characteristic. In particular, we classify such…

Algebraic Geometry · Mathematics 2021-06-25 Igor Dolgachev , Gebhard Martin

We determine the structure of automorphism groups of finite graphs of bounded Hadwiger number. Our proof includes a structural analysis of finite edge-transitive graphs. In particular, we show that for connected, $K_{h+1}$-minor-free,…

Combinatorics · Mathematics 2025-09-24 Martin Grohe , Pascal Schweitzer , Daniel Wiebking

For each commutative, graded algebra with finite dimension in each degree, we construct a graded cohomology theory for graphs whose graded Euler characteristic is the chromatic polynomial of the graph. This extends our previous work which…

Quantum Algebra · Mathematics 2007-05-23 Laure Helme-Guizon , Yongwu Rong

A graph is half-arc-transitive if its automorphism group acts transitively on its vertex set, edge set, but not its arc set. In this paper, we study all tetravalent half-arc-transitive graphs of order $12p$.

Combinatorics · Mathematics 2022-06-01 M. Ghasemi , A. A. Talebi , N. Mehdipoor

In order to complete (and generalize) results of Gardiner and Praeger on 4-valent symmetric graphs (European J. Combin, 15 (1994)) we apply the method of lifting automorphisms in the context of elementary-abelian covering projections. In…

Combinatorics · Mathematics 2017-08-01 Boštjan Kuzman , Aleksander Malnič , Primož Potočnik

A connected graph of order $n$ admitting a semiregular automorphism of order $n/k$ is called a $k$-multicirculant. Highly symmetric multicirculants of small valency have been extensively studied, and several classification results exist for…

Combinatorics · Mathematics 2022-08-15 Primož Potočnik , Micael Toledo

In this article, we study Euler characteristic techniques in topological data analysis. Pointwise computing the Euler characteristic of a family of simplicial complexes built from data gives rise to the so-called Euler characteristic…

Machine Learning · Computer Science 2024-07-25 Olympio Hacquard , Vadim Lebovici

We provide a topological characterization of quivers whose path algebra satisfies a polynomial identity. This class includes the oriented cycle and acyclic quivers and, in the latter case, we describe the associated T-ideal. We introduce a…

Representation Theory · Mathematics 2025-09-03 Giovanni Cerulli Irelli , Javier De Loera Chávez , Elena Pascucci

For an integer $k\geq 1$, a graph is called a $k$-circulant if its automorphism group contains a cyclic semiregular subgroup with $k$ orbits on the vertices. We show that, if $k$ is even, there exist infinitely many cubic arc-transitive…

Combinatorics · Mathematics 2016-03-07 Michael Giudici , István Kovács , Cai Heng Li , Gabriel Verret

One version of the polycirculant conjecture states that every vertex-transitive graph has a semiregular automorphism. We give a proof of the conjecture in the arc-transitive case for graphs of valency 8, which was the smallest open case.

Combinatorics · Mathematics 2013-03-20 Gabriel Verret