Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 87 tok/s
Gemini 2.5 Pro 47 tok/s Pro
GPT-5 Medium 29 tok/s Pro
GPT-5 High 37 tok/s Pro
GPT-4o 85 tok/s Pro
Kimi K2 183 tok/s Pro
GPT OSS 120B 419 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

On the largest singular vector of the Redheffer matrix (2502.09489v1)

Published 13 Feb 2025 in math.NT

Abstract: The Redheffer matrix $A_n \in \mathbb{R}{n \times n}$ is defined by setting $A_{ij} = 1$ if $j=1$ or $i$ divides $j$ and 0 otherwise. One of its many interesting properties is that $\det(A_n) = O(n{1/2 + \varepsilon})$ is equivalent to the Riemann hypothesis. The singular vector $v \in \mathbb{R}n$ corresponding to the largest singular value carries a lot of information: $v_k$ is small if $k$ is prime and large if $k$ has many divisors. We prove that the vector $w$ whose $k-$th entry is the sum of the inverse divisors of $k$, $w_k = \sum_{d|k} 1/d$, is close to a singular vector in a precise quantitative sense.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Ai Generate Text Spark Streamline Icon: https://streamlinehq.com

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.