The reviewed record of science sign in
Pith

arxiv: 2410.23621 · v1 · pith:Z3DCU5YC · submitted 2024-10-31 · math.CO

A lower bound on forcing numbers based on height functions

Fateh Aliyev , Nikita Gladkov This is my paper

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:Z3DCU5YCrecord.jsonopen to challenge →

classification math.CO
keywords boundlowerforcingfunctionsheightnumberscasescomputable
0
0 comments X
read the original abstract

We establish a lower bound on the forcing numbers of domino tilings computable in polynomial time based on height functions. This lower bound is sharp for a 2n by 2n square as well as other cases.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.