BROWSE

Related Scientist

Benjamin, Lund's photo.

Benjamin, Lund
이산수학 그룹
more info

ITEM VIEW & DOWNLOAD

Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof

Cited 0 time in webofscience Cited 0 time in scopus
54 Viewed 0 Downloaded
Title
Furstenberg Sets in Finite Fields: Explaining and Improving the Ellenberg–Erman Proof
Author(s)
Dhar, Manik; Dvir, Zeev; Ben Lund
Publication Date
2024-03
Journal
Discrete and Computational Geometry, v.71, pp.327 - 357
Publisher
Springer Verlag
Abstract
A (k, m)-Furstenberg set is a subset S⊂Fqn with the property that each k-dimensional subspace of Fqn can be translated so that it intersects S in at least m points. Ellenberg and Erman (Algebra Number Theory 10(7), 1415–1436 (2016)) proved that (k, m)-Furstenberg sets must have size at least Cn,kmn/k , where Cn,k is a constant depending only n and k. In this paper, we adopt the same proof strategy as Ellenberg and Erman, but use more elementary techniques than their scheme-theoretic method. By modifying certain parts of the argument, we obtain an improved bound on Cn,k , and our improved bound is nearly optimal for an algebraic generalization the main combinatorial result. We also extend our analysis to give lower bounds for sets that have large intersection with shifts of a specific family of higher-degree co-dimension n- k varieties, instead of just co-dimension n- k subspaces. © 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
URI
https://pr.ibs.re.kr/handle/8788114/14779
DOI
10.1007/s00454-023-00585-y
ISSN
0179-5376
Appears in Collections:
Pioneer Research Center for Mathematical and Computational Sciences(수리 및 계산과학 연구단) > Discrete Mathematics Group(이산 수학 그룹) > 1. Journal Papers (저널논문)
Files in This Item:
There are no files associated with this item.

qrcode

  • facebook

    twitter

  • Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.
해당 아이템을 이메일로 공유하기 원하시면 인증을 거치시기 바랍니다.

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse