arXiv subjects

Gleb Koshevoy

Publications and source records attributed to Gleb Koshevoy.

23 records · Page 2Linked to original sources

arXiv2014

Cluster monomials in $\mathbb C[GL_n/N]$, a simplicial fan in the cone of semi-standard Young tableaux, and the Lusztig basis

We study the cluster monomials and cluster complex in $\mathbb C[GL_n/N]$. For we consider the {\em tableau basis} in $\mathbb C[GL_n/N]$. Namely, an element $Δ_T$ of the tableau basis labeled by a semistandard Young tableau $T$ is the product of the flag minors corresponding to columns of $T$. Our main results state: (i) cluster monomials in $\mathbb C[GL_n/N]$ can be labeled by semistandard Young tableaux such that any cluster monomial has the form $Δ_T+$ lexicographically smaller terms; (ii) such labeling distinguish the cluster monomial; (iii) for any seed of the cluster algebra on $\mathbb C[GL_n/N]$, we define a cone in $\mathbf D(n)$ generated by tableaux which label the cluster variables of the seed, then these cones form a simlicial fan in $\mathbf D(n)$ ($\mathbf D(n)$ is linear isomorphic to the Gelfand Tseitlin cone).

math.RA↗

arXiv2014

Subtraction-free complexity, cluster transformations, and spanning trees

Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster transformations to design efficient subtraction-free algorithms for computing Schur functions and their skew, double, and supersymmetric analogues, thereby generalizing earlier results by P. Koev. We develop such algorithms for computing generating functions of spanning trees, both directed and undirected. A comparison to the lower bound due to M. Jerrum and M. Snir shows that in subtraction-free computations, "division can be exponentially powerful." Finally, we give a simple example where the gap between ordinary and subtraction-free complexity is exponential.

math.CO↗

arXiv2013

The purity of set-systems related to Grassmann necklaces

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 relation, in particular, on the Boolean cube $2^{[n]}$. In 0909.1423[math.CO] we proved these purity conjectures for the Boolean cube $2^{[n]}$, the discrete Grassmanian ${[n]\choose r}$, and some other set-systems. Oh, Postnikov, and Speyer in arxiv:1109.4434 proved the purity for weakly separated collections inside a positroid which contain a Grassmann necklace $\mathcal N$ defining the positroid. We denote such set-systems as $\mathcal{I}nt(\mathcal N )$. In this paper we give an alternative (and shorter) proof of the purity of $\mathcal{I}nt(\mathcal N )$ and present a stronger result. More precisely, we introduce a set-system $\mathcal{O}ut(\mathcal N )$ complementary to $\mathcal{I}nt(\mathcal N )$, in a sense, and establish its purity. Moreover, we prove (Theorem~3) that these two set-systems are weakly separated from each other. As a consequence of Theorem~3, we obtain the purity of set-systems related to pairs of weakly separated necklaces (Proposition 4 and Corollaries 1 and 2). Finally, we raise a conjecture on the purity of both the interior and exterior of a generalized necklace.

math.CO↗

arXiv2012

On the combinatorial structure of crystals of types A,B,C

Regular $A_n$-, $B_n$- and $C_n$-crystals are edge-colored directed graphs, with ordered colors $1,2,...,n$, which are related to representations of quantized algebras $U_q(\mathfrak{sl}_{n+1})$, $U_q(\mathfrak{sp}_{2n})$ and $U_q(\mathfrak{so}_{2n+1})$, respectively. We develop combinatorial methods to reveal refined structural properties of such objects. Firstly, we study subcrystals of a regular $A_n$-crystal $K$ and characterize pairwise intersections of maximal subcrystals with colors $1,...,n-1$ and colors $2,...,n$. This leads to a recursive description of the structure of $K$ and provides an efficient procedure of assembling $K$. Secondly, using merely combinatorial means, we demonstrate a relationship between regular $B_n$-crystals (resp. $C_n$-crystals) and regular symmetric $A_{2n-1}$-crystals (resp. $A_{2n}$-crystals).

math.CO↗

arXiv2010

Combinatorial Deformations of Algebras: Twisting and Perturbations

The framework used to prove the multiplicative law deformation of the algebra of Feynman-Bender diagrams is a \textit{twisted shifted dual law} (in fact, twice). We give here a clear interpretation of its two parameters. The crossing parameter is a deformation of the tensor structure whereas the superposition parameters is a perturbation of the shuffle coproduct of Hoffman type which, in turn, can be interpreted as the diagonal restriction of a superproduct. Here, we systematically detail these constructions.

cs.SC↗