A New Density Hierarchy Based on Riesz and Hölder Summability

Let f(n) be an Erdős–Ulam function satisfying f(n+1)/f(n)→1 as n→∞, and let Af denote the associated Riesz matrix. Furthermore, let Af* be the Riesz matrix generated by the weights f(n)/f(1)+f(2)+⋯+f(n), n≥1. The main result establishes that the matrix density induced by an arbitrary power of Af—or, equivalently, by a generalized Hölder mean of arbitrary order—is stronger than the matrix density induced by Af*.

Authors

Institutions

Publication Details

Journal
Mathematics
Published
2026-08-25
DOI
https://doi.org/10.3390/math14173058
Primary Topic
Mathematical Inequalities and Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A New Density Hierarchy Based on Riesz and Hölder Summability

Ferdinánd Filip, János T. Tóth, József Bukor
Mathematics
Mathematical Inequalities and Applications
article

A New Density Hierarchy Based on Riesz and Hölder Summability

Ferdinánd Filip, János T. Tóth, József Bukor
article en

Abstract

Let f(n) be an Erdős–Ulam function satisfying f(n+1)/f(n)→1 as n→∞, and let Af denote the associated Riesz matrix. Furthermore, let Af* be the Riesz matrix generated by the weights f(n)/f(1)+f(2)+⋯+f(n), n≥1. The main result establishes that the matrix density induced by an arbitrary power of Af—or, equivalently, by a generalized Hölder mean of arbitrary order—is stronger than the matrix density induced by Af*.

MathematicsVol. 14(17)
J. Selye University (SK)
Openalex Percentile: Top 6%
Mathematical Inequalities and Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.