betaFeedback

WorksComputer Science

Boxicity of Power Graphs of Finite Nilpotent Groups

Abstract

The boxicity of an undirected graph ΓΓ, denoted as box⁡(Γ)\operatorname{box}(Γ), is the smallest non-negative integer dd such that ΓΓ can be represented as the intersection graph of axis-parallel rectangular boxes in Rd\mathbb{R}^d. The power graph of a group GG, denoted as Pow⁡(G)\operatorname{Pow}(G), is an undirected graph whose vertex set is the group itself, with two elements being adjacent if one is a power of the other. We determine the exact boxicity of power graphs of finite nilpotent groups. For a cyclic group of order n=∏i=1rpiei>1n=\prod_{i=1}^{r}p_i^{e_i}>1, where the pip_i are distinct primes, we prove that its power graph has boxicity ∑i=1rei−max⁡iei\sum_{i=1}^{r}e_i-\max_i e_i. For a finite nilpotent group GG, let the number of noncyclic odd Sylow subgroups be denoted by t(G)t(G). If GG has odd order or if GG has a cyclic Sylow 22-subgroup, then box⁡(Pow⁡(G))=box⁡(Pow⁡(Zexp⁡(G)))+t(G)\operatorname{box}(\operatorname{Pow}(G))=\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_{\operatorname{exp}(G)}))+t(G), where exp⁡(G)\operatorname{exp}(G) denotes the exponent of a group GG. When the Sylow 22-subgroup is noncyclic, and the odd part is nontrivial, the boxicity equals this value or one more, and we characterise precisely when each of these values is attained. The boxicity of power graphs of arbitrary finite groups and the exact boxicity of the comparability graph of the Boolean lattice were posed as open questions in Discrete Mathematics, 349(7):115017, 2026. As a consequence of our results, we answer the latter question completely and the former question partially, by computing the exact boxicity of the power graphs of nilpotent groups.

Introduction

All graphs in this paper are finite, simple and undirected. A dd-dimensional box representation of a graph is a function ff that maps the vertices of the graph to axis-parallel boxes in Rd\mathbb{R}^{d}, such that two distinct vertices uu and vv in the graph are adjacent if and only if f(u)∩f(v)≠∅f(u)\cap f(v)\ne\varnothing.

Definition 1.1. The boxicity of a graph Γ\Gamma, denoted as box⁡(Γ)\operatorname{box}(\Gamma), is the minimum d≥0d\ge0 such that there is a dd-dimensional box representation of $\Gamma.

By convention, we assume that a complete graph has boxicity 0. Note that interval graphs are precisely the graphs that have boxicity at most 1.

The notion of boxicity was introduced by Roberts [34], who showed that any graph on nn vertices has a ⌊n/2⌋\lfloor n/2\rfloor-dimensional box representation. Boxicity has found applications in areas such as ecology [35] and operations research [33].

The boxicity of several important graph classes has been studied. It is known that boxicity can be arbitrarily large even for restrictive classes like chordal bipartite graphs [18], split graphs [23], line graphs [4, 20] and strongly chordal graphs [19]. On the other hand, it is known that planar graphs and strictly chordal graphs have boxicity at most 3 [19, 44] and that planar bipartite graphs and outerplanar graphs have boxicity at most 2 [27, 38]. The boxicity of asteroidal triple-free graphs, circular arc graphs, Kneser graphs and the complement of line graphs has also been studied [7, 8, 10, 12]. For more on the boxicity of graphs, the reader may refer to [21].

Adiga, Bhowmick, and Chandran [3] have examined the relationship between poset dimension, an order-theoretic concept, and boxicity, prompting investigations into boxicity within subclasses of comparability graphs and poset dimensions in the corresponding partial orders [14, 22]. Recently, Chandran and Ghosh [15] studied the boxicity of an algebraically defined subclass of comparability graphs, called power graphs. Outside of power graphs, the only other study of the boxicity of an algebraically defined graph class has been that of zero-divisor graphs. [11, 16, 17, 28].

The power graph of a finite group GG, denoted as Pow⁡(G)\operatorname{Pow}(G), is a graph defined on the group GG such that two group elements are adjacent in Pow⁡(G)\operatorname{Pow}(G) if and only if one is the power of the other. Power graphs were introduced by Chakrabarty, Ghosh and Sen [13]. For more on power graphs, the readers may refer to [2, 29].

Chandran and Ghosh [15] studied Pow⁡(G)\operatorname{Pow}(G) when GG is a cyclic group. They showed the following.

Theorem 1.2 ([15]). Let 1≤m1≤m2≤…≤md1 \le m_1 \le m_2 \le\ldots\le m_d be positive integers and d≥2d \ge2. Let n=p1m1p2m2⋯pdmdn = p_1^{m_1}p_2^{m_2}\cdots p_d^{m_d}, where p1,p2,…,pdp_1,p_2,\ldots,p_d are pairwise distinct primes. Then

(a) box⁡(Pow⁡(Zn))≤m1+m2+⋯+md−1\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n)) \le m_1 + m_2 + \cdots+ m_{d-1}.

(b) When dd is odd, box⁡(Pow⁡(Zn))≥∑1≤j≤d−12m2j−1+md−1\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n)) \ge\sum_{1 \le j \le\frac{d-1}{2}} m_{2j-1} + m_{d-1}.

(c) When dd is even, box⁡(Pow⁡(Zn))≥∑1≤j≤d−22m2j+md−1\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n)) \ge\sum_{1 \le j \le\frac{d-2}{2}} m_{2j} + m_{d-1}.

Moreover, in [15], an open question was posed: ”What is the exact value of the boxicity of the power graph of the cyclic group?” In this paper, we address this question. Additionally, the inquiry regarding the boxicity of power graphs of arbitrary groups was raised in [15]. We provide a partial answer by determining the exact boxicity of the power graph associated with a finite nilpotent group.

Our Results

Exact boxicity of the power graph of a cyclic group

Chandran and Ghosh [15] posed the question of determining the exact boxicity of power graphs of finite cyclic groups. In this paper, we address this question by establishing a lower bound for the boxicity that matches the upper bound provided in Theorem 1.2. We prove the following:

Theorem 1.3. Let n=p1m1p2m2⋯pdmdn = p_1^{m_1}p_2^{m_2}\cdots p_d^{m_d}, where p1,p2,…,pdp_1,p_2,\ldots,p_d are pairwise distinct primes and d≥2d \ge2. Then box⁡(Pow⁡(Zn))=∑i=1dmi−max⁡i∈[d]mi\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n)) = \sum_{i=1}^{d} m_i - \max_{i \in[d]} m_i.

Exact boxicity of the power graph of a nilpotent group

Our second result is the exact boxicity of the power graph of any nilpotent group (Theorem 1.5). To state the result, we need to give a few notations and definitions. Let GG be a finite nilpotent group. It is well known that the Sylow subgroups of GG are normal and that GG can be written as a direct product of its Sylow subgroups, i.e,

G=∏p is a prime factor of ∣G∣Sp,(1)G = \prod_{\substack{p\text{ is a prime factor of }|G|}} S_p, \tag*{(1)}

where SpS_p is the Sylow pp-subgroup of GG.

Let s(G)={p:Sp is noncyclic}s(G)=\{p:S_p\text{ is noncyclic}\} and t(G)={p odd:Sp is noncyclic}t(G)=\{p\text{ odd}:S_p\text{ is noncyclic}\}. Note that, when ∣G∣|G| is odd, we have t(G)=s(G)t(G)=s(G).

For a finite group HH, we define the function exp⁡(H)\operatorname{exp}(H) to be the exponent of HH, i.e., the smallest positive integer kk such that hk=eh^k=e, for every h∈Hh\in H. We write C(H)C(H) to denote the poset of cyclic subgroups of a finite group HH, ordered by inclusion. If HH is a pp-group, then the cover graph of C(H)C(H) is a rooted tree whose root is the trivial subgroup. We prove this later in Lemma 5.2. We need the following definition to state our results.

Definition 1.4. Let TT be a finite rooted tree poset (see Definition 2.1). For u∈Tu\in T, let depth⁡(u)\operatorname{depth}(u) be the distance of uu from the root in the cover graph of TT. For k≥2k\ge2, define hk(T)=max⁡{depth⁡(u):u has k pairwise incomparable strict descendants in T}h_k(T)=\max\{\operatorname{depth}(u):u\text{ has }k\text{ pairwise incomparable strict descendants in }T\}. The maximum of the empty set is −∞-\infty. For a pp-group HH, we write hk(H)=hk(C(H))h_k(H)=h_k(C(H)).

The descendants in this definition need not cover uu. The following theorem is our second main result.

Theorem 1.5. Let GG be a finite nilpotent group as expressed in Equation (1). Let n=exp⁡(G)n=\operatorname{exp}(G).

(i) If S2S_2 is absent or cyclic, then box⁡(Pow⁡(G))=box⁡(Pow⁡(Zn))+t(G)\operatorname{box}(\operatorname{Pow}(G))=\operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n))+t(G).

(ii) Suppose S2S_2 is noncyclic and the odd part of GG is nontrivial. Let exp⁡(Sp)=pep\operatorname{exp}(S_p)=p^{e_p}, a=e2a=e_2, m=max⁡p≠2epm=\max_{p\ne2}e_p, q=min⁡{a,m}q=\min\{a,m\}. Then

box⁡(Pow⁡(G))={box⁡(Pow⁡(Zn))+t(G)+1,h3(S2)≥q−1,box⁡(Pow⁡(Zn))+t(G),h3(S2)≤q−2.\operatorname{box}(\operatorname{Pow}(G))= \begin{cases} \operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n))+t(G)+1, & h_3(S_2)\ge q-1,\\ \operatorname{box}(\operatorname{Pow}(\mathbb{Z}_n))+t(G), & h_3(S_2)\le q-2. \end{cases}

(iii) If G=SpG=S_p is a noncyclic pp-group, then box⁡(Pow⁡(G))=1\operatorname{box}(\operatorname{Pow}(G))=1.

Because h3(S2)h_3(S_2) is an integer or −∞-\infty, the alternatives in Theorem 1.5 exhaust all cases.

Overview of the methods used: To achieve the results, we have combined order-theoretic, geometric, topological, and group-theoretic arguments. We first replace the power graph by the comparability graph of the poset of cyclic subgroups, preserving boxicity. For a finite nilpotent group, the Sylow subgroup decomposition expresses this poset as a product of rooted tree posets, whose heights are determined by the exponents of the Sylow subgroups of the nilpotent group. Explicit interval constructions provide upper bounds for adding chain factors and replacing chains by rooted tree posets.

For the lower bounds, we use topological concepts, in particular a combination of the Van Kampen obstruction and Tancer’s nonrepresentability theorem with the 2-Helly property of axis-parallel boxes. This yields a boxicity obstruction for comparability graphs of certain kinds of product posets. In particular, we determine the exact boxicity of the Boolean lattice and thereby settle the cyclic case. For more general products, we select layers that form an induced graph join and use the additivity of boxicity under joins. Group-theoretic arguments provide special subgroup structures in the corresponding poset of cyclic subgroups, particularly terminal ternary forks in each noncyclic odd Sylow factor.

Organisation of the paper

In Section 2, we write the necessary preliminaries on posets, groups, and boxicity. In Section 3, we establish the topological obstruction used for our lower bounds, after providing the necessary background. Section 4 develops bounds for comparability graphs of product posets and determines the exact values for mixed products of chains and stars. Further, we apply these tools to finite cyclic groups in Section 5.2 and to nilpotent groups in Section 5. Appendix A gives an alternative combinatorial proof of the Boolean-lattice result, while Appendix B contains an omitted proof.

Preliminaries

Definitions on Posets

A chain is a poset where all elements are pairwise comparable. We denote a chain of length ee as Ce={0<1<2<⋯<e}C_e = \{0 < 1 < 2 < \cdots< e\}.

Definition 2.1. A rooted tree poset is a finite poset (T,≤)(T, \le) with a unique minimum element ρ\rho, called its root, such that, for every v∈Tv \in T, the set {u∈T:u<v}\{u \in T : u < v\} is a chain. So, ρ≤v\rho\le v for all v∈Tv \in T. The depth of a node vv is defined by depth⁡(v)=∣{u∈T:u<v}∣\operatorname{depth}(v) = |\{u \in T : u < v\}|, i.e., the distance of vv from the root ρ\rho in the cover graph of TT.

The height of a rooted tree poset TT is the maximum length of the path from the root to a node, or the length of an induced longest chain in TT. For two elements u,v∈Tu, v \in T, if u≤vu \le v, then we say that uu is an ancestor of vv and vv is a descendant of uu. A strict descendant (or, ancestor) of uu is an element vv satisfying u<vu < v (or, v<uv < u). An immediate descendant of uu is an element vv satisfying u<vu < v and there is no ww such that u<w<vu < w < v. The notion of immediate ancestor of an element in the rooted tree poset TT should be clear. Maximal members (if any) of a rooted tree are called leaves, and maximal chains as induced subposets are called branches. Note that the cover graph of a rooted tree poset TT is a tree. Every non-root element in TT has a unique immediate ancestor.

We define a star poset as a rooted tree poset when the cover graph is a star. In this paper, we use SS to denote the four-element star poset consisting of a root element ρ\rho and three leaves a1,a2,a3a_1,a_2,a_3, where the relations in the poset are given by ρ<aj\rho< a_j, j=1,2,3j = 1,2,3, with the leaves pairwise incomparable.

References

  1. [1]Ghodratollah Alipour, Saieed Akbari, Peter J Cameron, Reza Nikandish, and Farzad Shaveisi. On the structure of the power graph and the enhanced power graph of a group. The Electronic Journal of Combinatorics, pages P3–16, 2017. (Cited on page 5.)
  2. [2]Jemal Abawajy, Andrei Kelarev, and Morshed Chowdhury. Power graphs: a survey. Electronic Journal of Graph Theory and Applications (EJGTA), 1(2):125–147, 2013. (Cited on page 2.)DOI
  3. [3]Abhijin Adiga, Diptendu Bhowmick, and L Sunil Chandran. Boxicity and poset dimension. SIAM Journal on Discrete Mathematics, 25(4):1687–1698, 2011. (Cited on page 2.)
  4. [4]Manu Basavaraju, L. Sunil Chandran, Martin Charles Golumbic, Rogers Mathew, and Deepak Rajendraprasad. Boxicity and separation dimension. In Dieter Kratsch and Ioan Todinca, editors, Graph-Theoretic Concepts in Computer Science, pages 81–92, Cham, 2014. Springer International Publishing. ISBN 978-3-319-12340-0. (Cited on page 2.)arxiv.org/abs/1404.4486
  5. [5]Mladen Bestvina, Michael Kapovich, and Bruce Kleiner. Van kampen’s embedding obstruction for discrete groups. Inventiones mathematicae, 150(2):219–235, 2002. (Cited on page 7.)
  6. [6]Manjul Bhargava. Groups as unions of proper subgroups. The American Mathematical Monthly, 116(5):413–422, 2009. doi: 10.1080/00029890.2009.11920955. (Cited on page 21.)DOI
  7. [7]Diptendu Bhowmick and L. Sunil Chandran. Boxicity and cubicity of asteroidal triple free graphs. Discrete mathematics, 310(10-11):1536–1543, 2010. (Cited on page 2.)arxiv.org/abs/0812.0894
  8. [8]Diptendu Bhowmick and L. Sunil Chandran. Boxicity of circular arc graphs. Graphs and Combinatorics, 27(6):769–783, 2011. (Cited on page 2.)arxiv.org/abs/0810.5524
  9. [9]Peter J. Cameron, A. Satyanarayana Reddy, and Khyati Sharma. Cyclic subgroup graph of a group, 2026. URL https://arxiv.org/abs/2409.13796v2. (Cited on page 16.)
  10. [10]Marco Caoduro and Lyuben Lichev. On the boxicity of kneser graphs and complements of line graphs. Discrete Mathematics, 346(5):113333, 2023. (Cited on page 2.)arxiv.org/abs/2105.02516
  11. [11]Marco Caoduro and Meike Neuwohner. Boxicity and threshold dimension of zero divisor graphs, 2026. URL https://arxiv.org/abs/2608.27381. (Cited on page 2.)
  12. [12]Marco Caoduro and András Sebő. Boxicity and interval-orders: Petersen and the complements of line graphs. In International Symposium on Graph Drawing and Network Visualization, pages 283–295. Springer, 2023. (Cited on page 2.)arxiv.org/abs/2309.02062
  13. [13]Ivy Chakrabarty, Shamik Ghosh, and MK Sen. Undirected power graphs of semigroups. In Semigroup forum, volume 78, pages 410–426. Springer, 2009. (Cited on page 2.)DOI
  14. [14]Parinya Chalermsook, Bundit Laekhanukit, and Danupon Nanongkai. Graph products revisited: Tight approximation hardness of induced matching, poset dimension and more. In Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, pages 1557–1576. SIAM, 2013. (Cited on page 2.)arxiv.org/abs/1212.4129
  15. [15]L Sunil Chandran and Jinia Ghosh. Boxicity and cubicity of a subclass of divisor graphs and power graphs of cyclic groups. Discrete Mathematics, 349(7):115017, 2026. (Cited on pages 2, 5, 10, 11, 16, 17, and 26.)DOI
  16. [16]L. Sunil Chandran and Suraj Kumar Sahoo. The boxicity of the compressed zero divisor graph of the ring of integers modulo N, 2026. URL https://arxiv.org/abs/2608.23539. (Cited on page 2.)
  17. [17]L. Sunil Chandran and Suraj Kumar Sahoo. Boxicity of zero divisor graphs. Discrete Applied Mathematics, 391:127–136, 2026. doi: 10.1016/j.dam.2026.04.044. (Cited on page 2.)DOI
  18. [18]L. Sunil Chandran, Mathew C Francis, and Rogers Mathew. Chordal bipartite graphs with high boxicity. Graphs and combinatorics, 27(3):353–362, 2011. (Cited on page 2.)arxiv.org/abs/0906.0541
  19. [19]L Sunil Chandran, Mathew C Francis, and Rogers Mathew. Boxicity of leaf powers. Graphs and Combinatorics, 27(1):61–72, 2011. (Cited on page 2.)
  20. [20]L. Sunil Chandran, Rogers Mathew, and Naveen Sivadasan. Boxicity of line graphs. Discrete Mathematics, 311(21):2359–2367, 2011. (Cited on page 2.)
  21. [21]L. Sunil Chandran, Mathew C Francis, and Suraj Kumar Sahoo. A survey on the boxicity and cubicity of graphs. Indian Journal of Pure and Applied Mathematics, 57(1):4–38, 2026. (Cited on pages 2 and 6.)DOI
  22. [22]Steven Chaplick, Stefan Felsner, Udo Hoffmann, and Veit Wiechert. Grid intersection graphs and order dimension. Order, 35(2):363–391, 2018. (Cited on page 2.)arxiv.org/abs/1512.02482
  23. [23]Margaret B. Cozzens and Fred S. Roberts. Computing the boxicity of a graph by covering its complement by cointerval graphs. Discrete Applied Mathematics, 6(3):217–228, 1983. (Cited on pages 2 and 27.)DOI
  24. [24]David S. Dummit and Richard M. Foote. Abstract Algebra. Wiley, 3 edition, 2004. (Cited on page 18.)
  25. [25]G Ehrlich, S Even, and R.E Tarjan. Intersection graphs of curves in the plane. Journal of Combinatorial Theory, Series B, 21(1):8–20, 1976. ISSN 0095-8956. doi: https://doi.org/10.1016/0095-8956(76)90022-8. (Cited on page 23.)
  26. [26]Martino Garonzi and Igor Lima. On the number of cyclic subgroups of a finite group. Bulletin of the Brazilian Mathematical Society, New Series, 49(3):515–530, 2018. (Cited on page 16.)DOI
  27. [27]I Ben-Arroyo Hartman, Ilan Newman, and Ran Ziv. On grid intersection graphs. Discrete Mathematics, 87(1):41–52, 1991. (Cited on page 2.)DOI
  28. [28]T. Kavaskar. Bounds for boxicity of circular clique graphs and zero-divisor graphs. Discrete Applied Mathematics, 365:260–269, 2025. doi: 10.1016/j.dam.2025.01.038. (Cited on page 2.)DOI
  29. [29]Ajay Kumar, Lavanya Selvaganesh, Peter J Cameron, and T Tamizh Chelvam. Recent developments on the power graph of finite groups–a survey. AKCE International Journal of Graphs and Combinatorics, 18(2):65–94, 2021. (Cited on page 2.)DOI
  30. [30]Yefim I. Leifman and Mikhail E. Muzychuk. Strongly regular cayley graphs over the group Z_{p^n}⊕Z_{p^n}. Discrete Mathematics, 305(1–3):219–239, 2005. doi: 10.1016/j.disc.2005.06.027. (Cited on page 16.)DOI
  31. [31]Jiří Matoušek. Using the Borsuk–Ulam theorem: lectures on topological methods in combinatorics and geometry. Springer, 2003. (Cited on page 6.)
  32. [32]Jiří Matoušek, Martin Tancer, and Uli Wagner. Hardness of embedding simplicial complexes in ℝᵈ. Journal of the European Mathematical Society, 13(2):259–295, 2011. doi: 10.4171/JEMS/252. (Cited on page 7.)DOI
  33. [33]Robert J. Opsut and Fred S. Roberts. On the fleet maintenance, mobile radio frequency, task assignment, and traffic phasing problems. The theory and applications of graphs, pages 479–492, 1981. (Cited on page 1.)
  34. [34]Fred S. Roberts. On the boxicity and cubicity of a graph. In Recent Progress in Combinatorics, pages 301–310. Academic Press, 1969. (Cited on pages 1, 5, and 6.)
  35. [35]Fred S. Roberts. Food webs, competition graphs, and the boxicity of ecological phase space. In Yousef Alavi and Don R. Lick, editors, Theory and Applications of Graphs, pages 477–490, Berlin, Heidelberg, 1978. Springer Berlin Heidelberg. ISBN 978-3-540-35912-8. (Cited on page 1.)DOI
  36. [36]Joseph J. Rotman. An introduction to the theory of groups. Springer Science & Business Media, 2012. doi: 10.1007/978-1-4612-4176-8. (Cited on page 5.)
  37. [37]Benjamin Sambale and Philipp Wellmann. On a bound of Cocke and Venkataraman. Monatshefte für Mathematik, 197:505–515, 2022. doi: 10.1007/s00605-021-01587-9. (Cited on page 20.)DOI
  38. [38]Edward R. Scheinerman. Intersection classes and multiple intersection parameters of graphs. PhD thesis, Princeton University, 1984. (Cited on page 2.)
  39. [39]Roland Schmidt. Subgroup lattices of groups. De Gruyter, Berlin, New York, 1994. doi: 10.1515/9783110868647. (Cited on page 16.)DOI
  40. [40]F. W. Sinden. Topology of thin film rc circuits. The Bell System Technical Journal, 45 (9):1639–1662, 1966. doi: 10.1002/j.1538-7305.1966.tb01713.x. (Cited on page 23.)DOI
  41. [41]Michio Suzuki. Group theory, II, volume 248 of Grundlehren der mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer-Verlag, New York, 1986. ISBN 0-387-10916-1. doi: 10.1007/978-3-642-86885-6. Translated from the Japanese. (Cited on page 18.)
  42. [42]Martin Tancer. d-representability of simplicial complexes of fixed dimension. Journal of Computational Geometry, 2(1):183–188, Nov. 2011. doi: 10.20382/v2i1a9. (Cited on page 7.)arxiv.org/abs/1107.1170
  43. [43]Marius Tărnăuceanu. On the number of edges of cyclic subgroup graphs of finite groups. Archiv der Mathematik, 120(4):349–353, 2023. doi: 10.1007/s00013-023-01846-1. (Cited on page 16.)DOI
  44. [44]Carsten Thomassen. Interval representations of planar graphs. Journal of Combinatorial Theory, Series B, 40(1):9–20, 1986. (Cited on page 2.)DOI

Paper details

vlnc:W_nnw7a2fm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 6

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents