Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...
The problem of classifying all the avoidable binary patterns in words has been completely solved (see Chapter 3 of M. Lothaire, Algebraic Combinatorics on Words, Cambridge Universi...
Francine Blanchet-Sadri, Robert Mercas, Sean Simmo...
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
We present a new algorithm for computing zigzag persistent homology, an algebraic structure which encodes changes to homology groups of a simplicial complex over a sequence of sim...
Nikola Milosavljevic, Dmitriy Morozov, Primoz Skra...
The intuitive properties of configurations of planar non-overlapping closed curves (boundaries) are presented as a pure boundary mathematics. The mathematics, which is not incorpor...