Related papers: Highly symmetric unstable maniplexes

Let $N\subset GL(n,R)$ be the group of upper triangular matrices with $1$s on the diagonal, equipped with the standard Carnot group structure. We show that quasiconformal homeomorphisms between open subsets of $N$, and more generally…

A graph $\Gamma$ is said to be stable if for the direct product $\Gamma\times\mathbf{K}_2$, ${\rm Aut}(\Gamma \times \mathbf{K}_2)$ is isomorphic to ${\rm Aut}(\Gamma) \times \mathbb{Z}_2$; otherwise, it is called unstable. An unstable…

A graph pair $(\Gamma, \Sigma)$ is called stable if $\aut(\Gamma)\times\aut(\Sigma)$ is isomorphic to $\aut(\Gamma\times\Sigma)$ and unstable otherwise, where $\Gamma\times\Sigma$ is the direct product of $\Gamma$ and $\Sigma$. A graph is…

In a graph whose vertices are assigned integer ranks, a path is well-ranked if the endpoints have distinct ranks or some interior point has a higher rank than the endpoints. A ranking is an assignment of ranks such that all nontrivial paths…

In this note we give a direct method to classify all stable forms on $\R^n$ as well as to determine their automorphism groups. We show that in dimension 6,7,8 stable forms coincide with non-degnerate forms. We present necessary conditions…

Consider the configuration spaces of manifold (closed or open). An influential theorem of McDuff and Segal shows that the (co)homology of unordered configuration spaces of open manifold is independent of number of configuration points in a…

We show rational homological stability for the homotopy automorphisms and block diffeomorphims of iterated connected sums of products of spheres. The spheres can have different dimension, but need to satisfy a certain connectivity…

A polyhedron in Euclidean 3-space is called a regular polyhedron of index 2 if it is combinatorially regular and its geometric symmetry group has index 2 in its combinatorial automorphism group; thus its automorphism group is…

Given an abstract polytope $\cal P$, its flag graph is the edge-coloured graph whose vertices are the flags of $\cal P$ and the $i$-edges correspond to $i$-adjacent flags. Flag graphs of polytopes are maniplexes. On the other hand, given a…

The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most reliable graphs…

For every $k \geq 2$ we construct infinitely many $4k$-dimensional manifolds that are all stably diffeomorphic but pairwise not homotopy equivalent. Each of these manifolds has hyperbolic intersection form and is stably parallelisable. In…

We will study homological stability of the diffeomorphism groups of the manifolds $W_{g,1}:=D^{2n} \# (S^n \times S^n)^{\#g }$ using $E_k$-algebras. This will lead to new improvements in the stability results, especially when working with…

The stability number of a graph G is the cardinality of a stability system of G (that is of a stable set of maximum size of G). A graph is alpha-stable if its stability number remains the same upon both the deletion and the addition of any…

Frei et al. [6] showed that the problem to decide whether a graph is stable with respect to some graph parameter under adding or removing either edges or vertices is $\Theta_2^{\text{P}}$-complete. They studied the common graph parameters…

For a smooth projective complex variety whose Albanese morphism is finite, we show that every Bridgeland stability condition on its bounded derived category of coherent sheaves is geometric, in the sense that all skyscraper sheaves are…

We find a sharp bound for the order of the automorphism group of a stable curve of genus $g$ with $3g-3$ nodes, and a sharp bound for the order of the automorphism group of such a curve with all smooth components. Combined with the results…

We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…

For a sequence $(H_i)_{i=1}^k$ of graphs, let $\textrm{nim}(n;H_1,\ldots, H_k)$ denote the maximum number of edges not contained in any monochromatic copy of $H_i$ in colour $i$, for any colour $i$, over all $k$-edge-colourings of~$K_n$.…

A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that ``neighbouring'' hypervertices have different colours. It is bipartite-uniform if within each of the sets of hypervertices of the same colour,…

Given a manifold with boundary, one can consider the space of subsurfaces of this manifold meeting the boundary in a prescribed fashion. It is known that these spaces of subsurfaces satisfy homological stability if the manifold has at least…