Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > math > arXiv:2503.00277

Help | Advanced Search

Mathematics > Combinatorics

arXiv:2503.00277 (math)
[Submitted on 1 Mar 2025 ]

Title: On the lattice formulation of the union-closed sets conjecture

Title: 关于闭包集合猜想的格点表述

Authors:Christopher Bouchard
Abstract: The union-closed sets conjecture, also known as Frankl's conjecture, is a well-studied problem with various formulations. In terms of lattices, the conjecture states that every finite lattice $L$ with more than one element contains a join-irreducible element that is less than or equal to at most half of the elements in $L$. In this work, we obtain several necessary conditions for any counterexample $\tilde{L}$ of minimum size.
Abstract: 集合闭包猜想,也称为弗兰克尔猜想,是一个被广泛研究的问题,具有多种表述形式。 在格论方面,该猜想指出,每个包含多于一个元素的有限格 $L$ 都包含一个_join-不可约元,它小于或等于格 $L$ 中不超过一半的元素。 在本工作中,我们得到了最小反例 $\tilde{L}$ 的若干必要条件。
Subjects: Combinatorics (math.CO)
Cite as: arXiv:2503.00277 [math.CO]
  (or arXiv:2503.00277v1 [math.CO] for this version)
  https://doi.org/10.48550/arXiv.2503.00277
arXiv-issued DOI via DataCite

Submission history

From: Christopher Bouchard [view email]
[v1] Sat, 1 Mar 2025 01:10:13 UTC (10 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
  • Other Formats
view license
Current browse context:
math.CO
< prev   |   next >
new | recent | 2025-03
Change to browse by:
math

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号