arXiv subjects

Gleb A. Koshevoy

Publications and source records attributed to Gleb A. Koshevoy.

17 recordsLinked to original sources

arXiv2026

Stability of Type A Mirković-Vilonen Polytopes under Minkowski Sum via Weak Separation

Mirković--Vilonen (MV) polytopes play a key role in the representation theory of reductive algebraic groups, while the geometric behavior of prime MV polytopes under Minkowski addition remains a subtle open problem. This paper focuses on type A and regards Schubert matroid polytopes as fundamental prime MV building blocks. Using the crystal structure on MV polytopes, we strengthen Sanchez's compatibility condition and establish a necessary and sufficient condition: the positive Minkowski sum of such polytopes is again an MV polytope precisely when the indexing family is weakly separated. Working within discrete convex analysis, we relate discrete concave tropical Plücker functions to concave extensions on the hypercube and the resulting generalized matroid subdivisions, showing that weak separation is equivalent to the stability of these subdivisions under common refinement. We further clarify the intrinsic connection between our subdivision constructions and the hypersimplex matroid subdivisions developed by Early, providing a natural flag-type generalization of his classical results. We briefly discuss generalized positroids and generalized polypositroids, and identify the MV fan $\mathcal{MV}$ as the secondary fan of hypercube generalized positroid subdivisions. Accordingly, maximal weakly separated sets correspond to maximal cones in $\mathcal{MV}$ and produce the finest such subdivisions. This work unifies MV polytope theory with tropical matroid geometry, advances the understanding of compatibility phenomena in MV combinatorics, and offers new perspectives at the interface of representation theory and combinatorics.

math.RT↗

arXiv2025

Finest positroid subdivisions from maximal weakly separated collections

We adopt a formal and algebraic approach of Early \cite{E2} to study the positive tropical Grassmannian $\operatorname{Trop}^+ Gr_{k,n}$. Specifically, we deal with positroid subdivision of hypersimplex induced by translated blades from any maximal weakly separated collection. One of our main results gives a necessary and sufficient condition on a maximal weakly separated collection to form a positroid subdivision of a hypersimplex corresponding to a simplicial cone in $\rm Trop^+Gr_{k,n}$. For k = 2 our condition says that any weakly separated collection of two-elements sets gives such a simplicial cone, and all cones are of such a form. We also show that the maximality of any weakly separated collection is preserved under the boundary map, which armatively answers a question by Early in \cite{E1}. Plabic graphs, invented by Postnikov \cite{P}, are of use in proving this result. As a corollary, we get that all those positroid subdivisions are the finest. Thus, the flip of two maximal weakly separatedcollections corresponds to a pair of adjacent maximal cones in positive tropical Grassmannian.

math.RT↗

arXiv2025

On universal quadratic inequalities for minors of TNN matrices

For positive integers $n,n'$, we give a combinatorial characterization for the set of quadratic inequalities on minors that are valid for all $n\times n'$ totally nonnegative matrices. This is obtained as a consequence from our earlier results on stable quadratic identities on minors of matrices generated by flows in planar graphs via Lindström's construction.

math.CO↗

arXiv2024

On Manin-Schechtman orders related to directed graphs

As a generalization of weak Bruhat orders on permutations, in 1989 Manin and Schechtman introduced the notion of a higher Bruhat order on the $d$-element subsets of a set $[n]=\{1,2,\ldots,n\}$. Among other results in this field, they proved that the set of such orders for $n,d$ fixed, endowed with natural local transformations, constitutes a poset with one minimal and one maximal elements. In this paper we consider a wider model, involving the so-called convex order on certain path systems in an acyclic directed graph, introduce local transformations, or flips, on such orders and prove that the resulting structure gives a poset with one minimal and one maximal elements as well, yielding a generalization of the above-mentioned classical result.

math.CO↗

arXiv2022

Higher Bruhat orders of types B and C

We propose versions of higher Bruhat orders for types $B$ and $C$. This is based on a theory of higher Bruhat orders of type~A and their geometric interpretations (due to Manin--Shekhtman, Voevodskii--Kapranov, and Ziegler), and on our study of the so-called symmetric cubillages of cyclic zonotopes.

math.CO↗

arXiv2022

Flips in symmetric separated set-systems

For a positive integer $n$, a collection $S$ of subsets of $[n]=\{1,\ldots,n\}$ is called symmetric if $X\in S$ implies $X^\ast\in S$, where $X^\ast:=\{i\in [n]\colon n-i+1\notin X\}$ (the involution $\ast$ was introduced by Karpman). Leclerc and Zelevinsky showed that the set of maximal strongly (resp. weakly) separated collections in $2^{[n]}$ is connected via flips, or mutations, ``in the presence of six (resp. four) witnesses''. We give a symmetric analog of those results, by showing that each maximal symmetric strongly (weakly) separated collection in $2^{[n]}$ can be obtained from any other one by a series of special symmetric local transformations, so-called symmetric flips. Also we establish the connectedness via symmetric flips for the class of maximal symmetric $r$-separated collections in $2^{[n]}$ when $n,r$ are even (where sets $A,B\subseteq [n]$ are called $r$-separated if there are no elements $i_0<i_1< \cdots <i_{r+1}$ in $[n]$ which alternate in $A\setminus B$ and $B\setminus A$). This is related to a symmetric version of higher Bruhat orders. These results are obtained as consequences of our study of related geometric objects: symmetric rhombus and combined tilings and symmetric cubillages.

math.CO↗

arXiv2021

Stable sets of contracts in two-sided markets

We revisit the problem of existence of stable systems of contracts with arbitrary sets of contracts. We show that stable sets of contracts exists if choices of agents satisfy path-independence. We call such choice functions Plott functions. Our proof is based on application of Zorn lemma to a special poset of semi-stable pairs. Moreover, we construct a dynamic process on the poset (generalizing algorithm Gale and Shapley) steady states of which are stable sets. In Appendix we discuss Lehmann hyper-orders and establish a bijection between the set of Lehmann hyper-orders and the set of Plott functions.

math.CO↗

arXiv2019

The weak separation in higher dimensions

For an odd integer $r>0$ and an integer $n>r$, we introduce a notion of weakly $r$-separated collections of subsets of $[n]=\{1,2,\ldots,n\}$. When $r=1$, this corresponds to the concept of weak separation introduced by Leclerc and Zelevinsky. In this paper, extending results due to Leclerc-Zelevinsky, we develop a geometric approach to establish a number of nice combinatorial properties of maximal weakly r-separated collections. As a supplement, we also discuss an analogous concept when $r$ is even.

math.CO↗

arXiv2018

Lift expectations of random sets

It is known that the distribution of an integrable random vector $ξ$ in $\mathbb{R}^d$ is uniquely determined by a $(d+1)$-dimensional convex body called the lift zonoid of $ξ$. This concept is generalised to define the lift expectation of random convex bodies. However, the unique identification property of distributions is lost; it is shown that the lift expectation uniquely identifies only one-dimensional distributions of the support function, and so different random convex bodies may share the same lift expectation. The extent of this nonuniqueness is analysed and it is related to the identification of random convex functions using only their one-dimensional marginals. Applications to construction of depth-trimmed regions and partial ordering of random convex bodies are also mentioned.

math.PR↗

arXiv2016

Combined tilings and separated set-systems

In 1998, Leclerc and Zelevinsky introduced the notion of weakly separated collections of subsets of the ordered $n$-element set $[n]$ (using this notion to give a combinatorial characterization for quasi-commuting minors of a quantum matrix). They conjectured the purity of certain natural domains $D\subseteq 2^{[n]}$ (in particular, of the hypercube $2^{[n]}$ itself, and the hyper-simplex $\{X\subseteq[n]\colon |X|=m\}$ for $m$ fixed), where $D$ is called pure if all maximal weakly separated collections in $D$ have the same cardinality. These conjectures have been answered affirmatively. In this paper, generalizing those earlier results, we reveal wider classes of pure domains in $2^{[n]}$. This is obtained as a consequence of our study of a novel geometric--combinatorial model for weakly separated set-systems, so-called \emph{combined (polygonal) tilings} on a zonogon, which yields a new insight in the area.

math.CO↗

arXiv2012

Assembling crystals of type A

Regular $A_n$-crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra $U_q(\mathfrak{sl}_{n+1})$. For such a crystal $K$ with colors $1,2,...,n$, we consider its maximal connected subcrystals with colors $1,...,n-1$ and with colors $2,...,n$ and characterize the interlacing structure for all pairs of these subcrystals. This is used to give a recursive description of the combinatorial structure of $K$ and develop an efficient procedure of assembling $K$.

math.CO↗

arXiv2012

Planar flows and quadratic relations over semirings

Adapting Lindström's well-known construction, we consider a wide class of functions which are generated by flows in a planar acyclic directed graph whose vertices (or edges) take weights in an arbitrary commutative semiring. We give a combinatorial description for the set of "universal" quadratic relations valid for such functions. Their specializations to particular semirings involve plenty of known quadratic relations for minors of matrices (e.g., Plücker relations) and the tropical counterparts of such relations. Also some applications and related topics are discussed.

math.CO↗

arXiv2011

Condorcet domains of tiling type

A Condorcet domain (CD) is a collection of linear orders on a set of candidates satisfying the following property: for any choice of preferences of voters from this collection, a simple majority rule does not yield cycles. We propose a method of constructing "large" CDs by use of rhombus tiling diagrams and explain that this method unifies several constructions of CDs known earlier. Finally, we show that three conjectures on the maximal sizes of those CDs are, in fact, equivalent and provide a counterexample to them.

math.CO↗

arXiv2010

On maximal weakly separated set-systems

For a permutation $ω\in S_n$, Leclerc and Zelevinsky \cite{LZ} introduced a concept of $ω$-{\em chamber weakly separated collection} of subsets of $\{1,2,...,n\}$ and conjectured that all inclusion-wise maximal collections of this sort have the same cardinality $\ell(ω)+n+1$, where $\ell(ω)$ is the length of $ω$. We answer affirmatively this conjecture and present a generalization and additional results.

math.CO↗

arXiv2010

Planar flows and Plücker's type quadratic relations over semirings

It is well known, due to Lindström, that the minors of a (real or complex) matrix can be expressed in terms of weights of flows in a planar directed graph. Another classical fact is that there are plenty of homogeneous quadratic relations involving flag minors, or Plücker coordinates of the corresponding flag manifold. Generalizing and unifying these facts and their tropical counterparts, we consider a wide class of functions on $2^{[n]}$ that are generated by flows in a planar graph and take values in an arbitrary commutative semiring, where $[n]=\{1,2,\ldots,n\}$. We show that the ``universal'' homogeneous quadratic relations fulfilled by such functions can be described in terms of certain matchings, and as a consequence, give combinatorial necessary and sufficient conditions on the collections of subsets of $[n]$ determining these relations.

math.CO↗

arXiv2009

Plücker environments, wiring and tiling diagrams, and weakly separated set-systems

For the ordered set $[n]$ of $n$ elements, we consider the class $\Bscr_n$ of bases $B$ of tropical Plücker functions on $2^{[n]}$ such that $B$ can be obtained by a series of mutations (flips) from the basis formed by the intervals in $[n]$. We show that these bases are representable by special wiring diagrams and by certain arrangements generalizing rhombus tilings on the $n$-zonogon. Based on the generalized tiling representation, we then prove that each weakly separated set-system in $2^{[n]}$ having maximum possible size belongs to $\Bscr_n$, thus answering affirmatively a conjecture due to Leclerc and Zelevinsky. We also prove an analogous result for a hyper-simplex $Δ_n^m=\{S\subseteq[n]\colon |S|=m\}$.

math.CO↗

arXiv2008

On bases of tropical Plücker functions

We consider functions $f:B\to\Rset$ that obey tropical analogs of classical Plücker relations on minors of a matrix. The most general set $B$ that we deal with in this paper is of the form $\{x\in \Zset^n\colon 0\le x\le a, m\le x_1+...+x_n\le m'\}$ (a rectangular integer box ``truncated from below and above''). We construct a basis for the set $\Tscr$ of tropical Plücker functions on $B$, a subset $\Bscr\subseteq B$ such that the restriction map $\Tscr\to\Rset^\Bscr$ is bijective. Also we characterize, in terms of the restriction to the basis, the classes of submodular, so-called skew-submodular, and discrete concave functions in $\Tscr$, discuss a tropical analogue of the Laurentness property, and present other results.

math.CO↗