Related papers: Graphs of 2-torus actions

The Weisfeiler-Leman (WL) algorithm is a combinatorial procedure that computes colorings on graphs, which can often be used to detect their (non-)isomorphism. Particularly the 1- and 2-dimensional versions 1-WL and 2-WL have received much…

As a generalization of Davis-Januszkiewicz theory, there is an essential link between locally standard $(\Z_2)^n$-actions (or $T^n$-actions) actions and nice manifolds with corners, so that a class of nicely behaved equivariant…

We consider a normal complete rational variety with a torus action of complexity one. In the main results, we determine the roots of the automorphism group and give an explicit description of the root system of its semisimple part. The…

This paper develops techniques which are used to answer a number of questions in the theory of equivalence relations generated by continuous actions of abelian groups. The methods center around the construction of certain specialized…

We consider fully effective orientation-preserving smooth actions of a given finite group G on smooth, closed, oriented 3-manifolds M. We investigate the relations that necessarily hold between the numbers of fixed points of various…

In the first part of the paper, we build a foundation for further work on Hamiltonian actions on symplectic orbifolds. Most importantly we prove the orbifold versions of the abelian connectedness and convexity theorems. In the second half,…

Every planar simple graph with n vertices has at least 2^(n/9) Z5-colorings.

Construction of (colored) knot polynomials for double-fat graphs is further generalized to the case when "fingers" and "propagators" are substituting R-matrices in arbitrary closed braids with m-strands. Original version of arXiv:1504.00371…

We develop the theory of transformation semigroups that have degree 2, that is, act by partial functions on a finite set such that the inverse image of points have at most two elements. We show that the graph of fibers of such an action…

We prove several results concerning smooth $\mathbb R^k$ actions with the property that their leafwise Laplacian is globally hypoelliptic. Such actions are necessarily uniquely ergodic and minimal, and cohomology is often…

Let $(M,\omega)$ be a compact symplectic manifold with a Hamiltonian GKM action of a compact torus. We formulate a positive condition on the space; this condition is satisfied if the underlying symplectic manifold is monotone. The main…

Let $R$ be a finite ring with identity. The idempotent graph $I(R)$ is the graph whose vertex set consists of the non-trivial idempotent elements of $R$, where two distinct vertices $x$ and $y$ are adjacent if and only if $xy = yx = 0$. The…

We study fixed points of smooth torus actions on closed manifolds using fixed point formulas and equivariant elliptic genera. We also give applications to positively curved Riemannian manifolds with symmetry.

Let $A$ be a finite-dimensional gentle algebra over an algebraically closed field. We investigate the combinatorial properties of support $\tau$-tilting graph of $A$. In particular, it is proved that the support $\tau$-tilting graph of $A$…

We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…

A fall $k$-coloring of a graph $G$ is a proper $k$-coloring of $G$ such that each vertex of $G$ sees all $k$ colors on its closed neighborhood. We denote ${\rm Fall}(G)$ the set of all positive integers $k$ for which $G$ has a fall…

A 2-factor of a graph $G$ is a 2-regular spanning subgraph of $G$. We present a survey summarising results on the structure of 2-factors in regular graphs, as achieved by various researchers in recent years.

A set of vertices in a graph is agile if, however we partition the set into two parts, we can always find two vertex-disjoint connected subgraphs where one covers the first and the other the second part. We present a characterization for…

Let $0<k\in\mathbb{Z}$. Let the star 2-set transposition graph $ST^2_k$ be the $(2k-1)$-regular graph whose vertices are the $2k$-strings on $k$ symbols, each symbol repeated twice, with its edges given each by the transposition of the…

A \emph{geometric graph} is a graph whose vertex set is a set of points in general position in the plane, and its edges are straight line segments joining these points. We show that for every integer $k \ge 2$, there exists a constat $c>0$…