Related papers: On cycles in monotone grid classes of permutations
Cyclically ordered graphs, or cogs, sit between abstract graphs and cellularly embedded graphs. They arise naturally in topological graph theory, knot theory, and mathematical biology. We develop a formal theory of cogs and establish a…
In this paper, we investigate the connection between infinite permutation monoids and bimorphism monoids of first-order structures. Taking our lead from the study of automorphism groups of structures as infinite permutation groups and the…
Given a graph, we associate each edge with the transposition which exchanges the endvertices. Fixing a linear order on the edge set, we obtain a permutation of the vertices. D\'enes proved that the permutation is a full cyclic permutation…
A mutation cycle is a cycle in a graph whose vertices are labeled by the quivers in a given mutation class and whose edges correspond to single mutations. For any fixed $n\ge 4$, we describe arbitrarily long mutation cycles involving…
In this paper we discuss gauging one-form symmetries in two-dimensional theories. The existence of a global one-form symmetry in two dimensions typically signals a violation of cluster decomposition -- an issue resolved by the observation…
The fundamental group of the complement of a hyperplane arrangement plays an important role in studying the corresponding arrangements. In particular, for large families of hyperplane arrangements, this fundamental group, being isomorphic…
We give a combinatorial description (including explicit differential-form bases) for the cohomology groups of the space of n distinct nonzero complex numbers, with coefficients in rank-one local systems which are of finite monodromy around…
In an award-winning expository article, V. Pozdnyakov and J.M. Steele gave a beautiful demonstration of the ramifications of a basic bijection for permutations. The aim of this note is to connect this correspondence to a seemingly unrelated…
We introduce a theory of stratifications of noncommutative stacks (i.e. presentable stable $\infty$-categories), and we prove a reconstruction theorem that expresses them in terms of their strata and gluing data. This reconstruction theorem…
Our main object of study is a certain degree-one cohomology class of the space K of long knots in R^3. We describe this class in terms of graphs and configuration space integrals, showing the vanishing of some anomalous obstructions. To…
We study the cycle structure of words in several random permutations. We assume that the permutations are independent and that their distribution is conjugation invariant, with a good control on their short cycles. If, after successive…
We uncover a connection between two seemingly unrelated notions: lettericity, from structural graph theory, and geometric griddability, from the world of permutation patterns. Both of these notions capture important structural properties of…
A notion of {\em normal submonoid} of a monoid $M$ is introduced that generalizes the normal subgroups of a group. When ordered by inclusion, the set $\mathsf{NorSub}(M)$ of normal submonoids of $M$ is a complete lattice. Joins are…
This paper introduces the notion of involution module, the first generalization of the modular decomposition of 2-structure which has a unique linear-sized decomposition tree. We derive an O(n^2) decomposition algorithm and we take…
Given a cycle module M with a ring structure we show that the cycle complex with coefficients in M of a smooth scheme of finite type over a field has a A-infinity algebra structure. In the case of Milnor K-theory this gives a homotopy model…
We present a surprisingly new connection between two well-studied combinatorial classes: rooted connected chord diagrams on one hand, and rooted bridgeless combinatorial maps on the other hand. We describe a bijection between these two…
This paper (parts I and II) provides an expository introduction to monotone and near-monotone dynamical systems associated to biochemical networks, those whose graphs are consistent or near-consistent. Many conclusions can be drawn from…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
We give recurrence relations for the enumeration of symmetric elements within four classes of arc diagrams corresponding to certain involutions and set partitions whose blocks contain no consecutive integers. These arc diagrams are…
Racks and quandles are rich algebraic structures that are strong enough to classify knots. Here we develop several fundamental categorical aspects of the theories of racks and quandles and their relation to the theory of permutations. In…