◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Johan Andersson

0 papers here

Matching runs newest-first, so older work may not be attached to this profile yet.

ORCID 0000-0002-9651-1766

identity via Semantic Scholar / OpenAlex

collaborators
Showing math.NTShow all

4 papers · 1 filter

math.NT2006

On the solutions to a power sum problem

Johan Andersson

In a recent paper we proved that if (*)=\inf_{|z_k|=1}\max_{v=1,...,n^2-n} |\sum_{k=1}^n z_k^v|, then (*)=\sqrt{n-1} if n-1 is a prime power. We proved that a construction of Fabry…

math.NT2006★ 5 cited

Turan's problem 10 revisited

Johan Andersson

In this paper we prove that inf_{|z_k| => 1} max_{v=1,...,n^2} |sum_{k=1}^n z_k^v| = sqrt n+O(n^{0.2625+epsilon}). This improves on the bound O(sqrt (n log n)) of Erdos and Renyi.…

math.NT2006

On the number of plane partitions and non isomorphic subgroup towers of abelian groups

Johan Andersson, Jan Snellman

We study the number of k×r plane partitions, weighted on the sum of the first row. Using Erhart reciprocity, we prove an identity for the generating function. For the spec…

math.NT2006★ 2 cited

Explicit solutions to certain inf max problems from Turan power sum theory

Johan Andersson

Let s_v denote the pure power sum \sum_{k=1}^n z_k^v. In a previous paper we proved that \sqrt n <= \inf_{|z_k| => 1} \max_{v=1,...,n^2} |s_v| <= \sqrt{n+1} when n+1 is prime. In t…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.