Submitted:
19 July 2023
Posted:
19 July 2023
Read the latest preprint version here
Abstract
Keywords:
1. Introduction
2. Problem Setup and Main Results
3. Other Pursuit Problems
4. Discussions
References
- E. Kasner and F. Supnick, “The Apollonian packing of circles”, Proceedings of the National Academy of Sciences USA 29(11), pp. 378–384, 1943.
- N. Ghaddar, S. Ganguly, L. Wang, and Y.-H. Kim, “A Lego-Brick Approach to Coding for Asymmetric Channels and Channels with State”, Proceedings of the International Symposium on Information Theory (ISIT), pp. 1367–1372, 2021.
- Isaac Weintraub, Eloy Garcia, and Meir E. Pachter, “Optimal guidance strategy for the defense of a non-manoeuverable target in 3-dimensions”, IET Control Theory & Applications 14(11), pp. 1531–1538, 2020.
- S. Ganguly and Y.-H. Kim, “Capacity Scaling for Cloud Radio Access Networks with Limited Orthogonal Fronthaul”, Proceedings of the International Symposium on Information Theory (ISIT), pp. 1472–1476, 2019.
- Pierre Bouguer, “Sur de nouvelles courbes auxquelles on peut donner le nom de lignes de poursuite”, Mémoires de mathématique et de physique tirés des registres de l’Académie royale des sciences, pp. 1–15, 1732.
- N. Ghaddar, S. Ganguly, L. Wang, and Y.-H. Kim, “A Lego-Brick Approach to Coding for Network Communication”, arXiv:2211.07208v3 [cs.IT], 2022.
- J. C. Barton and C. J. Eliezer, “On Pursuit Curves”, The Journal of the Australian Mathematical Society B41: Applied Mathematics (3), pp. 358–371, 2000.
- S. Ganguly and S. Pal, “Bounds on the Density of States and the Spectral Gap in CFT–2”, Phys. Rev. D 101(14):106022, pp. 1–4, May 2020.
- S. Ganguly, L. Wang, and Y.-H. Kim, “A Functional Construction of Codes for Multiple Access and Broadcast Channels”, Proceedings of the International Symposium on Information Theory (ISIT), pp. 1581–1586, 2020.
- C. Hoenselaers, “Chasing Relativistic Rabbits”, General Relativity and Gravitation (4), pp. 351–360, 1995.
- S. Ganguly and L. Wang, “Sliding-Window Gelfand–Pinsker Coding: General K-User Broadcast Channels”, Proceedings of the IEEE Information Theory Workshop (ITW), pp. 1–5, 2020.
- Richard P. Feynman, Robert B. Leighton, and Matthew Sands, The Feynman Lectures on Physics, Vol. 1 (Addison-Wesley, 1964), p. 3–10.
- S. Ganguly and Y.-H. Kim, “On the Capacity of Cloud Radio Access Networks”, Proceedings of the International Symposium on Information Theory (ISIT), pp. 2063–2067, 2017.
- I. E. Irodov, Problems in General Physics (Mir Publishers, 1988).
- S. Ganguly, S.-E. Hong, and Y.-H. Kim, “On the Capacity Regions of Cloud Radio Access Networks with Limited Orthogonal Fronthaul”, IEEE Trans. Inf. Theory 67(5), pp. 2958–2988, May 2021.
- Erwin Kreyszig, Advanced Engineering Mathematics (3rd ed.) (New York: Wiley, 1972).
- S. Ganguly, K. Sahasranand, and V. Sharma, “A New Algorithm for Distributed Nonparametric Sequential Detection”, Proceedings of the IEEE International Conference on Communications (ICC), pp. 1409–1415, 2014.
- Richard Courant, Differential and Integral Calculus, Vol. 1 (London: Blacktie & Son Limited, 1961).
- J. Ryu, S. Ganguly, Y.-H. Kim, Y.-K. Noh, and D. D. Lee, “Nearest Neighbor Density Functional Estimation based on Inverse Laplace Transform”, IEEE Trans. Inf. Theory 68(6), pp. 3511–3551, June 2022.
- Arthur Bernhart, “Curves of general pursuit”, Scripta Mathematica 24, 1959.
- S. Ganguly, K. Sahasranand, and V. Sharma, “A New Algorithm for Nonparametric Sequential Detection”, Proceedings of the National Conference on Communications (NCC), India, pp. 1–6, 2014.
- N. Ghaddar, S. Ganguly, L. Wang, and Y.-H. Kim, “A Lego-Brick Approach to Lossy Source Coding”, Proceedings of the 17th Canadian Workshop on Information Theory (CWIT), pp. 45–50, 2022.
- A. Guha and S. K. Biswas, “On Leonardo da Vinci’s cat and mouse problem”, Bulletin of the Institute of Mathematics and its Applications 30(1, 2), pp. 12–15, 1994.



Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).