AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (257.8 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

Restricted partitions and convex topologies

Department of Mathematics and Statistics, College of Science, Imam Mohammad Ibn Saud Islamic University (IMSIU), Riyadh 11586, Saudi Arabia
Show Author Information

Abstract

Let X n be a finite set. We consider two types of sequences of restricted partitions of X n , namely, the number of order consecutive partitions of X n into k parts, denoted N o c ( n , k ) and the sequence T ( n , k ) of the number of order-consecutive partition sequences of X n with k parts. This last sequence is also the number of locally convex topologies consisting of k nested open sets defined on a totally ordered set of cardinality n. Although all the main results apply to both sequences, we will focus on T ( n , k ). We prove that the generating polynomials of these sequences have real negative roots. A central limit theorem and a local limit theorem are also proved for T ( n , k ). Many other relations with Fibonacci and Lucas numbers are also given.

CLC number: 05A18, 11B39, 11B65

References

【1】
【1】
 
 
AIMS Mathematics
Pages 10187-10203

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Benoumhani M. Restricted partitions and convex topologies. AIMS Mathematics, 2025, 10(4): 10187-10203. https://doi.org/10.3934/math.2025464

6

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 02 October 2024
Revised: 20 March 2025
Accepted: 11 April 2025
Published: 15 April 2025
©2025 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)