Related papers: An algorithm to construct the Le diagram associate…
A positroid is a special case of a realizable matroid that arose from the study of the totally nonnegative part of the Grassmannian by Postnikov. In this paper, we study the facets of its matroid polytope and the independent set polytope.…
Unlabelled Necklaces are an equivalence class of cyclic words under both the rotation (cyclic shift) and the relabelling operations. The relabelling of a word is a bijective mapping from the alphabet to itself. The main result of the paper…
We study the commutative algebras $Z_{JK}$ appearing in Brown and Goodearl's extension of the $\mathcal{H}$-stratification framework, and show that if $A$ is the single parameter quantized coordinate ring of $M_{m,n}$, $GL_n$ or $SL_n$,…
Graphs are ubiquitous in modelling relational structures. Recent endeavours in machine learning for graph-structured data have led to many architectures and learning algorithms. However, the graph used by these algorithms is often…
We address two variants of the classical necklace counting problem from enumerative combinatorics. In both cases, we fix a finite group $\mathcal{G}$ and a positive integer $n$. In the first variant, we count the ``identity-product…
Postnikov constructed a decomposition of a totally nonnegative Grassmannian into positroid cells. We provide combinatorial formulas that allow one to decide which cell a given point belongs to and to determine affine coordinates of the…
Studying the problem of quasicommuting quantum minors, Leclerc and Zelevinsky introduced in 1998 the notion of weakly separated sets in $[n]:=\{1,\ldots, n\}$. Moreover, they raised several conjectures on the purity for this symmetric…
The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet and n is the length of the considered bracelets. The key part…
There are numerous combinatorial objects associated to a Grassmannian permutation $w_\lambda$ that index cells of the totally nonnegative Grassmannian. We study several of these objects and their $q$-analogues in the case of permutations…
Plabic graphs are interesting combinatorial objects used to study the totally nonnegative Grassmannian. Faces of plabic graphs are labeled by $k$-element sets of positive integers, and a collection of such $k$-element sets are the face…
An $(a,b)$-difference necklace of length $n$ is a circular arrangement of the integers $0, 1, 2, \ldots , n-1$ such that any two neighbours have absolute difference $a$ or $b$. We prove that, subject to certain conditions on $a$ and $b$,…
The inverse of a large matrix can often be accurately approximated by a polynomial of degree significantly lower than the order of the matrix. The iteration polynomial generated by a run of the GMRES algorithm is a good candidate, and its…
The positive Grassmannian $Gr_{k,n}^{\geq 0}$ is the subset of the real Grassmannian where all Pl\"ucker coordinates are nonnegative. It has a beautiful combinatorial structure as well as connections to statistical physics, integrable…
To a given nonsingular triangular matrix A with entries from a ring, we associate a weighted bipartite graph G(A) and give a combinatorial description of the inverse of A by employing paths in G(A). Under a certain condition, nonsingular…
Configurations are necklaces with prescribed numbers of red and black beads. Among all possible configurations, the regular one plays an important role in many applications. In this paper, several aspects of regular configurations are…
Any graph which is not vertex transitive has a proper induced subgraph which is unique due to its structure or the way of its connection to the rest of the graph. We have called such subgraph as an anchor. Using an anchor which, in fact, is…
Let $G$ be a $3$-connected ordered graph with $n$ vertices and $m$ edges. Let $\mathbf{p}$ be a randomly chosen mapping of these $n$ vertices to the integer range $\{1, 2,3, \ldots, 2^b\}$ for $b\ge m^2$. Let $\ell$ be the vector of $m$…
The intersection graph of a collection of trapezoids with corner points lying on two parallel lines is called a trapezoid graph. These graphs and their generalizations were applied in various fields, including modeling channel routing…
In this paper we want to introduce two commutative diagrams for weight $n$=2 and $n$=3 with six faces on each. These diagrams describe the relations between Grassmannian complex in geometric configurations, Bloch-Suslin's complex for weight…
A gaussoid is a combinatorial structure that encodes independence in probability and statistics, just like matroids encode independence in linear algebra. The gaussoid axioms of Lnenicka and Mat\'us are equivalent to compatibility with…