中文
相关论文

相关论文: On the number of permutation-twisted dot products

200 篇论文

Given permutations $\pi \in S_n$ and $\sigma \in S_k$, let $N_\sigma(\pi)$ denote the number of occurrences of $\sigma$ in $\pi$. While pattern avoidance and the distribution of pattern occurrences in permutations have been extensively…

组合数学 · 数学 2023-10-31 Jonas Iskander

A permutation $\pi \in \mathbb{S}_n$ is $k$-balanced if every permutation of order $k$ occurs in $\pi$ equally often, through order-isomorphism. In this paper, we explicitly construct $k$-balanced permutations for $k \le 3$, and every $n$…

组合数学 · 数学 2023-06-30 Gal Beniamini , Nir Lavee , Nati Linial

A permutation $\pi$ is ballot if, for all $k$, the word $\pi_1\cdots \pi_k$ has at least as many ascents as it has descents. Let $b(n)$ denote the number of ballot permutations of order $n$, and let $p(n)$ denote the number of permutations…

组合数学 · 数学 2019-03-15 Sam Spiro

Let $S_n$ denote the set of permutations of $[n]:=\{1,\cdots, n\}$, and denote a permutation $\sigma\in S_n$ by $\sigma=\sigma_1\sigma_2\cdots \sigma_n$. For $l\ge2$ an integer, let $A^{(n)}_{l;k}\subset S_n$ denote the event that the set…

组合数学 · 数学 2022-08-26 Ross G. Pinsky

We introduce the "Median Inverse Problem" for metric spaces. In particular, having a permutation $\pi$ in the symmetric group $S_n$ (endowed with the breakpoint distance), we study the set of all $k$-subsets $\{x_1,...,x_k\}\subset S_n$ for…

组合数学 · 数学 2017-12-11 Poly H. da Silva , Arash Jamshidpey , David Sankoff

We study the formula complexity of the word problem $\mathsf{Word}_{S_n,k} : \{0,1\}^{kn^2} \to \{0,1\}$: given $n$-by-$n$ permutation matrices $M_1,\dots,M_k$, compute the $(1,1)$-entry of the matrix product $M_1\cdots M_k$. An important…

计算复杂性 · 计算机科学 2022-11-29 William He , Benjamin Rossman

For $\eta\in S_3$, let $S_n^{\text{av}(\eta)}$ denote the set of permutations in $S_n$ that avoid the pattern $\eta$, and let $E_n^{\text{av}(\eta)}$ denote the expectation with respect to the uniform probability measure on…

概率论 · 数学 2023-04-28 Ross G. Pinsky

We consider the problem of finding the set of permutations $r_j$ of $\{1,\cdots , n\}$ such that $\sum_{i=1}^n \prod_{j=1}^k r_j(i)$ is maximized or minimized. While the set of permutations maximizing this value are easily determined,…

组合数学 · 数学 2020-03-03 Chai Wah Wu

We prove anti-concentration bounds for the inner product of two independent random vectors. For example, we show that if $A,B$ are subsets of the cube $\{\pm 1\}^n$ with $|A| \cdot |B| \geq 2^{1.01 n}$, and $X \in A$ and $Y \in B$ are…

概率论 · 数学 2019-03-06 Anup Rao , Amir Yehudayoff

In the first paper in this series we estimated the probability that a random permutation $\pi\in\mathcal{S}_n$ has a fixed set of a given size. In this paper, we elaborate on the same method to estimate the probability that $\pi$ has $m$…

群论 · 数学 2017-06-12 Sean Eberhard , Kevin Ford , Dimitris Koukoulopoulos

We investigate dynamical properties of the set of permutations of $\mathbb{Z}^d$ with restricted movement, i.e., permutations $\pi $ of $\mathbb{Z}^d$ such that $\pi (\mathbf{n})-\mathbf{n}$ lies, for every $\mathbf{n}\in \mathbb{Z}^d$, in…

动力系统 · 数学 2017-06-26 Klaus Schmidt , Gabriel Strasser

For $\tau\in S_3$, let $\mu_n^{\tau}$ denote the uniformly random probability measure on the set of $\tau$-avoiding permutations in $S_n$. Let $\mathbb{N}^*=\mathbb{N}\cup\{\infty\}$ with an appropriate metric and denote by…

概率论 · 数学 2018-07-05 Ross G. Pinsky

The sum of square roots is as follows: Given $x_1,\dots,x_n \in \mathbb{Z}$ and $a_1,\dots,a_n \in \mathbb{N}$ decide whether $ E=\sum_{i=1}^n x_i \sqrt{a_i} \geq 0$. It is a prominent open problem (Problem 33 of the Open Problems Project),…

计算几何 · 计算机科学 2023-12-05 Friedrich Eisenbrand , Matthieu Haeberle , Neta Singer

Let $K_n$ denote the number of distinct values among the first $n$ terms of an infinite exchangeable sequence of random variables $(X_1,X_2,\ldots)$. We prove for $n=3$ that the extreme points of the convex set of all possible laws of $K_3$…

概率论 · 数学 2021-03-16 Theodore Zhu

We are looking for integer numbers $g_{j}$ and $x_{j}$ ($j=1,...,n$) such that the sums $T_{\pi} := \sum_{j=1}^{n} g_{j} \cdot x_{\pi\left( j\right) }$ are different for all permutations $\pi\in S_{n}$ and $\max\left\{T_{\pi}:\pi\in…

综合数学 · 数学 2025-12-25 István Szalkai

A signed permutation \pi = \pi_1\pi_2 \ldots \pi_n in the hyperoctahedral group B_n is a word such that each \pi_i \in {-n, \ldots, -1, 1, \ldots, n} and {|\pi_1|, |\pi_2|, \ldots, |\pi_n|} = {1,2,\ldots,n}. An index i is a peak of \pi if…

Recently, B\'ona and Smith defined strong pattern avoidance, saying that a permutation $\pi$ strongly avoids a pattern $\tau$ if $\pi$ and $\pi^2$ both avoid $\tau$. They conjectured that for every positive integer $k$, there is a…

组合数学 · 数学 2020-06-02 Amanda Burcroff , Colin Defant

Let B=A+K where A is a bounded selfadjoint operator and K is an element of the von Neumann-Schatten ideal S_p with p>1. Let {\lambda_n} denote an enumeration of the discrete spectrum of B. We show that $\sum_n \dist(\lambda_n, \sigma(A))^p$…

谱理论 · 数学 2013-05-17 Marcel Hansmann

Ensembles of isotropic random matrices are defined by the invariance of the probability measure under the left (and right) multiplication by an arbitrary unitary matrix. We show that the multiplication of large isotropic random matrices is…

统计力学 · 物理学 2013-08-14 Z. Burda , G. Livan , A. Swiech

Given two sets of positive integers $A$ and $B$, let $AB := \{ab : a \in A,\, b \in B\}$ be their product set and put $A^k := A \cdots A$ ($k$ times $A$) for any positive integer $k$. Moreover, for every positive integer $n$ and every…

数论 · 数学 2020-12-15 Carlo Sanna