Related papers: A monotone isomorphism theorem
Quantum theory stipulates that if two particles are identical in all physical aspects, the allowed states of the system are either symmetric or antisymmetric with respect to permutations of the particle labels. Experimentally, the symmetry…
The probability that two randomly selected phylogenetic trees of the same size are isomorphic is found to be asymptotic to a decreasing exponential modulated by a polynomial factor. The number of symmetrical nodes in a random phylogenetic…
Given two tuples of subspaces, can you tell whether the tuples are isomorphic? We develop theory and algorithms to address this fundamental question. We focus on isomorphisms in which the ambient vector space is acted on by either a unitary…
We obtain the following embedding theorem for symbolic dynamical systems. Let $G$ be a countable amenable group with the comparison property. Let $X$ be a strongly aperiodic subshift over $G$. Let $Y$ be a strongly irreducible shift of…
Two factorizations of a permutation into products of cycles are equivalent if one can be obtained from the other by repeatedly interchanging adjacent disjoint factors. This paper studies the enumeration of equivalence classes under this…
We consider pairs of commuting isometries that are annihilated by a polynomial. We show that the polynomial must be inner toral, which is a geometric condition on its zero set. We show that cyclic pairs of commuting isometries are nearly…
Every symbolic system supports a Borel measure that is invariant under the shift, but it is not known if every such systems supports a measure that is invariant under all of its automorphisms; known as a characteristic measure. We give…
The family of symmetric one sided subshifts in two symbols given by a sequence $a$ is studied. We analyse some of their topological properties such as transitivity, the specification property and intrinsic ergodicity. It is shown that…
We consider the problem of when a symbolic dynamical system supports a Borel probability measure that is invariant under every element of its automorphism group. It follows readily from a classical result of Parry that the full shift on…
Given any two sequences of complex numbers, we establish simple relations between their binomial convolution and the binomial convolution of their individual binomial transforms. We employ these relations to derive new identities involving…
Consider the extreme value of a Bernoulli random walk on the one-dimensional integer lattice, with reflection at 0, over a finite discrete time interval. Only the asymmetric (biased) case is discussed. Asymptotic mean/variance results are…
In this paper, we show that, under some technical assumptions, the Kolmogorov-Sinai entropy and the permutation entropy are equal for one-dimensional maps if there exists a countable partition of the domain of definition into intervals such…
The isomorphism problem means to decide if two given finite-dimensional simple algebras over the same centre are isomorphic and, if so, to construct an isomorphism between them. A solution to this problem has applications in computational…
We compare a piecewise linear map with constant slope beta>1 and a piecewise linear map with constant slope -beta. These maps are called the positive and negative beta-transformations. We show that for a certain set of beta's, the…
An explicit algorithm is presented for testing whether two non-directed graphs are isomorphic or not. It is shown that for a graph of n vertices, the number of n independent operations needed for the test is polynomial in n. A proof that…
This paper introduces a new measure-conjugacy invariant for actions of free groups. Using this invariant, it is shown that two Bernoulli shifts over a finitely generated free group are measurably conjugate if and only if their base measures…
An infinite permutation is a linear order on the set N. We study the properties of infinite permutations generated by fixed points of some uniform binary morphisms, and find the formula for their complexity.
Given two messages - as linear sequences of letters, it is immediate to determine whether one can be transformed into the other by simple substitution cipher of the letters. On the other hand, if the letters are carried as labels on nodes…
Scale invariant scattering suggests that all Bernoulli numbers B_{2n} can be naturally partitioned, i.e., written as particular finite sums of same-signed, monotonic, rational numbers. Some properties of these rational numbers are discussed…
\noindent In our contribution to this volume we deal with \emph{discrete} symmetries: these are symmetries based upon groups with a discrete set of elements (generally a set of elements that can be enumerated by the positive integers). In…