{"title":"Most plane curves over finite fields are not blocking","authors":"Shamil Asgarli , Dragos Ghioca , Chi Hoi Yip","doi":"10.1016/j.jcta.2024.105871","DOIUrl":null,"url":null,"abstract":"<div><p>A plane curve <span><math><mi>C</mi><mo>⊂</mo><msup><mrow><mi>P</mi></mrow><mrow><mn>2</mn></mrow></msup></math></span> of degree <em>d</em> is called <em>blocking</em> if every <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-line in the plane meets <em>C</em> at some <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-point. We prove that the proportion of blocking curves among those of degree <em>d</em> is <span><math><mi>o</mi><mo>(</mo><mn>1</mn><mo>)</mo></math></span> when <span><math><mi>d</mi><mo>≥</mo><mn>2</mn><mi>q</mi><mo>−</mo><mn>1</mn></math></span> and <span><math><mi>q</mi><mo>→</mo><mo>∞</mo></math></span>. We also show that the same conclusion holds for smooth curves under the somewhat weaker condition <span><math><mi>d</mi><mo>≥</mo><mn>3</mn><mi>p</mi></math></span> and <span><math><mi>d</mi><mo>,</mo><mi>q</mi><mo>→</mo><mo>∞</mo></math></span>. Moreover, the two events in which a random plane curve is smooth and respectively blocking are shown to be asymptotically independent. Extending a classical result on the number of <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-roots of random polynomials, we find that the limiting distribution of the number of <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-points in the intersection of a random plane curve and a fixed <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-line is Poisson with mean 1. We also present an explicit formula for the proportion of blocking curves involving statistics on the number of <span><math><msub><mrow><mi>F</mi></mrow><mrow><mi>q</mi></mrow></msub></math></span>-points contained in a union of <em>k</em> lines for <span><math><mi>k</mi><mo>=</mo><mn>1</mn><mo>,</mo><mn>2</mn><mo>,</mo><mo>…</mo><mo>,</mo><msup><mrow><mi>q</mi></mrow><mrow><mn>2</mn></mrow></msup><mo>+</mo><mi>q</mi><mo>+</mo><mn>1</mn></math></span>.</p></div>","PeriodicalId":50230,"journal":{"name":"Journal of Combinatorial Theory Series A","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2024-02-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series A","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097316524000104","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0
Abstract
A plane curve of degree d is called blocking if every -line in the plane meets C at some -point. We prove that the proportion of blocking curves among those of degree d is when and . We also show that the same conclusion holds for smooth curves under the somewhat weaker condition and . Moreover, the two events in which a random plane curve is smooth and respectively blocking are shown to be asymptotically independent. Extending a classical result on the number of -roots of random polynomials, we find that the limiting distribution of the number of -points in the intersection of a random plane curve and a fixed -line is Poisson with mean 1. We also present an explicit formula for the proportion of blocking curves involving statistics on the number of -points contained in a union of k lines for .
期刊介绍:
The Journal of Combinatorial Theory publishes original mathematical research concerned with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series A is concerned primarily with structures, designs, and applications of combinatorics and is a valuable tool for mathematicians and computer scientists.