researcher

P. Ochem

41 papers hereh-index 211.3k citations106 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position

sole author3
first author8
middle author17
last author11

Across the 39 of 41 papers where every author was matched, so the position is known.

fields

math.CO19
cs.DM18
cs.FL2
cs.DS1
math.GM1

identity via Semantic Scholar / OpenAlex

activity

20032026

most citedIslands in graphs on surfaces

12 citations · 46 across the 32 of their papers we have counts for

collaborators

Showing 2018 · math.COShow all

2 papers · 2 filters

math.CO2018

Avoiding conjugacy classes on the 5-letter alphabet

Golnaz Badkobeh, Pascal Ochem

We construct an infinite word $w$ over the $5$ -letter alphabet such that for every factor $f$ of $w$ of length at least two, there exists a cyclic permutation of $f$ that is not a…

math.CO2018

On non-repetitive sequences of arithmetic progressions:the cases $k \in {4, 5, 6, 7, 8}$

Borut Lužar, Martina Mockovčiaková, Pascal Ochem +2

A $d$ -subsequence of a sequence $φ = x_{1} \dots x_{n}$ is a subsequence $x_{i} x_{i + d} x_{i + 2 d} \dots$ , for any positive integer $d$ and any $i$ , $1 \leq i \leq n$ . A \textit{ $k$ -Thue seque…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore

Search
Researchers
Institutions

Account

Library
Chat

Data

arXiv.org
Semantic Scholar
OpenAlex
Latest RSS

About Contact Privacy Developers llms.txt openapi.json

Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.

Avoiding conjugacy classes on the 5-letter alphabet

On non-repetitive sequences of arithmetic progressions:the cases k∈{4,5,6,7,8}

On non-repetitive sequences of arithmetic progressions:the cases $k \in {4, 5, 6, 7, 8}$