English
Related papers

Related papers: Some Graftings of Complex Projective Structures wi…

200 papers

Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…

Combinatorics · Mathematics 2025-07-18 Zawad Chowdhury , Stefan Steinerberger , Rekha R. Thomas

On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-block, we determine the most general block-cutvertex structure a graph $G$ may have in order to guarantee that $G^2$ is hamiltonian,…

Combinatorics · Mathematics 2023-09-28 J. Ekstein , H. Fleischner

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

Group Theory · Mathematics 2016-03-23 Cora Welsch

We develop a general diagrammatic theory of welded graphs, and provide an extension of Satoh's Tube map from welded graphs to ribbon surface-links. As a topological application, we obtain a complete link-homotopy classification of so-called…

Geometric Topology · Mathematics 2025-07-29 Benjamin Audoux , Jean-Baptiste Meilhan , Akira Yasuhara

We prove that the invariably generating graph of a finite group can have an arbitrarily large number of connected components with at least two vertices.

Group Theory · Mathematics 2021-02-15 Daniele Garzoni

We introduce pathographs as a framework to study graph classes defined by forbidden structures, including forbidding induced subgraphs, minors, etc. Pathographs approximately generalize s-graphs of L\'ev\^eque--Lin--Maffray--Trotignon by…

Combinatorics · Mathematics 2025-05-27 Daniel Carter , Nicolas Trotignon

Let $(X,\omega)$ be a closed symplectic manifold. A loop $\phi: S^1 \to \mathrm{Diff}(X)$ of diffeomorphisms of $X$ defines a fibration $\pi: P_{\phi} \to S^2$. By applying Gromov-Witten theory to moduli spaces of holomorphic sections of…

Symplectic Geometry · Mathematics 2021-11-11 Mohammed Abouzaid , Mark McLean , Ivan Smith

A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…

Combinatorics · Mathematics 2025-07-30 Erik Carlson , Willem Fletcher , MurphyKate Montee , Chi Nguyen , Jarne Renders , Xingyi Zhang

Let $X/S$ be a smooth family of smooth projective varieties, where $S$ is a smooth affine curve over a field $k$ of characteristic $0.$ We relate the differential fundamental groupoid scheme of $X/k$ with the differential fundamental…

Algebraic Geometry · Mathematics 2026-04-22 Phùng Hô Hai , Võ Quôc Bao , Trân Phan Quôc Bao

A space $X$ is "sequentially $n$-connected" at $x\in X$ if for every $0\leq k\leq n$ and sequence of maps $f_1,f_2,f_3,\dots:S^k\to X$ that converges toward a point $x\in X$, the maps $f_m$ contract by a sequence of null-homotopies that…

Algebraic Topology · Mathematics 2021-03-26 Jeremy Brazas

Let $G$ be 2-generated group. The generating graph $\Gamma(G)$ of $G$ is the graph whose vertices are the elements of $G$ and where two vertices $g$ and $h$ are adjacent if $G = \langle g, h \rangle.$ This definition can be extended to a…

Group Theory · Mathematics 2020-02-18 Andrea Lucchini

We construct a cobordism group for embedded graphs in two different ways, first by using sequences of two basic operations, called "fusion" and "fission", which in terms of cobordisms correspond to the basic cobordisms obtained by attaching…

Algebraic Topology · Mathematics 2013-08-13 Ahmad Zainy Al-Yasry

We initiate the algorithmic study of the following "structured augmentation" question: is it possible to increase the connectivity of a given graph G by superposing it with another given graph H? More precisely, graph F is the superposition…

Data Structures and Algorithms · Computer Science 2017-06-15 Fedor V. Fomin , Petr A. Golovach , Dimitrios M. Thilikos

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

Rings and Algebras · Mathematics 2010-05-19 Wolfgang Bertram , Michael Kinyon

For all classical groups (and for their analogs in infinite dimension or over general base fields or rings) we construct certain contractions, called "homotopes". The construction is geometric, using as ingredient involutions of associative…

Rings and Algebras · Mathematics 2010-05-31 Wolfgang Bertram , Michael Kinyon

Let $G$ be a (finite or infinite) group such that $G/Z(G)$ is not simple. The non-commuting, non-generating graph $\Xi(G)$ of $G$ has vertex set $G \setminus Z(G)$, with vertices $x$ and $y$ adjacent whenever $[x,y] \ne 1$ and $\langle x, y…

Group Theory · Mathematics 2023-11-13 Saul D. Freedman

We show that many graphs naturally associated to a connected, compact, orientable surface are hierarchically hyperbolic spaces in the sense of Behrstock, Hagen and Sisto. They also automatically have the coarse median property defined by…

Geometric Topology · Mathematics 2022-05-04 Kate M. Vokes

We prove two results on geometric consequences of the representation of restricted holonomy group of a Hermitian connection. The first result concerns when such a Hermitian manifold is K\"ahler in terms of the torsion and the irreducibility…

Differential Geometry · Mathematics 2024-10-10 Lei Ni

We study complex analytic (possibly singular) projective connections on the plane. We characterize some of them in terms of their families of integral curves. We also give a beginning of classification of second order odes polynomial in the…

Differential Geometry · Mathematics 2023-01-12 Oumar Wone

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár
‹ Prev 1 3 4 5 6 7 10 Next ›