Explore >> Select a destination
|
You are here 
|
www.galoisrepresentations.com | ||
| | | | |
gilkalai.wordpress.com
|
|
| | | | | Topology Quasi-polynomial algorithms for telling if a knot is trivial Marc Lackenby announced a quasi-polynomial time algorithm to decide whether a given knot is the unknot! This is a big breakthrough. This question is known to be both in NP and in coNP. See this post, and updates there in the comment section. Topology seminar,... | |
| | | | |
totallydisconnected.wordpress.com
|
|
| | | | | $latex \bullet$ Let $latex f$ be some cuspidal Hecke eigenform, with associated Galois representation $latex \rho_{f}:G_{\mathbf{Q}}\to \mathrm{GL}_2(\overline{\mathbf{Q}_p})$. A notorious conjecture of Greenberg asserts that if $latex \rho_{f}|G_{\mathbf{Q}_p}$ is abelian (i.e. is a direct sum of characters), then $latex f$ is a CM form, or equivalently $latex \rho_f$ is induced from a character. At some point... | |
| | | | |
djalil.chafai.net
|
|
| | | | | This post is mainly devoted to a probabilistic proof of a famous theorem due to Schoenberg on radial positive definite functions. Let us begin with a general notion: we say that \( {K:\mathbb{R}^d\times\mathbb{R}^d\rightarrow\mathbb{R}} \) is a positive definite kernel when \[ \forall n\geq1, \forall x_1,\ldots,x_n\in\mathbb{R}^d, \forall c\in\mathbb{C}^n, \quad\sum_{i=1}^n\sum_{j=1}^nc_iK(x_i,x_j)\bar{c}_j\geq0. \] When \( {K} \) is symmetric, i.e. \( {K(x,y)=K(y,x)} \) for... | |
| | | | |
jdh.hamkins.org
|
|
| | | Philosophy of Mathematics, Exam Paper 122, Oxford University Wednesdays 12-1 during term, Radcliffe Humanities Lecture Room Joel David Hamkins, Professor of Logic Lucy, Charles - Personifications o... | ||
