Related papers: A short proof that adding some permutation rules t…

Elizalde (2011) characterized which permutations can be obtained by ordering consecutive elements in the trajectories of (positive) beta-transformations and beta-shifts. We prove similar results for negative bases beta.

We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain various simple consistency proofs.

We study the problem of whether all bipartite quantum states having a prescribed spectrum remain positive under the reduction map applied to one subsystem. We provide necessary and sufficient conditions, in the form of a family of linear…

The aim of this work is to extend and prove the Onsager conjecture for a class of conservation laws that possess generalized entropy. One of the main findings of this work is the "universality" of the Onsager exponent, $\alpha > 1/3$,…

Let $p$ be a prime, $q=p^n$, and $D \subset \mathbb{F}_q^*$. A celebrated result of McConnel states that if $D$ is a proper subgroup of $\mathbb{F}_q^*$, and $f:\mathbb{F}_q \to \mathbb{F}_q$ is a function such that $(f(x)-f(y))/(x-y) \in…

Let S_n be the symmetric group on n-letters. Fix n>5. Given any nontrivial $\alpha,\beta\in S_n$, we prove that the product $\alpha^{S_n}\beta^{S_n}$ of the conjugacy classes $\alpha^{S_n}$ and $\beta^{S_n}$ is never a conjugacy class.…

We give a short and self-contained proof of Levi's Extension Lemma for pseudoline arrangements.

This is the fourth paper in a series. We prove a conjecture made independently by Boston et al and Shalev. The conjecture asserts that there is an absolute positive constant delta such that if G is a finite simple group acting transitively…

Let $\beta>1$. For $x \in [0,\infty)$, we have so-called the $\beta$-expansion of $x$ in base $\beta$ as follows: $$x= \sum_{j \leq k} x_{j}\beta^{j} = x_{k}\beta^{k}+ \cdots + x_{1}\beta+x_{0}+x_{-1}\beta^{-1} + x_{-2}\beta^{-2} + \cdots$$…

We prove an iteration theorem which guarantees for a wide class of nice iterations of $\omega_1$-preserving forcings that $\omega_1$ is not collapse, at the price of needing large cardinals to burn as fuel. More precisely, we show that a…

This paper is devoted to the proof of a structural theorem, concerning certain homomorphic images of Artin braid group on $n$ strands in finite symmetric groups. It is shown that any one of these permutation groups is an extension of the…

In this paper, we give corrected and improved definitions of the sets $S$ and $\Delta$ compared to [1]. By using these new definitions, we go throughout the proof of the main result in [1], and we correct it.

In this paper, a method to generate permutations of a string under a set of constraints decided by the user is presented. The required permutations are generated without generating all the permutations.

We show that the truncated simplex Hilbert transform enjoys some cancellation in the sense that its norm grows sublinearly in the number of scales retained in the truncation. This extends the recent result by Tao on cancellation for the…

We study the expansions of permutation statistics in the basis of functions counting occurrences of a fixed pattern in a permutation. We show the finiteness of these pattern expansions for a class of permutation statistics including the…

We introduce a modified version of P. Jones's $\beta$-numbers for Carnot groups which we call {\it stratified $\beta$-numbers}. We show that an analogue of Jones's traveling salesman theorem on 1-rectifiability of sets holds for any Carnot…

For a fixed permutation $\sigma \in S_k$, let $N_{\sigma}$ denote the function which counts occurrences of $\sigma$ as a pattern in permutations from $S_n$. We study the expected value (and $d$-th moments) of $N_{\sigma}$ on conjugacy…

The following Proposition is a positive answer to a question about cancellations between permutations that arises in a model problem in the many body theory of Fermions. It concerns the mathematically rigorous implementation of the Pauli…

We show how to force, with finite conditions, the forcing axiom PFA(T), a relativization of PFA to proper forcing notions preserving a given Souslin tree T. The proof uses a Neeman style iteration with generalized side conditions consisting…

A permutation p is realized by the shift on N symbols if there is an infinite word on an N-letter alphabet whose successive left shifts by one position are lexicographically in the same relative order as p. The set of realized permutations…