A lower bound on forcing numbers based on height functions

Fateh Aliyev; Nikita Gladkov

REVIEW

A lower bound on forcing numbers based on height functions

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

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

classification math.CO

keywords boundlowerforcingfunctionsheightnumberscasescomputable

verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved

0 comments

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.

A lower bound on forcing numbers based on height functions

discussion (0)