English
Related papers

Related papers: Permutations with few inversions are locally unifo…

200 papers

A smooth plane curve is said to admit a symmetric determinantal representation if it can be defined by the determinant of a symmetric matrix with entries in linear forms in three variables. We study the local-global principle for the…

Number Theory · Mathematics 2016-02-02 Yasuhiro Ishitsuka , Tetsushi Ito

Let $\Sigma$ be a strictly convex, compact patch of a $C^2$ hypersurface in $\mathbb{R}^n$, with non-vanishing Gaussian curvature and surface measure $d\sigma$ induced by the Lebesgue measure in $\mathbb{R}^n$. The Mizohata--Takeuchi…

Classical Analysis and ODEs · Mathematics 2024-08-20 Anthony Carbery , Marina Iliopoulou , Hong Wang

We consider a random permutation drawn from the set of 132-avoiding permutations of length $n$ and show that the number of occurrences of another pattern $\sigma$ has a limit distribution, after scaling by $n^{\lambda(\sigma)/2}$ where…

Probability · Mathematics 2016-05-25 Svante Janson

Let $G$ be a connected reductive $p$-adic group and let $\theta$ be an automorphism of $G$ of order at most two. Suppose $\pi$ is an irreducible smooth representation of $G$ that is taken to its dual by $\theta$. The space $V$ of $\pi$ then…

Representation Theory · Mathematics 2012-04-24 Alan Roche , Steven Spallone

Permutation tests date back nearly a century to Fisher's randomized experiments, and remain an immensely popular statistical tool, used for testing hypotheses of independence between variables and other common inferential questions. Much of…

Methodology · Statistics 2022-12-05 Aaditya Ramdas , Rina Foygel Barber , Emmanuel J. Candes , Ryan J. Tibshirani

We introduce a rather natural family of non-uniform distributions on $PF_n$, $n\in\mathbb{N}$, the set of parking functions of length $n$. One of the motivations for this comes from a similar situation in the context of integer partitions.…

Probability · Mathematics 2025-10-07 Ross G. Pinsky

We prove a tight and close-to-optimal lower bound on the effectiveness of local quantum measurements (without classical communication) at discriminating any two bipartite quantum states. Our result implies, for example, that any two…

Quantum Physics · Physics 2022-10-26 Willian H. G. Corrêa , Ludovico Lami , Carlos Palazuelos

What minimum degree of a graph $G$ on $n$ vertices guarantees that the union of $G$ and a random $2$-factor (or permutation) is with high probability Hamiltonian? Gir\~ao and Espuny D{\'\i}az showed that the answer lies in the interval…

Combinatorics · Mathematics 2025-02-04 Nemanja Draganić , Peter Keevash

In this paper we consider the (weighted) spectral measure $\mu_n$ of a $n\times n$ random matrix, distributed according to a classical Gaussian, Laguerre or Jacobi ensemble, and show a moderate deviation principle for the standardised…

Probability · Mathematics 2013-08-27 Jan Nagel

We present a non-standard proof of the fact that the existence of a local (i.e. restricted to a point) characteristic-zero, semi-parametric lifting for a variety defined by the zero locus of polynomial equations over the integers is…

Commutative Algebra · Mathematics 2017-07-26 Edisson Gallego , Danny A. J. Gomez-Ramirez , Juan D. Velez

Let $\mathbb{K}$ be a field of characteristic $0$. For each choice of distinct $a_1, \ldots, a_n\in \mathbb{K}$ and distinct $b_1, \ldots, b_n\in \mathbb{K}$, consider the sum $S=\sum_{i=1}^n a_i b_{\pi(i)}$ as $\pi$ ranges over the…

Combinatorics · Mathematics 2026-02-27 Ruben Carpenter , Colin Defant , Noah Kravitz

Answering a question of Claudet, we prove that the uniformly random graph $G\sim \mathbb G(n, 1/2)$ is $\Omega(\sqrt n)$-vertex-minor universal with high probability. That is, for some constant $\alpha\approx 0.911$, any graph on any…

Quantum Physics · Physics 2026-02-24 Ruben Ascoli , Bryce Frederickson , Sarah Frederickson , Caleb McFarland , Logan Post

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

Classical Analysis and ODEs · Mathematics 2014-08-12 Tuomas Orponen

Based on \cite{H}, it is well known that the rescaled two point correlation functions \[ \sqrt{N} \langle \sigma_i ; \sigma_j\rangle = \sqrt{N} \big( \langle \sigma_i \sigma_j\rangle -\langle \sigma_i\rangle \langle \sigma_j\rangle\big) \]…

Probability · Mathematics 2024-05-01 Christian Brennecke , Adrien Schertzer , Chen Van Dam

We deal with countable alphabet locally compact random subshifts of finite type (the latter merely meaning that the symbol space is generated by an incidence matrix) under the absence of Big Images Property and under the absence of uniform…

Dynamical Systems · Mathematics 2015-09-02 Volker Mayer , Mariusz Urbanski

Starting with a collection of $n$ oriented polygonal discs, with an even number $N$ of sides in total, we generate a random oriented surface by randomly matching the sides of discs and properly gluing them together. Encoding the surface in…

Combinatorics · Mathematics 2015-03-09 Sergei Chmutov , Boris Pittel

We revisit the problem of testing for multivariate reflected symmetry about an unspecified point. Although this testing problem is invariant with respect to full-rank affine transformations, among the hitherto few proposed tests only the…

Methodology · Statistics 2018-07-18 Norbert Henze , Celeste Mayer

We study the counts of smooth permutations and smooth polynomials over finite fields. For both counts we prove an estimate with an error term that matches the error term found in the integer setting by de Bruijn more than 70 years ago. The…

Combinatorics · Mathematics 2025-01-08 Ofir Gorodetsky

Given a non-negative random variable $W$ and $\theta>0$, let the generalized Dickman transformation map the distribution of $W$ to that of $$ W^*=_d U^{1/\theta}(W+1), $$ where $U \sim {\cal U}[0,1]$, a uniformly distributed variable on the…

Probability · Mathematics 2018-10-22 Larry Goldstein

Suppose we are given an infinite sequence of input cells, each initialized with a uniform random symbol from $[n]$. How hard is it to output a sequence in $[n]^n$ that is close to a uniform random permutation? Viola (SICOMP 2020)…

Computational Complexity · Computer Science 2025-12-03 Yaroslav Alekseev , Mika Göös , Konstantin Myasnikov , Artur Riazanov , Dmitry Sokolov
‹ Prev 1 4 5 6 7 8 10 Next ›