Year: 2024
Type: article
Abstract: Fix integers k , b , q with k ≥ 2 , b ≥ 0 , q ≥ 2 . Define the function p to be: p ( x ) = k x + b . We call a set S of integers \emph{ ( k , b , q ) -linear-free} if x ∈ S implies p i ( x ) ∉ S for all i = 1 , 2 , … , q − 1 , where p i ( x ) = p ( p i − 1 ( x ) ) and p 0 ( x ) = x . Such a set S is maximal in [ n ] := { 1 , 2 , … , n } if S ∪ { t } , ∀ t ∈ [ n ] ∖ S is not ( k , b , q ) -linear-free. Let M k , b , q ( n ) be the set of all maximal ( k , b , q ) -linear-free subsets of [ n ] , and define g k , b , q ( n ) = min S ∈ M k , b , q ( n ) | S | and f k , b , q ( n ) = max S ∈ M k , b , q ( n ) | S | . In this paper, formulae for g k , b , q ( n ) and f k , b , q ( n ) are proposed. Also, it is proven that there is at least one maximal ( k , b , q ) -linear-free subset of [ n ] with exactly x elements for any integer x between g k , b , q ( n ) and f k , b , q ( n ) , inclusively.
DOI: 10.61091/jcmcc120-28
Author: Nguyen Quang Minh
Institution: University of Cambridge
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: hybrid
OpenAlex ID: W4400485116