63 citations
- Russian Academy of SciencesRU27 papers
- Central Economics and Mathematics InstituteRU7 papers
- Moscow Institute of Physics and TechnologyRU7 papers
- Institute for Information Transmission ProblemsRU5 papers
- Lomonosov Moscow State UniversityRU5 papers
- National Research University Higher School of EconomicsRU5 papers
- Research Institute for System StudiesRU5 papers
- National Research Nuclear University MEPhIRU4 papers
- Nihon UniversityJP4 papers
- Institute for Nuclear ResearchRU3 papers
- P.N. Lebedev Physical Institute of the Russian Academy of SciencesRU3 papers
- Chemical Semantics (United States)US2 papers
13 papers · 1 filter
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…
A combinatorial algorithm for the planar multiflow problem with demands located on three holes
Maxim A. Babenko, Alexander V. Karzanov
We consider an undirected multi(commodity)flow demand problem in which a supply graph is planar, each source-sink pair is located on one of three specified faces of the graph, and…
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…
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…
Condorcet domains of tiling type
Vladimir I. Danilov, Alexander V. Karzanov, Gleb A. Koshevoy
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 s…