中文
相关论文

相关论文: Systematic study of Schmidt-type partitions via we…

200 篇论文

For a numerical semigroup $S := \langle n_1, \dots, n_k \rangle$ with minimal generators $n_1 < \cdots < n_k$, Barron, O'Neill, and Pelayo showed that $L(s+n_1) = L(s) + 1$ and $\ell(s+n_k) = \ell(s) + 1$ for all sufficiently large $s \in…

交换代数 · 数学 2023-08-23 Baian Liu

Let $(G,+)$ be an abelian group and consider a subset $A \subseteq G$ with $|A|=k$. Given an ordering $(a_1, \ldots, a_k)$ of the elements of $A$, define its {\em partial sums} by $s_0 = 0$ and $s_j = \sum_{i=1}^j a_i$ for $1 \leq j \leq…

组合数学 · 数学 2018-09-11 Jacob Hicks , M. A. Ollis , John. R. Schmitt

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

数论 · 数学 2019-10-28 David J. Grynkiewicz

We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…

组合数学 · 数学 2018-12-05 Yuriy Choliy , Andrew V. Sills

Let $\mathcal{B}(n)$ denote the collection of all set partitions of $[n]$. Suppose $\mathcal{A} \subseteq \mathcal{B}(n)$ is a non-trivial $t$-intersecting family of set partitions i.e. any two members of $\A$ have at least $t$ blocks in…

组合数学 · 数学 2011-09-05 Cheng Yeaw Ku , Kok Bin Wong

Explicit expressions for restricted partition function $W(s,{\bf d}^m)$ and its quasiperiodic components $W_j(s,{\bf d}^m)$ (called Sylvester waves) for a set of positive integers ${\bf d}^m = \{d_1, d_2, ..., d_m\}$ are derived. The…

数论 · 数学 2007-05-23 Boris Y. Rubinstein

We study periodic expansions in positional number systems with a base $\beta\in\C,\ |\beta|>1$, and with coefficients in a finite set of digits $\A\subset\C.$ We are interested in determining those algebraic bases for which there exists…

数论 · 数学 2016-04-13 Simon Baker , Zuzana Masáková , Edita Pelantová , Tomáš Vávra

Let $\bar{a}_s(n)$ denote the number of partitions of $n$, wherein each odd part is multicolored (atmost $s\ge 1$ colors) and the first appearance of parts may be overlined. In this paper, we establish new families of congruences modulo…

数论 · 数学 2026-05-21 M. P. Thejitha , S. N. Fathima

Raimi's theorem guarantees the existence of a partition of $\mathbb{N}$ into two parts with an unavoidable intersection property: for any finite coloring of $\mathbb{N}$, some color class intersects both parts infinitely many times, after…

组合数学 · 数学 2026-01-01 Norbert Hegyvari , Janos Pach , Thang Pham

The aim of this paper is twofold. First, we study the number of partitions of a positive integer $m$ into at most $n$ parts in a given set $A$. We prove that such a number is bounded by the $n$-th Fibonacci number $F(n)$ for any $m$ and…

表示论 · 数学 2023-11-09 Steven Benzel , Scott Conner , Nham Ngo , Khang Pham

Consideration of a question of E. R. Berlekamp led Carlitz, Roselle, and Scoville to give a combinatorial interpretation of the entries of certain matrices of determinant~1 in terms of lattice paths. Here we generalize this result by…

组合数学 · 数学 2014-04-21 Christine Bessenrodt , Richard P. Stanley

We prove an explicit formula to count the partitions of $n$ whose product of the summands is at most $n$. In the process, we also deduce a result to count the multiplicative partitions of $n$.

组合数学 · 数学 2022-10-25 Pankaj Jyoti Mahanta

Let $A$ be a subset of positive integers. By $A$-partition of $n$ we understand the representation of $n$ as a sum of elements from the set $A$. For given $i, n\in\N$, by $c_{A}(i,n)$ we denote the number of $A$-partitions of $n$ with…

数论 · 数学 2022-02-11 Filip Gawron , Maciej Ulas

For an integer partition $ \lambda$ of $n$ and an $n \times n$ matrix $A$, consider the expansion of the immanant $\text{Imm}^{\lambda}(A)$ as a sum indexed by permutations $\sigma$ of order $n$, with coefficients given by the irreducible…

组合数学 · 数学 2025-01-28 John M. Campbell

We give a possible explanation for the mystery of a missing number in the statement of a problem that asks for the non-negative integers to be partitioned into three subsets. We interpret the missing number as one of the clues that can lead…

历史与综述 · 数学 2017-08-04 Eunice Krinsky , Serban Raianu , Alexander Wittmond

A new formula for the partition function $p(n)$ is developed. We show that the number of partitions of $n$ can be expressed as the sum of a simple function of the two largest parts of all partitions. Specifically, if $a_1 + >... + a_k = n$…

组合数学 · 数学 2010-02-09 Jerome Kelleher

Let $(r_{A,n}(x))_{n \in \mathbb{N}}$ be a sequence of polynomials with coefficients from a field $K$ satisfying the recurrence relation $r_{A,n}(x)= \sum_{|\alpha|\leq m} t_{\alpha,n}(x)\textbf{r}_{A,n}^\alpha(x)$ of order $d+1 \in…

数论 · 数学 2022-04-26 Joanna Turaj

In a recent article (arXiv:1507.03499) (joint with Alon Regev) we studied sums of squares of characters Chi(L,M) of the Symmetric Group over shapes L that are two-rowed, and shapes L that are hook shapes, and M is an arbitrary shape that…

组合数学 · 数学 2015-10-27 Amitai Regev , Doron Zeilberger

We study sum-of-squares representations of symmetric univariate real matrix polynomials that are positive semidefinite along the real line. We give a new proof of the fact that every positive semidefinite univariate matrix polynomial of…

代数几何 · 数学 2017-07-27 Christoph Hanselka , Rainer Sinn

Let \(\mathcal{P}(n)\) be the set of partitions of the positive integer \(n\). For \(\alpha=(\alpha_1,...,\alpha_t) \in \mathcal{P}(n)\) define the diagonal sequence \(\delta(\alpha)=(d_k(\alpha))_{k \geq 1}\) via \( d_k(\alpha) =…

组合数学 · 数学 2024-12-11 Michael Neubauer , Harmony Vargas