Nearly Menger covering property via bitopological spaces

Necati Can Açıkgöz; Ceren Sultan Elmalı; Necati Can Açıkgöz; Ceren Sultan Elmalı

doi:10.3934/math.20241623

AIMS Mathematics

2024, Volume 9, Issue 12: 34042-34066. doi: 10.3934/math.20241623

Previous Article Next Article

Research article

Nearly Menger covering property via bitopological spaces

Department of Mathematics, Erzurum Technical University, Yakutiye, Erzurum 25050, Turkey

Received: 28 October 2024 Revised: 24 November 2024 Accepted: 27 November 2024 Published: 03 December 2024
MSC : 54A10, 54D20, 54E55

This paper is a continuation and complement for previous works on selective covering properties. We introduce the novel concept of the nearly Menger property in a bitopological context. We demonstrate its interrelations with existing covering properties and construct certain equivalences between those. We also investigate various properties of nearly Menger bitopological spaces by considering it under subspaces, products, and certain type of mappings.

Keywords:

Citation: Necati Can Açıkgöz, Ceren Sultan Elmalı. Nearly Menger covering property via bitopological spaces[J]. AIMS Mathematics, 2024, 9(12): 34042-34066. doi: 10.3934/math.20241623

Related Papers:

[1]	Tingting Du, Zhengang Wu . Some identities of the generalized bi-periodic Fibonacci and Lucas polynomials. AIMS Mathematics, 2024, 9(3): 7492-7510. doi: 10.3934/math.2024363
[2]	Tingting Du, Zhengang Wu . Some identities involving the bi-periodic Fibonacci and Lucas polynomials. AIMS Mathematics, 2023, 8(3): 5838-5846. doi: 10.3934/math.2023294
[3]	Hong Kang . The power sum of balancing polynomials and their divisible properties. AIMS Mathematics, 2024, 9(2): 2684-2694. doi: 10.3934/math.2024133
[4]	Utkal Keshari Dutta, Prasanta Kumar Ray . On the finite reciprocal sums of Fibonacci and Lucas polynomials. AIMS Mathematics, 2019, 4(6): 1569-1581. doi: 10.3934/math.2019.6.1569
[5]	Waleed Mohamed Abd-Elhameed, Omar Mazen Alqubori . New expressions for certain polynomials combining Fibonacci and Lucas polynomials. AIMS Mathematics, 2025, 10(2): 2930-2957. doi: 10.3934/math.2025136
[6]	Kritkhajohn Onphaeng, Prapanpong Pongsriiam . Exact divisibility by powers of the integers in the Lucas sequence of the first kind. AIMS Mathematics, 2020, 5(6): 6739-6748. doi: 10.3934/math.2020433
[7]	Ala Amourah, B. A. Frasin, G. Murugusundaramoorthy, Tariq Al-Hawary . Bi-Bazilevič functions of order $ \vartheta +i\delta $ associated with $ (p, q)- $ Lucas polynomials. AIMS Mathematics, 2021, 6(5): 4296-4305. doi: 10.3934/math.2021254
[8]	Can Kızılateş, Halit Öztürk . On parametric types of Apostol Bernoulli-Fibonacci, Apostol Euler-Fibonacci, and Apostol Genocchi-Fibonacci polynomials via Golden calculus. AIMS Mathematics, 2023, 8(4): 8386-8402. doi: 10.3934/math.2023423
[9]	Abdulmtalb Hussen, Mohammed S. A. Madi, Abobaker M. M. Abominjil . Bounding coefficients for certain subclasses of bi-univalent functions related to Lucas-Balancing polynomials. AIMS Mathematics, 2024, 9(7): 18034-18047. doi: 10.3934/math.2024879
[10]	Waleed Mohamed Abd-Elhameed, Amr Kamel Amin, Nasr Anwer Zeyada . Some new identities of a type of generalized numbers involving four parameters. AIMS Mathematics, 2022, 7(7): 12962-12980. doi: 10.3934/math.2022718

Abstract

1. Introduction

Fibonacci polynomials and Lucas polynomials are important in various fields such as number theory, probability theory, numerical analysis, and physics. In addition, many well-known polynomials, such as Pell polynomials, Pell Lucas polynomials, Tribonacci polynomials, etc., are generalizations of Fibonacci polynomials and Lucas polynomials. In this paper, we extend the linear recursive polynomials to nonlinearity, that is, we discuss some basic properties of the bi-periodic Fibonacci and Lucas polynomials.

The bi-periodic Fibonacci $\left \{ f_{n} \left (t\right) \right \}$ and Lucas $\left \{ l_{n} \left (t \right) \right \}$ polynomials are defined recursively by

$\begin{equation*} f_{0}\left (t \right ) = 0, \quad f_{1}\left (t\right ) = 1, \quad {f_{n}\left ( t\right ) = } \begin{cases} ayf_{n-1}\left ( t \right ) +f_{n-2}\left ( t \right ) \quad & n \equiv 0 \pmod{2}, \\ byf_{n-1}\left (t \right ) +f_{n-2}\left (t \right ) \quad & n \equiv 1 \pmod{2}, \end{cases} \quad n\ge 2, \end{equation*}$

and

$\begin{equation*} l_{0}\left ( t \right ) = 2, \quad l_{1}\left (t \right ) = at, \quad {l_{n}\left ( t \right ) = } \begin{cases} byl_{n-1}\left ( t \right ) +l_{n-2}\left ( t \right ) \quad & n \equiv 0 \pmod{2}, \\ ayl_{n-1}\left ( t \right ) +l_{n-2}\left ( t \right ) \quad & n \equiv 1 \pmod{2}, \end{cases} \quad n\ge 2, \end{equation*}$

where $a$ and $b$ are nonzero real numbers. For $t = 1$ , the bi-periodic Fibonacci and Lucas polynomials are, respectively, well-known bi-periodic Fibonacci $\left \{f_{n} \right \}$ and Lucas $\left \{l_{n} \right \}$ sequences. We let

$\begin{equation*} {\varsigma \left ( n \right ) = } \begin{cases} 0 \quad & n \equiv 0 \pmod{2}, \\ 1 \quad & n \equiv 1 \pmod{2}, \end{cases} \quad n\ge 2. \end{equation*}$

In ^[1], the scholars give the Binet formulas of the bi-periodic Fibonacci and Lucas polynomials as follows:

$\begin{equation} f_{n}\left (t \right ) = \frac{a^{\varsigma \left (n+1 \right) }}{ \left( ab \right )^{\left \lfloor \frac{n}{2} \right \rfloor } }\left (\frac{\sigma^{n} \left ( t\right ) -\tau ^{n}\left ( t \right ) }{\sigma\left (t \right ) -\tau \left ( t \right ) }\right), \end{equation}$

(1.1)

and

$\begin{equation} l_{n}\left (t \right ) = \frac{a^{\varsigma \left (n \right) }}{ \left( ab \right )^{\left \lfloor \frac{n+1}{2} \right \rfloor } }\left (\sigma ^{n}\left (t\right ) +\tau ^{n}\left ( t\right ) \right), \end{equation}$

(1.2)

where $n\ge 0$ , $\sigma\left (t \right)$ , and $\tau \left (t \right)$ are zeros of $\lambda ^{2}-abt\lambda -ab$ . This is $\sigma \left (t \right) = \frac{abt +\sqrt{a^{2} b^{2} t^{2}+4ab} }{2}$ and $\tau \left (t \right) = \frac{abt -\sqrt{a^{2} b^{2} t^{2}+4ab} }{2}$ . We note the following algebraic properties of $\sigma\left (t \right)$ and $\tau \left (t \right)$ :

$\begin{equation*} \sigma \left ( t \right ) +\tau \left (t \right ) = abt, \quad \sigma \left (t \right ) -\tau \left ( t \right ) = \sqrt{a^{2} b^{2} t^{2} +4ab}, \quad \sigma\left ( t \right ) \tau \left ( t\right ) = -ab. \end{equation*}$

Many scholars studied the properties of bi-periodic Fibonacci and Lucas polynomials; see ^[2,3,4,5,6]. In addition, many scholars studied the power sums problem of second-order linear recurrences and its divisible properties; see ^[7,8,9,10].

Taking $a = b = 1$ and $t = 1$ , we obtain the Fibonacci $\left \{ F_{n} \right \}$ or Lucas $\left \{ L_{n} \right \}$ sequence. Melham ^[11] proposed the following conjectures:

Conjecture 1. Let $m\ge 1$ be an integer, then the sum

$\begin{equation*} L_{1} L_{3} L_{5}\cdots L_{2m+1}\sum\limits_{k = 1}^{n} F_{2k}^{2m+1} \end{equation*}$

can be represented as $\left (F_{2n+1}-1 \right)^{2}R_{2m-1}\left (F_{2n+1} \right)$ , including $R_{2m-1}\left (t \right)$ as a polynomial with integer coefficients of degree $2m-1$ .

Conjecture 2. Let $m\ge 1$ be an integer, then the sum

$\begin{equation*} L_{1} L_{3} L_{5}\cdots L_{2m+1}\sum\limits_{k = 1}^{n} L_{2k}^{2m+1} \end{equation*}$

can be represented as $\left (L_{2n+1}-1 \right)Q_{2m}\left (L_{2n+1} \right)$ , where $Q_{2m}\left (t \right)$ is a polynomial with integer coefficients of degree $2m$ .

In ^[12], the authors completely solved the Conjecture $2$ and discussed the Conjecture $1$ . Using the definition and properties of bi-periodic Fibonacci and Lucas polynomials, the power sums problem and their divisible properties are studied in this paper. The results are as follows:

Theorem 1. We get the identities

$\begin{align} & \sum\limits_{k = 1}^{n}f_{2k}^{2m+1} \left (t\right ) = \frac{a^{2m+1} }{b\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \sum\limits _{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m+1}{m-j}\left ( \frac{f_{\left ( 2n+1 \right )\left ( 2j+1\right ) }\left ( t \right ) - f_{2j+1}\left ( t \right ) }{l_{2j+1} \left ( t \right ) } \right ), \end{align}$

(1.3)

$\begin{align} & \sum\limits_{k = 1}^{n}f_{2k+1}^{2m+1} \left ( t \right ) = \frac{\left ( ab \right ) ^{m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \sum\limits_{j = 0}^{m} \binom{2m+1}{m-j} \left ( \frac{f_{\left ( 2n+2\right )\left (2j+1 \right ) }\left (t\right ) -f_{2\left ( 2j+1 \right ) }\left (t\right ) }{l_{2j+1}\left ( t \right ) } \right ), \end{align}$

(1.4)

$\begin{align} & \sum\limits_{k = 1}^{n}l_{2k}^{2m+1} \left (t \right ) = \sum\limits_{j = 0}^{m} \binom{2m+1}{m-j} \left ( \frac{l_{\left ( 2n+1 \right )\left ( 2j+1 \right ) }\left (t \right ) -l_{2j+1}\left ( t\right ) }{l_{2j+1}\left ( t\right ) } \right ), \end{align}$

(1.5)

$\begin{align} &\sum\limits_{k = 1}^{n}l_{2k+1}^{2m+1} \left (t\right ) = \frac{ a ^{m+1} }{b^{m+1} } \sum\limits_{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m+1}{m-j} \left ( \frac{l_{\left ( 2n+2\right )\left ( 2j+1\right ) }\left ( t \right ) -l_{2\left ( 2j+1 \right ) }\left ( t \right ) }{l_{2j+1}\left ( t \right ) } \right ), \end{align}$

(1.6)

where $n$ and $m$ are positive integers.

Theorem 2. We get the identities

$\begin{align} & \sum\limits_{k = 1}^{n}f_{2k}^{2m} \left ( t \right ) = \frac{a^{2m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \sum\limits_{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m}{m-j} \frac{f_{2j\left ( 2n+1 \right ) }\left (t \right ) }{f_{2j}\left (t\right ) } -\frac{a^{2m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} }\binom{2m}{m}\left ( -1 \right )^{m}\left ( n+ \frac{1}{2 } \right ) , \end{align}$

(1.7)

$\begin{align} & \sum\limits_{k = 1}^{n}f_{2k+1}^{2m} \left ( t \right ) = \frac{\left ( ab \right ) ^{m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \sum\limits_{j = 0}^{m} \binom{2m}{m-j} \left ( \frac{f_{2j\left ( 2n+2\right ) }\left ( t \right ) -f_{4j }\left ( t \right ) }{f_{2j}\left ( t \right ) } \right )-\frac{\left ( ab \right ) ^{m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} }\binom{2m}{m}n , \end{align}$

(1.8)

$\begin{align} & \sum\limits_{k = 1}^{n}l_{2k}^{2m} \left ( t \right ) = \sum\limits_{j = 0}^{m} \binom{2m}{m-j} \frac{f_{2j\left ( 2n+1 \right ) }\left ( t \right ) }{l_{2j+1}\left (t \right ) }-2^{2m-1}-\binom{2m}{m}\left ( n+\frac{1}{2} \right ) , \end{align}$

(1.9)

$\begin{align} &\sum\limits_{k = 1}^{n}l_{2k+1}^{2m} \left ( t \right ) = \frac{ a ^{m} }{b^{m} } \sum\limits_{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m}{m-j} \left ( \frac{f_{2j\left ( 2n+2\right ) }\left ( t \right ) -f_{4j }\left (t \right ) }{f_{2j}\left ( t \right ) } \right ) -\frac{a^{m} }{b^{m} } \binom{2m}{m} \left ( -1 \right )^{m}n , \end{align}$

(1.10)

where $n$ and $m$ are positive integers.

As for application of Theorem 1, we get the following:

Corollary 1. We get the congruences:

$\begin{equation} bl_{1} \left ( t \right ) l_{3} \left ( t \right ) \cdots l_{2m+1}\left ( t \right )\sum\limits _{k = 1}^{n}f_{2k}^{2m+1}\left ( t \right ) \equiv 0\pmod{f_{2n+1}\left ( t \right ) -1}, \end{equation}$

(1.11)

and

$\begin{equation} al_{1} \left ( t\right ) l_{3} \left (t \right ) \cdots l_{2m+1}\left ( t \right )\sum\limits _{k = 1}^{n}l_{2k}^{2m+1}\left ( t \right ) \equiv 0\pmod{l_{2n+1}\left (t \right ) -at}, \end{equation}$

(1.12)

where $n$ and $m$ are positive integers.

Taking $t = 1$ in Corollary 1, we have the following conclusions for bi-periodic Fibonacci $\left \{ f_{n} \right \}$ and Lucas $\left \{ l_{n} \right \}$ sequences.

Corollary 2. We get the congruences:

$\begin{equation} bl_{1} l_{3} \cdots l_{2m+1} \sum\limits _{k = 1}^{n}f_{2k}^{2m+1} \equiv 0\pmod{f_{2n+1} -1}, \end{equation}$

(1.13)

and

$\begin{equation} al_{1} l_{3} \cdots l_{2m+1} \sum\limits _{k = 1}^{n}l_{2k}^{2m+1} \equiv 0\pmod{l_{2n+1} -a }, \end{equation}$

(1.14)

where $n$ and $m$ are nonzero real numbers.

Taking $a = b = 1$ and $t = 1$ in Corollary 1, we have the following conclusions for bi-periodic Fibonacci $\left \{ F_{n} \right \}$ and Lucas $\left \{ L_{n} \right \}$ sequences.

Corollary 3. We get the congruences:

$\begin{equation} L_{1} L_{3} \cdots L_{2m+1} \sum\limits _{k = 1}^{n}F_{2k}^{2m+1} \equiv 0\pmod{F_{2n+1} -1}, \end{equation}$

(1.15)

and

$\begin{equation} L_{1} L_{3} \cdots L_{2m+1} \sum\limits _{k = 1}^{n}L_{2k}^{2m+1} \equiv 0\pmod{L_{2n+1} -1 }, \end{equation}$

(1.16)

where $n$ and $m$ are nonzero real numbers.

2. Proofs of theorems

To begin, we will give several lemmas that are necessary in proving theorems.

Lemma 1. We get the congruence

$\begin{equation*} f_{\left ( 2n+1 \right )\left ( 2j+1\right ) } \left ( t \right ) -f_{2j+1 } \left ( t \right ) \equiv 0 \pmod{f_{2n+1 } \left ( t \right )-1}, \end{equation*}$

where $n$ and $m$ are nonzero real numbers.

Proof. We prove it by complete induction for $j\ge 0$ . This clearly holds when $j = 0$ . If $j = 1$ , we note that $abf_{3\left (2n+1 \right) } \left (t \right) = \left (a^{2} b^{2} t^{2} +4ab \right) f_{2n+1}^{3}\left (t \right)-3abf_{2n+1} \left (t\right)$ and we obtain

$\begin{equation*} \begin{split} & f_{3\left ( 2n+1 \right ) }\left ( t \right )-f_{3 }\left ( t \right ) = \left ( abt^{2}+4 \right ) f_{2n+1}^{3}\left ( t\right )-3f_{2n+1} \left (t \right )-\left ( abt^{2}+4 \right )f_{1}^{3} \left (t \right )+3f_{1} \left (t\right ) \\ & = \left ( abt^{2}+4 \right )\left ( f_{2n+1}\left ( t \right )-f_{1}\left ( t \right )\right )\left ( f_{2n+1}^{2}\left (t \right )+ f_{2n+1}\left ( t \right )f_{1}\left ( t \right )+ f_{1}^{2}\left ( t \right ) \right )-3\left ( f_{2n+1} \left ( t\right ) -f_{1}\left ( t \right ) \right ) \\ & = \left ( abt^{2}+4 \right )\left ( f_{2n+1}\left ( t\right )-1\right )\left ( f_{2n+1}^{2}\left (t \right )+ f_{2n+1}\left ( t \right )f_{1}\left ( t \right )+ f_{1}^{2}\left ( t \right ) \right )-3\left ( f_{2n+1} \left ( t \right ) -1 \right ) \\ & \equiv 0 \pmod{f_{2n+1}\left (t \right ) -1 } . \end{split} \end{equation*}$

This is obviously true when $j = 1$ . Assuming that Lemma 1 holds if $j = 1, 2, \dots, k$ , that is,

$\begin{equation*} f_{\left ( 2n+1 \right )\left ( 2j+1\right ) } \left ( t \right ) -f_{2j+1 } \left ( t \right ) \equiv 0 \pmod{f_{2n+1 } \left ( t \right )-1}. \end{equation*}$

If $j = k+1 \ge 2$ , we have

$\begin{equation*} l_{2\left ( 2n+1 \right ) } \left ( t \right ) f_{\left ( 2n+1 \right )\left ( 2j+1 \right ) }\left ( t \right ) = f_{\left ( 2n+1 \right )\left ( 2j+3 \right ) }\left ( t \right ) +abf_{\left ( 2n+1 \right )\left ( 2j-1 \right ) }\left ( t \right ), \end{equation*}$

and

$\begin{equation*} \begin{split} abl_{2\left ( 2n+1 \right ) } \left ( t \right ) = \left ( a^{2} b^{2} t^{2} +4ab \right )f_{2n+1}^{2}\left ( t \right )-2ab \equiv \left ( a^{2} b^{2} t^{2} +4ab \right )f_{1}^{2}\left ( t \right )-2ab \pmod{f_{2n+1}\left ( t \right ) -1 }. \end{split} \end{equation*}$

We have

$\begin{equation*} \begin{split} &f_{\left ( 2n+1 \right )\left ( 2k+3 \right ) } \left (t\right ) -f_{ 2k+3 } \left ( t\right )\\ & = l_{2\left ( 2n+1 \right ) }\left ( t \right ) f_{\left ( 2n+1 \right )\left ( 2k+1 \right ) }\left ( t \right )-abf_{\left (2n+1\right )\left ( 2k-1 \right ) } \left ( t \right ) -l_{2} \left ( t \right )f_{2k+1}\left ( t \right )+abf_{2k-1} \left ( t \right ) \\ & \equiv \left ( \left ( abt^{2}+4 \right )f_{ 1}^{2} \left (t \right ) -2 \right )f_{\left ( 2n+1 \right )\left ( 2k+1 \right ) }\left (t \right )-abf_{\left ( 2n+1 \right )\left ( 2k-1 \right ) } \left (t \right ) \\ &\quad -\left ( \left ( abt^{2}+4 \right )f_{ 1}^{2} \left ( t \right ) -2 \right ) f_{2k+1} \left ( t \right )+abf_{2k-1}\left ( t \right ) \\ & \equiv \left ( \left ( abt^{2}+4 \right )f_{ 1}^{2} \left ( t \right ) -2 \right )\left ( f_{\left ( 2n+1 \right ) \left ( 2k+1 \right ) }\left ( t \right )-f_{2k+1}\left ( t\right ) \right ) -ab\left ( f_{\left ( 2n+1 \right )\left ( 2k-1 \right ) } \left (t \right ) -f_{2k-1}\left ( t \right ) \right ) \\ & \equiv 0 \pmod{f_{2n+1}\left (t \right ) -1 } . \end{split} \end{equation*}$

This completely proves Lemma 1. □

Lemma 2. We get the congruence

$\begin{equation*} al_{\left ( 2n+1 \right )\left ( 2j+1\right ) } \left ( t \right ) -al_{2j+1 } \left ( t \right ) \equiv 0 \pmod{l_{2n+1 } \left ( t \right )-at}, \end{equation*}$

where $n$ and $m$ are nonzero real numbers.

Proof. We prove it by complete induction for $j\ge 0$ . This clearly holds when $j = 0$ . If $j = 1$ , we note that $al_{3\left (2n+1 \right) } \left (t \right) = b l_{2n+1}^{3}\left (t \right)+3al_{2n+1} \left (t \right)$ and we obtain

$\begin{equation*} \begin{split} & a l_{3\left ( 2n+1 \right ) }\left (t \right )-al_{3 }\left ( t \right ) = b l_{2n+1}^{3}\left ( t \right )+3al_{2n+1} \left ( t \right )-bl_{1}^{3} \left (t \right )-3al_{1} \left ( t \right ) \\ & = \left ( l_{2n+1}\left ( t \right )-l_{1}\left ( t \right )\right )\left ( bl_{2n+1}^{2}\left ( t \right )+ bl_{2n+1}\left ( t \right )l_{1}\left ( t \right )+ bl_{1}^{2}\left (t \right ) \right )-3a\left ( l_{2n+1} \left ( t \right ) -l_{1}\left ( t\right ) \right ) \\ & = \left ( l_{2n+1}\left ( t \right )-at\right )\left ( bl_{2n+1}^{2}\left ( t \right )+ bayl_{2n+1}\left ( t \right )+ ba^{2}t^{2} \right )-3a\left ( l_{2n+1} \left ( t \right ) -at \right )\\ & \equiv 0 \pmod{l_{2n+1}\left ( t \right ) -at } . \end{split} \end{equation*}$

This is obviously true when $j = 1$ . Assuming that Lemma 2 holds if $j = 1, 2, \dots, k$ , that is,

$\begin{equation*} al_{\left ( 2n+1 \right )\left ( 2j+1\right ) } \left (t \right ) -al_{2j+1 } \left ( t \right ) \equiv 0 \pmod{l_{2n+1 } \left ( t \right )-at}. \end{equation*}$

If $j = k+1 \ge 2$ , we have

$\begin{equation*} l_{2\left ( 2n+1 \right ) } \left (t \right ) l_{\left ( 2n+1 \right )\left ( 2j+1 \right ) }\left ( t\right ) = l_{\left ( 2n+1 \right )\left ( 2j+3 \right ) }\left ( t\right ) +l_{\left ( 2n+1 \right )\left ( 2j-1 \right ) }\left ( t \right ), \end{equation*}$

and

$\begin{equation*} \begin{split} & al_{2\left ( 2n+1 \right ) } \left ( t \right ) = bl_{2n+1}^{2}\left ( t \right )+2a \equiv bl_{1}^{2}\left ( t \right )+2a \pmod{l_{2n+1}\left ( t \right ) -at }. \end{split} \end{equation*}$

We have

$\begin{equation*} \begin{split} &al_{\left ( 2n+1 \right )\left ( 2k+3 \right ) } \left ( t\right ) -al_{\left ( 2k+3 \right ) } \left ( t \right )\\ & = a\left ( l_{2\left ( 2n+1 \right ) }\left ( t \right ) l_{\left ( 2n+1 \right )\left ( 2k+1 \right ) }\left (t \right )-l_{\left (2n+1\right )\left ( 2k-1 \right ) } \left ( t \right ) \right )-a\left ( l_{2} \left (t \right )l_{2k+1}\left ( t \right )-l_{2k-1} \left (t \right ) \right ) \\ & \equiv \left ( bl_{ 1}^{2} \left ( t \right ) +2a \right )l_{\left ( 2n+1 \right )\left ( 2k+1 \right ) }\left ( t \right )-al_{\left ( 2n+1 \right )\left ( 2k-1 \right ) } \left ( t \right ) -\left ( bl_{ 1}^{2} \left ( t \right ) +2a \right ) l_{2k+1} \left ( t \right )+al_{2k-1}\left ( t \right ) \\ & \equiv \left ( abt^{2} +2 \right )\left ( al_{\left ( 2n+1 \right ) \left ( 2k+1 \right ) }\left ( t\right )-al_{2k+1}\left ( t \right ) \right ) - \left ( al_{\left ( 2n+1 \right )\left ( 2k-1 \right ) } \left ( t\right ) -al_{2k-1}\left (t \right ) \right ) \\ & \equiv 0 \pmod{l_{2n+1}\left ( t \right ) -at } . \end{split} \end{equation*}$

This completely proves Lemma 2. □

Proof of Theorem 1. We only prove (1.3), and the proofs for other identities are similar.

$\begin{equation*} \begin{split} \sum\limits _{k = 1}^{n}f_{2k}^{2m+1}\left ( t \right )& = \sum\limits_{k = 1}^{n}\left (\frac{a^{\varsigma \left ( 2k+1 \right ) } }{\left (ab \right )^{ \left \lfloor \frac{2k}{2} \right \rfloor} }\cdot \left ( \frac{\sigma ^{2k}\left ( t \right ) - \tau ^{2k} \left (t \right ) }{\sigma\left ( t \right ) - \tau \left (t \right ) } \right ) \right ) ^{2m+1} \\ & = \frac{a^{2m+1} }{\left ( \sigma\left (t \right ) -\tau \left ( t \right ) \right )^{2m+1} }\sum\limits _{k = 1}^{n}\frac{\left ( \sigma ^{2k}\left (t \right ) - \tau ^{2k} \left ( t \right ) \right )^{2m+1} }{\left ( ab \right )^{\left ( 2m+1 \right )k } } \\ & = \frac{a^{2m+1} }{\left ( \sigma\left (t\right ) -\tau \left ( t \right ) \right )^{2m+1} }\sum\limits _{k = 1}^{n}\sum\limits _{j = 0}^{2m+1}\left ( -1 \right )^{j} \binom{2m+1}{j} \frac{ \sigma^{2k\left ( 2m+1-j \right ) } \left ( t \right ) \tau ^{2kj} \left ( t \right ) }{\left ( ab \right )^{\left ( 2m+1 \right )k } } \\ & = \frac{a^{2m+1} }{\left ( \sigma\left ( t \right ) -\tau \left (t \right ) \right )^{2m+1} }\sum\limits _{j = 0}^{2m+1}\left ( -1 \right )^{j} \binom{2m+1}{j} \left ( \frac{1-\frac{\sigma ^{2n\left ( 2m+1-2j \right ) }\left (t \right ) }{\left ( ab \right )^{\left ( 2m+1-2j \right )n } } }{\frac{\left ( ab \right )^{2m+1-2j} }{\sigma ^{2\left ( 2m+1-2j \right ) }\left (t \right ) } -1} \right )\\ & = \frac{a^{2m+1} }{\left (\sigma\left (t \right ) -\tau \left (t\right ) \right )^{2m+1} }\sum\limits _{j = 0}^{m}\left ( -1 \right )^{j} \binom{2m+1}{j} \left ( \frac{1-\frac{\sigma ^{2n\left ( 2m+1-2j \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( 2m+1-2j \right )n } } }{\frac{\left ( ab \right )^{2m+1-2j} }{\sigma ^{2\left ( 2m+1-2j \right ) }\left (t \right ) } -1} - \frac{1-\frac{\sigma ^{2n\left ( 2j-1-2m \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( 2j-1-2m\right )n } } }{\frac{\left ( ab \right )^{2j-1-2m} }{\sigma ^{2\left ( 2j-1-2m \right ) }\left ( t \right ) } -1}\right )\\ & = \frac{a^{2m+1} }{\left ( \sigma\left ( t \right ) -\tau \left ( t \right ) \right )^{2m+1} }\sum\limits _{j = 0}^{m}\left ( -1 \right )^{j} \binom{2m+1}{j} \left ( \frac{\frac{\sigma^{2 \left ( 2m+1-2j \right ) }\left ( t\right ) }{\left ( ab \right )^{ 2m+1-2j } }- \frac{\sigma ^{\left ( 2n+2 \right ) \left ( 2m+1-2j \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( n+1 \right ) \left ( 2m+1-2j \right ) } } +1- \frac{\sigma ^{2n \left ( 2j-1-2m \right ) }\left (t \right ) }{\left ( ab \right )^{ \left ( 2j-1-2m \right ) n }} }{1- \frac{\sigma^{2 \left ( 2m+1-2j \right ) }\left ( t \right ) }{\left ( ab \right )^{ \left ( 2m+1-2j \right ) }}} \right )\\ & = \frac{a^{2m+1} }{\left ( \sigma\left ( t \right ) -\tau \left (t \right ) \right )^{2m+1} }\sum\limits _{j = 0}^{m}\left ( -1 \right )^{j} \binom{2m+1}{j}\\ & \quad \times \left ( \frac{\sigma^{2m+1-2j}\left ( t \right ) - \tau ^{2m+1-2j}\left ( t \right ) -\frac{\sigma^{\left ( 2n+1 \right ) \left ( 2m+1-2j \right ) }\left ( t \right )}{\left ( ab \right )^{\left ( 2m+1-2j \right )n } } +\frac{\tau ^{\left ( 2n+1 \right ) \left ( 2m+1-2j \right ) }\left (t \right )}{\left ( ab \right )^{ \left ( 2m+1-2j \right )n } }}{-\sigma ^{2m+1-2j}\left ( t \right ) -\tau ^{2m+1-2j}\left ( t \right ) } \right ) \\ & = \frac{a^{2m+1} }{b\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \sum\limits _{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m+1}{m-j}\left ( \frac{f_{\left ( 2n+1 \right )\left ( 2j+1\right ) }\left (t \right ) - f_{2j+1}\left (t \right ) }{l_{2j+1} \left ( t \right ) } \right ) . \end{split} \end{equation*}$

□

Proof of Theorem 2. We only prove (1.7), and the proofs for other identities are similar.

$\begin{equation*} \begin{split} \sum\limits _{k = 1}^{n}f_{2k}^{2m }\left ( t \right )& = \sum\limits_{k = 1}^{n}\left (\frac{a^{\varsigma \left ( 2k +1\right ) } }{\left (ab \right )^{ \left \lfloor \frac{2k}{2} \right \rfloor} }\cdot \left ( \frac{\sigma ^{2k}\left ( t\right ) - \tau ^{2k} \left ( t \right ) }{\sigma\left ( t\right ) - \tau \left (t \right ) } \right ) \right ) ^{2m} \\ & = \frac{a^{2m} }{\left ( \sigma\left (t \right ) -\tau \left (t \right ) \right )^{2m} }\sum\limits _{k = 1}^{n}\frac{\left ( \sigma^{2k}\left ( t\right ) - \tau ^{2k} \left ( t \right ) \right )^{2m} }{\left ( ab \right )^{ 2mk } } \\ & = \frac{a^{2m} }{\left ( \sigma\left ( t \right ) -\tau \left (t \right ) \right )^{2m} }\sum\limits _{k = 1}^{n}\sum\limits _{j = 0}^{2m}\left ( -1 \right )^{j} \binom{2m}{j} \frac{ \sigma^{2k\left ( 2m-j \right ) } \left (t \right ) \tau ^{2kj} \left ( t \right ) }{\left ( ab \right )^{2mk } }\\ & = \frac{a^{2m} }{\left (\sigma\left (t \right ) -\tau \left ( t \right ) \right )^{2m} }\sum\limits _{j = 0}^{2m}\left ( -1 \right )^{j} \binom{2m }{j} \left ( \frac{1-\frac{\sigma ^{2n\left ( 2m-2j \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( 2m-2j \right )n } } }{\frac{\left ( ab \right )^{2m-2j} }{\sigma ^{2\left ( 2m-2j \right ) }\left ( t \right ) } -1} \right ) \end{split} \end{equation*}$

$\begin{equation*} \begin{split} & = \frac{a^{2m} }{\left (\sigma\left (t \right ) -\tau \left ( t \right ) \right )^{2m} }\sum\limits _{j = 0}^{m}\left ( -1 \right )^{j} \binom{2m}{j} \left ( \frac{1-\frac{\sigma ^{2n\left ( 2m-2j \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( 2m-2j \right )n } } }{\frac{\left ( ab \right )^{2m-2j} }{\sigma ^{2\left ( 2m-2j \right ) }\left ( t \right ) } -1} +\frac{1-\frac{\sigma ^{2n\left ( 2j-2m \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( 2j-2m\right )n } } }{\frac{\left ( ab \right )^{2j-2m} }{\sigma ^{2\left ( 2j-2m \right ) }\left (t\right ) } -1}\right )\\ & \quad +\frac{a^{2m} }{\left ( \sigma \left ( t \right ) -\tau \left (t \right ) \right )^{2m} } \left ( -1 \right ) ^{m+1}\binom{2m}{m}n\\ & = \frac{a^{2m} }{\left (\sigma\left ( t \right ) -\tau \left (t \right ) \right )^{2m} }\sum\limits _{j = 0}^{m}\left ( -1 \right )^{j} \binom{2m}{j} \left ( \frac{\frac{\sigma ^{2 \left ( 2m -2j \right ) }\left ( t \right ) }{\left ( ab \right )^{ 2m -2j } }- \frac{\sigma ^{\left ( 2n+2 \right ) \left ( 2m -2j \right ) }\left ( t \right ) }{\left ( ab \right )^{\left ( n+1 \right ) \left ( 2m -2j \right ) } } -1+\frac{\sigma^{2n \left ( 2j -2m \right ) }\left ( t \right ) }{\left ( ab \right )^{ \left ( 2j -2m \right ) n }} }{1- \frac{\sigma^{2 \left ( 2m -2j \right ) }\left ( t \right ) }{\left ( ab \right )^{ 2m-2j }}} \right )\\ & \quad +\frac{a^{2m} }{\left (\sigma \left ( t \right ) -\tau \left ( t \right ) \right )^{2m} } \left ( -1 \right ) ^{m+1}\binom{2m}{m}n \\ & = \frac{a^{2m } }{\left ( \sigma\left ( t \right ) -\tau \left ( t \right ) \right )^{2m } }\sum\limits _{j = 0}^{m}\left ( -1 \right )^{j} \binom{2m }{j} \left ( \frac{\sigma^{2m -2j}\left ( t \right ) - \tau ^{2m -2j}\left (t\right ) -\frac{\sigma^{\left ( 2n+1 \right ) \left ( 2m -2j \right ) }\left (t \right )}{\left ( ab \right )^{n\left ( 2m -2j \right ) } } +\frac{\tau ^{\left ( 2n+1 \right ) \left ( 2m-2j \right ) }\left (t \right )}{\left ( ab \right )^{n\left ( 2m-2j \right ) } }}{ \tau ^{2m -2j}\left ( t \right )-\sigma ^{2m -2j}\left ( t \right ) } \right ) \\ & \quad +\frac{a^{2m} }{\left ( \sigma \left (t \right ) -\tau \left ( t \right ) \right )^{2m} } \left ( -1 \right ) ^{m+1}\binom{2m}{m}n\\ & = \frac{a^{2m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \sum\limits _{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m}{m-j}\left ( \frac{f_{2j\left ( 2n+1 \right ) }\left ( t \right ) - f_{ 2j}\left (t \right ) }{f_{ 2j} \left (t \right ) } \right ) +\frac{a^{2m} }{\left ( a^{2} b^{2} t^{2} +4ab \right )^{m} } \left ( -1 \right ) ^{m+1}\binom{2m}{m}n . \end{split} \end{equation*}$

□

Proof of Corollary 1. First, from the definition of $f_{n}\left (t \right)$ and binomial expansion, we easily prove $\left (f_{2n+1}\left (t \right)-1, a^{2} b^{2} t^{2} +4ab \right) = 1$ . Therefore, $\left (f_{2n+1}\left (t \right)-1, \left (a^{2} b^{2} t^{2} +4ab \right)^{m} \right) = 1$ . Now, we prove (1.11) by Lemma 1 and (1.3):

$\begin{equation*} \begin{split} &b l_{1} \left ( t\right ) l_{3} \left ( t \right ) \cdots l_{2m+1}\left ( t \right )\sum\limits _{k = 1}^{n}f_{2k}^{2m+1}\left ( t\right ) \\ & = l_{1} \left ( t\right ) l_{3} \left (t \right ) \cdots l_{2m+1}\left ( t \right ) \left ( \frac{a^{2m+1} }{\left ( \sigma\left (t \right ) -\tau \left (t \right ) \right )^{2m} } \sum\limits_{j = 0}^{m}\left ( -1 \right )^{m-j} \binom{2m+1}{m-j} \left ( \frac{f_{\left ( 2n+1 \right )\left ( 2j+1 \right ) }\left ( t \right ) -f_{2j+1}\left ( t \right ) }{l_{2j+1}\left (t\right ) } \right ) \right )\\ & \equiv 0\pmod{f_{2n+1}\left ( t \right ) -1}. \end{split} \end{equation*}$

Now, we use Lemma 2 and (1.5) to prove (1.12):

$\begin{equation*} \begin{split} &al_{1} \left ( t\right ) l_{3} \left ( t \right ) \cdots l_{2m+1}\left ( t\right )\sum\limits _{k = 1}^{n}l_{2k}^{2m+1}\left ( t \right ) \\ & = l_{1} \left ( t \right ) l_{3} \left (t \right ) \cdots l_{2m+1}\left ( t \right ) \left ( \sum\limits_{j = 0}^{m} \binom{2m+1}{m-j} \left ( \frac{al_{\left ( 2n+1 \right )\left ( 2j+1 \right ) }\left ( t\right ) -al_{2j+1}\left (t \right ) }{l_{2j+1}\left ( t \right ) } \right ) \right )\\ & \equiv 0\pmod{l_{2n+1}\left ( t \right ) -at}. \end{split} \end{equation*}$

□

3. Conclusions

In this paper, we discuss the power sums of bi-periodic Fibonacci and Lucas polynomials by Binet formulas. As corollaries of the theorems, we extend the divisible properties of the sum of power of linear Fibonacci and Lucas sequences to nonlinear Fibonacci and Lucas polynomials. An open problem is whether we extend the Melham conjecture to nonlinear Fibonacci and Lucas polynomials.

Use of AI tools declaration

The authors declare that they did not use Artificial Intelligence (AI) tools in the creation of this paper.

Acknowledgments

The authors would like to thank the editor and referees for their helpful suggestions and comments, which greatly improved the presentation of this work. All authors contributed equally to the work, and they have read and approved this final manuscript. This work is supported by Natural Science Foundation of China (12126357).

Conflict of interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

References

[1]	W. Hurewicz, Über eine verallgemeinerung des Borelschen theorems, Math. Z., 24 (1926), 401–421. https://doi.org/10.1007/BF01216792 doi: 10.1007/BF01216792
[2]	K. Menger, Einige Uberdeckungssätze der Punktmengenlehren, Gedruckt Unterstutzung Jerome Margaret Stonborough, 133 (1924), 421–444.
[3]	M. Scheepers, Combinatorics of open covers Ⅰ: Ramsey theory, Topol. Appl., 69 (1996), 31–62. https://doi.org/10.1016/0166-8641(95)00067-4 doi: 10.1016/0166-8641(95)00067-4
[4]	W. Just, A. W. Miller, M. Scheepers, P. J. Szeptycki, The combinatorics of open covers Ⅱ, Topol. Appl., 73 (1996), 241–266. https://doi.org/10.1016/S0166-8641(96)00075-2 doi: 10.1016/S0166-8641(96)00075-2
[5]	M. Scheepers, Selection principles and covering properties in topology, Note Mat., 22 (2003), 3–41. https://doi.org/10.1285/I15900932V22N2P3 doi: 10.1285/I15900932V22N2P3
[6]	F. Rothberger, Eine verscharfung der eigenschaft $c$ , Fund. Math., 30 (1938), 50–55. https://doi.org/10.4064/FM-30-1-50-55 doi: 10.4064/FM-30-1-50-55
[7]	T. Banakh, D. Repovš, Universal nowhere dense and meager sets in Menger manifolds, Topol. Appl., 161 (2014), 127–140. https://doi.org/10.1016/j.topol.2013.09.012 doi: 10.1016/j.topol.2013.09.012
[8]	D. Repovs, L. Zdomskyy, S. Zhang, Countable dense homogeneous filters and the Menger covering property, arXiv, 2014. https://doi.org/10.48550/arXiv.1406.0692
[9]	M. Scheepers, Selection principles and Baire spaces, Mat. Vesn., 61 (2009), 195–202.
[10]	D. Kocev, Almost Menger and related spaces, Mat. Vesn., 61 (2009), 173–180.
[11]	L. D. Kočinac, Star Menger and related spaces Ⅱ, Filomat, 13 (1999), 129–140.
[12]	L. D. Kočinac, Generalized open sets and selection properties, Filomat, 33 (2019), 1485–1493. https://doi.org/10.2298/fil1905485k doi: 10.2298/fil1905485k
[13]	L. D. Kočinac, T. M. Al-Shami, V. Çetkin, Selection principles in the context of soft sets: Menger spaces, Soft Comput., 25 (2021), 12693–12702. https://doi.org/10.1007/s00500-021-06069-6 doi: 10.1007/s00500-021-06069-6
[14]	T. M. Al-Shami, L. D. Kočinac, Nearly soft Menger spaces, J. Math., 2020 (2020), 3807418. https://doi.org/10.1155/2020/3807418 doi: 10.1155/2020/3807418
[15]	T. M. Al-Shami, L. D. Kočinac, Almost soft Menger and weakly soft Menger spaces, Appl. Comput. Math., 21 (2022), 35–51. https://doi.org/10.30546/1683-6154.21.1.2022.35 doi: 10.30546/1683-6154.21.1.2022.35
[16]	S. Özçağ, A. E. Eysen, Almost Menger property in bitopological spaces, Ukr. Math. J., 68 (2016), 950–958. https://doi.org/10.1007/s11253-016-1268-4 doi: 10.1007/s11253-016-1268-4
[17]	A. E. Eysen, S. Özçağ, Weaker forms of the Menger property in bitopological spaces, Quaest. Math., 41 (2018), 877–888.
[18]	A. E. Eysen, S. Özçağ, Investigations on weak versions of the Alster property in bitopological spaces and selection principles, Filomat, 33 (2019), 4561–4571. https://doi.org/10.2298/fil1914561E doi: 10.2298/fil1914561E
[19]	L. D. Kočinac, S. Özçağ, Versions of separability in bitopological spaces, Topol. Appl., 158 (2011), 1471–1477. https://doi.org/10.1016/j.topol.2011.05.019 doi: 10.1016/j.topol.2011.05.019
[20]	L. D. Kočinac, S. Özçağ, Bitopological spaces and selection principles, Proc. ICTA, 2011,243–255.
[21]	D. Lyakhovets, A. V. Osipov, Selection principles and games in bitopological function spaces, Filomat, 33 (2019), 4535–4540. https://doi.org/10.2298/fil1914535L doi: 10.2298/fil1914535L
[22]	A. V. Osipov, S. Özçağ, Variations of selective separability and tightness in function spaces with set-open topologies, Topol. Appl., 217 (2017), 38–50. https://doi.org/10.1016/j.topol.2016.12.010 doi: 10.1016/j.topol.2016.12.010
[23]	L. D. Kočinac, Variations of classical selection principles: an overview, Quaest. Math., 43 (2020), 1121–1153. https://doi.org/10.2989/16073606.2019.1601646 doi: 10.2989/16073606.2019.1601646
[24]	H. V. Chauhan, B. Singh, On almost Hurewicz property in bitopological spaces, Commun. Fac. Sci. Univ. Ank. Ser. A1 Math. Stat., 70 (2021), 74–81. https://doi.org/10.31801/cfsuasmas.710601 doi: 10.31801/cfsuasmas.710601
[25]	N. C. Açıkgöz, C. S. Elmalı, On almost set-Menger spaces in bitopological context, AIMS Math., 7 (2022), 20579–20593. https://doi.org/10.3934/math.20221128 doi: 10.3934/math.20221128
[26]	A. E. Eysen, S. Özçağ, Games relating to weak covering properties in bitopological spaces, Turk. J. Math., 44 (2020) 2297–2305. https://doi.org/10.3906/mat-2004-25 doi: 10.3906/mat-2004-25
[27]	R. Engelking, General topology, Berlin Heldermann, 1989.
[28]	B. P. Dvalishvili, Bitopological spaces: theory, relations with generalized algebraic structures, and applications, Elsevier, 2005. https://doi.org/10.1016/s0304-0208(05)x8090-2
[29]	A. Parvez, M. D. Khan, On nearly Menger and nearly star-Menger spaces, Filomat, 33 (2019), 6219–6227. https://doi.org/10.2298/fil1919219a doi: 10.2298/fil1919219a
[30]	L. A. Steen, J. A. Seebach, Counterexamples in topology, Dover Publication, 1995.
[31]	A. R. Singal, S. P. Arya, On pairwise almost regular spaces, Glasnik Math., 6 (1971), 335–343.
[32]	F. Commaroto, G. Santoro, Some counterexamples and properties on generalizations of Lindelöf spaces, Int. J. Math. Math. Sci., 19 (1996), 737–746. https://doi.org/10.1155/S0161171296001020 doi: 10.1155/S0161171296001020
[33]	M. K. Singal, A. R. Singal, Some more separation axioms in bitopological spaces, Ann. Son. Sci. Bruxelles, 84 (1970), 207–230.
[34]	A. Kilicman, Z. Salleh, On the pairwise weakly Lindelöf bitopological spaces, Bull. Iran. Math. Soc., 39 (2013), 469–486.
[35]	Z. Salleh, A. Kilicman, On pairwise nearly Lindelöf bitopological spaces, Far East J. Math. Sci., 77 (2013), 147–171.
[36]	S. N. Maheshwari, R. Prasad, Semi open sets and semi continuous function in bitopological spaces, Math. Notae, 26 (1977), 29–37.
[37]	F. H. Khedr, A. M. Alshibani, On pairwise supercontinuous mappings in bitopological spaces, Int. J. Math. Math. Sci., 14 (1991), 715–722. https://doi.org/10.1155/S0161171291000960 doi: 10.1155/S0161171291000960
[38]	M. C. Datta, Projective bitopological spaces Ⅱ, J. Aust. Math. Soc., 14 (1972), 119–128. https://doi.org/10.1017/S1446788700009708 doi: 10.1017/S1446788700009708
[39]	A. Lelek, Some cover properties of spaces, Fund. Math., 64 (1969), 209–218. https://doi.org/10.4064/FM-64-2-209-218 doi: 10.4064/FM-64-2-209-218
[40]	G. K. Banerjee, On pairwise almost strongly $\theta$ -continuous mappings, Bull. Cal. Math. Soc., 79 (1987), 314–320.
[41]	A. Sabah, M. D. Khan, L. D. Kočinac, Covering properties defined by semi-open sets, J. Nonlinear Sci. Appl., 9 (2016), 4388–4398. https://doi.org/10.22436/jnsa.009.06.79 doi: 10.22436/jnsa.009.06.79
[42]	M. Kule, Ş. Dost, $\beta$ -selection properties in ditopological texture spaces, Sigma J. Eng. Nat. Sci., 38 (2020), 1019–1029.
[43]	F. H. Khedr, S. M. Al-Areefi, T. Noiri, Precontinuity and semi-precontinuity in bitopological spaces, Indian J. Pure Appl. Math., 23 (1992), 625–633.
[44]	M. Jelic, A decomposition of pairwise continuity, J. Inst. Math. Comput. Sci. Math. Ser., 3 (1990), 25–29.
[45]	S. S. Kumar, On decomposition of pairwise continuity, Bull. Cal. Math. Soc., 89 (1997), 441–446.
[46]	G. Thamizharasi, P. Thangavelu, Remarks on closure and interior operators in bitopological spaces, J. Math. Sci. Comput. Appl., 1 (2010), 1–8. https://doi.org/10.5147/jmsca.v1i1.85 doi: 10.5147/jmsca.v1i1.85
[47]	N. C. Açıkgöz, C. S. Elmalı, On the extension of SD sets by using generalized open sets in bitopological spaces, Int. J. Nonlinear Anal. Appl., 14 (2023), 1627–1638. https://doi.org/10.22075/ijnaa.2022.27884.3747 doi: 10.22075/ijnaa.2022.27884.3747

Reader Comments

Your name:*

Email:*
© 2024 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)

通讯作者: 陈斌, bchen63@163.com

1.
沈阳化工大学材料科学与工程学院沈阳 110142

AIMS Mathematics

1.8 3.4

Metrics

Article views(543) PDF downloads(80) Cited by(0)

Preview PDF

Download XML

Export Citation

Article outline

Show full outline

AIMS Mathematics

Nearly Menger covering property via bitopological spaces

Related Papers:

Abstract

1. Introduction

2. Proofs of theorems

3. Conclusions

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Other Articles By Authors

Catalog

AIMS Mathematics

Nearly Menger covering property via bitopological spaces

Related Papers:

Abstract

1. Introduction

2. Proofs of theorems

3. Conclusions

Use of AI tools declaration

Acknowledgments

Conflict of interest

References

Reader Comments

通讯作者: 陈斌, bchen63@163.com

Metrics

Other Articles By Authors

Related pages

Tools

Export File

Citation

Format

Content

Catalog