Choosing Postgrad Programme: Arithmetic Combinatorics Vs Algebraic Number Theory

deetz
Messages
2
Reaction score
0
Dear all,

I am attending a taught postgrad programme starting next October. I can not decide whether to take the Algebraic Number Theory or the (additive/arithmetic) Combinatorics modules. My choice will determine my PhD route, so it is a choice of career rather than just a choice of courses.

I am really interested in Combinatorics more than ANT. However, some of my professors are advising me to go for the ANT option because they claim that anybody can catch up with Combinatorics later in his life and because ANT is more challenging and respectable in the mathematical society these days. One should mention that my department has mostly Analysts and Alg. Numb. theorists in it (no one specializing in Combinatorics here :D).

The aforementioned courses are almost mutually exclusive (in the sense that registering the Combinatorics courses will rule out most of the ANT courses due to lectures overlapping and vice versa.) Thus, I have to take a crisp decision.

What do you think I should do?
 
Physics news on Phys.org


One argument for taking ANT is that your department has a number of them on staff (so probably better courses, more research opportunities, more people to discuss your research with and/or collaborate with).
 


Gokul43201 said:
One argument for taking ANT is that your department has a number of them on staff (so probably better courses, more research opportunities, more people to discuss your research with and/or collaborate with).

I should have said that I am taking the programme in another school (another continent, to be precise :smile:). At any rate, there are very renowned mathematicians there working in both ANT and combinatorics (not simultaneously).

I mentioned that my department has a number of staff specializing on ANT so as not to be told to ask my current professors and also to give a reason for their preference of ANT (it is their specialty after all.)

I do not know where I will be able to do research after getting my PhD, but I think I can always find a healthy community of combinatorists or algebraic number theorists.
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...

Similar threads

Back
Top