Proof Orders for Decreasing Diagrams

We present and compare some well-founded proof orders for decreasing diagrams. These proof orders order a conversion above another conversion if the latter is obtained by filling any peak in the former by a (locally) decreasing diagram. Therefore each such proof order entails the decreasing diagrams technique for proving confluence. The proof orders differ with respect to monotonicity and complexity. Our results are developed in the setting of involutive monoids. We extend these results to obtain a decreasing diagrams technique for confluence modulo

Confluence by Decreasing Diagrams -- Formalized

This paper presents a formalization of decreasing diagrams in the theorem prover Isabelle. It discusses mechanical proofs showing that any locally decreasing abstract rewrite system is confluent. The valley and the conversion version of decreasing diagrams are considered.Comment: 17 pages; valley and conversion version; RTA 201

Termination orders for 3-dimensional rewriting

This paper studies 3-polygraphs as a framework for rewriting on two-dimensional words. A translation of term rewriting systems into 3-polygraphs with explicit resource management is given, and the respective computational properties of each system are studied. Finally, a convergent 3-polygraph for the (commutative) theory of Z/2Z-vector spaces is given. In order to prove these results, it is explained how to craft a class of termination orders for 3-polygraphs.Comment: 30 pages, 35 figure

Poset structures in Boij-S\"oderberg theory

Boij-S\"oderberg theory is the study of two cones: the cone of cohomology tables of coherent sheaves over projective space and the cone of standard graded minimal free resolutions over a polynomial ring. Each cone has a simplicial fan structure induced by a partial order on its extremal rays. We provide a new interpretation of these partial orders in terms of the existence of nonzero homomorphisms, for both the general and the equivariant constructions. These results provide new insights into the families of sheaves and modules at the heart of Boij-S\"oderberg theory: supernatural sheaves and Cohen-Macaulay modules with pure resolutions. In addition, our results strongly suggest the naturality of these partial orders, and they provide tools for extending Boij-S\"oderberg theory to other graded rings and projective varieties.Comment: 23 pages; v2: Added Section 8, reordered previous section

Counting (3+1) - Avoiding permutations

A poset is {\it (\3+\1)-free} if it contains no induced subposet isomorphic to the disjoint union of a 3-element chain and a 1-element chain. These posets are of interest because of their connection with interval orders and their appearance in the (\3+\1)-free Conjecture of Stanley and Stembridge. The dimension 2 posets $P$ are exactly the ones which have an associated permutation $\pi$ where $i\prec j$ in $P$ if and only if $i<j$ as integers and $i$ comes before $j$ in the one-line notation of $\pi$. So we say that a permutation $\pi$ is {\it (\3+\1)-free} or {\it (\3+\1)-avoiding} if its poset is (\3+\1)-free. This is equivalent to $\pi$ avoiding the permutations 2341 and 4123 in the language of pattern avoidance. We give a complete structural characterization of such permutations. This permits us to find their generating function.Comment: 17 page