Avraham Naumovich Trahtman (Trakhtman) (Russian: Абрам Наумович Трахтман; 10 February 1944 – 17 July 2024) was a Soviet-born Israeli mathematician and academic at Bar-Ilan University (Israel).

In 2007, Trahtman solved a problem in combinatorics that had been open for 37 years, the Road Coloring Conjecture posed in 1970.

[2] Trahtman's solution to the road coloring problem was accepted in 2007 and published in 2009 by the Israel Journal of Mathematics.

The road coloring problem was raised by R. L. Adler and L. W. Goodwyn from the United States, and the Israeli mathematician B.

[6][7][8] The problem of estimating the length of synchronizing word has a long history and was posed independently by several authors, but it is commonly known as the Černý conjecture.

[9] If this is true, it would be tight: in his 1964 paper, Černý exhibited a class of automata (indexed by the number n of states) for which the shortest reset words have this length.

[22] There are results in theoretical mechanics[23] and in the promising area of extracting moisture from the air[24] mentioned in "New Scientist".