ﻻ يوجد ملخص باللغة العربية
We describe a generalization of a result of Boshernitzan and Carroll: an extension of Lagranges Theorem on continued fraction expansion of quadratic irrationals to interval exchange transformations. In order to do this, we use a two-sided version of the Rauzy induction. In particular, we show that starting from an interval exchange transforma- tion whose lengths are defined over a quadratic field and applying the two-sided Rauzy induction, one can obtain only a finite number of new transformations up to homothety.
The Arnoux-Rauzy systems are defined in cite{ar}, both as symbolic systems on three letters and exchanges of six intervals on the circle. In connection with a conjecture of S.P. Novikov, we investigate the dynamical properties of the interval exchang
A lower bound is obtained for the greatest possible number of colors in an interval colourings of some regular graphs.
A matching $M$ in a graph $G$ is said to be uniquely restricted if there is no other matching in $G$ that matches the same set of vertices as $M$. We describe a polynomial-time algorithm to compute a maximum cardinality uniquely restricted matching i
An edge-coloring of a graph $G$ with colors $1,2,ldots,t$ is an interval $t$-coloring if all colors are used, and the colors of edges incident to each vertex of $G$ are distinct and form an interval of integers. A graph $G$ is interval colorable if i
This note resolves an open problem asked by Bezrukov in the open problem session of IWOCA 2014. It shows an equivalence between regular graphs and graphs for which a sequence of invariants presents some symmetric property. We extend this result to a few other sequences.