*Discrete Mathematics and Theoretical Computer Science*in Alba Iulia

**:**

**Uniform distribution for a class of**

*k*-paradoxical oriented graphs*By using estimates for incomplete character sums with polynomial arguments, we provide uniform distribution results for the dominating sets in a class of k-paradoxical regular oriented graphs, including the Paley tournaments. Moreover, we will explore a method of quasi-random tournament generation from fi nite sets of natural numbers, by using the greatest prime factor function.*