Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:
ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Home/Authors/Sarit Pasiphol

Sarit Pasiphol

1 indexed paper

Recent (6 mo)
1
With code
0
Influential cites
0
Benchmarked
0

Publications per year

1
26

Top categories

Combinatorics×1Crypto×1

Frequent co-authors

Sarunyu Thongjarast1×
Suthee Ruangwises1×

Research Timeline

2026
Cyclic Equalizability Characterized by Parikh Vectors

This paper completely characterizes cyclic equalizability for two words over any finite alphabet by proving that the words must share the same Parikh vector.

Highlighted terms show continued research focus across papers

Papers

math.COcs.CRRecentApr 21, 2026

Cyclic Equalizability Characterized by Parikh Vectors

Sarunyu Thongjarast, Sarit Pasiphol, Suthee Ruangwises

This paper completely characterizes cyclic equalizability for two words over any finite alphabet by proving that the words must share the same Parikh vector.

View →