Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn factorizations into coprime parts
118
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Let $f(n)$ and $g(n)$ be the number of unordered and ordered factorizations of $n$ into integers larger than one. Let $F(n)$ and $G(n)$ have the additional restriction that the factors are coprime. We establish the asymptotic bounds for the sums of $F(n)^{beta}$ and $G(n)^{beta}$ up to $x$ for all real $beta$ and the asymptotic bounds for $f(n)^{beta}$ and $g(n)^{beta}$ for all negative $beta$.
rate research
Read More
We investigate the integer solutions of Diophantine equations related to perfect numbers. These solutions generalize the example, found by Descartes in 1638, of an odd, ``spoof perfect factorization $3^2cdot 7^2cdot 11^2cdot 13^2cdot 22021^1$. More recently, Voight found the spoof perfect factorization $3^4cdot 7^2cdot 11^2cdot 19^2cdot(-127)^1$. No other examples appear in the literature. We compute all nontrivial, odd, primitive spoof perfect factorizations with fewer than seven bases -- there are twenty-one in total. We show that the structure of odd, spoof perfect factorizations is extremely rich, and there are multiple infinite families of them. This implies that certain approaches to the odd perfect number problem that use only the multiplicative nature of the sum-of-divisors function are unworkable. On the other hand, we prove that there are only finitely many nontrivial, odd, primitive spoof perfect factorizations with a fixed number of bases.
In this article we study the norm of an integer partition, which we define to be the product of the parts. This partition-theoretic statistic has appeared here and there in the literature of the last century or so, and is at the heart of current research by both authors. We survey known results and give new results related to this all-but-overlooked object, which, it turns out, plays a comparable role in partition theory to the size, length, and other standard partition statistics.
** The primary topic of this dissertation is the study of the relationships between parts and wholes as described by particular physical theories, namely generalized probability theories in a quasi-classical physics framework and non-relativistic quantum theory. ** A large part of this dissertation is devoted to understanding different aspects of four different kinds of correlations: local, partially-local, no-signaling and quantum mechanical correlations. Novel characteristics of these correlations have been used to study how they are related and how they can be discerned via Bell-type inequalities that give non-trivial bounds on the strength of the correlations. ** The study of quantum correlations has also prompted us to study a) the multi-partite qubit state space with respect to its entanglement and separability characteristics, and b) the differing strength of the correlations in separable and entangled qubit states. Results include a novel classification of multipartite (partial) separability and entanglement, strong constraints on the monogamy of entanglement and of non-local correlations, and many new entanglement detection criteria that are directly experimentally accessible. ** Because of the generality of the investigation these results also have strong foundational as well as philosophical repercussions for the different sorts of physical theories as a whole; notably for the viability of hidden variable theories for quantum mechanics, for the possibility of doing experimental metaphysics, for the question of holism in physical theories, and for the classical vs. quantum dichotomy.
We show that for $n geq 3, n e 5$, in any partition of $mathcal{P}(n)$, the set of all subsets of $[n]={1,2,dots,n}$, into $2^{n-2}-1$ parts, some part must contain a triangle --- three different subsets $A,B,Csubseteq [n]$ such that $Acap B$, $Acap C$, and $Bcap C$ have distinct representatives. This is sharp, since by placing two complementary pairs of sets into each partition class, we have a partition into $2^{n-2}$ triangle-free parts. We also address a more general Ramsey-type problem: for a given graph $G$, find (estimate) $f(n,G)$, the smallest number of colors needed for a coloring of $mathcal{P}(n)$, such that no color class contains a Berge-$G$ subhypergraph. We give an upper bound for $f(n,G)$ for any connected graph $G$ which is asymptotically sharp (for fixed $k$) when $G=C_k, P_k, S_k$, a cycle, path, or star with $k$ edges. Additional bounds are given for $G=C_4$ and $G=S_3$.
We introduce a bijection between inequivalent minimal factorizations of the n-cycle (1 2 ... n) into a product of smaller cycles of given length, on one side, and trees of a certain structure on the other. We use this bijection to count the factorizations with a given number of different commuting factors that can appear in the first and in the last positions, a problem which has found applications in physics. We also provide a necessary and sufficient condition for a set of cycles to be arrangeable into a product evaluating to (1 2 ... n).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
