English
Related papers

Related papers: On factorizations into coprime parts

200 papers

Let $G$ be a finite group and let $A_1,\ldots,A_k$ be a collection of subsets of $G$ such that $G=A_1\ldots A_k$ is the product of all the $A_i$'s with $|G|=|A_1|\ldots|A_k|$. We write $G=A_1\cdot\ldots\cdot A_k$ and call this a $k$-fold…

Group Theory · Mathematics 2022-11-04 Mikhail Kabenyuk

We examine how closely a multiplicative function resembles an additive function. Given a multiplicative function $g$ and an additive function $f$, we examine the size of the quantity $E(f,g;x)=\# \{n\leq x:f(n)=g(n)\}$. We establish a lower…

Number Theory · Mathematics 2017-06-28 Theophilus Agama

Let $\Bbb F_q$ be a finite field with $q$ elements. Let $n$ be a positive integer with radical $rad(n)$, namely, the product of distinct prime divisors of $n$. If the order of $q$ modulo $rad(n)$ is either 1 or a prime, then the irreducible…

Information Theory · Computer Science 2020-12-16 Yansheng Wu , Qin Yue

Let P(n) denote the largest prime factor of $n \ge 2, P(1) = 1$, and let $$ \beta(n) = \sum_{p|n}p, \Beta(n) = \sum_{p^\alpha||n}\alpha p, \Beta_1(n) = \sum_{\p^\alpha||n}p^\alpha $$ denote "large" additive functions. A survey of results on…

Number Theory · Mathematics 2007-05-23 Aleksandar Ivić

Given $n$ positive integers $a_1,a_2,\dots,a_n$, and a positive integer right hand side $\beta$, we consider the feasibility version of the subset sum problem which is the problem of determining whether a subset of $a_1,a_2,\dots,a_n$ adds…

Optimization and Control · Mathematics 2020-01-07 Mustafa Kemal Tural

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

Number Theory · Mathematics 2019-01-11 F. E. Brochero Martínez , Lucas Reis , Lays Silva

We enumerate factorisations of the complete graph into spanning regular graphs in several cases, including when the degrees of all the factors except for one or two are small. The resulting asymptotic behaviour is seen to generalise the…

Combinatorics · Mathematics 2022-06-28 Mahdieh Hasheminezhad , Brendan D. McKay

Let $C(n)$ denote the number of permutations $\sigma$ of $[n]=\{1,2,\dots,n\}$ such that $\gcd(j,\sigma(j))=1$ for each $j\in[n]$. We prove that for $n$ sufficiently large, $n!/3.73^n < C(n) < n!/2.5^n$.

Number Theory · Mathematics 2022-03-08 Carl Pomerance

Let $f \in { \mathbb R} ( t) [x]$ be given by $ f(t, x) = x^n + t \cdot g(x) $ and $\beta_1 < \dots < \beta_m$ the distinct real roots of the discriminant $\Delta_{(f, x)} (t)$ of $f(t, x)$ with respect to $x$. Let $\gamma$ be the number of…

Number Theory · Mathematics 2019-05-30 Shuichi Otake , Tony Shaska

Let $G$ be a transitive normal subgroup of a permutation group $A$ of finite degree $n$. The factor group $A/G$ can be considered as a certain Galois group and one would like to bound its size. One of the results of the paper is that $|A/G|…

Group Theory · Mathematics 2017-01-31 Robert M. Guralnick , Attila Maróti , László Pyber

Let $F(x)= \sum_{\nu\in\NN^d} F_\nu x^\nu$ be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic in a neighborhood of the origin.…

Combinatorics · Mathematics 2012-08-07 Alexander Raichev , Mark C. Wilson

We show that, for any $r\geq 1$, if $g_1,\ldots,g_r$ are distinct coprime integers, sufficiently large depending only on $r$, then for any $\epsilon>0$ there are infinitely many integers $n$ such that all but $\epsilon \log n$ of the digits…

Number Theory · Mathematics 2025-09-04 Thomas F. Bloom , Ernie Croot

We consider the sum of the reciprocals of the middle prime factor of an integer, defined according to multiplicity or not. We obtain an asymptotic expansion in the first case and an asymptotic formula involving an implicit parameter in the…

Number Theory · Mathematics 2025-07-04 Jonathan Rotgé

Define a permutation $\sigma$ to be coprime if $\gcd(m,\sigma(m)) = 1$ for $m\in[n]$. In this note, proving a recent conjecture of Pomerance, we prove that the number of coprime permutations on $[n]$ is $n!\cdot (c+o(1))^n$ where \[c =…

Number Theory · Mathematics 2022-03-30 Ashwin Sah , Mehtaab Sawhney

Let V be a finite faithful completely reducible FG-module for a finite field F and a finite group G. In various cases explicit linear bounds in |V| are given for the numbers of conjugacy classes k(GV) and k(G) of the semidirect product GV…

Group Theory · Mathematics 2013-05-14 Robert M. Guralnick , Attila Maroti

Let A be a nonempty finite set of relatively prime positive integers, and let p_A(n) denote the number of partitions of n with parts in A. An elementary arithmetic argument is used to obtain an asymptotic formula for p_A(n).

Number Theory · Mathematics 2016-12-30 Melvyn B. Nathanson

Let $\alpha,\beta \in \mathbb{R}_{>0}$ be such that $\alpha,\beta$ are quadratic and $\mathbb{Q}(\alpha)\neq \mathbb{Q}(\beta)$. Then every subset of $\mathbb{R}^n$ definable in both $(\mathbb{R},{<},+,\mathbb{Z},x\mapsto \alpha x)$ and…

Logic · Mathematics 2024-07-23 Philipp Hieronymi , Sven Manthe , Chris Schulz

Let $t(N)$ denote the largest number such that $N!$ can be expressed as the product of $N$ integers greater than or equal to $t(N)$. The bound $t(N)/N = 1/e-o(1)$ was apparently established in unpublished work of Erd\H{o}s, Selfridge, and…

Let F be a totally real number field, n a prime integer, and G a unitary group of rank n defined over F that is compact at every infinite place. We prove an asymptotic formula for the number of cuspidal automorphic representations of G…

Number Theory · Mathematics 2011-10-18 William Conley

We propose a generalization of the factorization method to the case when $\mathcal{G}$ is a finite dimensional Lie algebra such that $\mathcal{G}=\mathcal{G}_0\oplus M \oplus N$ (direct sum of vector spaces), where $\mathcal{G}_0$ is a…

Exactly Solvable and Integrable Systems · Physics 2013-03-26 R. A. Atnagulova , O. V. Sokolova