3 papers
math.CO2025
Voting Profiles Admitting All Candidates as Knockout Winners
Bernard De Baets, Emilio De Santis
A set of candidates is presented to a commission. At every round, each member of this commission votes by pairwise comparison, and one-half of the candidates is deleted from…
math.DS2025
Conditional traffic-like rules for particle-flow simulation in cellular automata
B. Wolnik, D. M. Falkiewicz, W. BoÅt +2
This paper presents a novel approach to the description and understanding of two-dimensional binary cellular automata with the Moore neighborhood that preserve the number of active…
math.DS2025
Cellular automata can really solve the parity problem
Barbara Wolnik, Anna Nenca, Pedro Paulo Balbi +1
Determining properties of an arbitrary binary sequence is a challenging task if only local processing is allowed. Among these properties, the determination of the parity of 1s by d…