<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>A Maclaurin type inequality · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2310.05328/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/2310.05328/feed.xml" rel="self" type="application/rss+xml" /><item><title>A Maclaurin type inequality — mentioned by pa7x1</title><link>https://news.ycombinator.com/item?id=38037957</link><guid isPermaLink="false">urn:hackerpapers:mention:2310.05328:38037957</guid><pubDate>Fri, 27 Oct 2023 13:10:49 GMT</pubDate><description>&lt;p&gt;From a very quick glance at page 6 of https://arxiv.org/pdf/2310.05328.pdf You can see he is treating the case of k=1,2 with that formula and uses induction to extend it to 1 ≤ 𝑘 ≤ 𝑛 − 2. For k = n - 1 he uses a different bound defined in equation 2.2. So he bypasses the issue.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2310.05328/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>math.CA</category></item></channel></rss>
