Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A proof that a word of length n has less than 1.5n distinct squares   We are interested in the maximal number of distinct squares in a word. This
problem was introduced by Fraenkel and Simpson, who presented a bound of 2n for
a word of length n, and conjectured that the bound was less than n. Being that
the problem is on repetitions, their solution relies on Fine and Wilf's
Periodicity lemma. Ilie then refined their result and presented a bound of
2n-O(log n). Lam used an induction to get a bound of 95n/48. Deza, Franek and
Thierry achieved a bound of 11n/6 through a combinatorial approach. Using the
properties of the core of the interrupt, presented by Thierry, we refined here
the combinatorial structures exhibited by Deza, Franek and Thierry to offer a
bound of 3n/2.

15
The categories of this paper are: nucl-ex
34
The categories of this paper are: chem-ph
26
The categories of this paper are: bayes-an
18
The categories of this paper are: econ
11
The categories of this paper are: hep-lat
5
The categories of this paper are: gr-qc
6
The categories of this paper are: astro-ph
21
The categories of this paper are: adap-org
20
The categories of this paper are: acc-phys
35
The categories of this paper are: mtrl-th
24
The categories of this paper are: dg-ga
1
The categories of this paper are: cs
17
The categories of this paper are: q-fin
36
The categories of this paper are: cmp-lg
16
The categories of this paper are: stat
28
The categories of this paper are: alg-geom