4 citations · 4 across the 5 of their papers we have counts for
6 papers
On the number of antichains in
Matthew Jenssen, Jinyoung Park, Michail Sarantis
We provide precise asymptotics for the number of antichains in the poset , answering a question of Sapozhenko. Finding improved estimates for this number was also a pr…
A polynomial improvement for the odd cycle-complete Ramsey numbers
Marcelo Campos, Matthew Jenssen, Marcus Michelen +2
We give a polynomial improvement to the cycle-complete Ramsey numbers \[ r(C_{\ell},K_k) \geq k^{1+1/(\ell- 2) + \varepsilon_{\ell} + o(1)}, \] for all fixed odd with $k…
A new lower bound for the Ramsey numbers
Marcelo Campos, Matthew Jenssen, Marcus Michelen +1
We prove a new lower bound for the off-diagonal Ramsey numbers, \[ R(3,k) \geq \bigg( \frac{1}{3}+ o(1) \bigg) \frac{k^2}{\log k }\, , \] thereby narrowing the gap between the uppe…
On Dedekind's problem, a sparse version of Sperner's theorem, and antichains of a given size in the Boolean lattice
Matthew Jenssen, Alexandru Malekshahian, Jinyoung Park
Dedekind's problem, dating back to 1897, asks for the total number of antichains contained in the Boolean lattice on elements. We study Dedekind's problem using a…
A refined graph container lemma and applications to the hard-core model on bipartite expanders
Matthew Jenssen, Alexandru Malekshahian, Jinyoung Park
We establish a refined version of a graph container lemma due to Galvin and discuss several applications related to the hard-core model on bipartite expander graphs. Given a graph…
A new lower bound for sphere packing
Marcelo Campos, Matthew Jenssen, Marcus Michelen +1
We show there exists a packing of identical spheres in with density at least \[ (1-o(1))\frac{d \log d}{2^{d+1}}\, , \] as . This improves upon previous…