中文
相关论文

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

200 篇论文

The Dyson rank of an integer partition is the difference between its largest part and the number of parts it contains. Using Fine-Dyson symmetry, we give formulas for the number of partitions of n with rank larger than n/2, and we prove…

A tantalizing open problem, posed independently by Stiebitz in 1995 and by Alon in 2006, asks whether for every pair of integers $s,t \ge 1$ there exists a finite number $F(s,t)$ such that the vertex set of every digraph of minimum…

组合数学 · 数学 2025-07-02 Micha Christoph , Kalina Petrova , Raphael Steiner

Let $a,b,c$ be fixed coprime positive integers with $\min\{a,b,c\}>1$. In this paper, combining the Gel'fond-Baker method with an elementary approach, we prove that if $\max\{a,b,c\}>5\times 10^{27}$, then the equation $a^x+b^y=c^z$ has at…

数论 · 数学 2017-02-14 Yongzhong Hu , Maohua Le

In 1973, Katona raised the problem of determining the maximum number of subsets in a separating cover on n elements. The answer to Katona's question turns out to be the inverse to the answer to a much simpler question: what is the largest…

组合数学 · 数学 2010-08-30 Vincent Vatter

Let $a,b,c\in R$ where $R$ is a $*$-ring. We call $a$ \textit{left dual $(b,c)$-core invertible} if there exists $x\in Rc$ such that $bxab=b$ and $(xab)^*=xab$. Such an $x$ is called a left dual $(b,c)$-core inverse of $a$. In this paper,…

环与代数 · 数学 2024-12-30 Tugce Pekacar Calci , Serhat Emirhan Soycan

We show that for every $r \geq 1$, and all $r$ distinct (sufficiently large) primes $p_1,..., p_r > p_0(r)$, there exist infinitely many integers $n$ such that ${2n \choose n}$ is divisible by these primes to only low multiplicity. From a…

数论 · 数学 2023-01-09 Ernie Croot , Hamed Mousavi , Maxie Schmidt

In this paper, we give a conjecture, which generalises Euler's partition theorem involving odd parts and different parts for all moduli. We prove this conjecture for two family partitions. We give $q$-difference equations for the related…

组合数学 · 数学 2020-05-19 Xinhua Xiong , William J. Keith

The lattice of partitions of a set and its d-divisible generalization have been much studied for their combinatorial, topological, and representation-theoretic properties. An ordered set partition is a set partition where the subsets are…

组合数学 · 数学 2025-07-08 Bruce E Sagan , Sheila Sundaram

For relatively prime integers $a$ and $b$ both greater than one and odd integer $c$, there are at most two solutions in positive integers $(x,y,z)$ to the equation $a^x + b^y = c^z$. There are an infinite number of $(a,b,c)$ giving exactly…

数论 · 数学 2023-07-11 Reese Scott , Robert Styer

An $(n,k)$-Sperner partition system is a set of partitions of some $n$-set such that each partition has $k$ nonempty parts and no part in any partition is a subset of a part in a different partition. The maximum number of partitions in an…

组合数学 · 数学 2020-10-22 Adam Gowty , Daniel Horsley

We show that for $n \geq 3, n\ne 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,C\subseteq [n]$ such that…

组合数学 · 数学 2018-12-18 Eben Blaisdell , András Gyárfás , Robert A. Krueger , Ronen Wdowinski

In this note we conjecture Rogers-Ramanujan type colored partition identities for an array with odd number of rows w such that the first and the last row consist of even positive integers. In a strange way this is different from the…

组合数学 · 数学 2023-01-31 Mirko Primc

Given nonnegative integers, $s$ and $k$, an $(s,k)$-polar partition of a graph $G$ is a partition $(A,B)$ of $V_G$ such that $G[A]$ and $\overline{G[B]}$ are complete multipartite graphs with at most $s$ and $k$ parts, respectively. If $s$…

组合数学 · 数学 2023-04-25 F. Esteban Contreras Mendoza , César Hernández Cruz

Based on the Goldbach conjecture and arithmetic fundamental theorem, the Goldbach conjecture was extended to more general situations, i.e., any positive integer can be written as summation of some specific prime numbers, which depends on…

数论 · 数学 2016-03-17 Yan Kun , Li Hou Biao

Let $R$ be a unital $*$-ring. For any $a,w,b\in R$, we apply the defined $w$-core inverse to define a new class of partial orders in $R$, called the $w$-core partial order. Suppose $a,b\in R$ are $w$-core invertible. We say that $a$ is…

环与代数 · 数学 2023-09-26 Huihui Zhu , Liyun Wu

We continue the study of the $(a,b,m)$-copartition function $\mathrm{cp}_{a,b,m}(n)$, which arose as a combinatorial generalization of Andrews' partitions with even parts below odd parts. The generating function of $\mathrm{cp}_{a,b,m}(n)$…

数论 · 数学 2022-01-13 Hannah E. Burson , Dennis Eichhorn

An $(n,k)$-Sperner partition system is a collection of partitions of some $n$-set, each into $k$ nonempty classes, such that no class of any partition is a subset of a class of any other. The maximum number of partitions in an…

组合数学 · 数学 2020-11-13 Yanxun Chang , Charles J. Colbourn , Adam Gowty , Daniel Horsley , Junling Zhou

We consider a special type of integer partitions in which the parts of the form $p^aq^b$, for some relatively prime integers $p$ and $q$, are restricted by divisibility conditions. We investigate the problems of generating and encoding…

数论 · 数学 2012-12-04 Laurent Imbert , Fabrice Philippe

We initiate the study of simultaneous core multipartitions, generalising simultaneous core partitions, which have been studied extensively in the recent literature. Given a multipartition datum (s|c), which consists of a non-negative…

组合数学 · 数学 2018-07-04 Matthew Fayers

We prove a precise min-max theorem for the following problem. Let $G$ be an Eulerian graph with a specified set of edges $S \subseteq E(G)$, and let $b$ be a vertex of $G$. Then what is the maximum integer $k$ so that the edge-set of $G$…

组合数学 · 数学 2025-06-10 Rose McCarty