Related papers: Interval exchanges, admissibility and branching Ra…
We prove that an inductive limit of aperiodic noncommutative Cartan inclusions is a noncommutative Cartan inclusion whenever the connecting maps are injective, preserve normalisers and entwine conditional expectations. We show that under…
We study the group of interval exchange transformations. Let $T$ be an $m$-interval exchange transformation. By the rank of $T$ we mean the dimension of the $\mathbb{Q}$-vector space spanned by the lengths of the exchanged subintervals. We…
The prefix exchange distance of a permutation is the minimum number of exchanges involving the leftmost element that sorts the permutation. We give new combinatorial proofs of known results on the distribution of the prefix exchange…
The translation of an operator is defined by using conjugation with time-frequency shifts. Thus, one can define $\Lambda$-shift-invariant subspaces of Hilbert-Schmidt operators, finitely generated, with respect to a lattice $\Lambda$ in…
Consider a linear regression model with independent and identically normally distributed random errors. Suppose that the parameter of interest is a specified linear combination of the regression parameters. We prove that the usual…
An interval matrix is a matrix whose entries are intervals in the set of real numbers. We generalize this concept, which has been broadly studied, to other fields. Precisely we define a rational interval matrix to be a matrix whose entries…
We exhibit an explicit full measure class of minimal interval exchange maps T for which the cohomological equation $\Psi -\Psi\circ T=\Phi$ has a bounded solution $\Psi$ provided that the datum $\Phi$ belongs to a finite codimension…
The formalism used in describing the thermodynamics of abrupt (or first-order) phase transitions is reviewed as an application of maximum entropy inference. In this treatment, we show that the concepts of transition temperature, latent heat…
Given any two forests with the same degree sequence, we show in an algorithmic way that one can be transformed into the other by a sequence of 2-switches in such a way that all the intermediate graphs of the transformation are forests. We…
We consider a transfer operator where two interacting cells carrying non-negative traits transfer a random fraction of their trait to each other. These transfers can lead to population having singular distributions in trait. We extend the…
Admissible vectors lead to frames or coherent states under the action of a group by means of square integrable representations. This work shows that admissible vectors can be seen as weights with central support on the (left) group von…
We consider a continuous-time branching random walk on a multidimensional lattice in a random branching medium. It is theoretically known that, in such branching random walks, large rare fluctuations of the medium may lead to anomalous…
Symbolic regression via genetic programming is a flexible approach to machine learning that does not require up-front specification of model structure. However, traditional approaches to symbolic regression require the use of protected…
We provide an analytical argument for understanding the likely nature of parameter shifts between those coming from an analysis of a dataset and from a subset of that dataset, assuming differences are down to noise and any intrinsic…
Fuzzy circular interval graphs are a generalization of proper circular arc graphs and have been recently introduced by Chudnovsky and Seymour as a fundamental subclass of claw-free graphs. In this paper, we provide a polynomial-time…
The construction of affine interval exchange maps with wandering intervals that are semi-conjugate with a given self-similar interval exchange map is strongly related with the existence of the so called minimal sequences associated with…
If $\mathcal{A}$ is a finite set (alphabet), the shift dynamical system consists of the space $\mathcal{A}^{\mathbb{N}}$ of sequences with entries in $\mathcal{A}$, along with the left shift operator $S$. Closed $S$-invariant subsets are…
We investigate several questions related to the notion of recognizable morphism. The main result is a new proof of Moss\'e's theorem and actually of a generalization to non primitive morphisms due to Berth\'e et al. We actually prove the…
When knowledge is obtained from a database, it is only possible to deduce confidence intervals for probability values. With confidence intervals replacing point values, the results in the set covering model include interval constraints for…
We describe the infinite interval exchange transformations, called the rotated odometers, that are obtained as compositions of finite interval exchange transformations and the von Neumann-Kakutani map. We show that with respect to Lebesgue…