English
Related papers

Related papers: Subsets of colossally abundant numbers

200 papers

Let $\mathbf{G}$ be the set of all finite or infinite increasing sequences of positive integers beginning with 1. For a sequence $S=\{s(n)\}, n\geq1,$ from $\mathbf{G},$ a positive number $N$ is called an exponentially $S$-number $(N\in…

Number Theory · Mathematics 2016-02-09 Vladimir Shevelev

Let $G$ be a finite group and $\sigma_1(G)=\frac{1}{|G|}\sum_{H\leq G}\,|H|$. Under some restrictions on the number of conjugacy classes of (non-normal) maximal subgroups of $G$, we prove that if $\sigma_1(G)<\frac{117}{20}\,$, then $G$ is…

Group Theory · Mathematics 2024-09-23 Marius Tărnăuceanu

Given a finite group $R$, we let $\mathrm{Sub}(R)$ denote the collection of all subgroups of $R$. We show that $|\mathrm{Sub}(R)|< c\cdot |R|^{\frac{\log_2|R|}{4}}$, where $c<7.372$ is an explicit absolute constant. This result is…

Group Theory · Mathematics 2023-09-15 Marco Fusari , Pablo Spiga

The biclique partition number of a graph $G= (V,E)$, denoted $bp(G)$, is the minimum number of pairwise edge disjoint complete bipartite subgraphs of $G$ so that each edge of $G$ belongs to exactly one of them. It is easy to see that $…

Combinatorics · Mathematics 2024-01-10 Tom Bohman , Jakob Hofstad

Zaremba's conjecture (1971) states that every positive integer number can be represented as a denominator (continuant) of a finit continued fraction with all partial quotients being bounded by an absolute constant A. Recently (in 2011)…

Number Theory · Mathematics 2015-06-22 I. D. Kan

We compute the limiting distribution, as n approaches infinity, of the number of cycles of length between gamma n and delta n in a permutation of [n] chosen uniformly at random, for constants gamma, delta such that 1/(k+1) <= gamma < delta…

Combinatorics · Mathematics 2009-09-17 Michael Lugo

An equivalent definition of the Fibonacci numbers is that they are the unique sequence such that every integer can be written uniquely as a sum of non-adjacent terms. We can view this as we have bins of length 1, we can take at most one…

Motivated by questions of Fouvry and Rudnick on the distribution of Gaussian primes, we develop a very general setting in which one can study inequities in the distribution of analogues of primes through analytic properties of infinitely…

Number Theory · Mathematics 2025-12-01 Lucile Devin

We present a simple proof to a fact recently established in [5]: let $\xi$ be a symmetric random variable that has variance $1$, let $\Gamma=(\xi_{ij})$ be an $N \times n$ random matrix whose entries are independent copies of $\xi$, and set…

Functional Analysis · Mathematics 2019-02-06 Shahar Mendelson

Let L be a Lie group and Lambda a lattice in L. Suppose G is a non-compact simple Lie group realized as a Lie subgroup of L, and the image of G on L/Lambda is dense. Let c be a diagonalizable element of G not contained in a compact…

Representation Theory · Mathematics 2007-05-23 Nimish A. Shah

Let $(F_n)_{n \geq 1}$ be the sequence of Fibonacci numbers. Guy and Matiyasevich proved that \begin{equation*} \log \operatorname{lcm} (F_1, F_2, \dots, F_n) \sim \frac{3 \log \alpha}{\pi^2} \cdot n^2 \quad \text{as } n \to +\infty,…

Number Theory · Mathematics 2020-07-28 Carlo Sanna

Let $Q(n)$ denote the count of the primitive subsets of the integers $\{1,2\ldots n\}$. We give a new proof that $Q(n) = \alpha^{(1+o(1))n}$ which allows us to give a good error term and to improve upon the lower bound for the value of this…

Number Theory · Mathematics 2020-08-14 Nathan McNew

Let $\big(\mathcal{S}_n^{\alpha,\kappa,\mathfrak{r}}(z)\big)_{n=1}^\infty$ be a sequence of the largest possible integer intervals, such that…

General Mathematics · Mathematics 2020-04-09 Andrzej Bożek

Let $G$ be a $d$-regular graph $G$ on $n$ vertices. Suppose that the adjacency matrix of $G$ is such that the eigenvalue $\lambda$ which is second largest in absolute value satisfies $\lambda=o(d)$. Let $G_p$ with $p=\frac{\alpha}{d}$ be…

Combinatorics · Mathematics 2016-05-25 Alan Frieze , Michael Krivelevich , Ryan R. Martin

For $k\mid n$ let $Comb_{n,k}$ denote the tree consisting of an $(n/k)$-vertex path with disjoint $k$-vertex paths beginning at each of its vertices. An old conjecture says that for any $k=k(n)$ the threshold for the random graph $G(n,p)$…

Combinatorics · Mathematics 2014-01-14 Jeff Kahn , Eyal Lubetzky , Nicholas Wormald

Given a graph $G$ and a constant $\gamma \in [0,1]$, let $\omega^{(\gamma)}(G)$ be the largest integer $r$ such that there exists an $r$-vertex subgraph of $G$ containing at least $\gamma \binom{r}{2}$ edges. It was recently shown that…

Probability · Mathematics 2020-09-11 Kay Bogerd

For a given sequence of weights (non-negative numbers), we consider partitions of the positive integer n. Each n-partition is selected uniformly at random from the set of all such partitions. Under a classical scheme of assumptions on the…

Probability · Mathematics 2013-01-25 Ljuben Mutafchiev

We show that there exists some $\delta > 0$ such that, for any set of integers $B$ with $B\cap[1,Y]\gg Y^{1-\delta}$ for all $Y \gg 1$, there are infinitely many primes of the form $a^2+b^2$ with $b\in B$. We prove a quasi-explicit formula…

Number Theory · Mathematics 2025-06-18 Jori Merikoski

Let $I(n)$ denote the number of isomorphism classes of subgroups of $(\Bbb Z/n\Bbb Z)^\times$, and let $G(n)$ denote the number of subgroups of $(\Bbb Z/n\Bbb Z)^\times$ counted as sets (not up to isomorphism). We prove that both $\log…

Number Theory · Mathematics 2017-10-03 Greg Martin , Lee Troupe

Suppose $G$ is a $k$-uniform hypergraph on $n$ vertices such that every $(k-1)$-subset $S$ of $V(G)$ belongs to at least $\delta n$ edges, where $\delta> 1/2$. Let $\Psi(G)$ denote the number of tight Hamilton cycles in $G$, that is, cyclic…

Combinatorics · Mathematics 2026-04-17 Felix Joos , Xinyue Xie
‹ Prev 1 8 9 10 Next ›