Probability Distributions on Partially Ordered Sets and Network Interdiction Games

This article poses the following problem: Does there exist a probability distribution over subsets of a finite partially ordered set (poset), such that a set of constraints involving marginal probabilities of the poset’s elements and maximal chains is satisfied? We present a combinatorial algorithm to positively resolve this question. The algorithm can be implemented in polynomial time in the special case where maximal chain probabilities are affine functions of their elements. This existence problem is relevant for the equilibrium characterization of a generic strategic interdiction game on a capacitated flow network. The game involves a routing entity that sends its flow through the network while facing path transportation costs and an interdictor who simultaneously interdicts one or more edges while facing edge interdiction costs. Using our existence result on posets and strict complementary slackness in linear programming, we show that the Nash equilibria of this game can be fully described using primal and dual solutions of a minimum-cost circulation problem. Our analysis provides a new characterization of the critical components in the interdiction game. It also leads to a polynomial-time approach for equilibrium computation.

On invariants of polynomial functions, II

Let P be a finite partially ordered set. In our previous paper, we defined the sectional geometric genus gi(P) of P and studied gi(P). In this paper, by using this sectional geometric genus of P, we will give a criterion about the case in which P has no order.

Categories: Between Cubes and Globes. Sketch I

For a finite partially ordered set I, we define an abstract polytope PI which is a cube or a globe in the cases of discrete or linear poset, respectively. For a poset P, we have built a small category ♦P with finite lower subsets in P as objects. This category ♦P = ♦P+♦P- is factorized into a product of two wide subcategories ♦P+ of faces and ♦P- of degenerations. One can imagine a degeneration from I to J ⊂ I as a projection of an abstract polytope PI to the subspace spanned by J. Morphisms in ♦P+ with fixed target I are identified with faces of PI . The composition in ♦P admits the natural geometric interpretation. On the category ♦I of presheaves on ♦I , we construct a monad of free category in two steps: for a terminal presheaf, the free category is obtained via a generalized nerve construction; in the general case, the cells of a nerve are colored by elements of the initial presheaf. Strict P-fold categories are defined as algebras over this monad. All constructions are functorial in P. The usual theory of globular and cubical higher categories can be translated in a natural way into our general context.

Faces of 2-Dimensional Simplex of Order and Chain Polytopes

Each of the descriptions of vertices, edges, and facets of the order and chain polytope of a finite partially ordered set are well known. In this paper, we give an explicit description of faces of 2-dimensional simplex in terms of vertices. Namely, it will be proved that an arbitrary triangle in 1-skeleton of the order or chain polytope forms the face of 2-dimensional simplex of each polytope. These results mean a generalization in the case of 2-faces of the characterization known in the case of edges.

On Some Local Cohomology Spectral Sequences

We introduce a formalism to produce several families of spectral sequences involving the derived functors of the limit and colimit functors over a finite partially ordered set. The 1st type of spectral sequences involves the left derived functors of the colimit of the direct system that we obtain by applying a family of functors to a single module. For the 2nd type we follow a completely different strategy as we start with the inverse system that we obtain by applying a covariant functor to an inverse system. The spectral sequences involve the right derived functors of the corresponding limit. We also have a version for contravariant functors. In all the introduced spectral sequences we provide sufficient conditions to ensure their degeneration at their 2nd page. As a consequence we obtain some decomposition theorems that greatly generalize the well-known decomposition formula for local cohomology modules of Stanley–Reisner rings given by Hochster.

Formalization of some central theorems in combinatorics of finite sets

We present fully formalized proofs of some central theorems from combinatorics. These are Dilworth's decomposition theorem, Mirsky's theorem, Hall's marriage theorem and the Erdős-Szekeres theorem. Dilworth's decomposition theorem is the key result among these. It states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirsky's theorem is a dual of Dilworth's decomposition theorem, which states that in any finite poset, the size of a smallest antichain cover and a largest chain are the same. We use Dilworth's theorem in the proofs of Hall's Marriage theorem and the Erdős-Szekeres theorem. The combinatorial objects involved in these theorems are sets and sequences. All the proofs are formalized in the Coq proof assistant. We develop a library of definitions and facts that can be used as a framework for formalizing other theorems on finite posets.

Unimodular Equivalence of Order and Chain Polytopes

Order polytope and chain polytope are two polytopes that arise naturally from a finite partially ordered set. These polytopes have been deeply studied from viewpoints of both combinatorics and commutative algebra. Even though these polytopes possess remarkable combinatorial and algebraic resemblance, they seem to be rarely unimodularly equivalent. In the present paper, we prove the following simple and elegant result: the order polytope and chain polytope for a poset are unimodularly equivallent if and only if that poset avoid the 5-element "X" shape subposet. We also explore a few equivalent statements of the main result.

Finite partially ordered set and some of its properties

This paper focuses on some main properties of the finite partially ordered sets. These properties are furnished in the form of theorems. Here we have presented three such theorems. The first theorem is called as ‘duality theorem’. This fundamental theorem was first obtained by Greene. Few years later it was rediscovered and given an alternative proof by Fomin. The second theorem bestows the functionality property. The proof of this was also done by Greene. However, Gansner gave an alternative proof of the theorem taking advantage of a connection between poset and linear algebra. The proof of the third theorem is fully due to us. This theorem gives rise to a recursive computation of the shape. In the present paper we have discussed the first two properties through suitable illustrations only whereas a complete proof is furnished for the last one. BIBECHANA 13 (2016) 126-130

TWO APPROACHES TO MÖBIUS INVERSION

The Möbius inversion formula for a locally finite partially ordered set is realized as a Lagrange inversion formula. Schauder bases are introduced to interpret Möbius inversion.