Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2002.10514

On rearrangement inequalities for multiple sequences

Chai Wah Wu
View original source ↗Read source document ↗Export metadata ↓

Abstract

The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the smallest value. This has been generalized to multiple sequences to show that similarly ordered sequences provide the largest value. However, the permutations of the sequences that result in the smallest value are generally not known. We show a variant of the rearrangement inequality for which a lower bound can be obtained and conditions for which this bound is achieved for a sequence of permutations. We also study a generalization of the rearrangement inequality and a variation where the permutations of terms can be across the various sequences. For this variation, we can also find the minimizing and maximizing sequences under certain conditions. Finally, we also look at rearrangement inequalities of other objects that can be ordered such as functions and matrices.

Explore related subjects

math.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Chai Wah Wu. 2022-04-14. On rearrangement inequalities for multiple sequences. https://doi.org/10.7153/mia-2022-25-32

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Adjunctions, Box Products, and Forcing Families

Sidorenko's conjecture states that the number of copies of any given bipartite graph in another graph of given density is asymptotically minimized by a random graph. For bipartite graphs containing a cycle, the forcing conjecture further asserts that asymptotic equality characterizes quasi-random graphs. We establish an adjoint identity for a general class of graph-substitution operators and use it to obtain Sidorenko and forcing results for balanced blow-ups, subdivisions, Cartesian products, and strong products.

math.CO↗
arXiv2026

On the Cost Number of Graphs with Determining Number Two

A distinguishing vertex coloring of a graph $G$ is a vertex coloring such that only the identity automorphism of $G$ preserves the coloring. A graph is $2$-distinguishable if it admits a distinguishing vertex coloring with two colors, and its cost $ρ(G)$ is the minimum size of a color class in such a coloring. The determining number of a graph $G$, denoted by $Det(G)$, is the minimum size of a subset $S\subseteq V(G)$ such that only the trivial automorphism fixes every element of $S$ pointwise. Boutin (J. Combin. Math. Combin. Comput. 85: 161-171, 2013) asked if $ρ(G)$ and $Det(G)$ can be arbitrarily far apart. While the case for $Det(G) = 1$ is trivial, the answer remained unknown for $Det(G) \ge 2$. In this manuscript, we show that if $Det(G)=2$ then not only is $ρ(G)$ bounded, but in fact $ρ(G) \leq 4$. This is the first resolution of Boutin's question for any nontrivial fixed determining number. Moreover, for every fixed $Det(G)= n$, we construct examples giving a lower bound on any possible upper bound for $ρ(G)$ in terms of $n$.

math.CO↗