Related papers: Forcing quasirandomness with 4-point permutations
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
A sequence of reversals that takes a signed permutation to the identity is perfect if at no step a common interval is broken. Determining a parsimonious perfect sequence of reversals that sorts a signed permutation is NP-hard. Here we show…
Random permutations with distribution conditionally uniform given the set of record values can be generated in a unified way, coherently for all values of $n$. Our central example is a two-parameter family of random permutations that are…
We present a necessary and sufficient condition for a finite dimensional density matrix to be an extreme point of the convex set of density matrices with positive partial transpose with respect to a subsystem. We also give an algorithm for…
The divergence of a group is a quasi-isometry invariant defined in terms of pairs of points and lengths of paths avoiding a suitable ball around the identity. In this paper we study "random divergence'', meaning the divergence at two points…
The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
We study the interplay between notions of quasirandomness for additive sets and for hypergraphs. In particular, we show a strong connection between the notions of Gowers uniformity in the additive setting and discrepancy-type measures of…
The aim of this work is to enumerate alternating sign matrices (ASM) that are quasi-invariant under a quarter-turn. The enumeration formula (conjectured by Duchon) involves, as a product of three terms, the number of unrestricted ASM's and…
As a fundamental piece of multi-object Bayesian inference, multi-object density has the ability to describe the uncertainty of the number and values of objects, as well as the statistical correlation between objects, thus perfectly matches…
The role that quasiparticles play in a strong interaction system with spontaneous symmetry breaking is examined. We find, using a non- perturbative cluster decomposition method, that the quasiparticles do not saturate the physical local…
We prove that any link admitting a diagram with a single negative crossing is strongly quasipositive. This answers a question of Stoimenow's in the (strong) positive. As a second main result, we give simple and complete characterizations of…
A necessary and sufficient condition for an oriented pretzel surface to be quasipositive yields an estimate for the slice genus of the boundary of an arbitrary oriented pretzel surface.
We prove a version of the multidimensional Fourth Moment Theorem for chaotic random vectors, in the general context of diffusion Markov generators. In addition to the usual componentwise convergence and unlike the infinite-dimensional…
An involution is usually defined as a mapping that is its own inverse. In this paper, we study quaternion involutions that have the additional properties of distribution over addition and multiplication. We review formal axioms for such…
We consider uniform random permutations in classes having a finite combinatorial specification for the substitution decomposition. These classes include (but are not limited to) all permutation classes with a finite number of simple…
A structure $\cal S$ is quasi-projective if for every structure $\cal T$, for every homomorphism $f : {\cal S} \rightarrow {\cal T}$ and every epimorphism $j: {\cal S}\rightarrow {\cal T}$ there is an endomorphism $\phi$ of $\cal S$ such…
We prove that every Condorcet-consistent voting rule can be manipulated by a voter who completely reverses their preference ranking, assuming that there are at least 4 alternatives. This corrects an error and improves a result of [Sanver,…
We consider in this paper the semiparametric mixture of two distributions equal up to a shift parameter. The model is said to be semiparametric in the sense that the mixed distribution is not supposed to belong to a parametric family. In…
We consider uniform random permutations in proper substitution-closed classes and study their limiting behavior in the sense of permutons. The limit depends on the generating series of the simple permutations in the class. Under a mild…