Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Bounds on multiple self-avoiding polygons   A self-avoiding polygon is a lattice polygon consisting of a closed
self-avoiding walk on a square lattice. Surprisingly little is known rigorously
about the enumeration of self-avoiding polygons, although there are numerous
conjectures that are believed to be true and strongly supported by numerical
simulations. As an analogous problem of this study, we consider multiple
self-avoiding polygons in a confined region, as a model for multiple ring
polymers in physics. We find rigorous lower and upper bounds of the number
$p_{m \times n}$ of distinct multiple self-avoiding polygons in the $m \times
n$ rectangular grid on the square lattice. For $m=2$, $p_{2 \times n} =
2^{n-1}-1$. And, for integers $m,n \geq 3$, $$2^{m+n-3}
\left(\frac{17}{10}\right)^{(m-2)(n-2)} \ \leq \ p_{m \times n} \ \leq \
2^{m+n-3} \left(\frac{31}{16}\right)^{(m-2)(n-2)}.$$

34
The categories of this paper are: chem-ph
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
35
The categories of this paper are: mtrl-th
33
The categories of this paper are: plasm-ph
21
The categories of this paper are: adap-org
22
The categories of this paper are: chao-dyn
11
The categories of this paper are: hep-lat
26
The categories of this paper are: bayes-an
1
The categories of this paper are: cs
19
The categories of this paper are: eess
37
The categories of this paper are: supr-con
7
The categories of this paper are: hep-th
8
The categories of this paper are: hep-ex
17
The categories of this paper are: q-fin