Results 1 to 10 of about 64 (64)
On Graham partitions twisted by the Legendre symbol
We investigate when there is a partition of a positive integer nn, n=f(λ1)+f(λ2)+⋯+f(λℓ),n=f\left({\lambda }_{1})+f\left({\lambda }_{2})+\cdots +f\left({\lambda }_{\ell }), satisfying that 1=χp(λ1)λ1+χp(λ2)λ2+⋯+χp(λℓ)λℓ,1=\frac{{\chi }_{p}\left({\lambda }
Kim Byungchan +5 more
doaj +1 more source
Maximum entropy and integer partitions [PDF]
We derive asymptotic formulas for the number of integer partitions with given sums of \(j\)th powers of the parts for \(j\) belonging to a finite, non-empty set \(J \subset \mathbb N\).
McKinley, Gweneth +2 more
core +1 more source
MacMahon’s statistics on higher-dimensional partitions
We study some combinatorial properties of higher-dimensional partitions which generalize plane partitions. We present a natural bijection between d-dimensional partitions and d-dimensional arrays of nonnegative integers.
Alimzhan Amanov, Damir Yeliussizov
doaj +1 more source
Dynamics of plane partitions: Proof of the Cameron–Fon-Der-Flaass conjecture
One of the oldest outstanding problems in dynamical algebraic combinatorics is the following conjecture of P. Cameron and D. Fon-Der-Flaass (1995): consider a plane partition P in an $a \times b \times c$ box ${\sf B}$ . Let $\Psi (P)$
Rebecca Patrias, Oliver Pechenik
doaj +1 more source
Correlations in totally symmetric self‐complementary plane partitions
Totally symmetric self‐complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well‐known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in 1/12 of a hexagon with free ...
Arvind Ayyer, Sunil Chhita
doaj +1 more source
Parity results for broken 11-diamond partitions
Recently, Dai proved new infinite families of congruences modulo 2 for broken 11-diamond partition functions by using Hecke operators. In this note, we establish new parity results for broken 11-diamond partition functions.
Wu Yunjian
doaj +1 more source
Cyclic sums, network sharing, and restricted edge cuts in graphs with long cycles [PDF]
Cyclic Sums, Network Sharing and Restricted Edge Cuts in Graphs with Long Cycles Dieter Rautenbach , Lutz Volkmann Preprint series: 07-06, 8 MSC 2000 05A17 Partitions of integers 05C40 Connectivity Abstract We study graphs G = (V,E ...
Rautenbach, Dieter, Volkmann, Lutz
core +1 more source
Some congruences for 3-component multipartitions
Let p3(n) denote the number of 3-component multipartitions of n. Recently, using a 3-dissection formula for the generating function of p3(n), Baruah and Ojah proved that for n ≥ 0, p3(9n + 5) ≡ 0 (mod 33) and p3 (9n + 8) ≡ 0 (mod 34).
Zhao Tao Yan, Jin Lily J., Gu C.
doaj +1 more source
On Partitions and Arf Semigroups
In this study we examine some combinatorial properties of the Arf semigroup. In previous work, the author and Karakaş, Gümüşbaş defined an Arf partition of a positive integer n. Here, we continue this work and give new results on Arf partitions.
Tutaş Nesrin
doaj +1 more source
Arithmetic properties for Andrews’ (48,6)- and (48,18)-singular overpartitions
Singular overpartition functions were defined by Andrews. Let Ck,i(n) denote the number of (k, i)-singular overpartitions of n, which counts the number of overpartitions of n in which no part is divisible by k and only parts ±i (mod k) may be overlined ...
Liu Eric H., Du Wenjing
doaj +1 more source

