Related papers: An algorithm to construct the Le diagram associate…
Wilson loop diagrams are an important tool in studying scattering amplitudes of SYM $N=4$ theory and are known by previous work to be associated to positroids. In this paper we study the structure of the associated positroids, as well as…
A positroid is a special case of a realizable matroid, that arose from the study of totally nonnegative part of the Grassmannian by Postnikov. Postnikov demonstrated that positroids are in bijection with certain interesting classes of…
Le-diagrams are combinatorial objects that parametrize cells of the totally nonnegative Grassmannian, called positroid cells, and each Le-diagram gives rise to a cluster algebra which is believed to be isomorphic to the coordinate ring of…
Positroids are matroids realizable by real matrices with all nonnegative maximal minors. They partition the ordered matroids into equivalence classes, called positroid envelope classes, by their Grassmann necklaces. We give an explicit…
Using Postnikov's Le-diagrams, decorated permutations, and Grassmann necklaces, we classify which positroids are sparse paving matroids. This allows us to enumerate sparse paving positroids, making connections to a known sequence involving…
We study the boundaries of the positroid cells which arise from N = 4 super Yang Mills theory. Our main tool is a new diagrammatic object which generalizes the Wilson loop diagrams used to represent interactions in the theory. We prove…
A positroid is an ordered matroid realizable by a real matrix with all nonnegative maximal minors. Postnikov gave a map from ordered matroids to Grassmann necklaces, for which there is a unique positroid in each fiber of the map. Here, we…
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial…
We construct an algorithm to decide whether two given Legendrian or transverse links are equivalent. In general, the complexity of the algorithm is too high for practical implementation. However, in many cases, when the symmetry group of…
We study the problem of indexing irreducible polynomials over finite fields, and give the first efficient algorithm for this problem. Specifically, we show the existence of poly(n, log q)-size circuits that compute a bijection between {1,…
A necklace is an equivalence class of words of length $n$ over an alphabet under the cyclic shift (rotation) operation. As a classical object, there have been many algorithmic results for key operations on necklaces, including counting,…
Postnikov constructed a cellular decomposition of the totally nonnegative Grassmannians. The poset of cells can be described (in particular) via Grassmann necklaces. We study certain quiver Grassmannians for the cyclic quiver admitting a…
In this paper we explore the combinatorics of the non-negative part (G/P)+ of a cominuscule Grassmannian. For each such Grassmannian we define Le-diagrams -- certain fillings of generalized Young diagrams which are in bijection with the…
A dimer model is a quiver with faces embedded into a disk. A consistent dimer model gives rise to a strand diagram, and hence to a positroid. The Gorenstein-projective module category over the completed boundary algebra of a dimer model was…
A rational Dyck path of type $(m,d)$ is an increasing unit-step lattice path from $(0,0)$ to $(m,d) \in \mathbb{Z}^2$ that never goes above the diagonal line $y = (d/m)x$. On the other hand, a positroid of rank $d$ on the ground set $[d+m]$…
A numerical algorithm to decompose an exact low-rank skew-symmetric tensor into a sum of elementary (rank-$1$) skew-symmetric tensors is introduced. The algorithm uncovers this Grassmann decomposition based on linear relations that are…
We give subquadratic algorithms that, given two necklaces each with n beads at arbitrary positions, compute the optimal rotation of the necklaces to best align the beads. Here alignment is measured according to the p norm of the vector of…
Rook matroids were recently introduced by the author and Alexandersson as matroids whose bases arise from certain restricted rook placements on a skew-shaped board. They were shown to be a subclass of transversal matroids and positroids. We…
It is a well known that, for odd $n$, the number of subsets of $\{1,2,\dots,n\}$ the sum of whose elements is divisible by $n$ equals the number of binary necklaces of length $n$. In this paper generalize this result in two directions. On…
In this note, we initiate the systematic study of the Lie algebra structure of the necklace Lie algebra n of a free algebra in 2d variables. We begin by giving a description of n as an sp(2d)-module. Specializing to d = 1, we decompose n…