Papers
Topics
Authors
Recent
Search
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.

Citations (23)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.