2000 character limit reached
A Class of lattices and boolean functions related to a Manickam-Miklös-Singhi Conjecture
Published 10 Apr 2010 in math.CO, cs.DM, and cs.FL | (1004.1724v3)
Abstract: The aim of this paper is to build a new family of lattices related to some combinatorial extremal sum problems, in particular to a conjecture of Manickam, Mikl\"os and Singhi. We study the fundamentals properties of such lattices and of a particular class of boolean functions defined on them.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.