English
Related papers

Related papers: Measuring Abundance with Abundancy Index

200 papers

Any finite word $w$ of length $n$ contains at most $n+1$ distinct palindromic factors. If the bound $n+1$ is reached, the word $w$ is called rich. The number of rich words of length $n$ over an alphabet of cardinality $q$ is denoted…

Combinatorics · Mathematics 2019-03-26 Josef Rukavicka

We introduce a new real valued invariant for finitely presented groups called residual deficiency. Its main property is the following. Let G be a finitely presented group. If the residual deficiency of G is greater than one, then G has a…

Group Theory · Mathematics 2013-06-12 Mariano Zeron-Medina Laris

Complementarity is a phenomenon explaining several core features of quantum theory, such as the well-known uncertainty principle. Roughly speaking, two objects are said to be complementary if being certain about one of them necessarily…

Quantum Physics · Physics 2023-09-22 Chung-Yun Hsieh , Roope Uola , Paul Skrzypczyk

We define a sequence of positive integers recursively, where each term is determined as follows: starting with a given positive integer, if the term is odd, the next is the sum of its positive divisors; if the term is even, the subsequent…

Number Theory · Mathematics 2025-06-04 Ritesh Dwivedi , Rohit Yadav

This paper reports, by way of introduction, on the advances made by our group and the broader signal processing community on the concept of sample abundance; a phenomenon that naturally arises in one-bit and few-bit signal processing…

Information Theory · Computer Science 2025-07-28 Arian Eamaz , Farhang Yeganegi , Mojtaba Soltanalian

Inspired by a classical result of R\'enyi, we prove that every even integer $N\geq 4$ can be written as the sum of a prime and a number with at most 395 prime factors. We also show, under assumption of the generalised Riemann hypothesis,…

Number Theory · Mathematics 2025-04-14 Daniel R. Johnston , Valeriia V. Starichkova

We continue investigations on the average number of representations of a large positive integer as a sum of given powers of prime numbers. The average is taken over a short interval, whose admissible length depends on whether or not we…

Number Theory · Mathematics 2020-12-08 Marco Cantarini , Alessandro Gambini , Alessandro Zaccagnini

Following Srinivasan, an integer n\geq 1 is called practical if every natural number in [1,n] can be written as a sum of distinct divisors of n. This motivates us to define f(n) as the largest integer with the property that all of 1, 2,…

Number Theory · Mathematics 2012-01-17 Paul Pollack , Lola Thompson

A notion of arithmetic similarity between number fields is defined by requiring equality of some arithmetic statistics over all but finitely many rational primes. The exceptional set is empty in all previously studied cases, but existing…

Number Theory · Mathematics 2025-05-05 Shaver Phagan

A unitary perfect number is a positive integer n satisfying \sigma^*(n)=2n, where \sigma^* sums unitary divisors. Only five examples are known, and no sixth has been found. We revisit the Subbarao-Warren problem by keeping the seed factor…

Number Theory · Mathematics 2026-05-26 Tom Maciejewski

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan

A rationality condition is derived for the existence of odd perfect numbers involving the square root of a product, which consists of a sequence of repunits, multiplied by twice the base of one of the repunits. This constraint also provides…

Number Theory · Mathematics 2007-05-23 Simon Davis

Let $d,n$ be positive integers and $S$ be an arbitrary set of positive integers. We say that $d$ is an $S$-divisor of $n$ if $d|n$ and gcd $(d,n/d)\in S$. Consider the $S$-convolution of arithmetical functions given by (1.1), where the sum…

Number Theory · Mathematics 2007-05-23 László Tóth

We consider the set of finite sequences of length n over a finite or countable alphabet C. We consider the function which associate each given sequence with the size of the maximum overlap with a (shifted) copy of itself. We compute the…

Probability · Mathematics 2011-10-28 Miguel Abadi , Rodrigo Lambert

Let A be a finite subset of a commutative additive group Z. The sumset and difference set of A are defined as the sets of pairwise sums and differences of elements of A, respectively. The well-known inequality $\sigma(A)^{1/2} \leq…

Combinatorics · Mathematics 2015-10-20 Merlijn Staps

Let $q^k n^2$ be an odd perfect number with special prime $q$. Define the GCDs $$G = \gcd\bigg(\sigma(q^k),\sigma(n^2)\bigg)$$ $$H = \gcd\bigg(n^2,\sigma(n^2)\bigg)$$ and $$I = \gcd\bigg(n,\sigma(n^2)\bigg).$$ We prove that $G \times H =…

Number Theory · Mathematics 2023-03-30 Jose Arnaldo Bebita Dris

A goodness-of-fit index measures the consistency of consumption data with a given model of utility-maximization. We show that for the class of well-behaved (i.e., continuous and increasing) utility functions there is no goodness-of-fit…

Theoretical Economics · Economics 2026-02-13 Yujian Chen , Joshua Lanier , John K. -H. Quah

Let $\mathcal{I}$ be an analytic P-ideal [respectively, a summable ideal] on the positive integers and let $(x_n)$ be a sequence taking values in a metric space $X$. First, it is shown that the set of ideal limit points of $(x_n)$ is an…

Classical Analysis and ODEs · Mathematics 2018-11-27 Paolo Leonetti

The Riemann Hypothesis has been of central interest to mathematicians for a long time and many unsuccessful attempts have been made to either prove or disprove it. Since the Riemann zeta function is defined as a sum of the infinite number…

General Mathematics · Mathematics 2012-03-20 Yaroslav D. Sergeyev

In this paper, we introduce the concept of $F$-perfect number, which is a positive integer $n$ such that $\sum_{d|n,d<n}d^2=3n$. We prove that all the $F$-perfect numbers are of the form $n=F_{2k-1}F_{2k+1}$, where both $F_{2k-1}$ and…

Number Theory · Mathematics 2014-06-12 Tianxin Cai , Deyi Chen , Yong Zhang
‹ Prev 1 4 5 6 7 8 10 Next ›