English
Related papers

Related papers: Introducing edge-biregular maps

200 papers

We introduce partial duality of hypermaps, which include the classical Euler-Poincar\'e duality as a particular case. Combinatorially, hypermaps may be described in one of three ways: as three involutions on the set of flags (bi-rotation…

Combinatorics · Mathematics 2021-02-10 Sergei Chmutov , Fabien Vignes-Tourneret

The distributive property can be studied through bilinear maps and various morphisms between these maps. The adjoint-morphisms between bilinear maps establish a complete abelian category with projectives and admits a duality. Thus the…

Category Theory · Mathematics 2012-05-04 James B. Wilson

We present statistical biharmonic maps, a new class of mappings between statistical manifolds naturally derived from a variation problem. We give the Euler-Lagrange equation of this problem and prove that improper affine hyperspheres induce…

Differential Geometry · Mathematics 2026-04-14 Hitoshi Furuhata , Ryu Ueno

We study the group of automorphisms of the affine plane preserving some given curve, over any field. The group is proven to be algebraic, except in the case where the curve is a bunch of parallel lines. Moreover, a classification of the…

Algebraic Geometry · Mathematics 2016-11-24 Jérémy Blanc , Immanuel Stampfli

It was conjectured by the third author in about 1973 that every $d$-regular planar graph (possibly with parallel edges) can be $d$-edge-coloured, provided that for every odd set $X$ of vertices, there are at least $d$ edges between $X$ and…

Discrete Mathematics · Computer Science 2012-09-07 Maria Chudnovsky , Katherine Edwards , Paul Seymour

For a topological space $X$ we study continuous maps $f : X\to \mathbb R^m$ such that images of every pairwise distinct $k$ points are affinely (linearly) independent. Such maps are called affinely (linearly) $k$-regular embeddings. We…

Algebraic Topology · Mathematics 2011-06-29 R. N. Karasev

A graph drawn in the plane with straight-line edges is called a geometric graph. If no path of length at most $k$ in a geometric graph $G$ is self-intersecting we call $G$ $k$-locally plane. The main result of this paper is a construction…

Combinatorics · Mathematics 2011-11-01 Gábor Tardos

It is known that an automorphism group of a K3 surface with Picard number two is either infinite cyclic group or infinite dihedral group if it is infinite. In this paper, we study the generators of an automorphism group. We use the…

Algebraic Geometry · Mathematics 2022-10-25 Kwangwoo Lee

We classify the regular maps $\mathcal M$ which have automorphism groups $G$ acting faithfully and primitively on their vertices. As a permutation group $G$ must be of almost simple or affine type, with dihedral point stabilisers. We show…

Group Theory · Mathematics 2023-03-07 Gareth A. Jones , Martin Mačaj

We define pure graphs, invertible graphs, and the notion of complementation of bicoloured graphs. The study of pure graphs is motivated by two conjectures about the transition systems of eulerian graphs and by the Cycle Double Cover…

Combinatorics · Mathematics 2007-05-23 François Genest

A path (cycle) in a $2$-edge-colored multigraph is alternating if no two consecutive edges have the same color. The problem of determining the existence of alternating Hamiltonian paths and cycles in $2$-edge-colored multigraphs is an…

Combinatorics · Mathematics 2023-06-22 Alejandro Contreras-Balbuena , Hortensia Galeana-Sánchez , Ilan A. Goldfeder

In the paper we prove that every automorphism of a (elementary) Chevalley group of type $A_l, D_l$, or $E_l$, $l\geqslant 2$, over a commutative local ring with 1/2 is standard, i. e., is the composition of inner, ring, graph and central…

Group Theory · Mathematics 2009-08-09 E. I. Bunina

An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…

Combinatorics · Mathematics 2023-11-17 Stefan Gyurki , Sona Pavlikova , Jozef Siran

This paper proves the existence of a chiral map with alternating automorphism group for every hyperbolic type. We present a set of constructions using permutations for when at least one parameter is even, and call on previously known…

Combinatorics · Mathematics 2024-02-28 Olivia Reade

We prove that many normal subgroups of the extended mapping class group of a surface with punctures are geometric, that is, that their automorphism groups and abstract commensurator groups are isomorphic to the extended mapping class group.…

Geometric Topology · Mathematics 2018-10-02 Alan McLeay

Recently Bowden, Hensel and Webb defined the fine curve graph for surfaces, extending the notion of curve graphs for the study of homeomorphism or diffeomorphism groups of surfaces. Later Long, Margalit, Pham, Verberne and Yao proved that…

Geometric Topology · Mathematics 2024-12-25 Frédéric Le Roux , Maxime Wolff

A 2-edge-coloured graph $G$ is called {\bf locally complete} if for each vertex $v$, the vertices adjacent to $v$ through edges of the same colour induce a complete subgraph in $G$. Locally complete 2-edge-coloured graphs have nice…

Combinatorics · Mathematics 2024-10-08 Jørgen Bang-Jensen , Jing Huang

Cluster automorphisms have been shown to have links to the mapping class groups of surfaces, maximal green sequences and to exchange graph automorphisms for skew-symmetric cluster algebras. In this paper we aim to generalise these results…

Combinatorics · Mathematics 2016-12-12 John W. Lawson

A graph/multigraph $G$ is locally irregular if endvertices of every its edge possess different degrees. The locally irregular edge coloring of $G$ is its edge coloring with the property that every color induces a locally irregular…

Combinatorics · Mathematics 2024-10-04 Igor Grzelec , Tomáš Madaras , Alfréd Onderko , Roman Soták

A vertex colouring of a graph is called asymmetric if the only automorphism which preserves it is the identity. Tucker conjectured that if every automorphism of a connected, locally finite graph moves infinitely many vertices, then there is…

Combinatorics · Mathematics 2020-07-21 Florian Lehner , Monika Pilśniak , Marcin Stawiski
‹ Prev 1 3 4 5 6 7 10 Next ›