Related papers: Graphs of 2-torus actions

Actions of finite groups on stable curves are studied. They appear naturally at the boundary of a moduli space of smooth curves with group actions. Those actions which can equivariantly smoothed are characterised. A description of…

A maniplex of rank n is a connected, n-valent, edge-coloured graph that generalises abstract polytopes and maps. If the automorphism group of a maniplex M partitions the vertex-set of M into k distinct orbits, we say that M is a k-orbit…

Given an oriented surface of positive genus with finitely many punctures, we classify the finite orbits of the mapping class group action on the moduli space of semisimple complex special linear two dimensional representations of the…

We define globally hypoelliptic smooth $\mathbb R^k$ actions as actions whose leafwise Laplacian along the orbit foliation is a globally hypoelliptic differential operator. When $k=1$, strong global rigidity is conjectured for such actions…

We consider $G_2$-manifolds with an effective torus action that is multi-Hamiltonian for one or more of the defining forms. The case of $T^3$-actions is found to be distinguished. For such actions multi-Hamiltonian with respect to both the…

In this work, we delve into the study of the 2-switch-degree of a graph $G$, which is nothing more than the degree of $G$ as a vertex of the realization graph $\mathcal{G}(d)$ associated with the degree sequence $d$ of $G$. We explore the…

In this article we consider a generalization of manifolds and orbifolds which we call quasifolds; quasifolds of dimension k are locally isomorphic to the quotient of R^k by the action of a discrete group - tipically they are not Hausdorff…

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…

Let a torus $T$ act smoothly on a compact smooth manifold $M$. If the rational equivariant cohomology $H^*_T(M)$ is a free $H^*_T(pt)$-module, then according to the Chang-Skjelbred Lemma, it can be determined by the $1$-skeleton consisting…

We examine $t$-colourings of oriented graphs in which, for a fixed integer $k \geq 1$, vertices joined by a directed path of length at most $k$ must be assigned different colours. A homomorphism model that extends the ideas of Sherk for the…

We define an operation on finite graphs, called co-contraction. By showing that co-contraction of a graph induces an injective map between right-angled Artin groups, we exhibit a family of graphs, without any induced cycle of length at…

A conjecture of Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy says that in every $2$-coloring of the edges of the complete $k$-uniform hypergraph $K_n^k$, there are two disjoint monochromatic loose paths of distinct colors such that they cover all…

We determine the homeomorphism (resp. diffeomorphism) types of those 2-connected 7-manifolds (resp. smooth 2-connected 7-manifolds) that admit regular circle actions (resp. smooth regular circle actions).

$(1^a, 2^b)$-coloring is the problem of partitioning the vertex set of a graph into $a$ independent sets and $b$ 2-independent sets. This problem was recently introduced by Choi and Liu. We study the computational complexity and extremal…

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete.…

Consider the action of $SL(n+1,\mathbb{R})$ on $\mathbb{S}^n$ arising as the quotient of the linear action on $\mathbb{R}^{n+1}\setminus\{0\}$. We show that for a semigroup $\mathfrak{S}$ of $SL(n+1,\mathbb{R})$, the following are…

In a number of recent works [6, 7] the authors have introduced and studied a functor $\mathcal{F}_k$ which associates to each loose graph $\Gamma$ -which is similar to a graph, but where edges with $0$ or $1$ vertex are allowed - a…

Let $2\le k\in\mathbb{Z}$. A total coloring of a$k$-regular simple graph via $k+1$ colors is an efficient total coloring if each color yields an efficient dominating set, where the efficient domination condition applies to the restriction…

In recent work the author investigates perfect matchings of a bipartite graph obtained from a knot diagram and demonstrates that these correspond to discrete Morse functions on a 2-complex for the 2-sphere. This relationship is expounded…

An alternating cycle in a 2-two-edge-colored graph is a cycle such that any two consecutive edges have different colors. Let $G_1, \ldots, G_k$ be a collection of pairwise vertex disjoint 2-edge-colored graphs. The colored generalized sum…