Hostname: page-component-cd9895bd7-dzt6s Total loading time: 0 Render date: 2024-12-24T16:36:48.691Z Has data issue: false hasContentIssue false

Geometric-progression-free sets over quadratic number fields

Published online by Cambridge University Press:  27 February 2017

Andrew Best
Affiliation:
Department of Mathematics and Statistics, Williams College, Williamstown, MA 01267, USA ([email protected])
Karen Huan
Affiliation:
Department of Mathematics and Statistics, Williams College, Williamstown, MA 01267, USA ([email protected])
Nathan McNew
Affiliation:
Department of Mathematics, Dartmouth College, Hanover, NH 03755, USA
Steven J. Miller
Affiliation:
Department of Mathematics and Statistics, Williams College, Williamstown, MA 01267, USA ([email protected]; [email protected])
Jasmine Powell
Affiliation:
Department of Mathematics, Northwestern University, Evanston, IL 60208, USA
Kimsy Tor
Affiliation:
Department of Mathematics, Manhattan College, Riverdale, NY 10471, USA
Madeleine Weinstein
Affiliation:
Department of Mathematics, Harvey Mudd College, Claremont, CA 91711, USA ([email protected])

Extract

In Ramsey theory one wishes to know how large a collection of objects can be while avoiding a particular substructure. A problem of recent interest has been to study how large subsets of the natural numbers can be while avoiding three-term geometric progressions. Building on recent progress on this problem, we consider the analogous problem over quadratic number fields. We first construct high-density subsets of the algebraic integers of an imaginary quadratic number field that avoid three-term geometric progressions. When unique factorization fails, or over a real quadratic number field, we instead look at subsets of ideals of the ring of integers. Our approach here is to construct sets ‘greedily’, a generalization of the greedy set of rational integers considered by Rankin. We then describe the densities of these sets in terms of values of the Dedekind zeta function. Next, we consider geometric-progression-free sets with large upper density. We generalize an argument by Riddell to obtain upper bounds for the upper density of geometric-progression-free subsets, and construct sets avoiding geometric progressions with high upper density to obtain lower bounds for the supremum of the upper density of all such subsets. Both arguments depend critically on the elements with small norm in the ring of integers.

Type
Research Article
Copyright
Copyright © Royal Society of Edinburgh 2017 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)