Zobrazeno 1 - 9
of 9
pro vyhledávání: '"Kai An Sim"'
Publikováno v:
Mathematics, Vol 11, Iss 5, p 1107 (2023)
For a finite commutative ring R, let a,b,c∈R be fixed elements. Consider the equation ax+by=cz where x, y, and z are idempotents, units, and any element in the ring R, respectively. We say that R satisfies the r-monochromatic clean condition if, fo
Externí odkaz:
https://doaj.org/article/29517c4124264cdd989329c183504051
Autor:
Kai An Sim, Kok Bin Wong
Publikováno v:
Mathematics, Vol 10, Iss 12, p 1981 (2022)
Let p be a prime and Fp be the set of integers modulo p. Let χp be a function defined on Fp such that χp(0)=0 and for a∈Fp\{0}, set χp(a)=1 if a is a quadratic residue modulo p and χp(a)=−1 if a is a quadratic non-residue modulo p. Note that
Externí odkaz:
https://doaj.org/article/ea19dae6cd0a44a78e4dd1aaaf33bacc
Autor:
Kai An Sim, Kok Bin Wong
Publikováno v:
Mathematics, Vol 10, Iss 2, p 247 (2022)
By recalling van der Waerden theorem, there exists a least a positive integer w=w(k;r) such that for any n≥w, every r-colouring of [1,n] admits a monochromatic k-term arithmetic progression. Let k≥2 and rk(n) denote the minimum number of colour r
Externí odkaz:
https://doaj.org/article/d2c336904f2143a388243758c8cb4383
Autor:
Kai An Sim, Kok Bin Wong
Publikováno v:
Mathematics, Vol 9, Iss 18, p 2259 (2021)
In 1977, Davis et al. proposed a method to generate an arrangement of [n]={1,2,…,n} that avoids three-term monotone arithmetic progressions. Consequently, this arrangement avoids k-term monotone arithmetic progressions in [n] for k≥3. Hence, we a
Externí odkaz:
https://doaj.org/article/bbd97ebfad244407872cd3209c14e02c
Publikováno v:
Malaysian Journal of Fundamental and Applied Sciences. 19:236-262
Multiple state model is a mathematical model which is characterised by two important elements, transition intensity and transition probability. Critical illness has increased rapidly which is alarmed by the healthcare experts, and becoming an importa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7fe7a05fb08109c53af1fbef59af8a41
https://doi.org/10.11113/mjfas.v19n2.2848
https://doi.org/10.11113/mjfas.v19n2.2848
Publikováno v:
Clinical practice and epidemiology in mental health : CPEMH. 17
Objective: In light of the substantial clinical and societal burden of social phobia (SP) and impact on the sense of well-being of affected individuals, we sought to summarise extant data related to quality of life and relevant correlates in adults w
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fc9e4c79101286d44648301142780a8e
https://pubmed.ncbi.nlm.nih.gov/35173792
https://pubmed.ncbi.nlm.nih.gov/35173792
Publikováno v:
Bulletin of the Malaysian Mathematical Sciences Society. 41:1657-1670
The burning number b(G) of a graph G is used for measuring the speed of contagion in a graph. In this paper, we study the burning number of the generalized Petersen graph P(n, k). We show that for any fixed positive integer k, $$\lim _{n\rightarrow \
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::35e93feea50611d2ac08e4800be4f16b
https://doi.org/10.1007/s40840-017-0585-6
https://doi.org/10.1007/s40840-017-0585-6
Publikováno v:
Discrete Mathematics. 340:1693-1704
The lazy cop number is the minimum number of cops needed for the cops to have a winning strategy in the game of Cops and Robbers where at most one cop may move in any round. This variant of the game of Cops and Robbers, called Lazy Cops and Robbers,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b8b361edc0a59dc75df6e9af882d747c
https://doi.org/10.1016/j.disc.2016.09.031
https://doi.org/10.1016/j.disc.2016.09.031
Autor:
Kai An Sim, Gek L. Chia
Publikováno v:
Discrete Applied Mathematics. 161:2405-2409
The skewness of a graph G is the minimum number of edges in G whose deletion results in a planar graph. We prove some results concerning the skewness for the join of two graphs. We then use these results to determine completely the skewness of comple
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::88a2386df51f896ce373815ecd9098dd
https://doi.org/10.1016/j.dam.2013.03.023
https://doi.org/10.1016/j.dam.2013.03.023