English
Related papers

Related papers: Highly symmetric unstable maniplexes

200 papers

We prove that uniform hyperbolicity is invariant under topological conjugacy for dissipative polynomial automorphisms of C^2. Along the way we also show that a sufficient condition for hyperbolicity is that local stable and unstable…

Complex Variables · Mathematics 2020-06-04 Eric Bedford , Romain Dujardin

Wahl recently proved that the homology of the non-orientable mapping class group stabilizes as the genus increases. In this short note we analyse the situation where the underlying non-orientable surfaces have marked points.

Algebraic Topology · Mathematics 2008-06-09 Elizabeth Hanbury

We provide an upper bound to the number of graph homomorphisms from $G$ to $H$, where $H$ is a fixed graph with certain properties, and $G$ varies over all $N$-vertex, $d$-regular graphs. This result generalizes a recently resolved…

Combinatorics · Mathematics 2015-10-26 Yufei Zhao

An automorphism of a graph is called quasi-semiregular if it fixes a unique vertex of the graph and its remaining cycles have the same length. This kind of symmetry of graphs was first investigated by Kutnar, Malni\v{c}, Mart\'{i}nez and…

Combinatorics · Mathematics 2021-08-02 Fu-Gang Yin , Yan-Quan Feng , Jin-Xin Zhou , A-Hui Jia

The rank of a graph is defined to be the rank of its adjacency matrix. A graph is called reduced if it has no isolated vertices and no two vertices with the same set of neighbors. Akbari, Cameron, and Khosrovshahi conjectured that the…

Combinatorics · Mathematics 2014-04-29 E. Ghorbani , A. Mohammadian , B. Tayfeh-Rezaie

We show that among the Euclidean submanifolds with codimension two the ones of rank two that are parabolic but nonruled are isometrically rigid. This generalizes the result in [10] that these submanifolds are genuinely rigid. In addition,…

Differential Geometry · Mathematics 2009-04-01 Marcos Dajczer , Pedro Morais

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

Quantum Algebra · Mathematics 2019-07-01 Christian Eder , Viktor Levandovskyy , Julien Schanz , Simon Schmidt , Andreas Steenpass , Moritz Weber

We construct examples of nonresolvable generalized $n$-manifolds, $n\geq 6$, with arbitrary resolution obstruction, homotopy equivalent to any simply connected, closed $n$-manifold. We further investigate the structure of generalized…

Geometric Topology · Mathematics 2009-09-25 John L. Bryant , Steven C. Ferry , Washington Mio , Shmuel Weinberger

Let $M$ be a compact Riemannian manifold, and let $G$ be a compact simple Lie group with bi-invariant metric that is not $\operatorname{Sp}(n)$ for $n \geq 8$, $E_{8}$, $F_{4}$, or $G_{2}$. We show that the singular set of any stable…

Differential Geometry · Mathematics 2026-05-06 Jacob Krantz

The Fibonacci index of a graph is the number of its stable sets. This parameter is widely studied and has applications in chemical graph theory. In this paper, we establish tight upper bounds for the Fibonacci index in terms of the…

Discrete Mathematics · Computer Science 2024-03-11 Véronique Bruyère , Hadrien Mélot

For each g greater than one there is a 3-manifold with two genus g Heegaard splittings that require g stabilizations to become equivalent. Previously known examples required at most one stabilization. Control of families of Heegaard…

Geometric Topology · Mathematics 2014-11-11 Joel Hass , Abigail Thompson , William Thurston

The Erd\H{o}s-Simonovits stability theorem is one of the most widely used theorems in extremal graph theory. We obtain an Erd\H{o}s-Simonovits type stability theorem in multi-partite graphs. Different from the Erd\H{o}s-Simonovits stability…

Combinatorics · Mathematics 2026-01-14 Wanfang Chen , Changhong Lu , Long-Tu Yuan

We compute the rational stable homology of the automorphism groups of free nilpotent groups. These groups interpolate between the general linear groups over the ring of integers and the automorphism groups of free groups, and we employ…

K-Theory and Homology · Mathematics 2019-08-02 Markus Szymik

We prove that the boundary of the trapped region in an asymptotically Euclidean Riemannian manifold of dimension at least 3 is a stable smooth minimal hypersurface except for a singular set of codimension at least 8.

Differential Geometry · Mathematics 2018-09-05 Eric Larsson

Given a simply connected, closed four manifold, we associate to it a simply connected, closed, spin five manifold. This leads to several consequences : the stable and unstable homotopy groups of such a four manifold is determined by its…

Algebraic Topology · Mathematics 2015-12-29 Samik Basu , Somnath Basu

A 2-cell embedding of a graph $G$ into a closed (orientable or nonorientable) surface is called regular if its automorphism group acts regularly on the flags - mutually incident vertex-edge-face triples. In this paper, we classify the…

Combinatorics · Mathematics 2010-01-19 Jin Ho Kwak , Young Soo Kwon

Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…

Combinatorics · Mathematics 2023-10-31 Martin Milanič , Nicolas Trotignon

For the universal isomonodromic deformation of an irreducible logarithmic rank two connection over a smooth complex projective curve of genus at least two, consider the family of holomorphic vector bundles over curves underlying this…

Algebraic Geometry · Mathematics 2017-09-13 Indranil Biswas , Viktoria Heu , Jacques Hurtubise

We classify closed, simply connected $n$-manifolds of non-negative sectional curvature admitting an isometric torus action of maximal symmetry rank in dimensions $2\leq n\leq 6$. In dimensions $3k$, $k=1,2$ there is only one such manifold…

Differential Geometry · Mathematics 2012-07-27 Fernando Galaz-Garcia , Catherine Searle

A graph is strongly perfect if every induced subgraph H has a stable set that meets every nonempty maximal clique of H. The characterization of strongly perfect graphs by a set of forbidden induced subgraphs is not known. Here we provide…

Combinatorics · Mathematics 2020-03-05 Maria Chudnovsky , Cemil Dibek , Paul Seymour
‹ Prev 1 8 9 10 Next ›