Related papers: Indecomposable Permutations, Hypermaps and Labeled…
In this article, we establish a mathematical framework that utilizes concepts from graph theory to formalize the parity transformation, an encoding strategy for compiling optimization problems on quantum devices. We introduce the…
A map is a connected topological graph cellularly embedded in a surface and a complete map is a cellularly embedded complete graph in a surface. In this paper, all automorphisms of complete maps of order n are determined by permutations on…
Path sets are spaces of one-sided infinite symbol sequences corresponding to the one-sided infinite walks beginning at a fixed initial vertex in a directed labeled graph. Path sets are a generalization of one-sided sofic shifts. This paper…
We use a well known problem in discrete and computational geometry (partitions of measures by $k$-fans) as a motivation and as a point of departure to illustrate many aspects, both theoretical and computational, of the problem of…
We prove that the number of Hamiltonian paths on the complement of an acyclic digraph is equal to the number of cycle covers. As an application, we obtain a new expansion of the chromatic symmetric function of incomparability graphs in…
Many matching, tracking, sorting, and ranking problems require probabilistic reasoning about possible permutations, a set that grows factorially with dimension. Combinatorial optimization algorithms may enable efficient point estimation,…
The classification of high-dimensional data defined on graphs is particularly difficult when the graph geometry is unknown. We introduce a Haar scattering transform on graphs, which computes invariant signal descriptors. It is implemented…
The Springer numbers are defined in connection with the irreducible root systems of type $B_n$, which also arise as the generalized Euler and class numbers introduced by Shanks. Combinatorial interpretations of the Springer numbers have…
We define a map $\nu$ between the symmetric group $S_n$ and the set of pairs of Dyck paths of semilength $n$. We show that the map $\nu$ is injective when restricted to the set of 1234-avoiding permutations and characterize the image of…
This article is meant as a mathematical appendix or comment on [BT]. We first consider the notion of transcritical bifurcations of fixed points of general area-preserving maps, and then adress some questions related to [BT] on bifurcation…
We introduce a new notation for representing labeled regular bipartite graphs of arbitrary degree. Several enumeration problems for labeled and unlabeled regular bipartite graphs have been introduced. A general algorithm for enumerating all…
A road map can be interpreted as a graph embedded in the plane, in which each vertex corresponds to a road junction and each edge to a particular road section. We consider the cartographic problem to place non-overlapping road labels along…
There are (at least) three bijections from Dyck paths to 321-avoiding permutations in the literature, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How different are they? Denoting them B,K,M respectively, we show that…
We construct an explicit bijection between bipartite pointed maps of an arbitrary surface $\mathbb{S}$, and specific unicellular blossoming maps of the same surface. Our bijection gives access to the degrees of all the faces, and distances…
We study the problem of calculating noncommutative distances on graphs, using techniques from linear algebra, specifically, Birkhoff-James orthogonality. A complete characterization of the solutions is obtained in the case when the…
A paradigm that was successfully applied in the study of both pure and algorithmic problems in graph theory can be colloquially summarized as stating that "any graph is close to being the disjoint union of expanders". Our goal in this paper…
Bauer and Itzykson showed that associated to each labeled map embedded on an oriented Riemann surface there was a group generated by a pair of permutations. From this result an algorithm may be constructed for enumerating labeled maps, and…
We extend so-called slit-slide-sew bijections to constellations and quasiconstellations. We present an involution on the set of hypermaps given with an orientation, one distinguished corner, and one distinguished edge leading away from the…
The subjects in the title are interwoven in many different and very deep ways. I recently wrote several expository accounts [64-66] that reflect a certain range of developments, but even in their totality they cannot be taken as a…
We give diagrammatic formulae for morphisms between indecomposable representations of $\bar{U}_{q}(\mathfrak{sl}_{2})$ appearing in the decomposition of $\mathbb{C}^{\otimes 2n}$, including projections and second endomorphisms on projective…