BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:Milan Studený (Institute of Information Theory and Automation\, P
 rague)
DTSTART:20260409T150000Z
DTEND:20260409T161500Z
DTSTAMP:20260423T034445Z
UID:AAIT/52
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/AAIT/52/">Se
 mi-graphoids interpreted as collections of posets.</a>\nby Milan Studený 
 (Institute of Information Theory and Automation\, Prague) as part of Semin
 ar on Algorithmic Aspects of Information Theory\n\n\nAbstract\nSemi-grapho
 ids are discrete structures introduced in context of probabilistic reasoni
 ng. Particular structural semi-graphoids correspond to the non-empty faces
  of the cone of tight polymatroids. A result will be presented that any se
 mi-graphoid over a finite non-empty variable set N can be viewed as a coll
 ection of posets (= partial orderings) on N. To this end\, a semi-graphoid
  is first identified with a particular subgraph of the so-called permutohe
 dral graph\, whose nodes are enumerations (= total orderings) of N. The co
 mponents of this semi-graphoidal subgraph appear to be special geodeticall
 y convex sets in the permutohedral graph and\, for this reason\, each of t
 hese components uniquely corresponds to a poset on N. We also mention geom
 etrical interpretation of finite posets in terms of so-called braid cones.
 \n\nThe presentation is based on the paper Semi-graphoids viewed as collec
 tions of posets. To appear in Proceedings of the 21th conference IPMU 2026
  (B. Vantaggi et al. eds)\, Springer.\n
LOCATION:https://researchseminars.org/talk/AAIT/52/
END:VEVENT
END:VCALENDAR