Related papers: Symmetric groups and checker triangulated surfaces
In this paper, a theorem is proved that generalizes several existing amalgamation results in various ways. The main aim is to disentangle a given edge-colored amalgamated graph so that the result is a graph in which the edges are shared out…
Pattern avoidance in the symmetric group $S_n$ has provided a number of useful connections between seemingly unrelated problems from stack-sorting to Schubert varieties. Recent work has generalized these results to $S_n\wr C_c$, the objects…
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…
In this paper, we determine the asymptotic dimension for all surface braid groups -- including those associated with non-orientable and infinite-type surfaces -- as well as for torsion-free poly-finitely generated surface groups. We…
We revisit the problem of enumeration of vertex-tricolored planar random triangulations solved in [Nucl. Phys. B 516 [FS] (1998) 543-587] in the light of recent combinatorial developments relating classical planar graph counting problems to…
We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…
We construct an infinite family of homologous, non-isotopic, symplectic surfaces of any genus greater than one in a certain class of closed, simply connected, symplectic four-manifolds. Our construction is the first example of this…
We survey the theory of totally symmetric sets, with applications to homomorphisms of symmetric groups, braid groups, linear groups, and mapping class groups.
Symmetry in mathematical programming may lead to a multiplicity of solutions. In nonconvex optimisation, it can negatively affect the performance of the branch-and-bound algorithm. Symmetry may induce large search trees with multiple…
Higher chromatic numbers $\chi_s$ of simplicial complexes naturally generalize the chromatic number $\chi_1$ of a graph. In any fixed dimension $d$, the $s$-chromatic number $\chi_s$ of $d$-complexes can become arbitrarily large for…
We consider the faces in pseudoline arrangements in which the pseudolines are colored with two colors. Bj\"orner, Las Vergnas, Sturmfels, White, and Ziegler conjecture the existence of a two-colored triangle in such arrangements. We…
Graphical designs are subsets of vertices of a graph that perfectly average a selected set of eigenvectors of the Graph Laplacian. We show that in highly-structured graphs, graphical designs can coincide with highly structured and…
Given a set of points in the plane each colored either red or blue, we find non-self-intersecting geometric spanning cycles of the red points and of the blue points such that each edge of the red spanning cycle is crossed at most three…
We investigate monodromy groups arising in enumerative geometry, with a particular focus on how these groups are influenced by prescribed symmetries. To study these phenomena effectively, we work in the framework of moduli stacks rather…
Using the theory of the symmetry group for PDEs [15, 17], we derive the symmetry group G associated to surfaces PDE. Several group invariant solutions of the surfaces PDE are given by solving a reduced system of partial differential…
In a recent paper we constructed a family of foliated 2-complexes of thin type whose typical leaves have two topological ends. Here we present simpler examples of such complexes that are, in addition, symmetric with respect to an involution…
We apply some basic notions from combinatorial topology to establish various algebraic properties of edge ideals of graphs and more general Stanley-Reisner rings. In this way we provide new short proofs of some theorems from the literature…
Various results ensure the existence of large complete bipartite graphs in properly colored graphs when some condition related to a topological lower bound on the chromatic number is satisfied. We generalize three theorems of this kind,…
A good deal of research has been done and published on coloring of the vertices of graphs for several years while studying of the excellent work of those maestros, we get inspire to work on the vertex coloring of graphs in case of a…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…