中文
相关论文

相关论文: When Does the Set of $(a, b, c)$-Core Partitions H…

200 篇论文

In a 2022 paper, Dawsey, Just and the present author prove that the set of integer partitions, taken as a monoid under a partition multiplication operation I defined in my Ph.D. work, is isomorphic to the positive integers as a monoid under…

数论 · 数学 2026-01-21 Robert Schneider

Motivated by the study of integer partitions, we consider partitions of integers into fractions of a particular form, namely with constant denominators and distinct odd or even numerators. When numerators are odd, the numbers of partitions…

数论 · 数学 2021-01-25 Zachary Hoelscher , Eyvindur Ari Palsson

Given integers $k_1, k_2$ with $0\le k_1<k_2$, the determinations of all positive integers $q$ for which there exists a perfect Splitter $B[-k_1, k_2](q)$ set is a wide open question in general. In this paper, we obtain new necessary and…

信息论 · 计算机科学 2019-03-04 Pingzhi Yuan , Kevin Zhao

In 1963, Graham proved that all integers greater than 77 (but not 77 itself) can be partitioned into distinct positive integers whose reciprocals sum to 1. He further conjectured that for any sufficiently large integer, it can be…

数论 · 数学 2025-02-11 Max A. Alekseyev

A triple (a,b,c) of positive integers is called a Markoff triple iff it satisfies the diophantine equation a2 + b2 + c2 = abc . Recasting the Markoff tree, whose vertices are Markoff triples, in the framework of intergral upper triangular…

数论 · 数学 2013-04-01 Norbert Riedel

A graph is prime (with respect to the split decomposition) if its vertex set does not admit a partition (A,B) (called a split) with |A|, |B| >= 2 such that the set of edges joining A and B induces a complete bipartite graph. We prove that…

组合数学 · 数学 2014-04-24 O-joung Kwon , Sang-il Oum

Let $P(m)$ denote the greatest prime factor of $m$. For integer $a>1$, M. Ram Murty and S. Wong proved that, under the assumption of the ABC conjecture, $$P(a^n-1)\gg_{\epsilon, a} n^{2-\epsilon}$$ for any $\epsilon>0$. We study analogues…

数论 · 数学 2015-05-26 Amir Akbary , Soroosh Yazdani

Let $p$ be a prime number, and let $S$ be the numerical semigroup generated by the prime numbers not less than $p$. We compare the orders of magnitude of some invariants of $S$ with each other, e. g., the biggest atom $u$ of $S$ with $p$…

数论 · 数学 2024-06-11 Michael Hellus , Anton Rechenauer , Rolf Waldi

The paper introduce a new type of partitions where the largest part appears exactly once, and the remaining parts constitute a partition of that largest part. We derive the generating function associated with these partitions and…

组合数学 · 数学 2025-06-16 H Kaur , M Rana

The $abc$ conjecture states that there are only finitely many triples of coprime positive integers $(a,b,c)$ such that $a+b=c$ and $\operatorname{rad}(abc) < c^{1-\epsilon}$ for any $\epsilon > 0$. Using the optimized methods in a recent…

数论 · 数学 2025-07-08 Runbo Li

We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) =…

数论 · 数学 2021-02-16 Kathrin Bringmann , Ben Kane , Joshua Males

Let $Q_n = \{0, 1\}^n$ be a hypercube graph. The initial segment $I_k \subseteq Q_n$ is the subset consisting of the first $k$ vertices of $Q_n$ in the binary order. A pair of integers $(a, b) \in \mathbb{Z}_{>0}^2$ is said to be fit if,…

组合数学 · 数学 2025-01-13 Ethan Soloway , Megan Triplett , Wenshi Zhao

A partition of $n$ is called a $t$-core partition if none of its hook number is divisible by $t.$ In 2019, Hirschhorn and Sellers \cite{Hirs2019} obtained a parity result for $3$-core partition function $a_3(n)$. Recently, both authors…

数论 · 数学 2023-02-24 Nabin Kumar Meher , Ankita Jindal

Simultaneous core partitions have been widely studied since Anderson's work on the enumeration of $(s,t)$-core partitions. Amdeberhan and Leven showed that the number of $(s,s+1, \ldots, s+k)$-core partitions is equal to the number of $(s,…

组合数学 · 数学 2019-05-03 Sherry H. F. Yan , Yao Yu , Hao Zhou

We show that if $A$ and $B$ are finite sets of real numbers, then the number of triples $(a,b,c)\in A\times B\times (A\cup B)$ with $a+b=2c$ is at most $(0.15+o(1))(|A|+|B|)^2$ as $|A|+|B|\to\infty$. As a corollary, if $A$ is antisymmetric…

数论 · 数学 2012-11-29 Vsevolod F. Lev , Rom Pinchasi

Let $a,b,c$ be distinct positive integers. Set $M=a+b+c$ and $N=abc$. We give an explicit description of the Mordell-Weil group of the elliptic curve $\displaystyle E_{(M,N)}:y^2-Mxy-Ny=x^3$ over $\Q$. In particular we determine the torsion…

数论 · 数学 2015-05-08 Mohammad Sadek , Nermine El-Sissi

In his classic text, \emph{Combinatory Analysis}, MacMahon defined a perfect partition of a positive integer $n$ as a partition whose parts contain exactly one partition of every positive integer not exceeding $n$. In this paper we apply…

组合数学 · 数学 2025-10-21 Augustine O. Munagi

In this paper we present an extension of Stanley's theorem related to partitions of positive integers. Stanley's theorem states a relation between "the sum of the numbers of distinct members in the partitions of a positive integer $n$" and…

离散数学 · 计算机科学 2010-12-30 Manosij Ghosh Dastidar , Sourav Sen Gupta

Let $M$ be a positive integer and $p(n)$ be the number of partitions of a positive integer $n$. Newman's Conjecture asserts that for each integer $r$, there are infinitely many positive integers $n$ such that \[ p(n)\equiv r \pmod{M}. \]…

数论 · 数学 2025-05-30 Dohoon Choi , Youngmin Lee

A $(k,\ell )$ partial partition of an $n$-element set is a collection of $\ell $ pairwise disjoint $k$-element subsets. It is proved that, if $n$ is large enough, one can find $\left\lfloor {n\choose k}/{\ell}\right\rfloor$ such partial…

组合数学 · 数学 2023-12-15 Gyula O. H. Katona , Gyula Y. Katona