Facets of the cone up to rank 7

Margaret M. Bayer and Gabor Hetyei

Department of Mathematics
University of Kansas
Lawrence KS 66045-2142
April 28, 2000

This note is available on the Worldwide Web at the address

http://www.math.ku.edu/~bayer/euler/index.html
and it provides supplemental information to our paper Flag vectors of Eulerian partially ordered
sets, to appear in the European Journal of Combinatorics.

Description of notation

m+n
Convolution of chain operators: fSm fTn = fS{m}(T
+m) .
See Appendix B of our paper.
def

Sparse f basis: A set S {1, 2, . . . , n} is sparse if it does not contain two consecutive integers, and
it does not contain n. For the vector space of chain operators fSn+1 : S {1, 2, . . . , n} acting
on Eulerian posets of rank n + 1, the set {fSn+1 : S {1, 2, . . . , n}, S sparse} forms a basis.
This was shown in:
M. M. Bayer and L. J. Billera, Generalized DehnSommerville relations for polytopes, spheres
and Eulerian partially ordered sets, Invent. Math. 79 (1985), 143157.
L-vector:

Ln+1
S

def

n|S|

= (1)


T [1,n]\S

|T |

fTn+1 . Equivalently fSn+1 = 2|S|


T [1,n]\S

Ln+1
T .

See Denition 2 of our paper.

This research was supported by University of Kansas General Research allocation #3552.
On leave from the Alfred Renyi Institute. Partially supported by Hungarian National Foundation for Scientific
Research grant no. F 032325.

The cones: CEn+1 is the smallest closed convex cone containing the ag vectors of all Eulerian posets.
n+1
is the smallest closed convex cone containing the ag vectors of the horizontal doubles of
CD
all half-Eulerian posets. (See Section 2 of our paper.)

From PORTA output to Eulerian cone

Let V be a set of vectors contained in the cone of half-Eulerian ag f -vectors, and let cone(V) be the
smallest convex cone containing V. Consider the ane transformation that multiplies each fS -entry
of a vector by 2|S| , and divides the coecient of fS in an inequality by 2|S| . Let Kn+1 be the image
n+1
of cone(V) under . Then Kn+1 is contained in the closed cone CD
of ag f -vectors of horizontal
doubles of half-Eulerian posets, which is contained in the Eulerian cone CEn+1 .
For each rank n+1 7 we created a nite set V in the cone of half-Eulerian ag f -vectors, and used
PORTA to generate cone(V). In this note we list the facet inequalities for the corresponding cone Kn+1
(n 6). We check that these inequalities are valid for all Eulerian posets (not just for doubled halfn+1
= CEn+1 ,
Eulerian posets), and this tells us that CEn+1 Kn+1 for rank at most 7. Thus Kn+1 = CD
so we have in fact determined the closed cone of Eulerian ag f -vectors for rank n + 1 7.

Inequalities in the sparse f basis

The inequalities listed are equivalent up to a constant factor to the inequalities encoded in the corresponding PORTA output les. The second number in brackets corresponds to the number of the
equivalent inequality in the L-basis. Boldfaced inequalities cannot be written as convolutions of lowerrank inequalities.
Rank 1:
(F 1) f1 0 (L1)
Rank 2:
(F 1) f2 0 (L1)
(F1) is equivalent to 12 f12 = 12 f1 f1 0.
Rank 3:

(F 1)
f3 0 (L2)
3
(F 2) 2f + f13 0 (L1)

Rank 4:

(F 1)
f4 0 (L3)
4
(F 2) f1 + f24 0 (L2)
(F 3) 2f4 + f14 0 (L1)

Equivalent forms of reducible or non-evident inequalities:

4 2f 4 ) = 1 f 1 (f 3 2f 3 ) 0.
(F 2) : 12 (f12
1

2 1
4
4 2f 4 ) = 1 (f 3 2f 3 )f 1 0.
(F 3) : f2 f34 = 12 (f13
3

2 1

Rank 5:

(F 1)
f5
5
(F 2)
2f35 + f13
5
5
(F 3)
2f2 + f13
5
(F 4)
f1 + f25
(F 5)
2f5 + f15
5
5
(F 6) 2f + f1 f25 + f35

0
0
0
0
0
0

(L6)
(L3)
(L1)
(L2)
(L5)
(L4)

Equivalent forms of reducible or non-evident inequalities:

(F 2)
(F 3)
(F 4)
(F 6)
Rank 6:

: (f13 2f3 )f2 = 12 (f13 2f3 )f1 f1 0.

5 4f 5 ) = 1 (f 5 2f 5 ) = 1 f 1 f 1 (f 3 2f 3 ) 0.
: 12 (f123
2
12

2 123
2 1
5 2f 5 ) = 1 f 1 (f 4 2f 4 ) = 1 f 1 (f 3 2f 3 )f 1 0.
: 12 (f12
1

2 1
4 1
: f45 2f5 0.
(F 1)
f6
6
6
(F 2)
f14 + f24
6
6
(F 3)
2f3 + f13
6
(F 4)
2f26 + f13
6
(F 5)
f1 + f26
(F 6)
2f6 + f16
6
6
6
(F 7)
2f3 f13 2f46 + f14
6
6
6
6
(F 8) 2f3 + 2f4 f14 + f24
(F 9)
f16 + f26 f36 + f46
(F 10)
2f6 + f16 f26 + f36

0 (L10)
0 (L2)
0 (L6)
0 (L1)
0 (L5)
0 (L8)
0 (L9)
0 (L3)
0 (L7)
0 (L4)

Equivalent forms of reducible or non-evident inequalities:

(F 2)
(F 3)
(F 4)
(F 5)

: (f14 f24 )f2 = 14 f1 (f13 2f3 )f1 f1 0.

: (f13 f3 )f3 0.
6 + f 6 ) = 1 f 1 f 1 (2f 4 f 4 ) = 1 f 1 f 1 (f 3 2f 3 )f 1 0.
: 12 (2f12
123
1

2
4 1
1
6
: 2 (f12 2f16 ) = 12 f1 (f15 2f5 ).

6 + f 6 f 6 = 1 (4f 6 2f 6 + f 6
6
(F 7) : 2f36 f23
24
34
3
23
234 2f34 ) =
2
= 12 (f13 2f3 )(f13 2f3 ) 0.
6 2f 6 = f 3 (f 3 2f 3 ) 0.
(F 8) : f34
3
1

(F 9) : f56 2f6 0.
6 2f 6 ) = 1 (f 5 2f 5 )f 1 0.
(F 10) : f46 f56 = 12 (f45
5

2 4

Rank 7:

(F 1)
f7
7
7
(F 2)
2f25 + f135
7 + f7
(F 3)
f14
24
7
(F 4)
2f37 + f13
7
7
(F 5)
2f2 + f13
(F 6)
f17 + f27
(F 7)
2f7 + f17
(F 8)
2f7 + f37
(F 9)
2f7 + f47
7
7
7
(F 10)
2f3 f13 2f47 + f14
7 2f 7 + f 7
(F 11)
4f47 2f14
35
135
7
7 f7 + f7
(F 12)
f14 f24
15
25
7 f7 + f7
(F 13)
2f57 + f15
25
35
7 f7 + f7
(F 14)
2f47 + f15
25
35
7 + f7
(F 15)
2f37 + 2f47 f14
24
7
(F 16)
2f27 + 2f37 2f57 + f25
7 f7 + f7
(F 17)
2f27 + f13
14
15
7
7
(F 18)
2f2 + 2f47 2f57 + f25
(F 19)
f17 + f27 f37 + f47
7
7
7 2f 7 + f 7
(F 20)
2f3 + f13 + 2f47 f14
5
15
7
7
7
7 2f 7 + f 7
(F 21)
2f1 + f13 + 2f4 f14
5
15
(F 22)
2f7 + f17 f27 + f37 f47 + f57
7 + 4f 7 f 7 2f 7 + f 7
(F 23) 2f17 2f37 + f13
4
14
5
15

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

1
3
2 (f2

2f3 )(f13 2f3 )

(L23)
(L1)
(L5)
(L10)
(L3)
(L9)
(L13)
(L15)
(L14)
(L16)
(L17)
(L18)
(L4)
(L7)
(L2)
(L22)
(L6)
(L21)
(L8)
(L11)
(L20)
(L12)
(L19)

Equivalent forms of reducible or non-evident inequalities:

(F 2)
(F 3)
(F 4)
(F 5)
(F 6)
(F 10)
(F 11)
(F 12)
(F 13)
(F 14)
(F 15)
(F 17)
(F 19)
(F 20)
(F 21)
(F 22)
(F 23)

5 )f 2 = 1 f 1 f 1 (f 3 2f 3 )f 1 f 1 0.
: (2f25 + f13

4 1
: (f24 f14 )f3 = 12 f1 (f13 2f3 )f3 0.
: (f13 2f3 )f4 0.
7 + f 7 ) = 1 f 1 f 1 (f 5 2f 5 ) 0.
: 12 (2f12
123

2 1
1
7 + f 7 ) = 1 f 1 (f 6 2f 6 ) 0.
(2f
1
12
1

2
2
1
7 + f 7 f 7 = 1 (4f 7 2f 7 + f 7
7
3
3
4
4
: 2f37 f23
24
34
3
23
234 2f34 ) = 2 (f1 2f )(f1 2f )
2
= 14 (f13 2f3 )(f13 2f3 )f1 0.
1
7 +2f 7 2f 7 +f 7 = 1 (2f 7 +4f 7 2f 7 +f 7
3
3 1 3
3
: 2f24
34
35
135
134
34
345
1345 ) = 2 (f1 2f )f (f1 2f ) 0.
2
1
7 + f 7 f 7 = 1 (4f 7 2f 7 + f 7
7
4
4
3
3
: 2f47 f34
35
45
4
34
345 2f45 ) = 2 (f3 2f )(f1 2f )
2
= 12 (f24 f14 )(f13 2f3 ) = 14 f1 (f23 2f3 )(f13 2f3 ) = 14 f1 (f13 2f3 )(f13 2f3 ) 0.
7 2f 7 = 1 (f 5 2f 5 )f 1 f 1 0.
: f45
5

2 4
7 2f 7 = f 4 (f 3 2f 3 ) 0.
: f45
4
1

7 2f 7 = f 3 (f 4 2f 4 ) = 1 f 3 (f 3 2f 3 )f 1 0.
: f34
3
1

2 1
7 2f 7 = f 1 (f 6 2f 6 ) 0.
: f16
1
5

7 2f 7 ) = 1 (f 6 2f 6 )f 1 0.
: f57 f67 = 12 (f56
6

2 5
7 2f 7 = (f 6 2f 6 )f 1 0.
: f16
6
1

7 2f 7 2f 7 + 2f 7 0.
: f16
1
6
3
: f67 2f7 0.
7 2f 7 2f 7 + 2f 7 0.
: f16
1
6
4

Inequalities in the L-basis

Note: Since fSn+1 = 2|S|


T [1,n]\S

n+1
Ln+1
T , and here we need to consider only the nonzero LT s, it is

easy to convert an f -formula into an L-formula. The other way may be more dicult. The labels
(F i) refer to the numbering in the sparse f basis which is given in section 3. Boldfaced inequalities
cannot be written as convolutions of lower-rank inequalities.
Rank 1:
(L1) L1 0 (F 1)
Rank 2:
(L1) L2 0 (F 1)

Rank 3:

Rank 4:

Rank 5:

(L1)
L312 0 (F 2)
3
(L2) L L312 0 (F 1)
(L1)
L412 = L312 L1 0 (F 3)
(L2)
L423 = L1 L312 0 (F 2)
4
(L3) L L412 L423 0 (F 1)
(L1)
L534 0
(L2)
L523 0
(L3)
L512 0
5
5
(L4)
L34 + L1234 0
(L5)
L512 + L51234 0
5
5
5
(L6) L L12 L23 L534 L51234 0

(F 3)
(F 4)
(F 2)
(F 6)
(F 5)
(F 1)

Rank 6:
(L1)
L634 0 (F 4)
(L2)
L623 0 (F 2)
6
6
(L3)
L45 + L1245 0 (F 8)
(L4)
L634 + L61234 0 (F 10)
(L5)
L623 + L62345 0 (F 5)
(L6)
L612 + L61245 0 (F 3)
6
6
(L7)
L45 + L1245 + L62345 0 (F 9)
(L8)
L612 + L61234 + L61245 0 (F 6)
(L9)
L61245 0 (F 7)
(L10) L6 L612 L623 L634 L61234 L645 L61245 L62345 0 (F 10)

Rank 7:

(L1)
(L2)
(L3)
(L4)
(L5)
(L6)
(L7)
(L8)
(L9)
(L10)
(L11)
(L12)
(L13)
(L14)
(L15)
(L16)
(L17)
(L18)
(L19)
(L20)
(L21)
(L22)
(L23)

L734
7
7
L45 + L1245
L734 + L73456
L734 + L71234
L723 + L72356
L756 + L72356 + L73456
L756 + L71256 + L72356
L745 + L71245 + L72345
L723 + L72345 + L72356
L712 + L71245 + L71256
L712 + L71234 + L71245
7
7
7
L56 + L1256 + L2356 + L73456 + L7123456
L712 + L71234 + L71245 + L71256 + L7123456
L734 + L71234 + L745 + L71245 + L72345 + L73456 + L7123456
L723 + L734 + L71234 + L72345 + L72356 + L73456 + L7123456
L71245
L71256
L72356
L734 + L71234 + L745 + L71245 + L72345 L71256 + L73456
L723 + L734 + L71234 + L72345 L71256 + L72356 + L73456
L734 + L71234 + L745 L71256 L72356 + L73456
L723 + L734 + L71234 L71245 L71256 + L73456
L7 L712 L723 L734 L71234 L745
L71245 L72345 L756 L71256 L72356 L73456 L7123456

0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0
0

(F 2)
(F 15)
(F 5)
(F 13)
(F 3)
(F 17)
(F 14)
(F 19)
(F 6)
(F 4)
(F 20)
(F 22)
(F 7)
(F 9)
(F 8)
(F 10)
(F 11)
(F 12)
(F 23)
(F 21)
(F 18)
(F 16)
(F 1)