English
Related papers

Related papers: The distribution of values in the quadratic assign…

200 papers

We consider a symmetric matrix-valued Gaussian process $Y^{(n)}=(Y^{(n)}(t);t\ge0)$ and its empirical spectral measure process $\mu^{(n)}=(\mu_{t}^{(n)};t\ge0)$. Under some mild conditions on the covariance function of $Y^{(n)}$, we find an…

Probability · Mathematics 2022-05-17 Mario Diaz , Arturo Jaramillo , Juan Carlos Pardo

Travelling Salesman Problem (TSP) is one of the unsolved problems in computer science. TSP is NP Hard. Till now the best approximation ratio found for symmetric TSP is three by two by Christofides Algorithm more than forty years ago. There…

Data Structures and Algorithms · Computer Science 2021-04-27 Alok Chauhan , Madhusudan Verma

Let S be a subset of the unit disk, and let F(s) denote the class of completely multiplicative functions f such that f(p) is in S for all primes p. The authors' main concern is which numbers arise as mean-values of functions in F(s). More…

Number Theory · Mathematics 2016-09-07 Andrew Granville , K. Soundararajan

In math.CO/0111309, we used admissible permutations and a variant of the Floyd-Warshall Algorithm to obtain an optimal solution to the Assignment Problem and an approximate solution to the Traveling Salesman Problem. Here we give a large,…

Combinatorics · Mathematics 2007-05-23 Howard Kleiman

For various arithmetic functions $f:\mathbb{N} \to \mathbb{R}$, the behavior of $f(n!)$ and that of $\sum_{n\le N} f(n!)$ can be intriguing. For instance, for some functions $f$, we have ${f(n!)=\sum_{k\le n}f(k)}$, for others, we have…

Number Theory · Mathematics 2024-05-30 Jean-Marie De Koninck , William Verreault

Let the term $k$-representation refer to the permutation representations of the symmetric group $\mathfrak{S}_n$ on $k$-tuples and $k$-subsets as well as the $S^{(n-k,1^k)}$ irreducible representation of $\mathfrak{S}_n$. Endow…

Probability · Mathematics 2018-10-30 Benjamin Tsou

Consider a $N\times n$ matrix $\Sigma_n=\frac{1}{\sqrt{n}}R_n^{1/2}X_n$, where $R_n$ is a nonnegative definite Hermitian matrix and $X_n$ is a random matrix with i.i.d. real or complex standardized entries. The fluctuations of the linear…

Probability · Mathematics 2016-06-29 Jamal Najim , Jianfeng Yao

Let $X,X_1,X_2,\ldots$ be i.i.d. ${\mathbb{R}}^d$-valued real random vectors. Assume that ${\mathbf{E}X=0}$, $\operatorname {cov}X=\mathbb{C}$, $\mathbf{E}\Vert X\Vert^2=\sigma ^2$ and that $X$ is not concentrated in a proper subspace of…

Probability · Mathematics 2014-01-15 Friedrich Götze , Andrei Yu. Zaitsev

Motivated by applications to poaching and burglary prevention, we define a class of weighted Traveling Salesman Problems on metric spaces. The goal is to output an infinite (though typically periodic) tour that visits the n points…

Data Structures and Algorithms · Computer Science 2018-08-03 David Kempe , Mark Klein

We present a new $4$-approximation algorithm for the Combinatorial Motion Planning problem which runs in $\mathcal{O}(n^2\alpha(n^2,n))$ time, where $\alpha$ is the functional inverse of the Ackermann function, and a fully distributed…

Discrete Mathematics · Computer Science 2018-05-24 Simran Dokania , Aditya Paliwal , Shrisha Rao

It has been conjectured that the statistical properties of zeros of the Riemann zeta function near $z = 1/2 + \ui E$ tend, as $E \to \infty$, to the distribution of eigenvalues of large random matrices from the Unitary Ensemble. At finite…

Number Theory · Mathematics 2009-11-11 E. Bogomolny , O. Bohigas , P. Leboeuf , A. G. Monastra

We derive functional equations for distributions of six classical statistics (ascents, descents, left-to-right maxima, right-to-left maxima, left-to-right minima, and right-to-left minima) on separable and irreducible separable…

Combinatorics · Mathematics 2024-04-30 Joanna N. Chen , Sergey Kitaev , Philip B. Zhang

Let $F_n$ denote the distribution function of the normalized sum $Z_n = (X_1 + \dots + X_n)/\sigma\sqrt{n}$ of i.i.d. random variables with finite fourth absolute moment. In this paper, polynomial rates of convergence of $F_n$ to the normal…

Probability · Mathematics 2017-06-30 Sergey G. Bobkov

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…

Combinatorics · Mathematics 2008-01-29 Joshua Cooper , Andrew Petrarca

We study the distribution of spacings between squares modulo q, where q is square-free and highly composite, in the limit as the number of prime factors of q goes to infinity. We show that all correlation functions are Poissonian, which…

Number Theory · Mathematics 2007-05-23 P. Kurlberg , Z. Rudnick

We obtain a positive probability distribution or Q-function for an arbitrary fermionic many-body system. This is different to previous Q-function proposals, which were either restricted to a subspace of the overall Hilbert space, or used…

Quantum Physics · Physics 2015-03-27 Laura E. C. Rosales-Zarate , P. D. Drummond

We compute analytically, for large N, the probability distribution of the number of positive eigenvalues (the index N_{+}) of a random NxN matrix belonging to Gaussian orthogonal (\beta=1), unitary (\beta=2) or symplectic (\beta=4)…

Statistical Mechanics · Physics 2015-05-14 Satya N. Majumdar , Celine Nadal , Antonello Scardicchio , Pierpaolo Vivo

In a compound decision problem, consisting of $n$ statistically independent copies of the same problem to be solved under the sum of the individual losses, any reasonable compound decision rule $\delta$ satisfies a natural symmetry…

Statistics Theory · Mathematics 2019-12-02 Asaf Weinstein

Two semimetrics on probability distributions are proposed, given as the sum of differences of expectations of analytic functions evaluated at spatial or frequency locations (i.e, features). The features are chosen so as to maximize the…

Machine Learning · Statistics 2016-10-31 Wittawat Jitkrittum , Zoltan Szabo , Kacper Chwialkowski , Arthur Gretton

Let $\mathcal{S}_n$ denote the set of permutations of $\{1,2,\dots,n\}$. The function $f(n,s)$ is defined to be the minimum size of a subset $S\subseteq \mathcal{S}_n$ with the property that for any $\rho\in \mathcal{S}_n$ there exists some…

Combinatorics · Mathematics 2020-04-30 Kevin Hendrey , Ian M. Wanless