Please turn JavaScript on
Recent Questions - MathOverflow icon

Recent Questions - MathOverflow

Want to stay in touch with the latest updates from Recent Questions - MathOverflow? That's easy! Just subscribe clicking the Follow button below, choose topics or keywords for filtering if you want to, and we send the news to your inbox, to your phone via push notifications or we put them on your personal page here on follow.it.

Reading your RSS feed has never been easier!

Website title: MathOverflow

Is this your feed? Claim it!

Publisher:  Unclaimed!
Message frequency:  26.46 / day

Message History

I am studying a family of non‑homogeneous linear complex differential equations and encountered the following limit. I would like an explicit counterexample, if one exists.

We consider $\eta \in L^\infty([1,+\infty), \mathbb{C})$ satisfying the following hypothesis $(H)$:

$$ \exists \rho_\eta \in \mathbb{C}^*\quad \text{such that} \quad \sup_{t \ge 1} \left| \in...


Read full story

There is this beautiful Crofton formula for the length $L(C)$ of a curve $C$ on the round unit 2-sphere: you take the expected number of intersections of $C$ with a random great circle and multiply by $\pi$ (e.g. if $C$ is itself a great circle then the expected number of intersections is 2, so you get $2\pi$). Is there a simple geometric interpretation for the variance or ot...


Read full story

For integers $n\geq k>0$, let $f$ be the following quadratic form: $$f(x_1,\ldots,x_n)=\sum_{i=1}^n\sum_{j=0}^{k-1}x_ix_{i+j\bmod n}.$$ Is it true that the minimum of $f$ over the unit simplex is attained at $(1/n,\ldots,1/n)$? Where the unit simplex is the set $\{x\in\mathbb R^n:x_i\geq 0\forall i,\ \sum x_i=1\}$.


Read full story

It is known that for each finite set of primes $p$ we have: $\log(p)$ are linear independent over the rational numbers.

We have $\log(ab) = \log(a)+\log(b)$ and $\log(n) = \sum_{p \mid n}v_p(n) \log(p)$.

We define $\psi(n) := \sum_{p \mid n}v_p(n) e_p$ where $e_p$ is the $p$-th standard basis vector of the Hilbert space of sequences.

For $q = a/b \in \mat...


Read full story

Let $P(n) = \{p < n \mid p \text{ prime}, p \text{ odd}\}$ and define $$G_n(x,y) = \prod_{p \in P(n)} (1 + yx^p).$$

For integers $s, k \geq 1$, let $F(s,k)$ denote the set of $k$-element subsets $A \subset P(n)$ with $\sum_{a \in A} a = s$. Expanding $G_n$ shows $$[x^s y^k] G_n(x,y) = |F(s,k)|.$$

Necessary condition: Since all primes in $P(n)...


Read full story