- This event has passed.

# Primitive elements in number fields and Diophantine avoidance (Lenny Fukshansky, CMC)

## April 16 @ 12:15 pm - 1:10 pm

The famous primitive element theorem states that every number field K is of the form Q(a) for some element a in K, called a primitive element. In fact, it is clear from the proof of this theorem that not only there are infinitely many such primitive elements in K, but in fact most elements in K are primitive. This observation raises the question about finding a primitive element of small “size”, where the standard way of measuring size is with the use of a height function. We discuss some conjectures and known results in this direction, as well as some of our recent work on a variation of this problem which includes some additional avoidance conditions. Joint work with Sehun Jeong (CGU).