English
Related papers

Related papers: Some Graftings of Complex Projective Structures wi…

200 papers

Finite \'etale covers of a connected scheme $X$ are parametrised by the \'etale fundamental group via the monodromy correspondence. This was generalised to an exodromy correspondence for constructible sheaves, first in the topological…

Algebraic Geometry · Mathematics 2024-10-10 Remy van Dobben de Bruyn

Let $G$ be a graph on $n$ nodes. In this note, we prove that if $G$ is $(r+1)$-vertex connected, $1 \leq r \leq n-2$, then there exists a configuration $p$ in general position in $R^r$ such that the bar framework $(G,p)$ is universally…

Metric Geometry · Mathematics 2014-08-18 A. Y. Alfakih

The paper contains a general construction which produces new examples of non simply-connected smooth projective surfaces. We analyze the resulting surfaces and their fundamental groups. Many of these fundamental groups are expected to be…

alg-geom · Mathematics 2008-02-03 Fedor Bogomolov , Ludmil Katzarkov

We express the hairy graph complexes computing the rational homotopy groups of long embeddings (modulo immersion) of R^m in R^n as "decorated" graph complexes associated to certain representations of the outer automorphism groups of free…

Algebraic Topology · Mathematics 2017-05-04 Victor Turchin , Thomas Willwacher

Helly graphs are graphs in which every family of pairwise intersecting balls has a non-empty intersection. This is a classical and widely studied class of graphs. In this article we focus on groups acting geometrically on Helly graphs --…

Group Theory · Mathematics 2025-01-08 Jérémie Chalopin , Victor Chepoi , Anthony Genevois , Hiroshi Hirai , Damian Osajda

A graph is Helly if its disks satisfy the Helly property, i.e., every family of pairwise intersecting disks in G has a common intersection. It is known that for every graph G, there exists a unique smallest Helly graph H(G) into which G…

Discrete Mathematics · Computer Science 2020-07-29 Heather M. Guarnera , Feodor F. Dragan , Arne Leitert

A standard combinatorial construction, due to Kontsevich, associates to any A-infinity algebra with an invariant inner product, an inhomogeneous class in the cohomology of the moduli spaces of Riemann surfaces with marked points. We…

Quantum Algebra · Mathematics 2007-05-23 Alastair Hamilton , Andrey Lazarev

We classify the connected-homogeneous digraphs with more than one end. We further show that if their underlying undirected graph is not connected-homogeneous, they are highly-arc-transitive.

Combinatorics · Mathematics 2010-04-30 Matthias Hamann , Fabian Hundertmark

For a group $\Gamma$, a $\Gamma$-labelled graph is an undirected graph $G$ where every orientation of an edge is assigned an element of $\Gamma$ so that opposite orientations of the same edge are assigned inverse elements. A path in $G$ is…

The present paper studies the structure of characteristic varieties of fundamental groups of graph manifolds. As a consequence, a simple proof of Papadima's question is provided on the characterization of algebraic links that have…

Geometric Topology · Mathematics 2019-11-27 E. Artal Bartolo , J. I. Cogolludo-Agustín , D. Matei

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

A relational structure R is ultrahomogeneous if every isomorphism of finite induced substructures of R extends to an automorphism of R. We classify the ultrahomogeneous finite binary relational structures with one asymmetric binary relation…

Combinatorics · Mathematics 2024-08-15 Irene Heinrich , Eda Kaja , Pascal Schweitzer

We show that finitely presented groups which admit $k$-planar Cayley graphs contain finite-index subgroups with planar Cayley graphs. More generally, we answer a question of Georgakopoulos and Papasoglu in the special case of coarsely…

Group Theory · Mathematics 2026-05-06 John M. Mackay , Joseph P. MacManus , Davide Spriano

A finite set can be supplied with a group structure which can then be used to select (classes of) differential calculi on it via the notions of left-, right- and bicovariance. A corresponding framework has been developed by Woronowicz, more…

q-alg · Mathematics 2008-11-26 K. Bresser , A. Dimakis , F. Mueller-Hoissen , A. Sitarz

Let $R$ be a group and let $S$ be a subset of $R$. The Haar graph $\mathrm{Haar}(R,S)$ of $R$ with connection set $S$ is the graph having vertex set $R\times\{-1,1\}$, where two distinct vertices $(x,-1)$ and $(y,1)$ are declared to be…

Combinatorics · Mathematics 2024-04-22 Joy Morris , Pablo Spiga

We consider the standard contact structure on the supercircle, S^{1|1}, and the supergroups E(1|1), Aff(1|1) and SpO(2|1) of contactomorphisms, defining the Euclidean, affine and projective geometry respectively. Using the new notion of…

Mathematical Physics · Physics 2008-06-19 Jean-Philippe Michel , Christian Duval

The notion of $\times$-homotopy from \cite{DocHom} is investigated in the context of the category of pointed graphs. The main result is a long exact sequence that relates the higher homotopy groups of the space $\Hom_*(G,H)$ with the…

Combinatorics · Mathematics 2008-07-07 Anton Dochtermann

We construct several $C^*$-algebras and spectral triples associated to the Berkovich projective line $\mathbb{P}^1_{\mathrm{Berk}}({\mathbb{C}_p})$. In the commutative setting, we construct a spectral triple as a direct limit over finite…

Functional Analysis · Mathematics 2026-04-10 Masoud Khalkhali , Damien Tageddine

Associated to any uniform finite layered graph Gamma there is a noncommutative graded quadratic algebra A(Gamma) given by a construction due to Gelfand, Retakh, Serconek and Wilson. It is natural to ask when these algebras are Koszul.…

Rings and Algebras · Mathematics 2010-11-08 Thomas Cassidy , Christopher Phan , Brad Shelton

A flag complex can be defined as a simplicial complex whose simplices correspond to complete subgraphs of its 1-skeleton taken as a graph. In this article, by introducing the notion of s-dismantlability, we shall define the s-homotopy type…

Combinatorics · Mathematics 2019-06-04 Romain Boulet , Etienne Fieux , Bertrand Jouve