14 citations
- Russian Academy of SciencesRU10 papers
- Institute for Systems AnalysisRU7 papers
- Institute of EconomicsRU5 papers
- Institute for Information Transmission ProblemsRU2 papers
- Lomonosov Moscow State UniversityRU2 papers
- Université Pierre-et-Marie-CurieFR2 papers
- Academy of Mathematics and Systems ScienceCN1 paper
- Centre de Mathématiques Appliquées de l'École polytechniqueFR1 paper
- Centre National de la Recherche ScientifiqueFR1 paper
- Chinese Academy of SciencesCN1 paper
- Dorodnitsyn Computing CentreRU1 paper
- École Normale Supérieure - PSLFR1 paper
12 papers · 1 filter
On stable flows and preflows
Alexander Karzanov
In 2010s Fleiner introduced a notion of stable flows in directed networks and showed that such a flow always exists and can be found by use of a reduction to the stable allocation…
On interrelations between strongly, weakly and chord separated set-systems (a geometric approach)
V. I. Danilov, A. V. Karzanov, G. A. Koshevoy
We consider three types of set-systems that have interesting applications in algebraic combinatorics and representation theory: maximal collections of the so-called strongly separa…
Combined tilings and separated set-systems
Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy
In 1998, Leclerc and Zelevinsky introduced the notion of weakly separated collections of subsets of the ordered -element set (using this notion to give a combinatorial cha…
Subtraction-free complexity, cluster transformations, and spanning trees
Sergey Fomin, Dima Grigoriev, Gleb Koshevoy
Subtraction-free computational complexity is the version of arithmetic circuit complexity that allows only three operations: addition, multiplication, and division. We use cluster…
Assembling crystals of type A
Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy
Regular -crystals are certain edge-colored directed graphs which are related to representations of the quantized universal enveloping algebra . For s…
Planar flows and quadratic relations over semirings
Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy
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 w…