2,539 research outputs found
On several varieties of cacti and their relations
Motivated by string topology and the arc operad, we introduce the notion of
quasi-operads and consider four (quasi)-operads which are different varieties
of the operad of cacti. These are cacti without local zeros (or spines) and
cacti proper as well as both varieties with fixed constant size one of the
constituting loops. Using the recognition principle of Fiedorowicz, we prove
that spineless cacti are equivalent as operads to the little discs operad. It
turns out that in terms of spineless cacti Cohen's Gerstenhaber structure and
Fiedorowicz' braided operad structure are given by the same explicit chains. We
also prove that spineless cacti and cacti are homotopy equivalent to their
normalized versions as quasi-operads by showing that both types of cacti are
semi-direct products of the quasi-operad of their normalized versions with a
re-scaling operad based on R>0. Furthermore, we introduce the notion of
bi-crossed products of quasi-operads and show that the cacti proper are a
bi-crossed product of the operad of cacti without spines and the operad based
on the monoid given by the circle group S^1. We also prove that this particular
bi-crossed operad product is homotopy equivalent to the semi-direct product of
the spineless cacti with the group S^1. This implies that cacti are equivalent
to the framed little discs operad. These results lead to new CW models for the
little discs and the framed little discs operad.Comment: Published by Algebraic and Geometric Topology at
http://www.maths.warwick.ac.uk/agt/AGTVol5/agt-5-13.abs.htm
On the Graceful Game
A graceful labeling of a graph with edges consists of labeling the
vertices of with distinct integers from to such that, when each
edge is assigned as induced label the absolute difference of the labels of its
endpoints, all induced edge labels are distinct. Rosa established two well
known conjectures: all trees are graceful (1966) and all triangular cacti are
graceful (1988). In order to contribute to both conjectures we study graceful
labelings in the context of graph games. The Graceful game was introduced by
Tuza in 2017 as a two-players game on a connected graph in which the players
Alice and Bob take turns labeling the vertices with distinct integers from 0 to
. Alice's goal is to gracefully label the graph as Bob's goal is to prevent
it from happening. In this work, we study winning strategies for Alice and Bob
in complete graphs, paths, cycles, complete bipartite graphs, caterpillars,
prisms, wheels, helms, webs, gear graphs, hypercubes and some powers of paths
- …