This work surveys essential properties of the so-called copositive matrices, the study of which is spread over more than fifty-five years. Special emphasis is given to variational ...
A survey is given of results about coherence for categories with finite products and coproducts. For these results, which were published previously by the authors in several places...
We prove that the threshold for a random graph to have a k-core is equal to the threshold for having a subgraph which meets a necessary condition of Gallai for being k-critical. 1...
Word and tree codes are studied in a common framework, that of polypodes which are sets endowed with a substitution like operation. Many examples are given and basic properties are...
Recently Zagier proved a remarkable q-series identity. We show that this identity can also be proved by modifying Franklin's classical proof of Euler's pentagonal number...
We describe automated methods for constructing nonisomorphism proofs for pairs of graphs. The proofs can be human-readable or machinereadable. We have developed an experimental imp...
Arjeh M. Cohen, Jan Willem Knopper, Scott H. Murra...
We prove that there exists a structure M whose monadic second order theory is decidable, and such that the elementary theory of every expansion of M by a constant is undecidable. 1...
The Nash equilibria set (NES) is described as an intersection of graphs of best response mappings. The problem of NES computing for multi-matrix extended games is considered. A me...
Let a graph be locally disjoint union of three copies of complete graphs Kq-1 and let be cospectral with the Hamming graph H(3, q). Bang and Koolen [Asian-Eur. J. Math. 1 (2008),...
Abstract. We consider a multicriteria variant for the wellknown partition problem. A formula of the stability radius for an efficient solution was obtained. Mathematics Subject Cl...