12 citations · 46 across the 32 of their papers we have counts for
41 papers
On odd perfect numbers with exactly one even exponent greater than 2
Pascal Ochem, Joshua Zelinsky
We show that if all the even exponents of an odd perfect number N are equal to 2 except for one, then divides N .
Words avoiding the morphic images of most of their factors
Pascal Ochem, Matthieu Rosenfeld
We say that a finite factor of a word is \emph{imaged} if there exists a non-erasing morphism , distinct from the identity, such that contains . We show that e…
Contact graphs of boxes with unidirectional contacts
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
This paper is devoted to the study of particular geometrically defined intersection classes of graphs. Those were previously studied by Magnant and Martin, who proved that these gr…
Complement Avoidance in Binary Words
James Currie, L'ubomíra Dvořaková, Pascal Ochem +3
The complement of a binary word is obtained by changing each in to and vice versa. We study infinite binary words that avoid sufficiently lar…
Antisquares and Critical Exponents
Aseem Baranwal, James Currie, Lucas Mol +3
The (bitwise) complement of a binary word is obtained by changing each in to and vice versa. An is a nonempty word of the form…
Pseudoperiodic Words and a Question of Shevelev
Joseph Meleshko, Pascal Ochem, Jeffrey Shallit +1
We generalize the familiar notion of periodicity in sequences to a new kind of pseudoperiodicity, and we prove some basic results about it. We revisit the results of a 2012 paper o…