2 papers
cs.LO2024
Decidability for Sturmian words
Philipp Hieronymi, Dun Ma, Reed Oei +3
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwa…
cs.DS2024
Scalable Multilevel and Memetic Signed Graph Clustering
Felix Hausberger, Marcelo Fonseca Faraj, Christian Schulz
In this study, we address the complex issue of graph clustering in signed graphs, which are characterized by positive and negative weighted edges representing attraction and repuls…