Related papers: Bijectivity of a generalized Pak-Stanley labeling
We introduce a novel algebraic structure called di-skew brace by which we show that generalized digroups systematically yield bijective, non-degenerate solutions to the set-theoretic Yang-Baxter equation. We study the structural properties…
We find large classes of injective and projective $p$-multinormed spaces. In fact, these classes are universal, in the sense that every $p$-multinormed space embeds into (is a quotient of) an injective (resp. projective) $p$-multinormed…
Let $M$ be a regular matroid. The Jacobian group ${\rm Jac}(M)$ of $M$ is a finite abelian group whose cardinality is equal to the number of bases of $M$. This group generalizes the definition of the Jacobian group (also known as the…
We establish a bijective correspondence between Smirnov words with balanced letter multiplicities and Hamiltonian paths in complete $m$-partite graphs $K_{n,n,\ldots,n}$. This bijection allows us to derive closed inclusion-exclusion…
In this paper, we give part-preserving bijections between three fundamental families of objects that serve as natural framework for many problems in enumerative combinatorics. Specifically, we consider compositions, Dyck paths, and…
We show that compactly generated t-structures in the derived category of a commutative ring $R$ are in a bijection with certain families of compactly generated t-structures over the local rings $R_\mathfrak{m}$ where $\mathfrak{m}$ runs…
In 1989 Manin and Schechtman defined the discriminantal arrangement $\mathcal{B}(n, k,\mathcal{A})$ associated to a generic arrangement $\mathcal{A}$ of $n$ hyperplanes in a $k$-dimensional space. An equivalent notion was already introduced…
Graphical parking functions, or $G$-parking functions, are a generalization of classical parking functions which depend on a connected multigraph $G$ having a distinguished root vertex. Gaydarov and Hopkins characterized the relationship…
We construct a bijection between $321$- and $213$-avoiding permutations that preserves the property of $t$-stack-sortability. Our bijection transforms natural statistics between these two classes of permutations and proves a refinement of…
In this note we introduce several instructive examples of bijections found between several different combinatorially defined sequences of sets. Each sequence has cardinalities given by the Catalan numbers. Our results answer some questions…
Identification of string junction states of pure SU(2) Seiberg-Witten theory as B-branes wrapped on a Calabi-Yau manifold in the geometric engineering limit is discussed. The wrapped branes are known to correspond to objects in the bounded…
We classify finite posets with a particular sorting property, generalizing a result for rectangular arrays. Each poset is covered by two sets of disjoint saturated chains such that, for any original labeling, after sorting the labels along…
We construct a pairing, which we call factorization homology, between framed manifolds and higher categories. The essential geometric notion is that of a vari-framing of a stratified manifold, which is a framing on each stratum together…
Bipartite ranking is a fundamental supervised learning problem, with the goal of learning a ranking over instances with maximal Area Under the ROC Curve (AUC) against a single binary target label. However, one may often observe multiple…
Multi-label classification is a type of supervised machine learning that can simultaneously assign multiple labels to an instance. To solve this task, some methods divide the original problem into several sub-problems (local approach),…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
Trivalent $2$-stratifolds are a generalization of $2$-manifolds in that there are disjoint simple closed curves where three sheets meet. We obtain a classification of $1$-connected $2$-stratifolds in terms of their associated labeled graphs…
This work characterizes the general form of a bijective linear map $\Psi:\mathscr{M}_n(\mathbb{C}) \to \mathscr{M}_n(\mathbb{C})$ such that $[\Psi(A_1),~\Psi(A_2)]=D_2$ whenever $[A_1,~A_2]=D_1$ where $D_1~\text{and}~D_2$ are fixed…
We present a bijective proof for the planar case of Louf's counting formula on bipartite planar maps with prescribed face degree, that arises from the Toda hierarchy. We actually show that his formula hides two simpler formulas, both of…
A depth-first search version of Dhar's burning algorithm is used to give a bijection between the parking functions of a graph and labeled spanning trees, relating the degree of the parking function with the number of inversions of the…