Related papers: A monotone isomorphism theorem

We call an objective function or algorithm symmetric with respect to an input if after swapping two parts of the input in any algorithm, the solution of the algorithm and the output remain the same. More formally, for a permutation $\pi$ of…

Let a countable amenable group G acts freely and ergodically on a Lebesgue space (X,mu), preserving the measure mu. If T is an automorphism of the equivalence relation defined by G then T can be extended to an automorphism alpha_T of the…

The topic of this paper is the distributed and incremental generation of long executions of concurrent systems, uniformly or more generally with weights associated to elementary actions. Synchronizing sequences of letters on alphabets…

We consider two related problems arising from a question of R. Graham on quasirandom phenomena in permutation patterns. A ``pattern'' in a permutation $\sigma$ is the order type of the restriction of $\sigma : [n] \to [n]$ to a subset $S…

Given a submonoid $H$ of $\mathbb N^k$, we give some characterizations of the minimum $r\in \mathbb N^+$ such that $H$ is isomorphic to a submonoid of $\mathbb N^r$. In the context of submonoids of $\mathbb N$, we prove that if two…

Let $A,B\in B(H)$. We present among others a simple proof of the widely known result stating that if $0\leq A\leq B$, then $\sqrt A\leq \sqrt B$. The same idea is used to prove that if $0\leq A\leq B$ and $A$ is invertible, then $B$ too is…

We give many examples of algebraic actions which are factors of Bernoulli shifts. These include certain harmonic models over left orderable groups of large enough growth, as well as algebraic actions associated to certain lopsided elements…

In this paper we show some remarkable consequences of the method which proves that every bisymmetric, symmetric, reflexive, strictly monotonic binary map on a proper interval is continuous, in particular it is a quasi-arithmetic mean. Now…

General permutation invariant statistics in the second quantized approach are considered. Simple interpolations between dual statistics are constructed. Particularly, we present a new minimal interpolation between parabosons and…

Motivated by proving the loss of ergodicity in expanding systems of piecewise affine coupled maps with arbitrary number of units, all-to-all coupling and inversion symmetry, we provide ad-hoc substitutes - namely inversion-symmetric maps of…

We study petal diagrams of knots, which provide a method of describing knots in terms of permutations in a symmetric group $S_{2n+1}$. We define two classes of moves on such permutations, called trivial petal additions and crossing…

We prove that a self similar measure is absolutely continuous providing that it satisfies a condition depending on its Garsia entropy, contraction ratio, and the separation between different points in approximations of the self similar…

This article provides a method for constructing invariants and semi-invariants of a binary $N$-ic form over a field $k$ characteristics $0$ or $p > N$. A practical and broadly applicable sufficient condition for ensuring nontriviality of…

We survey the connections between entropy, chaos, and independence in topological dynamics. We present extensions of two classical results placing the following notions in the context of symbolic dynamics: 1. Equivalence of positive entropy…

Let $n \ge 3$ be an integer. Let $P_n = \{1, 2, 3, ..., n-1, n \}$ and let $S_n$ be the symmetric group of permutations on $P_n$. Motivated by the theory of discrete dynamical systems on the interval, we associate each permutation $\si_n$…

An involution is a permutation that is its own inverse. Given a permutation $\sigma$ of $[n],$ let $\mathbf{N}_{n}(\sigma)$ denote the number of ways to write $\sigma$ as a product of two involutions of $[n].$ If we endow the symmetric…

Consider a one dimensional simple random walk $X=(X_n)_{n\geq0}$. We form a new simple symmetric random walk $Y=(Y_n)_{n\geq0}$ by taking sums of products of the increments of $X$ and study the two-dimensional walk…

The problem we consider is the following: Given an infinite word $w$ on an ordered alphabet, construct the sequence $\nu_w=(\nu[n])_n$, equidistributed on $[0,1]$ and such that $\nu[m]<\nu[n]$ if and only if $\sigma^m(w)<\sigma^n(w)$, where…

Bowen's notion of sofic entropy is a powerful invariant for classifying probability-preserving actions of sofic groups. It can be defined in terms of the covering numbers of certain metric spaces associated to such an action, the `model…

Over 50 years ago, Lov\'{a}sz proved that two graphs are isomorphic if and only if they admit the same number of homomorphisms from any graph [Acta Math. Hungar. 18 (1967), pp. 321--328]. In this work we prove that two graphs are quantum…