Pith. sign in

REVIEW 1 cited by

On boundedness of zeros of the independence polynomial of tori

Not yet reviewed by Pith; the record is open.

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 2306.12934 v3 pith:EDDPMO4F submitted 2023-06-22 math.CO cs.DSmath-phmath.MP

classification math.COcs.DSmath-phmath.MP
keywords torizerosindependencepolynomialrelationshipsequencessidebalanced
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We study boundedness of zeros of the independence polynomial of tori for sequences of tori converging to the integer lattice. We prove that zeros are bounded for sequences of balanced tori, but unbounded for sequences of highly unbalanced tori. Here balanced means that the size of the torus is at most exponential in the shortest side length, while highly unbalanced means that the longest side length of the torus is super exponential in the product over the other side lengths cubed. We discuss implications of our results to the existence of efficient algorithms for approximating the independence polynomial on tori. This project was partially inspired by the relationship between zeros of partition functions and holomorphic dynamics, a relationship that in the last two decades played a prominent role in the field. Besides presenting new results, we survey this relationship and its recent consequences.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. The independence polynomial on recursive sequences of graphs

    math.DS 2024-11 conditional novelty 6.0 of 10

    For stable and expanding recursive graph constructions with a maximally independent starting graph, all zeros of the independence polynomials are uniformly bounded, via a superattracting invariant manifold in an assoc...

Pith tools