相关论文: Graphs and $({\Bbb Z}_2)^k$-actions

This paper applies the decomposition theorem in intersection cohomology to geometric invariant theory quotients, relating the intersection cohomology of the quotient to that of the semistable points for the action. Suppose a connected…

We show that the simply-connected four-manifolds which admit locally linear, homologically trivial actions by rank two finite abelian groups are homeomorphic to connected sums of CP^2, -CP^2, and S^2 x S^2 (with one exception: pseudofree…

We define an infinite graded graph of ordered pairs and a~canonical action of the group $\mathbb{Z}$ (the adic action) and of the infinite sum of groups of order two~$\mathcal{D}=\sum_1^{\infty} \mathbb{Z}/2\mathbb{Z}$ on the path space of…

We present a simple approach to questions of topological orbit equivalence for actions of countable groups on topological and smooth manifolds. For example, for any action of a countable group $\Gamma$ on a topological manifold where the…

A well-known result of Tutte says that if Gamma is an Abelian group and G is a graph having a nowhere-zero Gamma-flow, then G has a nowhere-zero Gamma'-flow for each Abelian group Gamma' whose order is at least the order of Gamma. Jaeger,…

An edge-colored graph is said to be balanced if it has an equal number of edges of each color. Given a graph $G$ whose edges are colored using two colors and a positive integer $k$, the objective in the Edge Balanced Connected Subgraph…

We investigate the extent to which the $k$-coloring graph $\mathcal{C}_{k}(G)$ uniquely determines the base graph $G$ and the number of colors $k$. The vertices of $\mathcal{C}_{k}(G)$ are the proper $k$-colorings of $G$, and edges connect…

In this work we consider a straightforward linear programming formulation of the recently introduced $\{k\}$-packing function problem in graphs, for each fixed value of the positive integer number $k$. We analyse a special relation between…

We present a sufficient condition for the stability property of extremal graph problems that can be solved via Zykov's symmetrisation. Our criterion is stated in terms of an analytic limit version of the problem. We show that, for example,…

We study discrete, cocompact, isometric actions of groups on Hadamard spaces, and the induced actions on ideal boundaries. For a class of groups generalizing fundamental groups of three-dimensional graph manifolds, we find a set of…

Classical invariant theory establishes a systematic correspondence between algebraic and smooth invariants for compact and reductive Lie groups. However, the extension of these results to non-compact and non-reductive regimes remains a…

Let $\textbf{k} := (k_1,\ldots,k_s)$ be a sequence of natural numbers. For a graph $G$, let $F(G;\textbf{k})$ denote the number of colourings of the edges of $G$ with colours $1,\dots,s$ such that, for every $c \in \{1,\dots,s\}$, the edges…

Let $G = (V,E)$ be a graph, and for each $e \in E(G)$, let $L_e$ be a list of real numbers. Let $w:E(G) \to \cup_{e \in E(G)}L_e$ be an edge weighting function such that $w(e) \in L_e$ for each $e \in E(G)$, and let $c_w$ be the vertex…

In this paper we prove several related results concerning smooth $\Z_p$ or $\s^1$ actions on 4-manifolds. We show that there exists an infinite sequence of smooth 4-manifolds $X_n$, $n\geq 2$, which have the same integral homology and…

Let $\sigma$ denote an endomorphism of a smooth algebraic group $G$ over the algebraic closure of a finite field, and assume all iterates of $\sigma$ have finitely many fixed points. Steinberg gave a formula for the number of fixed points…

In this paper, we prove various results for circle actions on compact unitary manifolds with discrete fixed point sets, generalizing results for almost complex manifolds. For a circle action on a compact unitary manifold with a discrete…

For a finitely generated free group F_n, of rank at least 2, any finite subgroup of Out(F_n) can be realized as a group of automorphisms of a graph with fundamental group F_n. This result, known as Out(F_n) realization, was proved by…

Let $k \geq 3$. We prove the following three bounds for the matching number, $\alpha'(G)$, of a graph, $G$, of order $n$ size $m$ and maximum degree at most $k$. If $k$ is odd, then $\alpha'(G) \ge \left( \frac{k-1}{k(k^2 - 3)} \right) n \,…

We study the number of connected graphs with $n$ vertices that cannot be written as the cartesian product of two graphs with fewer vertices. We give an upper bound which implies that for large $n$ almost all graphs are both connected and…

We calculate geometric and homotopical (or stable) bordism rings associated to semi-free $S^1$ actions on complex manifolds, giving explicit generators for the geometric theory. The classification of semi-free actions with isolated fixed…