English
Related papers

Related papers: On a Balanced Property of Compositions

200 papers

Let $\mathcal{P}_r$ denote an almost-prime with at most $r$ prime factors, counted according to multiplicity. In this paper, it is proved that for $\alpha\in\mathbb{R}\backslash\mathbb{Q},\,\beta\in\mathbb{R}$ and $0<\theta<10/1561$, there…

Number Theory · Mathematics 2021-03-23 Fei Xue , Jinjiang Li , Min Zhang

We establish necessary and sufficient conditions for convergence (in the sense of finite dimensional distributions) of multiplicative measures on the set of partitions. We show that this convergence is equivalent to asymptotic independence…

Probability · Mathematics 2012-02-28 Boris L. Granovsky

Fix a prime $p >2$ and a finite field $\mathbb{F}_{q}$ with $q$ elements, where $q$ is a power of $p$. Let $m$ be a monic polynomial in the polynomial ring $\mathbb{F}_{q}[T]$ such that $deg(m)$ is large. Fix an integer $r\geq 2$, and let…

Number Theory · Mathematics 2021-10-15 Youssef Sedrati

Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…

Number Theory · Mathematics 2010-05-06 Giedrius Alkauskas

For a large integer $m,$ we obtain an asymptotic formula for the number of solutions of a certain congruence modulo $m$ with four variables, where the variables belong to special sets of residue classes modulo $m.$ This formula are applied…

Number Theory · Mathematics 2007-05-23 M. Z. Garaev , A. A. Karatsuba

Let $R_\epsilon(\cdot)$ stand for the bounded-error randomized query complexity with error $\epsilon > 0$. For any relation $f \subseteq \{0,1\}^n \times S$ and partial Boolean function $g \subseteq \{0,1\}^m \times \{0,1\}$, we show that…

Computational Complexity · Computer Science 2018-11-28 Dmitry Gavinsky , Troy Lee , Miklos Santha , Swagato Sanyal

A probabilistic characterization of the dominance partial order on the set of partitions is presented. This extends work in "Symmetric polynomials and symmetric mean inequalities". Electron. J. Combin., 20(3): Paper 34, 2013. Let $n$ be a…

Combinatorics · Mathematics 2015-12-15 Clifford Smyth

If $N = {q^k}{n^2}$ is an odd perfect number, where $q$ is the Euler prime, then we show that $n < q$ is sufficient for Sorli's conjecture that $k = \nu_{q}(N) = 1$ to hold. We also prove that $q^k < 2/3{n^2}$, and that $I(q^k) < I(n)$,…

Number Theory · Mathematics 2012-09-07 Jose Arnaldo B. Dris

Given integer $n > 0$ and $m > 1$, we call a partition of set $[n] = \{1, \dots, n\}$ {\em $m$-good} if each of the partitioning sets is of size at most $m$ and the sum of numbers in it is a power of $m$, that is, $m^t$ for some $t \geq 0$.…

Combinatorics · Mathematics 2025-08-26 Vladimir Gurvich , Mariya Naumova

Given an integer $g$ and also some given integers $m$ (sufficiently large) and $c_1,\dots, c_m$, we show that the number of all non-negative integers $n\le M$ with the property that there exist non-negative integers $k_1,\dots, k_m$ such…

Number Theory · Mathematics 2021-02-04 Dragos Ghioca , Alina Ostafe , Sina Saleh , Igor E. Shparlinski

Given a partition $\{E_0,\ldots,E_n\}$ of the set of primes and a vector $\mathbf{k} \in \mathbb{N}_0^{n+1}$, we compute an asymptotic formula for the quantity $|\{m \leq x: \omega_{E_j}(m) = k_j \ \forall \ 0 \leq j \leq n\}|$ uniformly in…

Number Theory · Mathematics 2016-06-16 Alexander P. Mangerel

Let $A\subset \mathbb{N}^{n}$ be an $r$-wise $s$-union family, that is, a family of sequences with $n$ components of non-negative integers such that for any $r$ sequences in $A$ the total sum of the maximum of each component in those…

Combinatorics · Mathematics 2016-06-03 Peter Frankl , Masashi Shinohara , Norihide Tokushige

Let $S$ be the multiplicative semigroup of $q\times q$ matrices with positive entries such that every row and every column contains a strictly positive element. Denote by $(X_n)_{n\geq1}$ a sequence of independent identically distributed…

Probability · Mathematics 2008-01-25 Hubert Hennion , Loic Hervé

Let $G$ be a finite group, and let $\kappa(G)$ be the probability that elements $g$, $h\in G$ are conjugate, when $g$ and $h$ are chosen independently and uniformly at random. The paper classifies those groups $G$ such that $\kappa(G) \geq…

Group Theory · Mathematics 2014-02-26 Simon R. Blackburn , John R. Britnell , Mark Wildon

We prove specific biases in the number of occurrences of parts belonging to two different residue classes $a$ and $b$, modulo a fixed non-negative integer $m$, for the sets of unrestricted partitions, partitions into distinct parts, and…

Combinatorics · Mathematics 2025-02-03 Michael J. Schlosser , Nian Hong Zhou

Let $\overline{p}_{j,k}(n)$ denotes the number of $(j,k)$-regular overpartitions of a positive integer $n$ such that none of the parts is congruent to $j$ modulo $k$. Naika et. al. (2021) proved infinite families of congruences modulo…

Number Theory · Mathematics 2021-09-16 Riyajur Rahman , Nipen Saikia

For a set $\cM=\{-\mu,-\mu+1,\ldots, \lambda\}\setminus\{0\}$ with non-negative integers $\lambda,\mu<q$ not both 0, a subset $\cS$ of the residue class ring $\Z_q$ modulo an integer $q\ge 1$ is called a $(\lambda,\mu;q)$-\emph{covering…

Information Theory · Computer Science 2013-10-02 Zhixiong Chen , Igor E. Shparlinski , Arne Winterhof

If $N = {p^k}{m^2}$ is an odd perfect number with special prime factor $p$, then it is proved that ${p^k} < (2/3){m^2}$. Numerical results on the abundancy indices $\frac{\sigma(p^k)}{p^k}$ and $\frac{\sigma(m^2)}{m^2}$, and the ratios…

Number Theory · Mathematics 2012-06-18 Jose Arnaldo B. Dris

The plethysm coefficient $p(\nu, \mu, \lambda)$ is the multiplicity of the Schur function $s_\lambda$ in the plethysm product $s_\nu \circ s_\mu$. In this paper we use Schur--Weyl duality between wreath products of symmetric groups and the…

Representation Theory · Mathematics 2024-12-17 Chris Bowman , Rowena Paget , Mark Wildon

It is known that for an arbitrary positive integer \(n\) the sequence \(S(x^n)=(1^n, 2^n, \ldots)\) is complete, meaning that every sufficiently large integer is a sum of distinct \(n\)th powers of positive integers. We prove that every…

Number Theory · Mathematics 2017-07-11 Doyon Kim