Related papers: On rearrangement inequalities for multiple sequenc…
The rearrangement inequality states that the sum of products of permutations of 2 sequences of real numbers are maximized when the terms are similarly ordered and minimized when the terms are ordered in opposite order. We show that similar…
Some natural inequalities related to rearrangement in matrix products can also be regarded as extensions of classical inequalities for sequences or integrals. In particular, we show matrix versions of Chebyshev and Kantorovich type…
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,…
The symmetric decreasing rearrangement of functions on $\mathbb{R}^n$ features in several seminal inequalities, such as the P\'olya-Szeg\H{o} inequality. The latter was shown by the authors to hold for all smoothing rearrangements, a class…
We study the following rearrangement problem: Given $n$ words, rearrange and concatenate them so that the obtained string is lexicographically smallest (or largest, respectively). We show that this problem reduces to sorting the given words…
Early literature on genome rearrangement modelling views the problem of computing evolutionary distances as an inherently combinatorial one. In particular, attention was given to estimating distances using the minimum number of events…
We study $L^2$-constraint minimizing problems related to elliptic systems. We introduce a new rearrangement to show $H^1$-precompactness of any minimizing sequences. Some strict inequality for the new rearrangement is obtained. It is a key…
Majorisation, also called rearrangement inequalities, yields a type of stochastic ordering in which two or more distributions can be compared. In this paper we argue that majorisation is a good candidate as a theory for uncertainty. We…
How many permutations of the natural numbers are needed so that every conditionally convergent series of real numbers can be rearranged to no longer converge to the same sum? We define the \emph{rearrangement number}, a new cardinal…
Consider a stack of books, containing both white and black books. Suppose that we want to sort them out, putting the white books on the right, and the black books on the left (fig.~1). This will be done by a finite sequence of elementary…
We present a number of results relating partial Cauchy-Littlewood sums, integrals over the compact classical groups, and increasing subsequences of permutations. These include: integral formulae for the distribution of the longest…
Sequences have become first class citizens in supervised learning thanks to the resurgence of recurrent neural networks. Many complex tasks that require mapping from or to a sequence of observations can now be formulated with the…
This paper can be seen as an attempt of rethinking the {\em Extra-Gradient Philosophy} for solving Variational Inequality Problems. We show that the properly defined {\em Reduced Gradients} can be used instead for finding approximate…
Weak values are usually associated with weak measurements of an observable on a pre- and post-selected ensemble. We show that more generally, weak values are proportional to the correlation between two pointers in a successive measurement.…
Many theorems of mathematics have the form that for a certain problem, e.g. a differential equation or polynomial (in)equality, there exists a solution. The sequential version then states that for a sequence of problems, there is a sequence…
By analyzing an optimization problem over orthogonal matrices, we prove a generalization of the Hardy-Littlewood-P\'olya rearrangement inequality to positive definite matrices. The inequality is then extended to rectangular matrices. Using…
A composition of a nonnegative integer (n) is a sequence of positive integers whose sum is (n). A composition is palindromic if it is unchanged when its terms are read in reverse order. We provide a generating function for the number of…
A fundamental task underlying many important optimization problems, from influence maximization to sensor placement to content recommendation, is to select the optimal group of $k$ items from a larger set. Submodularity has been very…
We define a multidimensional rearrangement, which is related to classical inequalities for functions that are monotone in each variable. We prove the main measure theoretical results of the new theory and characterize the functional…
The Bruss-Robertson inequality gives a bound on the maximal number of elements of a random sample whose sum is less than a specified value, and the extension of that inequality which is given here neither requires the independence of the…