Related papers: Infinite cyclic impartial games

We show that if G is an infinitely generated locally (polycyclic-by-finite) group with cohomology almost everywhere finitary, then every finite subgroup of G acts freely and orthogonally on some sphere.

We prove that one cannot algorithmically decide whether a finitely presented $\mathbb{Z}$-extension admits a finitely generated base group, and we use this fact to prove the undecidability of the BNS invariant. Furthermore, we show the…

A group $\Gamma$ is said to be periodic if for any $g$ in $\Gamma$ there is a positive integer $n$ with $g^n=id$. We first prove that a finitely generated periodic group acting on the 2-sphere $\SS^2$ by $C^1$-diffeomorphisms with a finite…

There are presented sufficient conditions for existence of an infinite family of trajectories of an analytic gradient flow which converge to a critical point.

We introduce and analyse an extension of the disjunctive sum operation on some classical impartial games. Whereas the disjunctive sum describes positions formed from independent subpositions, our operation combines positions that are not…

We describe computational results about undirected graphs having $10$ vertices and automorphism group isomorphic to $\mathbb{Z}/4\mathbb{Z}$.

The entropy of a digraph is a fundamental measure which relates network coding, information theory, and fixed points of finite dynamical systems. In this paper, we focus on the entropy of undirected graphs. We prove that for any integer $k$…

Parity games are games that are played on directed graphs whose vertices are labeled by natural numbers, called priorities. The players push a token along the edges of the digraph. The winner is determined by the parity of the greatest…

We prove that, to every abstract group $G$, we can associate a sequence of graphs $\Gamma_n$ such that the automorphism group of $\Gamma_n$ is isomorphic to $G$ and the genus of $\Gamma_n$ is an unbounded function of $n$.

We analyze the Sprague-Grundy functions for a class of almost disjoint selective compound games played on Nim heaps. Surprisingly, we find that these functions behave chaotically for smaller Sprague-Grundy values of each component game yet…

Candogan et al. (2011) provide an orthogonal direct-sum decomposition of finite games into potential, harmonic and nonstrategic components. In this paper we study the issue of decomposing games that are strategically equivalent from a…

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…

A $k$-regular graph of girth $g$ is called edge-girth-regular graph, shortly egr-graph, if each of its edges is contained in exactly $\lambda$ distinct $g-$cycles. An egr-graph is called extremal for the triple $(k, g, \lambda)$ if has the…

We establish a generic result concerning order independence of a dominance relation on finite games. It allows us to draw conclusions about order independence of various dominance relations in a direct and simple way.

Planar locally finite graphs which are almost vertex transitive are discussed. If the graph is 3-connected and has at most one end then the group of automorphisms is a planar discontinuous group and its structure is well-known. A general…

Games on graphs provide a natural and powerful model for reactive systems. In this paper, we consider generalized reachability objectives, defined as conjunctions of reachability objectives. We first prove that deciding the winner in such…

We study algebraic properties on a group G such that if the discrete group G has these properties then every locally compact shift continuous topology on G with adjoined zero is either compact, or discrete. We introduce electorally flexible…

A connected undirected graph is called \emph{geodetic} if for every pair of vertices there is a unique shortest path connecting them. It has been conjectured that for finite groups, the only geodetic Cayley graphs are odd cycles and…

We study turn-based quantitative games of infinite duration opposing two antagonistic players and played over graphs. This model is widely accepted as providing the adequate framework for formalizing the synthesis question for reactive…