Restricted coloring of 1-by-n chessboards

Ronit Mansour; Amal Sharif-Rasslan

doi:10.47443/dml.2021.0068

Restricted coloring of 1-by-n chessboards

Ronit Mansour, Amal Sharif-Rasslan

Research output: Contribution to journal › Article › peer-review

Abstract

In this note, we answer the following question: in how many ways one can color a 1 × n chessboard using colors from the set {1, 2, …, m} such that the color i occurs a multiple of t_i number of times for all i = 1, 2, …, m?.

Original language	English
Pages (from-to)	90-93
Number of pages	4
Journal	Discrete Mathematics Letters
Volume	7
DOIs	https://doi.org/10.47443/dml.2021.0068
State	Published - 2021
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2021 the authors.

Keywords

Coloring chessboard
Generating function

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.47443/dml.2021.0068

Cite this

@article{c6e973fe695145d386ad675ba0ccd1ca,

title = "Restricted coloring of 1-by-n chessboards",

abstract = "In this note, we answer the following question: in how many ways one can color a 1 × n chessboard using colors from the set {1, 2, …, m} such that the color i occurs a multiple of ti number of times for all i = 1, 2, …, m?.",

keywords = "Coloring chessboard, Generating function",

author = "Ronit Mansour and Amal Sharif-Rasslan",

note = "Publisher Copyright: {\textcopyright} 2021 the authors.",

year = "2021",

doi = "10.47443/dml.2021.0068",

language = "English",

volume = "7",

pages = "90--93",

journal = "Discrete Mathematics Letters",

issn = "2664-2557",

publisher = "Shahin Digital Publisher",

}

TY - JOUR

T1 - Restricted coloring of 1-by-n chessboards

AU - Mansour, Ronit

AU - Sharif-Rasslan, Amal

PY - 2021

Y1 - 2021

N2 - In this note, we answer the following question: in how many ways one can color a 1 × n chessboard using colors from the set {1, 2, …, m} such that the color i occurs a multiple of ti number of times for all i = 1, 2, …, m?.

AB - In this note, we answer the following question: in how many ways one can color a 1 × n chessboard using colors from the set {1, 2, …, m} such that the color i occurs a multiple of ti number of times for all i = 1, 2, …, m?.

KW - Coloring chessboard

KW - Generating function

UR - http://www.scopus.com/inward/record.url?scp=85113860822&partnerID=8YFLogxK

U2 - 10.47443/dml.2021.0068

DO - 10.47443/dml.2021.0068

M3 - Article

AN - SCOPUS:85113860822

SN - 2664-2557

VL - 7

SP - 90

EP - 93

JO - Discrete Mathematics Letters

JF - Discrete Mathematics Letters

ER -

Restricted coloring of 1-by-n chessboards

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this