18 citations · 28 across the 17 of their papers we have counts for
22 papers
Extremal Trees With Prescribed Burning Numbers
Eugene Jun Tong Leong, Kai An Sim, Wen Chean Teh
Graph burning is motivated by the spread of social influence, and the burning number measures the speed of the spread. Given that the smallest burning number among the spanning tre…
Ternary is Still Good for Parikh Matrices
Robert Mercaş, Wen Chean Teh
The focus of this work is the study of Parikh matrices with emphasis on two concrete problems. In the first part of our presentation we show that a conjecture by Dick at al. in 202…
A Note on Graph Burning of Path Forests
Ta Sheng Tan, Wen Chean Teh
Graph burning is a natural discrete graph algorithm inspired by the spread of social contagion. Despite its simplicity, some open problems remain steadfastly unsolved, notably the…
Burnability of Double Spiders and Path Forests
Ta Sheng Tan, Wen Chean Teh
The burning number of a graph can be used to measure the spreading speed of contagion in a network. The burning number conjecture is arguably the main unresolved conjecture related…
Counting Subwords in Circular Words and Their Parikh Matrices
Ghajendran Poovanandran, Jamie Simpson, Wen Chean Teh
The word inference problem is to determine languages such that the information on the number of occurrences of those subwords in the language can uniquely identify a word. A consid…
Ranks of Strictly Minimal Reaction Systems Induced by Permutations and Cartesian Product
Wen Chean Teh, Kien Trung Nguyen, Chuei Yee Chen
Reaction system is a computing model inspired by the biochemical interaction taking place within the living cells. Various extended or modified frameworks motivated by biological,…
Simulation Of Reaction Systems By The Strictly Minimal Ones
Wen Chean Teh, Adrian Atanasiu
Reaction systems, introduced by Ehrenfeucht and Rozenberg, are elementary computational models based on biochemical reactions transpiring within the living cells. Numerous studies…
Graph Burning: Tight Bounds on the Burning Numbers of Path Forests and Spiders
Ta Sheng Tan, Wen Chean Teh
In 2016, Bonato, Janssen, and Roshanbin introduced graph burning as a discrete process that models the spread of social contagion. Although the burning process is a simple algorith…
M-Ambiguity Sequences for Parikh Matrices and Their Periodicity Revisited
Wen Chean Teh, Ghajendran Poovanandran
The introduction of Parikh matrices by Mateescu et al. in 2001 has sparked numerous new investigations in the theory of formal languages by various researchers, among whom is Serba…
Parikh Word Representability of Bipartite Permutation Graphs
Wen Chean Teh, Zhen Chuan Ng, Muhammad Javaid +1
The class of Parikh word representable graphs were recently introduced. In this work, we further develop its general theory beyond the binary alphabet. Our main result shows that t…
Parikh Matrices for Powers of Words
Adrian Atanasiu, Ghajendran Poovanandran, Wen Chean Teh
Certain upper triangular matrices, termed as Parikh matrices, are often used in the combinatorial study of words. Given a word, the Parikh matrix of that word elegantly computes th…
Parikh Motivated Study on Repetitions in Words
Ghajendran Poovanandran, Adrian Atanasiu, Wen Chean Teh
We introduce the notion of general prints of a word, which is substantialized by certain canonical decompositions, to study repetition in words. These associated decompositions, wh…
Compositions of Functions and Permutations Specified by Minimal Reaction Systems
Wen Chean Teh
This paper studies mathematical properties of reaction systems that was introduced by Enrenfeucht and Rozenberg as computational models inspired by biochemical reaction in the livi…
A Ramsey Algebraic Study of Matrices
Zu Yao Teoh, Wen Chean Teh
The notion of a topological Ramsey space was introduced by Carlson some 30 years ago. Studying the topological Ramsey space of variable words, Carlson was able to derive many class…
Are Ramsey Algebras Essentially Semigroups
ZuYao Teoh, Andrew Rajah, Wen Chean Teh
It is known that semigroups are Ramsey algebras. This paper is an attempt to understand the role associativity plays in a binary system being a Ramsey algebra. Specifically, we sho…
Strong 2.t and Strong 3.t Transformations for Strong M-equivalence
Ghajendran Poovanandran, Wen Chean Teh
Parikh matrices have been extensively investigated due to their usefulness in studying subword occurrences in words. Due to the dependency of Parikh matrices on the ordering of the…
Heterogeneous Ramsey Algebras and Classification of Ramsey Vector Spaces
Zu Yao Teoh, Wen Chean Teh
Carlson introduced the notion of a Ramsey space as a generalization to the Ellentuck space. When a Ramsey space is induced by an algebra, Carlson suggested a study of its purely co…
Ramsey Orderly Algebras as a New Approach to Ramsey Algebras
Wen Chean Teh, Zu Yao Teoh
Ramsey algebras are algebras that induce Ramsey spaces, which are generalizations of the Ellentuck space and Milliken's space. Previous work suggests a possible local version of Ra…
Parikh matrices and Parikh Rewriting Systems
Wen Chean Teh
Since the introduction of the Parikh matrix mapping, its injectivity problem is on top of the list of open problems in this topic. In 2010 Salomaa provided a solution for the terna…
Ramsey Algebra and the Existence of Idempotent Ultrafilters
Wen Chean Teh
Hindman's Theorem says that every finite coloring of the positive natural numbers has a monochromatic set of finite sums. Ramsey algebras, recently introduced, are structures that…
Parikh Matrices and Strong M-Equivalence
Wen Chean Teh
Parikh matrices have been a powerful tool in arithmetizing words by numerical quantities. However, the dependence on the ordering of the alphabet is inherited by Parikh matrices. S…
Ramsey Algebras
Wen Chean Teh
Hindman's theorem says that every finite coloring of the natural numbers has a monochromatic set of finite sums. Ramsey algebras are structures that satisfy an analogue of Hindman'…