Assorted inequalities for pattern occurrences
Reza Rastegar
TL;DR
This paper explores various inequalities related to pattern containment, applying fundamental probabilistic tools like FKG inequality and Shearer's lemma to establish new bounds and relationships.
Contribution
It introduces several novel inequalities in pattern containment using elementary probabilistic inequalities, expanding theoretical understanding in combinatorics.
Findings
Derived new inequalities for pattern occurrences
Applied FKG inequality and Shearer's lemma in novel contexts
Provided theoretical bounds for pattern containment
Abstract
In this note, we present several inequalities in the context of pattern containment, utilizing elementary applications of the Fortuin-Kasteleyn-Ginibre (FKG) inequality and Shearer's lemma.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Cellular Automata and Applications · Algorithms and Data Compression