English
Related papers

Related papers: Subsets of colossally abundant numbers

200 papers

The normal covering number $\gamma(G)$ of a finite, non-cyclic group $G$ is the least number of proper subgroups such that each element of $G$ lies in some conjugate of one of these subgroups. We prove that there is a positive constant $c$…

Group Theory · Mathematics 2013-01-30 Daniela Bubboloni , Cheryl E. Praeger , Pablo Spiga

We call $n$ a cyclic number if every group of order $n$ is cyclic. It is implicit in work of Dickson, and explicit in work of Szele, that $n$ is cyclic precisely when $\gcd(n,\phi(n))=1$. With $C(x)$ denoting the count of cyclic $n\le x$,…

Number Theory · Mathematics 2020-07-28 Paul Pollack

Let $\varepsilon>0$. We construct an explicit, full-measure set of $\alpha \in[0,1]$ such that if $\gamma \in \mathbb{R}$ then, for almost all $\beta \in[0,1]$, if $\delta \in \mathbb{R}$ then there are infinitely many integers $n\geq 1$…

Number Theory · Mathematics 2023-07-28 Sam Chow , Niclas Technau

We prove versions of Goldbach conjectures for Gaussian primes in arbitrary sectors. Fix an interval $\omega \subset \mathbb{T}$. There is an integer $N_\omega $, so that every odd integer $n$ with $N(n)>N_\omega $ and $\text{dist}(…

Number Theory · Mathematics 2024-03-21 Christina Giannitsi , Ben Krause , Michael Lacey , Hamed Mousavi , Yaghoub Rahimi

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Logic · Mathematics 2026-02-11 Peter Hertling , Rupert Hölzl , Philip Janicki

In this article, we investigate the existence and multiplicity of solutions to the Robin problem \begin{equation*} \begin{cases} -\Delta u = \lambda f(u) & \text{in } \Omega, \frac{\partial u}{\partial \nu} + \gamma u=0 & \text{on }…

Analysis of PDEs · Mathematics 2025-12-01 José Carmona Tapia , Antonio J. Martínez Aparicio , Pedro J. Martínez-Aparicio

In this paper, we study the distribution of the sequence of integers $2^{\omega(n)}$ under the assumption of the strong Riemann hypothesis, where $\omega(n)$ denotes the number of distinct prime divisors of $n$. We provide an asymptotic…

Number Theory · Mathematics 2025-02-06 K. Venkatasubbareddy , A. Sankaranarayanan

Let $n$ be a positive integer and $G(n)$ denote the number of non-isomorphic finite groups of order $n$. It is well-known that $G(n) = 1$ if and only if $(n,\phi(n)) = 1$, where $\phi(n)$ and $(a, b)$ denote the Euler's totient function and…

Group Theory · Mathematics 2017-05-22 A. R. Ashrafi , E. Haghi

This research explores the sum of divisors - $\sigma(n)$ - and the abundancy index given by the function $\frac{\sigma(n)}{n}$. We give a generalization of amicable pairs - feebly amicable pairs (also known as harmonious pairs), that is…

Number Theory · Mathematics 2022-08-16 Jamie Bishop , Abigail Bozarth , Rebekah Kuss , Benjamin Peet

W.H. Woodin showed that if $\kappa_1 < \cdots < \kappa_n$ are strong cardinals then two-step ${\bf\Sigma}^1_{n+3}$ generic absoluteness holds after collapsing $2^{2^{\kappa_n}}$ to be countable. We show that this number can be reduced to…

Logic · Mathematics 2018-07-09 Trevor M. Wilson

The covering number of a group $G$, denoted by $\sigma(G)$, is the size of a minimal collection of proper subgroups of $G$ whose union is $G$. We investigate which integers are covering numbers of groups. We determine which integers $129$…

Group Theory · Mathematics 2018-11-30 Martino Garonzi , Luise-Charlotte Kappe , Eric Swartz

A celebrated unresolved conjecture of Peter Frankl states that every finite union-closed collection of sets ($B$), with non-empty universe, admits an abundant element. The best result in the literature states that if $|B|=n$, then there…

Combinatorics · Mathematics 2021-06-17 Acquaah Peter

Let $\Gamma$ be an abelian group and $g \geq h \geq 2$ be integers. A set $A \subset \Gamma$ is a $C_h[g]$-set if given any set $X \subset \Gamma$ with $|X| = k$, and any set $\{ k_1 , \dots , k_g \} \subset \Gamma$, at least one of the…

Combinatorics · Mathematics 2013-11-14 Xing Peng , Rafael Tesoro , Craig Timmons

We give very precise bounds for the congruence subgroup growth of arithmetic groups. This allows us to determine the subgroup growth of irreducible lattices of semisimple Lie groups. In the most general case our results depend on the…

Group Theory · Mathematics 2007-05-23 A. Lubotzky , N. Nikolov

Let $Y$ be a compact metric space, $G$ be a group acting by transformations on $Y$. For any infinite subset $A\subset Y$, we study the density of $gA$ for $g\in G$ and quantitative density of the set $\displaystyle{\bigcup_{g\in G_n}gA}$ by…

Dynamical Systems · Mathematics 2017-09-19 Changguang Dong

Let $G$ be the alternating group of degree $n$. Let $\omega(G)$ be the maximal size of a subset $S$ of $G$ such that $\langle x,y \rangle = G$ whenever $x,y \in S$ and $x \neq y$ and let $\sigma(G)$ be the minimal size of a family of proper…

Group Theory · Mathematics 2022-06-24 Francesco Fumagalli , Martino Garonzi , Pietro Gheri

We address two questions of Simon Thomas. First, we show that for any n>2 one can find a four generated free subgroup of SLn(Z) which is profinitely dense. More generally, we show that an arithmetic group \Gamma which admits the congruence…

Group Theory · Mathematics 2012-05-08 Menny Aka , Tsachik Gelander , Gregory A. Soifer

We prove that for every nonempty set $\Sigma$ of integers bigger than $1$, which has at most three elements, there exists a numerical semigroup $T$ and an element $x$ of $T$ such that a natural number $n$ is the number of atoms in a…

Commutative Algebra · Mathematics 2018-07-31 Hamid Kulosman

Suppose $\Pi$ is an exchangeable random partition of the positive integers and $\Pi_n$ is its restriction to $\{1, ..., n\}$. Let $K_n$ denote the number of blocks of $\Pi_n$, and let $K_{n,r}$ denote the number of blocks of $\Pi_n$…

Probability · Mathematics 2010-07-14 Jason Schweinsberg

A graph $G$ is said to be $\mathcal H(n,\Delta)$-universal if it contains every graph on $n$ vertices with maximum degree at most $\Delta$. It is known that for any $\varepsilon > 0$ and any natural number $\Delta$ there exists $c > 0$ such…

Combinatorics · Mathematics 2016-02-02 David Conlon , Asaf Ferber , Rajko Nenadov , Nemanja Škorić