Voltage Operations on Maniplexes, Polytopes and Maps

Classical geometric and topological operations on polyhedra, maps and polytopes often give rise to structures with the same symmetry group as the original one, but with more flags. In this paper we introduce the notion of voltage operations on maniplexes, as a way to unify the study of such operations and generalize them to other geometric and combinatorial structures such as abstract polytopes, hypermaps, maniplexes or hypertopes. This can be done since our technique provides a way to study classical operations in a graph theoretic setting, and thus to apply a voltage operation one only needs that the combinatorial structure in hand can be understood as an n-valent properly n-edge colored graph. For example, in the case of abstract polytopes, the partial order can be encoded into the so-called flag graph of the polytope and the voltage operation is therefore applied to such flag graph to then be recovered as a partial order. We focus on studying the interactions between voltage operations and the symmetries of the operated object, and show that these operations can be potentially used to build maniplexes with prescribed symmetry type graphs. Moreover, a complete characterization of when an operation can be seen as a voltage operation is given.


Introduction
Traditionally, operations on polyhedra induce local transformations on the vertices, edges or faces. Classical examples include the Wythoffian ones, such as truncation and medial (see [3, chs. VIII and XI ] and Sect. 4). Classical operations often give rise to maps or polytopes with the same symmetry group as the original one, but with more flags. Thus, by applying one of these operations to a polytope we get a new polytope with more flag orbits. Furthermore, it is not difficult to see that, often, the "local configuration" of the flags does not depend on the original polytope but on the operation per se. Could we use operations to get any local configuration of the flag orbits? We shall explain this question more precisely later on.
Operations on maps and polytopes have been studied previously. For example, in [24], Orbanič, Pellicer and Weiss explore map operations to build k-orbit maps. They take a combinatorial approach and divide each flag (incident triplets vertex-edgeface) of a map into several new ones. In a very recent paper [6] Cunningham, Pellicer and Williams introduce stratified operations to study monodromy groups of some important families of non-regular maniplexes (a generalization of -the flag graph ofpolytopes, where some conditions are relaxed; see Sect. 2.2). This concept is closely related to our concept of voltage operation and many of their results can be written in our language and vice versa. However, not all classical operations have been studied in this combinatorial form. As an example, we have the snub operation, which is well known. The snub has the particularity that one should not take all flags of the original convex polyhedron P to obtain the operated one, but only half of them. Alternatively, one can take all the flags of P and obtain two connected components that, if P is regular, one might regard as the two enantiomorphic forms of the snub. The previously studied operations assign one or more new flags to each flag of the operated object to obtain a connected object; voltage operations allow this to change, so we can obtain a much broader class of operations on polyhedra, maps, polytopes or maniplexes.
The flag graph of a polytope P is a properly edge-colored n-valent graph whose vertices are the flags of P and two of them are adjacent if the corresponding flags differ in exactly one element. The colors of the edges are given by the type of element they differ in. The quotient of the flag graph of P by its symmetry group is the symmetry type graph of P. The symmetry type graph can be thought as a way to represent the local configuration of the flag orbits.
We can notice that when we apply a classical operation to different regular polyhedra, the resulting polyhedra often have isomorphic symmetry type graphs. (For example, if Med represents the medial operation and P is a regular polyhedron, the symmetry type graph of Med(P) will have either one single vertex, or two vertices and an edge of color 2 joining them, depending on whether or not P is self-dual.) Moreover, if we apply an operation to two polyhedra, both with the same symmetry type graph T , it is very likely that both resulting polyhedra have the same symmetry type graph T .
A natural question to ask is: given a properly edge-colored n-valent graph T , is there a maniplex whose symmetry type graph is T ? Going back to operations, can we find an operation O such that if P is a regular maniplex, then the symmetry type graph of O(P) is precisely T ? These questions give rise to voltage operations as a potential useful tool to find answers. Voltage operations define a technique that uses voltage graphs to generalize the above mentioned classical operations, as well as many others, even in higher dimensions (or ranks). These operations can also be defined for maniplexes. But not only that, they can also be defined for premaniplexes, a more general concept that includes both maniplexes and their symmetry type graphs.
It is important to remark that voltage graphs have been used before in constructing polytope-like structures. Notably, in [26] the authors use voltage graphs to build 2-orbit n-maniplexes (for n ≥ 4) with prescribed symmetry type graphs. In [4] the authors use voltage graphs, without explicitly mentioning them, to find generators and relations for the automorphism group of 3-orbit polytopes. In [14], the first and second authors of this manuscript exploited extensively the use of voltage graphs to solve some relevant problems in the area, namely, problems 1 and 2 in [5] (see also [22]).
We start this paper by giving some basic definitions that we shall need throughout the manuscript. In Sect. 3 we give the definition of a voltage operation and look in detail into the mix of two maniplexes (also called parallel product [31]) as a voltage operation; we also study some connectivity properties of the voltage operations. In Sect. 4 we explore some examples of classical operations on polytopes and polyhedra. In particular we show how pyramids, prisms, Wythoffian operations, among others, can be seen as voltage operations. In Sect. 5

we describe how automorphisms and voltage operations interact. We show that if M is a maniplex with symmetry type T and O is a voltage operation, then every automorphism of M induces an automorphism of O(M).
That is, the automorphism group of M is a subgroup of the automorphism group of O(M). Moreover, we show that the symmetry type graph of O(M) with respect to the automorphism group of M can be obtained by applying the voltage operation to T . In Sect. 6 we show that voltage operations are closed under composition and we find a simple way to describe the composition of two voltage operations. Finally, in Sect. 7 we give conditions for two voltage operations to be equivalent. We also characterize voltage operations in terms of what they do to the flag graph of the universal polytope U (introduced in [27] and defined in Sect. 2.2 as a maniplex). More precisely, in Theorem 5.1 we prove that if O is an operation that assigns a premaniplex O(X ) to each premaniplex X , then O is a voltage operation if and only if O(U/ ) ∼ = O(U)/ for every group ≤ (U).

Graphs
In this work we use the definition of graph used in [19], which is slightly more general than the usual definition. A graph X is a quadruple The edges are the orbits of D under the action of (·) −1 . If an edge consists only of a single dart, that is, a dart d that satisfies d −1 = d, then it is called a semiedge. A loop is an edge consisting of two darts whose initial vertex is the same. A link is an edge that is not a loop or a semiedge. That is, an edge whose two darts are different and have different starting points.
Usually a graph X is defined by its vertex set V (X ) and the set E(X ) of edges. We can recover the set of darts as the set of formal pairs The function I is given by I ( e v) = v and if an edge e is incident to the vertices u and v, then ( e v) −1 = e u. Formally speaking, this definition turns loops into semiedges. In this work we will not use graphs with loops hence we allow this small abuse.
In other words, the initial vertex (resp. inverse) of the image of a dart is the image of initial vertex (resp. inverse) of such dart. In this work we shall evaluate graph homomorphisms (hence, isomorphisms and automorphism, defined below) on the right, but any other function on the left. If v ∈ V (X ) and d ∈ D(X ), we shall write v f and d f instead of v f V and d f D . If both f V and f D are bijective and is also a graph homomorphism, then we say that f (and f −1 ) is an isomorphism and that X and Y are isomorphic (and write X ∼ = Y ). Naturally, for a graph X , an automorphism is an isomorphism f : X → X .
A path is a finite sequence W = (d 1 , . . . , d k ) of darts such that the endpoint of d i is the starting point of d i+1 for i ∈ {0, . . . , k − 1}. We usually omit commas and parentheses and simply write W = d 1 . . . d k . The number k is the length of W . The starting point of d 1 is the starting point of W ; we also say that W starts at I (d 1 ). Similarly, the endpoint of W is the endpoint of d k and we say that W ends at this vertex. We might slightly abuse notation and define a path of length 0 as a single vertex. A path is closed if its starting point and its endpoint are the same vertex.
Notions such as valency of a vertex, cycle, subgraphs, connectivity, connected components and trees extend naturally from the classic definition of graphs and paths.
Given a path W = d 1 . . . d k , an elementary (graph) move consists in inserting or removing a pair of consecutive inverse darts at any point in the sequence d 1 , . . . , d k . If a path W can be obtained from a path W by applying a series of elementary moves then we say that the paths are graph-homotopic (and write W ∼ W ). Clearly graphhomotopy is an equivalence relation and we often identify a path with its homotopy class. Observe that if W is graph-homotopic to a path of length 0 then W must be closed.
Given two paths W 1  The fundamental groupoid of a graph X , denoted by (X ) is the set of graphhomotopy classes of X with the partial operation defined above. If u is a vertex in X , then the fundamental group of X at u, denoted by u (X ) is the set of graph-homotopy classes of closed paths at u with concatenation as operation. Observe that u (X ) is actually a group and that if W is a path from v to u then v (X ) = W u (X )W −1 .
If X is a graph and G is a group, a voltage assignment is a function ξ : (X ) → G that satisfies ξ(W 1 W 2 ) = ξ(W 2 )ξ(W 1 ) for any two compatible paths W 1 and W 2 . 1 The group G is called the voltage group of ξ and the pair (X , ξ) is called a voltage graph.
Since every path can be thought as the product of its darts, we can regard a voltage assignment as a function ξ : If (X , ξ) is a voltage graph, the derived graph is the graph X ξ whose vertices and darts are the elements in V (X ) × G and D(X ) × G, respectively. The initial vertex of a dart (d, g) is (I (d), g) and its inverse is (d −1 , ξ(d)g). The adjacent vertices of a given vertex (x, g) are the vertices (y, ξ(d)g) for each dart d starting at x and ending at y. Equivalently, two vertices (x, g) and (y, h) are connected if there exists a dart d starting at x and ending at y whose voltage is hg −1 .
If X is a graph and ξ : (X ) → and ζ : (X ) → are voltage assignments, then ξ and ζ are equivalent if there is an isomorphism X ξ → X ζ such that the following diagram commutes: where the arrows pointing to X are the projection to the first coordinate, which is a homomorphism. The following theorem is well known (see [19]): is a connected voltage graph and x 0 is a vertex in X , there exists a voltage assignment ξ on X satisfying that: • there is a spanning tree T of X such that for every dart d in T , ξ (d) = 1.
Note that if X is connected, without loss of generality, we can assume that a voltage assignment ξ on X satisfies the last two conditions of Theorem 2.1. We can think of the spanning tree T as a fundamental region for the group G.

Premaniplexes and Maniplexes
A properly n-edge-colored graph is an n-valent graph X (that is, a graph whose vertices have all valency n) and a function c : for every dart d and if d 1 and d 2 are such that I (d 1 Observe that c induces a proper edge-coloring in the classical sense.
A premaniplex of rank n or simply n-premaniplex is a properly n-edge-colored graph X such that every vertex is the starting point of one dart of each color and if i, j ∈ {0, . . . , n − 1} are such that |i − j| ≥ 2, then the alternating paths of length 4 with colors i, j are closed.
If a premaniplex X is connected and simple, that is, if there are no semiedges or parallel edges, then we say that X is a maniplex. Maniplexes were introduced in [32] as a combinatorial generalization of maps to higher ranks. Constructions of maniplexes with given symmetry properties can be found in [26]. Natural examples of maniplexes are the flag graphs of polytopes. In fact, if X is a maniplex, we usually call its vertices flags. Moreover, if M is an n-maniplex and i ∈ {0, . . . , n − 1}, the i-faces of M are the connected components of M after removing the edges of color i. More generally, if 0 ≤ k < ≤ n − 1 the (k, )-sections of M are the connected components of M after removing the edges of color i if i < k or i > . Note that when M is the flag graph of a polytope P, the faces and sections of M are in correspondence with the faces and sections of P. This close relation between flag graphs of polytopes and maniplexes allows us to think of polytopes in a graph-theoretical approach. In this paper, we slightly abuse language and whenever we talk of a polytope P we actually refer to the flag graph of P. In [9] Garza-Vargas and Hubard characterize when a maniplex is the flag graph of a polytope. Finally, observe that the notions of flags, sections and faces extend naturally to premaniplexes. However, we shall keep the use of the word flag just for the case when a premaniplex is actually a maniplex.
If X is a premaniplex, whenever we write x ∈ X we mean that that x is a vertex in X . If x is a vertex in an n-premaniplex, and i ∈ {0, . . . , n − 1} we denote by i x the dart of color i whose starting point is x. We denote by x i the i-adjacent vertex of x, that is, the endpoint of the dart i x.
Given two n-premaniplexes X and X , a (premaniplex) homomorphism from X to X is a function that preserves i-adjacencies, for i ∈ {0, . . . , n − 1}. In the particular case where X and X are prepolytopes, these homomorphisms are called rap-maps. It is easy to prove that if X is connected, every homomorphism with codomain X is surjective (see [23, Lemma 2.5] for a proof for rap-maps that naturally extends to homomorphism of premaniplexes). In general, every connected component of X is either contained completely in the image of a homomorphism or in its complement. The class of all n-premaniplexes together with the premaniplex homomorphisms as arrows forms a category which we will call pMpx n . A surjective homomorphism is called a covering. If there is a covering from X to X we say that X covers X . It is easy to see that if X is connected, any homomorphism from X to X is a covering. The notions of isomorphism and automorphism of premaniplexes are defined in the usual way. The automorphism group of X is denoted by (X ), and acts naturally on vertices, i-faces and (k, )-sections. Such actions will be considered as right actions.
A premaniplex X is regular (or reflexible) if (X ) acts transitively on vertices. We say that X is a k-orbit premaniplex if (X ) induces k orbits on vertices. These notions coincide with the analogous notions for polytopes. For example, the flag graph of a polytope is a regular maniplex if and only if the polytope is regular itself.
If X is an n-premaniplex and ≤ (X ) the quotient X / is the n-edge-colored graph whose vertices are the orbits {x : x ∈ V (X )} and for i ∈ {0, . . . , n − 1} (x ) i = (x i ) . Observe that the adjacencies are well-defined since (x i )γ = (xγ ) i for every γ ∈ (X ). Moreover, it is straightforward that X / is an n-premaniplex.
If M is a maniplex and ≤ (M), the symmetry type graph of M with respect to is the quotient M/ . In particular, when = (M) then the quotient M/ is the symmetry type graph of M (see [4,22]).
The universal rank-n Coxeter group (with string diagram) is the group C n = ρ 0 , . . . ρ n−1 defined by the following relations: The universal n-maniplex U n is the Cayley graph associated with the universal Coxeter group C n . That is, the vertex set of U n is C n and for γ ∈ C n , the i-adjacent vertex of γ is ρ i γ . The maniplex U n is in fact the flag graph of the universal polytope {∞, . . . , ∞} introduced by Schulte in [27] (see [20, sect. 3D] [12, Theorem 5.2]). We omit the rank of both the universal Coxeter group and the universal maniplex whenever it is implicit.
Since the universal Coxeter group C acts transitively by automorphisms on the universal maniplex U, then U is a regular maniplex. In fact, (U) is precisely C.
We denote by r i the permutation of V (U) that swaps every vertex x with x i . More precisely, for γ ∈ C = V (U), r i : γ → ρ i γ .
The monodromy group of U, denoted by Mon(U), is the permutation group of V (U) generated by {r 0 , . . . , r n−1 }. We call monodromies the elements of Mon(U). The group Mon(U) admits a (left) action on X that is compatible with the (right) action of (X ), that is for every x ∈ V (X ), γ ∈ (X ) and i ∈ {0, . . . , n − 1}.
Observe that the elements r 0 , . . . , r n−1 satisfy the relations In fact, there exists an isomorphism from C to Mon(U) mapping ρ i to r i (see [23,Theorem 3.9]).
The relations in Equation (2.3) imply that if X is any n-premaniplex, then Mon(U) acts on X by r i : x → x i for every vertex x and i ∈ {0, . . . , n − 1}. The monodromy group of X is the permutation group induced by this action. Naturally, we denote this group by Mon(X ). It is important to remark that the term connection group has been used for what we call the monodromy group and has gained popularity in the last few years.
Recall that for a vertex x and i ∈ {0, . . . , n − 1}, i x denotes the dart of color i whose starting point is x. We can generalize this notation. If W is a path starting at x and following the colors i 1 , i 2 , . . . , i k then we write W = i k ,i k−1 ,...,i 1 x. For every vertex x and i 1 , i 2 , . . . , i k ∈ {0, . . . , n − 1}, the path i k ,i k−1 ,...,i 1 x ends at the vertex r i k · · · r i 1 x.
Given a vertex y of U and a path W = i k ,i k−1 ...,i 1 x in a premaniplex X , the lift of W starting at y is simply the path i k ,i k−1 ,...,i 1 y in U.
An elementary (maniplex) move on a path w x with w = i k , i k−1 , . . . , i 1 consists of either adding or removing the same color two times at any two consecutive positions (i.e. if v = i k , . . . , i , j, j, i −1 , . . . , i 1 then w x → v x and v x → w x are elementary moves) or swapping two non-consecutive colors in consecutive positions, more precisely, if |i − i −1 | > 1, and u = i k , . . . , i +1 , i −1 , i , i −2 , . . . , i 1 then w x → u x is an elementary move. We say that two paths in a premaniplex are maniplex-homotopic if we can turn one into the other by a finite sequence of elementary (maniplex) moves. Observe that two paths in an premaniplex are homotopic if their lifts to the universal maniplex U starting at a the same vertex also end at the same vertex.
The homotopy class of a path in a premaniplex is uniquely determined by its starting vertex and a monodromy of the universal maniplex. If w ∈ Mon(U n ) and w = r i k · · · r i 1 is a word representing w, then we denote by w x the homotopy class of the path i k ,i k−1 ,...,i 1 x. Observe that any two words representing w yield homotopic paths and if W 1 , W 2 ∈ w x, then both paths end at wx.
Let X be a premaniplex and let (X ) be its fundamental groupoid. If ξ : (X ) → is a voltage assignment such that ξ(W ) is the identity in whenever W is a path of length 4 alternating between two non-consecutive colors, we say that the pair (X , ξ) is a voltage premaniplex. In other words, a voltage premaniplex is a voltage graph where the voltage of the maniplex homotopy class of a path is well defined.

Voltage operations
Let X be an n-premaniplex and let Y be an m-premaniplex. Consider the voltage assignment η : Fig. 1). Since, in Y, there is an i-edge from y to r i y, then the darts i y and i r i y are inverse, implying that η( i r i y)η( i y) is the identity. Thus, each vertex of the graph X η Y has exactly one i-edge and, hence, it has valency m.
In the terminology of [19], X η Y is the derived graph from the voltage space (X , Mon(U); η) with X being the abstract fiber.
A pair (Y, η) is called a voltage operator if it is a voltage premaniplex with η : Similarly, we say that the mapping X → X η Y, where X runs over all n-premaniplexes Given premaniplexes X and Y and a voltage assignment η, we shall see that X η Y is not only a properly m-edge-colored graph, but an m-premaniplex itself, although it need not be a maniplex (even if X and/or Y are maniplexes). Before showing this, we give some straightforward examples of voltage operations.
Let us denote by 1 n the symmetry type graph of a regular n-maniplex. That is, the premaniplex with only one vertex and n semiedges (see Fig. 2A). Moreover, if G is a group and η : 1 n → G is a voltage assignment that assigns g i to the semiedge of color i, then we denote this voltage graph by (1 n , [g 0 , . . . , g n−1 ]).
The maniplex M d can easily be seen as an (n, n)-voltage operation: Classical examples of the above operation are the dual and the Petrial of an n-maniplex X : In the above examples we know that whenever X is in fact a maniplex, then so is If (Y, η) is a voltage operator, we want to show that X η Y is a premaniplex, for every premaniplex X . Thus, we need to show that the alternating paths in X η Y of length 4 with colors i and j, with |i − j| ≥ 2, are closed. In other words, given a premaniplex X and a voltage operator More generally, we are interested in obtaining properties for the paths in X η Y from the paths in X or Y. The following result is a straightforward but useful observation towards this direction.
and follows the same colors as W finishes at η(W )x, r i k · · · r i 1 y .
Note now that since Y is a premaniplex, then r i r j r i r j y = y for every y ∈ Y, which implies that i, j,i, j (x, y) is closed if and only if η( i, j,i, j y) fixes x. But η( i, j,i, j y) is the identity, since (Y, η) is a voltage premaniplex. Therefore, we have the following proposition.

Proposition 3.3 Given a voltage premaniplex (Y, η) and a premaniplex X , the voltage operation X η Y is a premaniplex.
Since we are working with voltage premaniplexes, for the rest of the paper, whenever we refer to paths being "homotopic" or to the "homotopy class" of a path, we are thinking in terms of maniplex homotopy. In the same way, the notation (Y) will denote the fundamental groupoid consisting of paths in Y considered up to maniplex homotopy.
Although we have special interest on voltage operations that give rise to connected premaniplexes, there are interesting examples of voltage operations in which we (often) obtain disconnected objects.
A rooted premaniplex is a pair (X , x) where X is a connected premaniplex and the root x is a vertex of X . If X is not connected, then (X , x) denotes the rooted premaniplex with the connected component of x in X as its underlying premaniplex. If (X , x) and (Y, y) are rooted premaniplexes and (Y, η) is a voltage operator, then (X , x) η (Y, y) denotes the rooted premaniplex (X η Y, (x, y)).
. Then X η Y is a graph whose connected components are the (k, )-sections of X . In particular, if k = −1 and X is a maniplex, then X η Y determines the set of all -faces of X . Moreover, if y denotes the only vertex in Y, for each x ∈ X , then (X , In a recent paper [6] the term stratified operations is introduced. They are operations on maniplexes defined in terms of a set A of strata admitting a left action of Mon(U) and a function ϕ that assigns a monodromy to each pair (a, r i ) where r i is a generator of Mon(U). We can describe stratified operations in terms of voltage operations. If O is a stratified operation with strata set A, we can define the voltage operator (Y, η) by taking the vertices of Y to be the set A, defining the adjacencies by a i = r i a, and defining the voltage assignment η by η( i a) = ϕ(a, r i ). There may be a subtle difference between the stratified operation O and the voltage operation defined by (Y, η). Mainly, if M is a maniplex O(M) must be a maniplex too, and therefore connected, while

The Mix as a Voltage Operation on Premaniplexes
The mix of two regular polytopes was defined in terms of their automorphism groups (see [21,23]). In [5] the mix is defined for rooted maniplexes as a natural generalization of the parallel product of rooted maps (see [31]), and hence it is also defined for rooted polytopes. If (M, x) and (N , y) are rooted maniplexes, then (M, x)♦(N , y) is the smallest maniplex that covers both (M, x) and (N , y). In particular, it is connected. We shall see that the mix can be defined as a voltage operation on premaniplexes.
Let Y be an n-premaniplex. We denote by μ : (Y) → Mon(U n ) the voltage assignment that maps each dart of color i to r i . In other words μ( ω y) := ω. We call μ the mixing voltage (for Y) and we say that (Y, μ) is a mix operator. Then X μ Y is the mix X ♦Y, and it is easy to see that this generalizes the same concept previously defined for regular abstract polytopes. By rooting the premaniplexes, this voltage operation generalizes the one for rooted maniplexes.
With our definition of the mix as a voltage operation we allow the resulting graph to be disconnected. However, each connected component of X μ Y covers both X and Y, so if at least one of them is simple (that is, a maniplex) the mentioned components are maniplexes as well. Moreover, the connected component of X ♦Y containing the vertex (x, y) is the smallest premaniplex that covers both (X , x) and (Y, y) (cf. [5,Proposition 3.10]).
We can use this definition of the mix to find the smallest cover of a maniplex satisfying some property, as we shall see in the next example.
We denote by 2 n I the n-premaniplex with 2 vertices with semiedges of colors in I at each vertex and links of colors not in I between the 2 vertices (see Fig. 2B). We can use these premaniplexes to describe certain properties of maniplexes: orientable n-maniplexes (those that are bipartite) are those that cover 2 n ∅ and vertex-bipartite maniplexes (those whose 1-skeleton is bipartite) are those that cover 2 n {1,2,...,n−1} , for example. In general, if X covers 2 n I it means that there is a coloring of the vertices (or flags) of X with two colors such that i-adjacent flags are of the same color if and only if i ∈ I . See [18,26] for a detailed discussion on flag colorings.
If a maniplex X does not cover 2 n I , then X ♦2 n I is a maniplex that covers X but also covers 2 n I . We call this the double cover of X with respect to I . If X is non-orientable, X ♦2 n ∅ is the so called orientable double cover of X . Note that if X does cover 2 n I , then X ♦2 n I = X μ 2 n I (with μ the mixing voltage) consists of two isomorphic copies of X , but the flags of these copies will be colored by the vertices of 2 n I . More precisely, if we colored the vertices of 2 n I with white and black, then each vertex (flag) of X ♦2 n I is colored white or black according to its second coordinate. So X ♦2 n I consists of two copies of X but together with an I -compatible coloring, and the two copies have opposite colorings. In particular, if X is orientable and I = ∅, the two copies of X ♦2 n ∅ are mirror images; if X is a chiral maniplex, then X μ 2 n ∅ consists of its two enantiomorphic forms. Before ending this section let us note that the mixing voltages are the only voltages such that the product is naturally commutative. More precisely:

Connectivity
We now turn our attention to the connectivity of X η Y. We say that an (n, m)voltage operator (Y, η) preserves connectivity if whenever X is connected X η Y is connected as well (in the context of [6], these are called fully stratified operations). We first analyze when we can find a path between two vertices of X η Y and use this to determine when a voltage operator preserves connectivity.

Lemma 3.7 Let (x, y) and (x , y ) be two vertices of X η Y. There is a path in X η Y that starts at (x, y) and ends at (x , y ) if and only if there exists a path W in Y that connects y with y and such that η(W )x = x .
Proof Assume there is a path i k ,...,i 1 (x, y) that ends at (x , y ). By Remark 3.2 the path i k ,...,i 1 (x, y) ends at η(W )x, r i k · · · r i 1 y , where W denotes the path i k ,...,i 1 y. Hence, η(W )x = x and r i k · · · r i 1 y = y . Moreover, r i k · · · r i 1 y is precisely the endpoint of W , which implies that W connects y with y .
Conversely, assume that there exists a path W that connects y with y and satisfies that η(W )x = x . Since W starts at y, it can be written as W = i k ,...,i 1 y, for some i k , . . . , i 1 ∈ {0, . . . , m − 1}. This implies that y = r i k · · · r i 1 y. By Remark 3.2, the path i k ,...,i 1 (x, y) ends at η(W )x, r i k · · · r i 1 y = (x , y ).

Proposition 3.8
The graph X η Y is connected if and only if Y is connected and η( y 0 (Y)) acts transitively on X for some vertex y 0 ∈ Y.
Proof We start by assuming that X η Y is connected, and let x, x ∈ X . First note that X η Y covers Y, so Y must be connected as well. Now we want to prove that η( y 0 (Y)) acts transitively on X . Since X η Y is connected, there is a path from (x, y 0 ) to (x , y 0 ). By Lemma 3.7 there exists W ∈ y 0 (Y) such that η(W )x = x . Since x and x were arbitrary, we have proved that η( y 0 (Y)) acts transitively on X . Now we assume that Y is connected and η( y 0 (Y)) acts transitively on X . We will prove that X η Y is connected. Let x 0 ∈ X be fixed, and let x ∈ X and y ∈ Y. Since Y is connected, there is a path V from y 0 to y in Y. Let σ = η(V ). Since η( y 0 (Y)) acts transitively on X , there exists W ∈ y 0 (Y) such that η(W )x 0 = σ −1 x. Then the path W V goes from y 0 to y and satisfies that η(W V )x 0 = x. By Lemma 3.7 the existence of the path W V implies that there exists a path in X η Y from (x 0 , y 0 ) to (x, y). That is, (x 0 , y 0 ) is connected to every vertex of X η Y, implying that X η Y is connected. In [4] the authors give a way to find generators of the automorphism group of a maniplex, given its symmetry type graph (STG). They do so they in terms of a spanning tree of the STG with trivial voltage on all its darts. Hence, it will be helpful to see Corollary 3.9 in the light of such a spanning tree of Y. Proof The group y 0 (Y) is generated by the paths C d where d varies among darts in Y not in T and C d denotes the path that starts at y 0 , goes to the initial vertex of d through T , then uses the dart d, and then goes back to y 0 through T . This implies that η( y 0 (Y)) is generated by the voltages of those paths, but η(C d ) = η(d).

More Examples of Voltage Operations
Here, we shall see some examples of operations on maps and polytopes that can be seen as voltage operations. In fact, if we have an operation on polytopes (or maps) that can be seen as a voltage operation, by defining the corresponding voltage operator we have defined the operation on maniplexes and premaniplexes.
We show here that the Wythoffian constructions, including the snub, all prisms and pyramids over polytopes, the trapezotope and the k-bubbles can be seen as voltage operations (each of them will be properly defined). Moreover, we also study the operations M → 2 M and M →2 M , and see that although there is no voltage operator that will give us these operations, whenever M is regular, there is a way to describe the construction2 M as a voltage operation that depends on each M.

Wythoffian Constructions
We start by recalling the Wythoffian constructions from convex regular polytopes (see for example [2,29]). Given a regular convex polytope, its symmetry group is generated by reflections {ρ 0 , . . . , ρ n−1 }. We call these reflections the generating reflections of the group and note that their mirrors form a cone that, intersected with the polytope, results in a fundamental region for the polytope with respect to its symmetry group. For a Wythoffian construction, first choose a non-empty set A of generating reflections and pick a point v of the fundamental region that is not fixed by any of the reflections in A, but fixed by any generating reflection not in A (if they exist). The vertices of the new convex polytope are the orbit of v under ρ 0 , . . . ρ n−1 and the polytope is the convex hull of such vertices. This can be represented on the Coxeter diagram (a graph with n nodes, each representing a generating reflection, and an edge labeled by the order of the product of their nodes, whenever it is bigger than 2) by marking the nodes representing the generating reflections in A.
If n = 3, then A is a non-empty subset of a 3 element set, so there are seven possibilities for A, each giving a different construction. In particular, for A = {ρ 0 } and A = {ρ 2 } the Wythoffian constructions give rise to the identity and dual operations, respectively, that have been given as voltage operations in Example 3.1. It is not difficult to generalize the Wythoffian constructions of regular polyhedra to maps on surfaces, by investigating the flag adjacencies of the constructed polyhedra. In particular, the medial and truncation of a map have been studied in [16,17] and [24], respectively. Figure 3 shows voltage operators (Y, η) for five of the Wythoffian constructions to be seen as a voltage operation. (As pointed out above, the two remaining ones correspond to when A = {ρ 0 } and A = {ρ 2 } that are the identity and dual operations, respectively.) The omnitruncation in rank 3 (Fig. 3e) can be easily generalized to higher dimensions for a regular convex polytope P: it corresponds to the Wythoffian construction where A is the set of all reflections {ρ 0 , ρ 1 , . . . , ρ n−1 }. We can define this operation when P is an abstract polytope (regular or not) in the following way. For i ∈ {0, 1, . . . , n − 1}, the i-faces of ot(P) are chains of P that do not contain the greatest nor least elements and have n − i elements, and given two faces C and C of  i . This means that the 1-skeleton of ot(P) is the flag graph of P. Another way to construct ot(P) is as the colorful polytope of the flag graph of P [1].
The omnitruncation in rank n can be thought as a voltage operation. To see this, use the following construction for the voltage operator. Let S be the flag graph of an (n − 1)-simplex. First, change the color of each edge by increasing it by 1 (i.e. if two flags of S are i-adjacent, they will be joined by an edge of color i + 1). All these edges will have the identity voltage. Note that now each vertex has an edge of color i, for i ∈ {1, 2, . . . , n − 1}. Now, label each connected component of the graph with edges of colors 1, . . . , n − 2 with a different number from 0 to n − 2. Then, add a semiedge of color 0 at each vertex with voltage r j where j is the label of connected component of the vertex. The resulting voltage operator (Y, η) satisfies that the flag graph of ot(P) is P η Y.
As can be expected all Wythoffian constructions for higher dimensions can be seen as voltage operations. We do not give here all the voltage operators, as for rank n, there can be up to n! vertices in it. However, in Sect. 7 we describe a theoretical way of finding them all.
The snub of a polyhedron can be thought as a generalized Wythoffian construction, where the rotational subgroup is used. We shall not give details of this kind of constructions, but rather note some interesting differences between the snub and the Wythoffian described above.
The snub operator given in Fig. 4. In contrast with the Wythoffian operations that preserve connectivity of any maniplex, the snub operator only preserves connectivity for non-orientable premaniplexes. If we apply this snub operation to an orientable premaniplex X (in particular to a regular convex polyhedron) we get two copies of what is usually referred to as the snub X , each copy having all the "rotational" symmetry of X but not the reflection symmetry of X . We will explore this phenomenon deeper in Sect. 5.

Prisms and Pyramids Over Polytopes
Let P be an abstract polytope. The pyramid over P, denoted by Pyr(P) is the poset P × {0, 1} with the product order, that is, (F,  Both the prism and the pyramid over an n-polytope are (n + 1)-polytopes. They are particular cases of products of polytopes, in the sense of [10]: the pyramid is the join product by a vertex, while the prism is the direct product by an edge.
The flag graph of Pri(P) is P η Y .

The Trapezotope
Given a polytope P, we define the trapezotope over P denoted by Trp(P) as follows: the faces of rank i, for i ≥ 0, of the trapezotope are the ordered pairs (F, G) where  (F, F), so they are in correspondence to the faces of P, and the edges of Trp(P) are in correspondence to the edges of the Hasse diagram of P. Thus, the 1-skeleton of the trapezotope of P is the Hasse diagram of P. The trapezotope over P is in fact the dual of the antiprism over P, defined in [11].
In [11] the authors showed that the trapezotope of a polytope P (or rather its dual) is in fact a polytope and that the flags are in one-to-one correspondence with the set F(P) × Z n+1 2 . When we denote a flag of Trp(P) by ( , v), the i-th coordinate of the vector v tells us if the faces ( , v)

Fig. 6
Voltage operator for the prism over an n-polytope in the first coordinate (when v i = 0) or in the second one (when v i = 1). Using this natural correspondence, one can prove that the i-adjacent flag of the flag ( , v) is: where j is the rank of F i if v i = 0 or the rank of G i if v i = 1 and e i denotes the vector in Z n+1 2 whose all but the i-th coordinate are zero. Let Y be the premaniplex whose vertices are Z n 2 and the adjacencies are given by: And let η be the voltage assignment given by where j is defined the same way as before. One can confirm that the voltage operator (Y, η) satisfies that for every polytope P, the flag graph of Trp(P) is P η Y. The k-Bubble The k-bubble operation was introduced by Helfand in [13] as a generalization of the truncation of the vertices. Let P be an abstract n-polytope. The k-bubble [P] k of P is defined as follows. Let P i denote the set of i-faces of P. The set ([P] k ) i of i-faces of [P] k is defined by The order in [P] k is defined by the following rules: Let H and H be faces in P with ranks different than k, let F be a k-face of P and let G and G be faces of P properly containing F.
One can see that the flags of  Fig. 8 The k-bubble operator. The vertices (from left to right) can be labeled with ∈ {k + 1, . . . , n} and the voltage of the dart i is and trivial otherwise (gray) adjacencies on [P] k are described by the following rules: With this information we can see that the k-bubble is described by the voltage operator in Fig. 8.

The 2 M and2 M Operations
Given a finite maniplex M of rank n, the maniplex 2 M was defined in [8]  ∈ M and v ∈ Z 2 , are given by the following formula, where e k ∈ Z 2 is the vector that has 0 in all its entries except the k-th one: if i = 0, and the 0-face of is labeled with k, It is well-known that if M is the flag graph of a polytope P, then 2 M is the flag graph of the polytope 2 P discovered by Danzer [7] and first defined in [28] (see [20, sect. 8C] and [22] for details).
The maniplex2 M is defined as the dual of 2 M * , where M * is the dual of M. Thus, the set of flags of2 M is M × Z m 2 , where the set of facets of M is labeled with the set {1, . . . , m}. The adjacencies in2 M are given by: where e k ∈ Z m 2 is the vector that has 0 in all its entries except the k-th one.
These operations on maniplexes are very interesting. In particular in the context of voltage operations, Example 5.3 will show that one cannot find a premaniplex Y that satisfies that 2 M = M η Y, for every maniplex M (not even if we fix the rank of M, or ask M to be regular). However we shall see that if M is a regular premaniplex, then there exists a premaniplex Y M and a voltage assignment η such Let M be a regular n-premaniplex and let ρ 0 , ρ 1 , . . . , ρ n−1 be the distinguished generators of (M) with respect to the base flag . We define the premaniplex Y := Y M as follows. The set of vertices of Y is the set Z m 2 . Given v ∈ Y the entries of v correspond to facets of M. Assume that the facets of M are labeled with the set {1, . . . , m}, as above, in such a way that the facet corresponding to the base flag is labeled with 1. Notice that every element in (M) permutes the facets of M, which in turn induces an action of (M) on Z m 2 by permutation of coordinates. More precisely, for α ∈ (M) and , that is, the vector resulting from v after permuting the coordinates according to α.
The adjacencies in Y are given as follows: for i ∈ {0, 1, . . . , n − 1} there is an edge of color i between v and v i := vρ i . Further, there is an edge of color n between v and v + e 1 . We now define the voltage assignment on Y as: We shall show that2 M ∼ = M η Y. For this, we recall that M is regular, and hence any flag of M can be written in a unique way as α, where is the base flag and α ∈ (M).
Then, ϕ preserves incidences. In fact, we observe that if k = 1α: On the other hand, for i < n we have that: The computation above shows that2 M and M η Y are isomorphic. It is clear that if we drop the regularity condition on M the given voltage operator (Y, η) is not well-defined as it depends heavily on the existence of the distinguished generators of the automorphism group. Thus, we can ask ourselves the following questions. For example, we have not been able to determine if there exists such voltage operator for the case when M is the pyramid over a digon. If the answer for the above question is negative, then we could ask: Note that a sufficient condition for the last question is to have M to be regular, as shown above. However chances are this condition is not necessary. For example, we believe that if the symmetry type graph of M is itself a regular pre-maniplex, the above voltage operator might exist.

Automorphisms
In this section we will study the interplay between the automorphism group of a premaniplex and the resulting premaniplex after a voltage operation, as well as their symmetry type graphs.
Let X be a premaniplex and let (Y, η) be a voltage operator. Observe that (X ) acts faithfully as a group of automorphisms on X η Y. Indeed, if γ ∈ (X ), then the mappingγ : (x, y) → (xγ, y) induces an automorphism of X η Y. To see this, just note thatγ commutes with the monodromies r i ((x, y) Thus, (X ) ≤ (X η Y) for every voltage operator (Y, η) and we may replaceγ by γ to simplify notation. The latter result implies that (X ) acts by automorphisms on X η Y. Note that X naturally covers X / for every group ≤ (X ). As expected X η Y naturally covers (X η Y )/ , In fact, we have a slightly more general result: Theorem 5.1 Let X and X be n-premaniplexes, and let (Y, η) a voltage operator. If X covers X , then X η Y covers X η Y.
In particular, when X is obtained from X as a quotient by a group ≤ (X ), we get that Proof Let ϕ : X → X be a covering homomorphism. If X = X / we chose ϕ as the natural projection x → x . Define ϕ : X η Y → X η Y by ϕ : (x, y) → (ϕ(x), y). Now, using the fact that ϕ is a homomorphism we simply check that x, y)) .
This proves that ϕ is a homomorphism, and it is trivial to see that it is surjective. Therefore it is a covering.
In the particular case when X = X / we get that ϕ (x, y) = (x , y), but by using the natural action of on X η Y we get that (x , y) = (x, y) .
The above theorem is of particular interest when X is a maniplex and = (X ). In this case, T := X / is the symmetry type graph of X . Theorem 5.1 tells us that the symmetry type graph of X η Y with respect to is precisely T η Y. However it is important to remark that might be a proper subgroup of (X η Y), that is, T η Y might not be the symmetry type graph of X η Y, even when X η Y is a maniplex. An example of such situation will be given in Example 5.5. This phenomenon will be explored deeply in [15].
Words of caution: the fact that (X ) acts by automorphisms on X η Y does not imply that it acts by automorphisms on each connected component of X η Y. For example, as pointed out in Sect. 4, when X is an orientable (pre)maniplex of rank 3 and (Y, η) is the snub operator of Fig. 4, X η Y has two connected components, say the left snub (whose flags are those of the form (x, y) with x ∈ X a white flag), and the right snub (whose flags are those of the form (x, y) with x ∈ X a black flag). Each component has all the "rotational" symmetry of X but none of the "reflection" symmetries of X . However, if there exists a reflection τ ∈ (X ), that is, an automorphism that interchanges white flags with black flags, then τ acts on X η Y by swapping the left snub with the right snub. This means that if we consider rooted premaniplexes (X , x) and (Y, y), then the rooted premaniplex (X η Y, (x, y)) may not have all the symmetries of X . In fact we have the following result: , (x, y)). This means that (x, y)γ is an element of (X η Y, (x, y)); in other words, (x, y)γ and (x, y) are in the same connected component of X η Y. Hence, there exists a monodromy w such that w(x, y) = (x, y)γ . Note that on one hand, (x, y)γ = (xγ, y), while on the other hand w(x, y) = (η( w y)x, wy). Thus, (xγ, y) = (η( w y)x, wy), which implies that y = wy and therefore W := w y ∈ y (Y).

Proposition 5.2 Let (X , x) be a rooted premaniplex, ((Y, y), η) a rooted voltage operator and γ ∈ (X ). Then γ ∈ (X η Y, (x, y)) if and only if there exists a closed path W based on y such that xγ
Conversely, suppose that there exists W ∈ y (Y) such that xγ = η(W )x. The fact that W ∈ y (Y) implies that there exists a monodromy w such that wy = y and W = w y. Hence, (x, y)γ = (xγ, y) = (η(W )x, y) = (η( w y)x, y) = (η( w y)x, wy) = w(x, y), which implies that (x, y)γ and (x, y) are in the same connected component of X η Y. Since we already know that γ is an automorphism of X η Y, this implies that γ ∈ (X η Y, (x, y)).
Note that we may use Theorem 5.1 to determine when an operation is not a voltage operation, as we see in the following example.

Example 5.3
In this example we will prove that there is no (n, n + 1)-voltage operator (Y, η) such that 2 M = M η Y for every n-maniplex M (as was hinted in Question 4.1). For a 2-gon {2}, the polytope 2 {2} is the quadrangular dihedron {4, 2} (the map on the sphere consisting of two squared faces sharing all the vertices and edges). For the square {4}, we have that 2 {4} is the toroidal map {4, 4} (4,0) (a 4 × 4 grid on the torus). We can get a 2-gon from a square by taking its quotient by the cyclic group of order two generated by the half-turn around the center, that is {2} = {4}/Z 2 . However, it is not possible to get the quadrangular dihedron by taking a quotient of {4, 4} (4,0) by any group of order 2. In other words 2 {4} /Z 2 2 {4}/Z 2 . Hence, Theorem 5.1 is not satisfied for the operation 2 M . Thus, there is no voltage operator (Y, η) such that 2 M = M η Y for every maniplex M.
The previous example uses Theorem 5.1 to prove that there does not exist a voltage operation (Y, η) such that 2 M ∼ = M η Y for all maniplexes M, in other words, that M → 2 M is not a voltage operation. Observe that this fact can also be established in a more elementary way by simply comparing the number of flags in M η Y and in 2 M . We use Theorem 5.1 to emphasize the relation between quotients and voltage operations. In fact, Theorem 5.1 characterizes all voltage operations; this shall be shown in Theorem 7.3.
It is easy to come up with examples of operations that are not voltage operations, for instance, by defining them differently for different cases. However, the operation M → 2 M is of interest because it is a functor between the categories pMpx n and pMpx n+1 , in other words, if there is a homomorphism p : M → M then there is a natural way to define a homomorphismp : It is straightforward prove thatp is a maniplex homomorphism and that p →p is indeed a functor.
Let M be a premaniplex, let be a group of automorphisms of M and let X = M/ . Hence, there exists a voltage assignment ξ : (X ) → such that X ξ is isomorphic to M, where X ξ is the derived graph (see Sect. 2.1). If (Y, η) is a voltage operation, Theorem 5.1 tells us that (M η Y)/ is isomorphic to X η Y. Then, there exists a voltage assignment θ : (X η Y) → such that (X η Y) θ is isomorphic to M η Y (again, (X η Y) θ denotes the derived graph). The following theorem tells us how to find θ in terms of η and ξ . for every w ∈ Mon(U).
We shall show that ϕ is a premaniplex isomorphism.

Example 5.5
It is not difficult to see that the antiprism of a q-gon can be obtained by taking the medial of the pyramid over a q-gon. Thus, we shall use Theorem 5.4 to recover the antiprism of a q-gon as a voltage maniplex. To do so, we first construct the pyramid over a q-gon as the derived graph of a voltage premaniplex and then apply the medial operator (as a voltage operator).
Note that the automorphism group of a q-gonal pyramid coincides with the automorphism group of its base, which is the dihedral group where ρ 0 is thought as the reflection in a plane orthogonal to the base, that includes the midpoint of an edge e in the base; and ρ 1 as the reflection in a plane orthogonal to the base, that includes one of the vertices incident to e. Hence, the q-gonal pyramid can be recovered from its symmetry type graph X via the voltage premaniplex (X , ξ) shown in Fig. 9. (As in previous examples, the colors red, green and blue for the edges represent 0-, 1-and 2-adjacencies, respectively.) Let (Y, η) be the medial operator. Then, by Theorem 5.4, (X η Y, θ) is the antiprism over a q-gon, where θ is defined as in the theorem.
Theorem 5.4 gives us a way to construct such antiprism. When we want to calculate, for example, the endpoint and voltage of the dart 0 (a, x) (the red dart that starts at (a, x)), we first see that η( 0 x) = r 1 , so we follow the path 1 a and we see that it ends in a and has voltage ξ( 1 a) = ρ 1 . Therefore, (a, x) 0 = (η( 0 x)a, x 0 ) = (a, x) (i.e., the dart is a semiedge) and the dart 0 (a, x) has voltage θ( 0 (a, x)) = ρ 1 .
Note that X η Y is the symmetry type graph of the antiprism with respect to the automorphism group of its base, but not with respect to the full automorphism group of the antiprism. In fact, the antiprism over any polygon always has extra symmetry, which is induced by the isomorphism between the base of the antiprism and its dual, so antiprisms over polygons have usually four orbits on flags. The antiprism over

Fig. 9
A voltage premaniplex for the medial of a pyramid, where the colors red, green and blue for the edges represent 0-, 1-and 2-adjacencies, respectively the triangle is in fact an octahedron and therefore regular, so in that case the actual symmetry type graph is 1 3 .
A consequence of Theorem 5.4 is the following corollary: Proof Since X is regular, it is isomorphic to the derived graph (1 n ) ξ where, if x is the only vertex of 1 n , ξ( i x) = ρ i . Then Theorem 5.4 tells us that X η Y is isomorphic to (1 n η Y) θ with θ( w (x, y)) = ξ( η( w y )x). This means precisely that θ replaces each occurrence of r i in η by the voltage of the semiedge of color i in 1 n , but this is exactly ρ i . By applying the natural isomorphism 1 n η Y → Y we get the desired result.

Composition of Voltage Operations
The result of applying a voltage operation to a premaniplex is again a premaniplex. Thus, it is natural to think about the composition of two voltage operations. In contrast, the result of applying a voltage operation to a maniplex is not always a maniplex, so one must be careful with this fact when composing operations, as the result of a voltage operation can be disconnected. It is interesting to note that in fact the composition of two voltage operations can be written as a new voltage operation. In this section we describe how to do this by using the operator θ defined in Theorem 5.4, but instead of using an arbitrary voltage premaniplex (X , ξ) and a voltage operator (Y, η) we use two voltage operators (Y 1 , η 1 ) and (Y 2 , η 2 ). Theorem 6.1 Let X be an n-premaniplex, (Y 1 , η 1 ) an (n, m)-voltage operator and (Y 2 , η 2 ) a (m, )-voltage operator. Then (y 1 , y 2 )) .
It is clear that ϕ is a bijection, so we only need to prove that it commutes with r i , for all i ∈ {0, 1, . . . , − 1}: The above theorem can be applied in different contexts, we give some examples here. Let (1 m , d) be the duality operator and consider a (n, m)-voltage operator (Y, η). If X is a premaniplex, then (X η Y) d 1 m is the dual of (X η Y). Theorem 6.1 tells us that this dual is in fact isomorphic to X θ (Y d 1 m ). Thus, (Y d 1 m , θ) is the dual of Y, where the voltages of the darts are the same as the ones of the darts of the dual color in (Y, η). In other words, if (Y * , η * ) denotes the voltage operator we get by recoloring the darts of color i in Y with the color n − 1 − i, then the dual of More generally, Theorem 6.1 lets us define the composition of two operators. If (Y 1 , η 1 ) is an (n, m)-operator and (Y 2 , η 2 ) is an (m, )-operator we define the composition of (Y 1 , η 1 ) with (Y 2 , η 2 ) as (Y 1 η 2 Y 2 , θ(η 1 , η 2 )) and denote it by (Y 1 , η 1 ) • (Y 2 , η 2 ). Theorem 6.1 tells us that (Y 1 , η 1 ) • (Y 2 , η 2 ) is an (n, )-operator and that the composition of operators is associative. This allows us to define a new category: recall that pMpx n denotes the class of all premaniplexes of rank n and let pMpx be the category whose objects are the classes pMpx n with n ≥ 1, and whose arrows are voltage operators. An (n, m)-operator is an arrow from pMpx n to pMpx m and the composition of arrows is defined as above. The neutral element at the object pMpx n is the arrow (1 n , μ) where μ is the mixing voltage, and the isomorphisms are precisely the voltage operators described in Example 3.1. It might be also interesting to study the analogous category obtained by considering rooted voltage operations.
Observe that the snub operation seems to act differently on orientable maniplexes than on non-orientable ones. However, the result of applying the snub operation to a non-orientable maniplex M is one of the connected components of doing the same operation to the orientable double cover of M. This phenomenon is easy to understand with the following results: Theorem 6.2 Let X be an n-premaniplex, (Y 1 , μ) be a mix n-operator and (Y 2 , η) be an (n, m)-voltage operator with Y 2 connected. Let y 1 ∈ Y 1 and y 2 ∈ Y 2 be fixed and suppose that η( y 2 (Y 2 )) fixes y 1 . Then, the induced (colored) graph of Proof Because of Theorem 2.1, we may assume without loss of generality that η(W ) ∈ η( y 2 (Y 2 )) for every path W ∈ (Y 2 ), and thus η(W ) fixes y 1 .
First we notice that the induced (colored) graph of Y 1 η Y 2 with vertex set {(y 1 , y) : y ∈ Y 2 } forms an isomorphic copy of Y 2 . This is easy to see since the i-adjacent flag to (y 1 , y) (in Y 1 η Y 2 ) is (η( i y)y 1 , y i ) = (y 1 , y i ), because, by assumption, the voltages of paths in Y 2 fix y 1 .
Next we use Theorem 6.1 to see μ). This means that we can consider the i-adjacent flag to ((x, y 1 (y 1 , y)) to denote that these two points are in correspondence under the isomorphism. On one hand, observe that by definition of θ , for any y ∈ Y 2 and any monodromy w, we have that θ( w (y 1 , y)) is μ( η( w y) y 1 ). On the other hand, by definition of μ we have that μ( η( w y) y 1 ) = η( w y). Hence, and since η( i y)x, (y 1 , y i ) ↔ (η( i y)x, y 1 ), y i , the theorem follows.

Corollary 6.3
Let X be an n-premaniplex, (Y 1 , μ) be a mix n-operator and (Y 2 , η) be an (n, m)-voltage operator with Y 2 connected. Suppose that η( y 2 (Y 2 ) fixes every vertex of Y 1 . Then (X μ Y 1 ) μ Y 2 has a copy of X μ Y 2 for each vertex of Y 1 .
We now have the tools to understand the relation between the snub of a nonorientable 3-maniplex M and the snub of its double cover. In Example 3.5 we saw that the orientable double cover of M is M♦2 3 ∅ = M μ 2 3 ∅ . Hence, if (Y, η) is the snub operator (see Fig. 4), then Corollary 6.3 tells us that (M♦2 3 ∅ ) η Y consists of two copies of M η Y. (Note that the voltages of η take values in Mon + (U 3 ),the group that fixes the vertices of 2 3 ∅ .) In other words, the snub M is an unrooted snub M♦2 3 ∅ . The following is a similar example. Given a maniplex M with a bipartite 1-skeleton (that is, the graph with the 0-faces as vertices and the 1-faces as edges, with the induced incidence), one can find a voltage operator (Y, η) such that M η Y has two connected components and in each component the vertices of one part of the bipartition are truncated while the ones in the other part remain unchanged. If now we apply this same operation to a maniplex M whose 1-skeleton is not bipartite, the result is one of the connected components of (M ♦2 n {1,2,...,n−1} ) η Y.

Voltage Operations on the Universal Maniplex
Since a voltage operator (Y, η) is a voltage premaniplex, it natural to consider the derived premaniplex Y η . In this section we see that this derived premaniplex is in fact the one obtained from applying the corresponding voltage operation to the universal maniplex U. We shall use this fact to prove that Theorem 5.1 characterizes voltage operations.

Theorem 7.1 Let U be the universal n-maniplex and let (Y, η) a (n, m)-voltage operator. Then
Proof Let be a base flag of U. Consider the function ϕ : Y η → U η Y given by ϕ(y, w) = (w , y). Recall that any flag of U is of the form w for some (unique) w ∈ Mon(U), which implies that the function ϕ is bijective. Finally, observe that ϕ(r i (y, w)) = ϕ(r i y, η( i y)w) The proof of Theorem 7.1 is based on the fact that since U is regular, its monodromy group acts regularly on its vertices (flags). We can generalize Theorem 7.1 as follows. Let X be a regular premaniplex and let (Y, η) be a voltage operator. If S X = {w ∈ Mon(U) : wx = x for all x ∈ X }, that is, the kernel of the projection Mon(U) → Mon(X ), then Mon(X ) ∼ = Mon(U)/S X . Let η X : (Y) → Mon(X ) be the voltage assignment on Y we get by reducing η to Mon(X ), that is η X (W ) := η(W )S X . Then by using the exact same argument as in Theorem 7.1 we can see that X ηχ Y is isomorphic to Y η X .
An immediate consequence of Theorems 5.1 and 7.1 is that operators (Y, η 1 ) and (Y, η 2 ) with η 1 and η 2 equivalent voltages (that is, with isomorphic derived graphs as in Equation (2.1)) yield equivalent voltage operations. More precisely, Proposition 7.2 Let (Y, η 1 ) and (Y, η 2 ) be two (n, m)-operators with equivalent voltages η 1 and η 2 . Then for every n-premaniplex X , Moreover, there is an isomorphism X η 1 Y → X η 2 Y such that the following diagram commutes: Proof From [12] we know that X ∼ = U/ for certain ≤ (U), now If we start with a vertex (x, y) in X η 1 Y and apply the natural isomorphisms between consecutive terms in the equation above, we get the following sequence, where is a base flag of U: (x, y) → ( , y) for some ∈ U → ( , y) → (y, w) where w ∈ Mon(U) is such that = w → (y,w) for somew ∈ Mon U (since η 1 is equivalent to η 2 ) → (˜ , y) where˜ =ω → (˜ , y) → (x, y) for somex ∈ X .
We can see that this isomorphism makes the diagram in Equation (7.1) commute.
In the proof of Proposition 7.2 we strongly used that if X ∼ = U/ for ≤ (U), then X η Y ∼ = (U η Y)/ for any voltage operator (Y, η) (which is Theorem 5.1 of this paper). In the following result we will show that this property characterizes all voltage operations. Finally, if X is a premaniplex and ≤ (U) is such that X ∼ = U/ , then We often come across operations that are well defined for some family F of premaniplexes (for example, for convex polytopes) but such that it is not immediately evident how to generalize them for all premaniplexes. One may ask if it is possible to extend operations of this kind to all premaniplexes (of the given rank) in such a way that the operation is a voltage operation. As an example, in Sect. 4, we have found voltage operations that extend the Wythoffian operations, the k-bubble and the trapezotope operation to all premaniplexes. Theorem 7.3 and Corollary 5.6 answer this question and find the corresponding voltage operation, when possible. The idea is as follows: suppose there is some regular premaniplex P and an operation O such that we already know O(P). According to the proof of Theorem 7.3, if O is indeed a voltage operation X → X η Y, then Y should be O(1 n ), but due to Theorem 5.1 Y must coincide with O(P)/ (P). Now let ν : (Y) → (P) be the voltage assignment such that O(P) is isomorphic to Y ν . Corollary 5.6 tells us that ν is obtained by replacing each occurrence of r i by ρ i in the voltage assignment η : (Y) → Mon(U). So we can recover η by replacing every instance of ρ i by r i in ν. Note that, in general, such replacement is not well defined unless P is the universal polytope U, however with some intuition we can find the right way to do it for the natural occurring operations. However, observe that one can do this without knowing if O was in fact a voltage operation. To know if O is a voltage operation or not, one must see that O(X ) = X η Y for X in the family F. In fact, if for some X ∈ F we observe that O(X ) = X η Y, then O cannot be seen as a voltage operation.

Final Remarks and Open Problems
We have seen that voltage operations generalize classical operations on maps and polytopes and allow us to define such classical operations on premaniplexes.
One can see that voltage operations naturally generalize to hypertopes (thin residually connected geometries), "complexes", and their quotients. Following [32], a complex is a properly n-edge colored n-valent graph (note that a complex is a combinatorial map in the sense of Vince [30]). Complexes generalize (the "chamber graphs" of) hypertopes. Thus, one can define a precomplex as a n-valent pregraph that has been properly n-edge colored. In this context, the definition of a voltage operator as well as the results in this paper hold if we ask η : (Y) → W n , where W n is the group generated by n involutions with no other relations among the generators. In particular, this allows us to define operations like the ones given in Sects. 3 and 4 to hypertopes.
Symmetry type graphs and voltage assignments have proven to be strong tools to study polytopes and maniplexes. A natural (and well-known) problem that arises when dealing with symmetry type graphs is the following: Problem 1 Given a premaniplex T , does there exist a polytope (or maniplex) such that its symmetry type graph (with respect to the full automorphism group) is T ?
A particular example of this problem was the question posted in the early 1990's by Schulte and Weiss of whether or not there exist chiral polytopes of all ranks (which was solved by Pellicer in 2010 [25]). Of course, one can generalize Problem 1 to hypertopes.

Problem 2
Given a precomplex T , does there exist a hypertope (or complex) such that its symmetry type graph (with respect to the full automorphism group) is T ?
One thing that one tries to do when dealing the above question is to use voltage assignments on T to lift to a maniplex M. In [22] the voltage assignments that give a polytope as the derived graph are characterized. Of course the voltage group acts by automorphisms on M and the quotient of M by it is precisely T . However, M can have (and often does) symmetries not coming from the voltage group. In the context of voltage operations, we have shown that given a voltage operator (Y, η) and a premaniplex X , all automorphisms of X act as automorphisms of X η Y. However, again, X η Y might have extra symmetry (for example, in the case when one applies the medial operation to a self-dual map). It is natural to ask when is it true that automorphisms of Y also lift to X η Y, and when all automorphisms of X η Y come either from X or from (Y, η). We refer to [15] for more details about these questions. Answering, at least partially, these questions might be of great help for solving Problem 1 (at least partially).

Problem 3
Give necessary conditions on (Y, η) so that one can compute the symmetry type graph of X η Y with respect to its full automorphism group in terms of X and (Y, η).
If one's interest is in polytopes rather that in (pre)maniplexes, one can ask when a voltage operation preserves polytopality, though we might not care if the result of the operation is not connected. More precisely, Problem 4 Give necessary and sufficient conditions on (Y, η) for (P, ) η (Y, y) to be a polytope, for all rooted polytopes (P, ) and y ∈ Y.
Similarly, Problem 5 Give necessary and sufficient conditions on (Y, η) for (H, ) η (Y, y) to be a hypertope, for all rooted hypertopes (H, ) and y ∈ Y.