For centuries we struggled with the concept of spatial rotations. We used to represent them in many different ways: mostly, Euler Angles and matrices. Those all had drawbacks and failed in specific edge cases that required manual/special treatment. Suddenly, we found out about quaternions. Those allow us to describe spatial rotations in a much more natural way. Formulas using quaternions require no special treatments, no "ifs". They clearly have lower kolmogorov complexity.
I feel like number themselves are in the state spatial rotations were. We can describe and represent them in many different ways; yet, those reps are complex and seemingly fail in some edge cases - infinities and division by 0, for example, has required all sorts of special treatments through the whole history of math. Those days, I've found about graphical linear algebra, which is basically a graphical, not syntactical, treatment for different kinds of numbers. Not only it looks to be a much more elegant description of numbers, but it also seems to cover edge cases: division by 0 works, has meaningful representations and requires no special treatment. Algorithms written for that representation clearly have lower Kolmogorov Complexity.
I'm looking for insights.
Is it meaningful to look for "elegant" representation of mathematical objects?
Is it possible to measure elegance quantitively? I.e., can we formalize such search? Is Kolmogorov Complexity related?
Am I wrong in thinking this graphical view is truly more elegant and than the traditional representations?