{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:44:20Z","timestamp":1768941860626,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"12","license":[{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T00:00:00Z","timestamp":1756166400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2025,12]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Let\n                    <jats:italic>q<\/jats:italic>\n                    be an odd power of a prime\n                    <jats:italic>p<\/jats:italic>\n                    , and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$S \\subseteq \\mathbb {F}_q^*$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>S<\/mml:mi>\n                            <mml:mo>\u2286<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>F<\/mml:mi>\n                              <mml:mi>q<\/mml:mi>\n                              <mml:mo>\u2217<\/mml:mo>\n                            <\/mml:msubsup>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    such that\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$S=-S$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>S<\/mml:mi>\n                            <mml:mo>=<\/mml:mo>\n                            <mml:mo>-<\/mml:mo>\n                            <mml:mi>S<\/mml:mi>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    and\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$S\/S \\ne \\mathbb {F}_q^*$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mi>S<\/mml:mi>\n                            <mml:mo>\/<\/mml:mo>\n                            <mml:mi>S<\/mml:mi>\n                            <mml:mo>\u2260<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>F<\/mml:mi>\n                              <mml:mi>q<\/mml:mi>\n                              <mml:mo>\u2217<\/mml:mo>\n                            <\/mml:msubsup>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    . We show that the clique number of the Cayley graph\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\operatorname {Cay}(\\mathbb {F}_q^+,S)$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:mo>Cay<\/mml:mo>\n                            <mml:mo>(<\/mml:mo>\n                            <mml:msubsup>\n                              <mml:mi>F<\/mml:mi>\n                              <mml:mi>q<\/mml:mi>\n                              <mml:mo>+<\/mml:mo>\n                            <\/mml:msubsup>\n                            <mml:mo>,<\/mml:mo>\n                            <mml:mi>S<\/mml:mi>\n                            <mml:mo>)<\/mml:mo>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    is at most\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\sqrt{|S\/S|}+\\sqrt{q\/p}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:mrow>\n                            <mml:msqrt>\n                              <mml:mrow>\n                                <mml:mo>|<\/mml:mo>\n                                <mml:mi>S<\/mml:mi>\n                                <mml:mo>\/<\/mml:mo>\n                                <mml:mi>S<\/mml:mi>\n                                <mml:mo>|<\/mml:mo>\n                              <\/mml:mrow>\n                            <\/mml:msqrt>\n                            <mml:mo>+<\/mml:mo>\n                            <mml:msqrt>\n                              <mml:mrow>\n                                <mml:mi>q<\/mml:mi>\n                                <mml:mo>\/<\/mml:mo>\n                                <mml:mi>p<\/mml:mi>\n                              <\/mml:mrow>\n                            <\/mml:msqrt>\n                          <\/mml:mrow>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , improving the best-known\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:tex-math>$$\\sqrt{q}$$<\/jats:tex-math>\n                        <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                          <mml:msqrt>\n                            <mml:mi>q<\/mml:mi>\n                          <\/mml:msqrt>\n                        <\/mml:math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    upper bound for many families of such graphs substantially. Such a new bound is strongest for cyclotomic graphs and in particular, it implies the first nontrivial upper bound on the clique number of all generalized Paley graphs of non-square order, extending the work of Hanson and Petridis. Moreover, our new bound is asymptotically sharp for an infinite family of generalized Paley graphs, and we further discover the first nontrivial family among them for which the clique number can be exactly determined. We also obtain a new lower bound on the number of directions determined by a large Cartesian product in the affine Galois plane\n                    <jats:italic>AG<\/jats:italic>\n                    (2,\u00a0\n                    <jats:italic>q<\/jats:italic>\n                    ), which is sharp for infinite families.\n                  <\/jats:p>","DOI":"10.1007\/s10623-025-01721-w","type":"journal-article","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T09:59:36Z","timestamp":1756202376000},"page":"5131-5142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exact values and improved bounds on the clique number of cyclotomic graphs"],"prefix":"10.1007","volume":"93","author":[{"given":"Chi Hoi","family":"Yip","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,26]]},"reference":[{"issue":"105667","key":"1721_CR1","first-page":"23","volume":"192","author":"S Asgarli","year":"2022","unstructured":"Asgarli S., Yip C.H.: Van Lint-MacWilliams\u2019 conjecture and maximum cliques in Cayley graphs over finite fields. J. Comb. Theory Ser. A 192(105667), 23 (2022).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"1","key":"1721_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1080\/16073606.1988.9631945","volume":"11","author":"I Broere","year":"1988","unstructured":"Broere I., D\u00f6man D., Ridley J.N.: The clique numbers and chromatic numbers of certain Paley graphs. Quaest. Math. 11(1), 91\u201393 (1988).","journal-title":"Quaest. Math."},{"issue":"1","key":"1721_CR3","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1023\/A:1018620002339","volume":"10","author":"AE Brouwer","year":"1999","unstructured":"Brouwer A.E., Wilson R.M., Xiang Q.: Cyclotomy and strongly regular graphs. J. Algebraic Comb. 10(1), 25\u201328 (1999).","journal-title":"J. Algebraic Comb."},{"key":"1721_CR4","doi-asserted-by":"crossref","unstructured":"Croot E.S. III, Lev V.F.: Open problems in additive combinatorics. In: Additive Combinatorics, Volume 43 of CRM Proceedings and Lecture Notes, pp. 207\u2013233. American Mathematical Society, Providence, RI (2007).","DOI":"10.1090\/crmp\/043\/10"},{"issue":"6","key":"1721_CR5","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s00493-020-4516-z","volume":"41","author":"D Di Benedetto","year":"2021","unstructured":"Di Benedetto D., Solymosi J., White E.P.: On the directions determined by a cartesian product in an affine Galois plane. Combinatorica 41(6), 755\u2013763 (2021).","journal-title":"Combinatorica"},{"issue":"4","key":"1721_CR6","doi-asserted-by":"publisher","first-page":"1415","DOI":"10.1007\/s00454-021-00284-6","volume":"66","author":"D Dona","year":"2021","unstructured":"Dona D.: Number of directions determined by a set in $${\\mathbb{F} }_q^2$$ and growth in $${\\rm Aff}({\\mathbb{F} }_q)$$. Discret. Comput. Geom. 66(4), 1415\u20131428 (2021).","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"1721_CR7","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/jnth.1998.2235","volume":"71","author":"S Eliahou","year":"1998","unstructured":"Eliahou S., Kervaire M.: Sumsets in vector spaces over finite fields. J. Number Theory 71(1), 12\u201339 (1998).","journal-title":"J. Number Theory"},{"issue":"4","key":"1721_CR8","doi-asserted-by":"publisher","first-page":"982","DOI":"10.1016\/j.jctb.2011.10.006","volume":"102","author":"T Feng","year":"2012","unstructured":"Feng T., Xiang Q.: Strongly regular graphs from unions of cyclotomic classes. J. Comb. Theory Ser. B 102(4), 982\u2013995 (2012).","journal-title":"J. Comb. Theory Ser. B"},{"issue":"3","key":"1721_CR9","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1112\/plms.12322","volume":"122","author":"B Hanson","year":"2021","unstructured":"Hanson B., Petridis G.: Refined estimates concerning sumsets contained in the roots of unity. Proc. Lond. Math. Soc. (3) 122(3), 353\u2013358 (2021).","journal-title":"Proc. Lond. Math. Soc. (3)"},{"issue":"2","key":"1721_CR10","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1112\/mtk.12138","volume":"68","author":"G Martin","year":"2022","unstructured":"Martin G., White E.P., Yip C.H.: Asymptotics for the number of directions determined by $$[n]\\times [n]$$ in $${\\mathbb{F} }^2_p$$. Mathematika 68(2), 511\u2013534 (2022).","journal-title":"Mathematika"},{"issue":"3","key":"1721_CR11","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1112\/S0025579319000044","volume":"65","author":"B Murphy","year":"2019","unstructured":"Murphy B., Petridis G., Roche-Newton O., Rudnev M., Shkredov I.D.: New results on sum-product type growth over fields. Mathematika 65(3), 588\u2013642 (2019).","journal-title":"Mathematika"},{"key":"1721_CR12","unstructured":"R\u00e9dei L.: Lacunary Polynomials Over Finite Fields. North-Holland Publishing Co., Amsterdam-London; American Elsevier Publishing Co., Inc., New York, Translated from the German by I. F\u00f6ldes (1973)."},{"key":"1721_CR13","doi-asserted-by":"publisher","first-page":"185","DOI":"10.4064\/aa-4-3-185-208","volume":"4","author":"A Schinzel","year":"1958","unstructured":"Schinzel A., Sierpi\u0144ski W.: Sur certaines hypoth\u00e8ses concernant les nombres premiers. Acta Arith. 4, 185\u2013208 (1958) Erratum 5 (1958), 259.","journal-title":"Acta Arith."},{"issue":"3","key":"1721_CR14","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1512\/iumj.2022.71.8972","volume":"71","author":"T Schoen","year":"2022","unstructured":"Schoen T., Shkredov I.D.: Character sums estimates and an application to a problem of Balog. Indiana Univ. Math. J. 71(3), 953\u2013964 (2022).","journal-title":"Indiana Univ. Math. J."},{"key":"1721_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1134\/S0081543821040179","volume":"314","author":"J Solymosi","year":"2021","unstructured":"Solymosi J.: On the Thue-Vinogradov lemma. Proc. Steklov Inst. Math. 314, 325\u2013331 (2021).","journal-title":"Proc. Steklov Inst. Math."},{"key":"1721_CR16","first-page":"1171","volume":"33","author":"SA Stepanov","year":"1969","unstructured":"Stepanov S.A.: On the number of points of a hyperelliptic curve over a finite prime field. Izv. Akad. Nauk SSSR Ser. Mat. 33, 1171\u20131181 (1969).","journal-title":"Izv. Akad. Nauk SSSR Ser. Mat."},{"issue":"1","key":"1721_CR17","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1006\/jcta.1996.0042","volume":"74","author":"T Sz\u0151nyi","year":"1996","unstructured":"Sz\u0151nyi T.: On the number of directions determined by a set of points in an affine Galois plane. J. Comb. Theory Ser. A 74(1), 141\u2013146 (1996).","journal-title":"J. Comb. Theory Ser. A"},{"issue":"209","key":"1721_CR18","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/S0012-365X(99)00097-7","volume":"208","author":"T Sz\u0151nyi","year":"1999","unstructured":"Sz\u0151nyi T.: Around R\u00e9dei\u2019s theorem. Discret. Math. 208(209), 557\u2013575 (1999).","journal-title":"Discret. Math."},{"issue":"A51","key":"1721_CR19","first-page":"31","volume":"21","author":"CH Yip","year":"2021","unstructured":"Yip C.H.: On the directions determined by cartesian products and the clique number of generalized Paley graphs. Integers 21(A51), 31 (2021).","journal-title":"Integers"},{"issue":"1","key":"1721_CR20","doi-asserted-by":"publisher","first-page":"119","DOI":"10.7169\/facm\/1981","volume":"66","author":"CH Yip","year":"2022","unstructured":"Yip C.H.: Gauss sums and the maximum cliques in generalized Paley graphs of square order. Funct. Approx. Comment. Math. 66(1), 119\u2013128 (2022).","journal-title":"Funct. Approx. Comment. Math."},{"issue":"2","key":"1721_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10801-021-01113-y","volume":"56","author":"CH Yip","year":"2022","unstructured":"Yip C.H.: On maximal cliques of Cayley graphs over fields. J. Algebraic Comb. 56(2), 323\u2013333 (2022).","journal-title":"J. Algebraic Comb."},{"key":"1721_CR22","doi-asserted-by":"publisher","first-page":"101930","DOI":"10.1016\/j.ffa.2021.101930","volume":"77","author":"CH Yip","year":"2022","unstructured":"Yip C.H.: On the clique number of Paley graphs of prime power order. Finite Fields Appl. 77, 101930 (2022).","journal-title":"Finite Fields Appl."},{"issue":"4","key":"1721_CR23","doi-asserted-by":"publisher","first-page":"901","DOI":"10.5802\/alco.291","volume":"6","author":"CH Yip","year":"2023","unstructured":"Yip C.H.: Maximality of subfields as cliques in Cayley graphs over finite fields. Algebraic Comb. 6(4), 901\u2013905 (2023).","journal-title":"Algebraic Comb."},{"key":"1721_CR24","unstructured":"Yip C.H.: Van Lint-MacWilliams\u2019 conjecture and maximum cliques in Cayley graphs over finite fields, II. arXiv:2505.04061 (2025)."}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01721-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10623-025-01721-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-025-01721-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T15:18:17Z","timestamp":1763997497000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10623-025-01721-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,26]]},"references-count":24,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2025,12]]}},"alternative-id":["1721"],"URL":"https:\/\/doi.org\/10.1007\/s10623-025-01721-w","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"value":"0925-1022","type":"print"},{"value":"1573-7586","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,26]]},"assertion":[{"value":"17 March 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2025","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 August 2025","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 August 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}