/explore
|
You are here 
|
fabricebaudoin.blog | ||
| | | | |
mikespivey.wordpress.com
|
|
| | | | | The Riemann zeta function $latex \zeta(s)$ can be expressed as $latex \zeta(s) = \sum_{n=1}^{\infty} \frac{1}{n^s}$, for complex numbers s whose real part is greater than 1. By analytic continuation, $latex \zeta(s)$ can be extended to all complex numbers except where $latex s = 1$. The power sum $latex S_a(M)$ is given by $latex S_a(M) =... | |
| | | | |
blog.georgeshakan.com
|
|
| | | | | I recently uploaded "On the largest sum-free subset problem in the integers," to the arXiv. Let $latex A \subset \mathbb{Z}$ be a finite subset of the integers. We say $latex A$ is sum-free if there are no solutions to $latex a + b = c,$ with $latex a,b,c \in A$. We define $latex S(A)$ to... | |
| | | | |
xorshammer.com
|
|
| | | | | An arithmetic statement is one made up of quantifiers ``$latex \forall n\in\mathbb{N}$,'' ``$latex \exists n\in \mathbb{N}$,'' the logical connectives ``and,'' ``or,'' ``not'', function symbols $latex \times$, $latex +$, constants $latex {0}$, $latex 1$, and variables $latex n$ which are bound by the aforementioned quantifiers. It is known that there is no algorithm which will decide... | |
| | | | |
francisbach.com
|
|
| | | [AI summary] This mathematical post explores the geometry of positive semi-definite matrices using the von Neumann entropy and related Bregman divergences to derive concentration inequalities for random matrices. | ||
