On the number of nonnegative sums for semi-partitions

Let [ n] = { 1 , 2 , ⋯ , n}. Let ([n]k) be the family of all subsets of [n] of size k. Define a real-valued weight function w on the set ([n]k) such that ∑X∈([n]k)w(X)≥0. Let Un,t,k be the set of all P= { P1, P2, ⋯ , Pt} such that Pi∈([n]k) for all i and Pi∩ Pj= ∅ for i≠ j. For each P∈ Un,t,k, let w...

Full description

Saved in:
Bibliographic Details
Main Authors: Ku, Cheng Yeaw, Wong, Kok Bin
Other Authors: School of Physical and Mathematical Sciences
Format: Article
Language:English
Published: 2022
Subjects:
Online Access:https://hdl.handle.net/10356/160838
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Nanyang Technological University
Language: English
id sg-ntu-dr.10356-160838
record_format dspace
spelling sg-ntu-dr.10356-1608382022-08-03T06:32:09Z On the number of nonnegative sums for semi-partitions Ku, Cheng Yeaw Wong, Kok Bin School of Physical and Mathematical Sciences Science::Mathematics Subset Sums Extremal Problems Let [ n] = { 1 , 2 , ⋯ , n}. Let ([n]k) be the family of all subsets of [n] of size k. Define a real-valued weight function w on the set ([n]k) such that ∑X∈([n]k)w(X)≥0. Let Un,t,k be the set of all P= { P1, P2, ⋯ , Pt} such that Pi∈([n]k) for all i and Pi∩ Pj= ∅ for i≠ j. For each P∈ Un,t,k, let w(P) = ∑ P∈Pw(P). Let Un,t,k+(w) be set of all P∈ Un,t,k with w(P) ≥ 0. In this paper, we show that |Un,t,k+(w)|≥∏1≤i≤(t-1)k(n-tk+i)(k!)t-1((t-1)!) for sufficiently large n. 2022-08-03T06:32:08Z 2022-08-03T06:32:08Z 2021 Journal Article Ku, C. Y. & Wong, K. B. (2021). On the number of nonnegative sums for semi-partitions. Graphs and Combinatorics, 37(6), 2803-2823. https://dx.doi.org/10.1007/s00373-021-02393-8 0911-0119 https://hdl.handle.net/10356/160838 10.1007/s00373-021-02393-8 2-s2.0-85112830101 6 37 2803 2823 en Graphs and Combinatorics © 2021 The Author(s), under exclusive licence to Springer Japan KK, part of Springer Nature. All rights reserved.
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Science::Mathematics
Subset Sums
Extremal Problems
spellingShingle Science::Mathematics
Subset Sums
Extremal Problems
Ku, Cheng Yeaw
Wong, Kok Bin
On the number of nonnegative sums for semi-partitions
description Let [ n] = { 1 , 2 , ⋯ , n}. Let ([n]k) be the family of all subsets of [n] of size k. Define a real-valued weight function w on the set ([n]k) such that ∑X∈([n]k)w(X)≥0. Let Un,t,k be the set of all P= { P1, P2, ⋯ , Pt} such that Pi∈([n]k) for all i and Pi∩ Pj= ∅ for i≠ j. For each P∈ Un,t,k, let w(P) = ∑ P∈Pw(P). Let Un,t,k+(w) be set of all P∈ Un,t,k with w(P) ≥ 0. In this paper, we show that |Un,t,k+(w)|≥∏1≤i≤(t-1)k(n-tk+i)(k!)t-1((t-1)!) for sufficiently large n.
author2 School of Physical and Mathematical Sciences
author_facet School of Physical and Mathematical Sciences
Ku, Cheng Yeaw
Wong, Kok Bin
format Article
author Ku, Cheng Yeaw
Wong, Kok Bin
author_sort Ku, Cheng Yeaw
title On the number of nonnegative sums for semi-partitions
title_short On the number of nonnegative sums for semi-partitions
title_full On the number of nonnegative sums for semi-partitions
title_fullStr On the number of nonnegative sums for semi-partitions
title_full_unstemmed On the number of nonnegative sums for semi-partitions
title_sort on the number of nonnegative sums for semi-partitions
publishDate 2022
url https://hdl.handle.net/10356/160838
_version_ 1743119535812116480