Related papers: Graphs of 2-torus actions

A connected simple graph is said dual-hamiltonian if its vertex set has a $2$-coloring such that each color class induces a tree. We call such a coloring a hamiltonian coloring. We prove that if $G$ is a graph with a certain type of…

We study when the mapping class group of an infinite-type surface $S$ admits an action with unbounded orbits on a connected graph whose vertices are simple closed curves on $S$. We introduce a topological invariant for infinite-type…

The active bijection forms a package of results studied by the authors in a series of papers in oriented matroids. The present paper is intended to state the main results in the particular case, and more widespread language, of graphs. We…

A mixed graph is, informally, an object obtained from a simple undirected graph by choosing an orientation for a subset of its edges. A mixed graph is $(m, n)$-coloured if each edge is assigned one of $m \geq 0$ colours, and each arc is…

We study multisections of embedded surfaces in 4-manifolds admitting effective torus actions. We show that a simply-connected 4-manifold admits a genus one multisection if and only if it admits an effective torus action. Orlik and Raymond…

Let $(M, \omega)$ be a 6-dimensional closed symplectic manifold with a symplectic $S^1$-action with $M^{S^1} \neq \emptyset$ and $\dim M^{S^1} \leq 2$. Assume that $\omega$ is integral with a generalized moment map $\mu$. We first prove…

We describe all possible coactions of finite groups (equivalently, all group gradings) on two-dimensional Artin-Schelter regular algebras. We give necessary and sufficient conditions for the associated Auslander map to be an isomorphism,…

Let $M^{2d}$ be a compact symplectic manifold and $T$ a compact $n$-dimensional torus. A Hamiltonian action, $\tau$, of $T$ on $M$ is a GKM action if, for every $p \in M^T$, the isotropy representation of $T$ on $T_pM$ has pair-wise…

Let G be an n-dimensional torus and $\tau$ a Hamiltonian action of G on a compact symplectic manifold, M. If M is pre-quantizable one can associate with $\tau$ a representation of G on a virtual vector space, Q(M), by…

We introduce topological invariants of semi-decompositions (e.g. filtrations, semi-group actions, multi-valued dynamical systems, combinatorial dynamical systems) on a topological space to analyze semi-decompositions from a dynamical…

In this paper we study smooth orientation-preserving free actions of the cyclic group $\mathbb Z/m$ on a class of $(n-1)$-connected $2n$-manifolds, $\sharp g (S^n \times S^n)\sharp \Sigma$, where $\Sigma$ is a homotopy $2n$-sphere. When…

We construct a group acting on a binary rooted tree; this discrete group mimics the monodromy action of iterates of $f(z)=z^2-1$ on associated coverings of the Riemann sphere. We then derive some algebraic properties of the group, and…

It is known that the canonical double cover of any connected nonbipartite graph have an automorphism group of the form $H \rtimes \mathbb{Z}_2$, where $H$ is the set of automorphism which preserve bipartite parts. We construct connected…

Let the compact torus $T^{n-1}$ act on a smooth compact manifold $X^{2n}$ effectively with nonempty finite set of fixed points. We pose the question: what can be said about the orbit space $X^{2n}/T^{n-1}$ if the action is cohomologically…

Given a graph $G$, we determine the structure of the rotation graph of a graph obtained by applying certain operations to $G$. Specifically, we consider the operations of adding a simplicial vertex, adding a true twin to a vertex, and the…

We consider collections of disjoint simple closed curves in a compact orientable surface which decompose the surface into pairs of pants. The isotopy classes of such curve systems form the vertices of a 2-complex, whose edges correspond to…

Let $Z\subset\mathbb{C}^N$ be an $n$-pseudoconcave subset, for $1\leq n<N$, which is locally the graph of a continuous function over a closed subset of $\mathbb{C}^n\times\mathbb{R}$. We show that $Z$ can be realised as the disjoint union…

Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…

k-graphs are higher-rank analogues of directed graphs which were first developed to provide combinatorial models for operator algebras of Cuntz-Krieger type. Here we develop a theory of the fundamental groupoid of a k-graph, and relate it…