\documentclass[oneside,final,12pt]{book}

\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{xunicode}

\usepackage{hyperref}
\usepackage{xstring}
\def\rooturl{https://www.math.bgu.ac.il/}
\hyperbaseurl{\rooturl}
\let\hhref\href
\providecommand{\extrahref}[2][]{\LTRfootnote{\LR{\IfBeginWith*{#2}{http}{\nolinkurl{#2}}{\nolinkurl{\rooturl#2}}}}}
\renewcommand{\href}[2]{\IfBeginWith*{#1}{http}{\hhref{#1}{#2}}{\hhref{\rooturl#1}{#2}}\extrahref{#1}}

\usepackage{polyglossia}
\usepackage{longtable}
%% even in English, we sometimes have Hebrew (as in course hours), and we
%% can't add it in :preamble, since it comes after hyperref
%%\usepackage{bidi}
\setdefaultlanguage{english}
\setotherlanguage{hebrew}
%%\setmainfont[Ligatures=TeX]{Libertinus Serif}
\setmainfont[Script=Hebrew,Ligatures=TeX]{LibertinusSerif}[
  UprightFont = *-Regular,
  BoldFont = *-Bold,
  ItalicFont = *-Italic,
  BoldItalicFont = *-BoldItalic,
  Extension = .otf]

\SepMark{‭.}
\robustify\hebrewnumeral
\robustify\Hebrewnumeral
\robustify\Hebrewnumeralfinal

% vim: ft=eruby.tex:



\begin{document}
\pagestyle{empty}
\pagenumbering{gobble}

\begin{center}
\vspace*{\baselineskip}

{\Large Department of Mathematics, BGU}

\vspace*{\baselineskip}

\rule{\textwidth}{1.6pt}\vspace*{-\baselineskip}\vspace*{2pt}
\rule{\textwidth}{0.4pt}\\[\baselineskip]

{\Huge BGU Probability and Ergodic Theory  (PET) seminar}\\[0.2\baselineskip]

\rule{\textwidth}{0.4pt}\vspace*{-\baselineskip}\vspace{3.2pt}
\rule{\textwidth}{1.6pt}\\[\baselineskip]

\textbf{On} \emph{Thursday, May 23, 2019}
\bigskip

\textbf{At} \emph{11:10 -- 12:00}
\bigskip

\textbf{In} \emph{-101}

\vspace*{2\baselineskip}

{\large\scshape  J.C. Saunders 
  %
  (Ben-Gurion University)
}
\bigskip

will talk about
\bigskip

{\Large\bfseries On (a,b) Pairs in Random Fibonacci Sequences\par}
\bigskip

\end{center}
\vfill

\textsc{Abstract:}
\begin{longtable}{|l|l|l|}
\hline
We deal with the random Fibonacci tree, which is an inﬁnite binary tree with nonnegative integers at each node. The root consists of the number 1 with a single child, also the number 1. We deﬁne the tree recursively in the following way: if x is the parent of y, then y has two children, namely & x−y & and x+y. This tree was studied by Benoit Rittaud who proved that any pair of integers a,b that are coprime occur as a parent-child pair inﬁnitely often. We extend his results by determining the probability that a random inﬁnite walk in this tree contains exactly one pair (1,1), that being at the root of the tree. Also, we give tight upper and lower bounds on the number of occurrences of any speciﬁc coprime pair (a,b) at any given ﬁxed depth in the tree.\\
\hline
\end{longtable}








% vim: ft=eruby.tex:


\end{document}

% vim: ft=eruby.tex:
