Related papers: Relations with a fixed interval exchange transform…
Randomness (in the sense of being generated in an IID fashion) and exchangeability are standard assumptions in nonparametric statistics and machine learning, and relations between them have been a popular topic of research. This short paper…
We show that every dense subgroup of a connected Lie group G contains a dense subgroup generated by 2d elements, where d=dim(G). We also give a detailed proof for the quantitive characterization of a contracting projective transformation in…
We describe the group of $\mathbb Z$-linear automorphisms of the ring of integers of a number field $K$ that preserve the set $V_{K,k}$ of $k$th power-free integers: every such map is the composition of a field automorphism and the…
We investigate the proportion of fixed point free permutations (derangements) in finite transitive permutation groups. This article is the first in a series where we prove a conjecture of Shalev that the proportion of such elements is…
We analyze general aspects of exchangeable quantum stochastic processes, as well as some concrete cases relevant for several applications to Quantum Physics and Probability. We establish that there is a one-to-one correspondence between…
We introduce the notion of iterated group extensions, which, roughly speaking, is what one obtains by forming a group extension of a group extension. We interpret iterated extensions in terms of group cohomology, in the same way as…
In this work, we introduce the \emph{interval permutation segment (IP-SEG)} model that naturally generalizes the geometric intersection models of interval and permutation graphs. We study properties of two graph classes that arise from the…
We give new examples of simple finitely generated groups arising from actions of free abelian groups on the Cantor sets. As particular examples, we discuss groups of interval exchange transformations, and a group naturally associated with…
We study and extend the conditions for asociativity on fusion over antielement free $\sigma$-sets to introduce a group to solve $\sigma$-set equations. $\sigma$-sets as a theory of sets and antisets is sumarized and used as a framework to…
In this article, we consider skew product extensions over symmetric interval exchange transformations with respect to the cocycle $f(x)=\chi_{(0,1/2)}-\chi_{(1/2,1)}$. More precisely, we prove that for almost every interval exchange…
We investigate the relation between bifix codes and interval exchange transformations. We prove that the class of natural codings of regular interval echange transformations is closed under maximal bifix decoding.
The set of idempotents of any semigroup carries the structure of a biordered set, which contains a great deal of information concerning the idempotent generated subsemigroup of the semigroup in question. This leads to the construction of a…
The random permutation is the Fra\"iss\'e limit of the class of finite structures with two linear orders. Answering a problem stated by Peter Cameron in 2002, we use a recent Ramsey-theoretic technique to show that there exist precisely 39…
This paper argues for a wider use of the functional theory of randomness, a modification of the algorithmic theory of randomness getting rid of unspecified additive constants. Both theories are useful for understanding relationships between…
The statistical mechanics characterization of a finite subsystem embedded in an infinite system is a fundamental question of quantum physics. Nevertheless, a full closed form { for all required entropic measures} does not exist in the…
There is a connection between permutation groups and permutation patterns: for any subgroup $G$ of the symmetric group $S_\ell$ and for any $n \geq \ell$, the set of $n$-permutations involving only members of $G$ as $\ell$-patterns is a…
Invertible fermionic topological (IFT) phases are gapped phases of matter with nondegenerate ground states on any closed spatial manifold. When open boundary conditions are imposed, nontrivial IFT phases support gapless boundary degrees of…
We give an account on what is known on the subject of permutation matchings, which are bijections of a finite regular semigroup that map each element to one of its inverses. This includes partial solutions to some open questions, including…
We discuss the classical statement of group classification problem and some its extensions in the general case. After that, we carry out the complete extended group classification for a class of (1+1)-dimensional nonlinear…
Trait allocations are a class of combinatorial structures in which data may belong to multiple groups and may have different levels of belonging in each group. Often the data are also exchangeable, i.e., their joint distribution is…