A distributive lattice connected with arithmetic progressions of length three

DOI10.1007/S11139-014-9623-2MaRDI QIDQ2254869zbMATH OpenOpenAlexFDO

Authors Fu Liu, Richard P. Stanley

Publication date 6 February 2015

Published in The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1312.5758

zbMATH Keywords

consistent setdistributive latticesemistandard Young tableau

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial aspects of representation theory (05E10) Distributive lattices (06D99)

Abstract: Let $mathcalT$ be a collection of 3-element subsets $S$ of $1,ldots,n$ with the property that if $i<j<k$ and $a<b<c$ are two 3-element subsets in $S$, then there exists an integer sequence $x_1<x_2<cdots<x_n$ such that $x_i,x_j,x_k$ and $x_a,x_b,x_c$ are arithmetic progressions. We determine the number of such collections $mathcalT$ and the number of them of maximum size. These results confirm two conjectures of Noam Elkies.

Recommendations

• Three notes on distributive lattices
• Distributive lattices with sufficiently many chain intervals
• Finiteness and infiniteness of 3-generated lattices with distributive elements among generators
• Distributive lattices of numberings
• On the distributivity of a lattice of lattice-congruences
• scientific article; zbMATH DE number 3924848
• On the number of distributive lattices
• On the structure of sets with few three-term arithmetic progressions
• Arithmetic progressions of length three in subsets of a random set

Cited in

(1)

• scientific article; zbMATH DE number 1193655 (Why is no real title available?)

This page was built for publication: A distributive lattice connected with arithmetic progressions of length three

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2254869)