English
Related papers

Related papers: Postorder rearrangement operators

200 papers

In this paper general rearrangements of the Haar system in BMO are considered. Several, necessary and suficient, conditions for the boundednes of the induced permutation operator are given. Using analytic families of operators extensions to…

Functional Analysis · Mathematics 2009-09-25 Paul F. X. Müller

General permutations acting on the Haar system are investigated. We give a necessary and sufficient condition for permutations to induce an isomorphism on dyadic BMO. Extensions of this characterization to Lipschitz spaces $\lip,…

Functional Analysis · Mathematics 2009-09-25 Paul F. X. Müller

For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…

Data Structures and Algorithms · Computer Science 2011-12-05 Christoph Dürr , Maurice Queyranne , Frits C. R. Spieksma , Fabrice Talla Nobibon , Gerhard J. Woeginger

Let $X$ be a Banach space with a basis $(e_k)_k$ and biorthogonals $(e^\ast_k)_k$. An operator on $X$ is said to have a $\textit {large diagonal}$ if $\inf\limits_{k} |e_k^\ast(T(e_k))| > 0$. The basis $(e_k)_k$ is said to have the $\textit…

Functional Analysis · Mathematics 2023-04-04 Kh. V. Navoyan

We prove $\mathrm{H}^1$ and $\mathrm{BMO}$ endpoint inequalities for generic cancellative Haar shifts defined with respect to a possibly non-homogeneous Borel measure $\mu$ satisfying a weak regularity condition. This immediately yields a…

Classical Analysis and ODEs · Mathematics 2024-12-18 José M. Conde Alonso , Nathan A. Wagner

We provide algorithms for isotonic regression minimizing $L_0$ error (Hamming distance). This is also known as monotonic relabeling, and is applicable when labels have a linear ordering but not necessarily a metric. There may be…

Data Structures and Algorithms · Computer Science 2022-06-14 Quentin F. Stout

We obtain sharp bounds for the monotonic rearrangement operator from "dyadic-type" classes to "continuous". In particular, for the $\mathrm{BMO}$ space and Muckenhoupt classes. The idea is to connect the problem with a simple geometric…

Classical Analysis and ODEs · Mathematics 2016-04-07 Dmitriy M. Stolyarov , Vasily I. Vasyunin , Pavel B. Zatitskiy

The behavior of certain weighted Hardy-type operators on rearrangement-invariant function spaces is thoroughly studied with emphasis being put on the optimality of the obtained results. First, the optimal rearrangement-invariant function…

Functional Analysis · Mathematics 2023-08-14 Zdeněk Mihula

We study the {pair correlations between} prime numbers in an interval $M \leq p \leq M + L$ with $M \rightarrow \infty$, $L/M \rightarrow \beta > 0$. By analyzing the \emph{structure factor}, we prove, conditionally on the {Hardy-Littlewood…

Number Theory · Mathematics 2019-05-22 Salvatore Torquato , Ge Zhang , Matthew De Courcy-Ireland

\'O. Blasco and S. Pott showed that the supremum of operator norms over $L^2$ of all bicommutators (with the same symbol) of one-parameter Haar multipliers dominates the biparameter dyadic product BMO norm of the symbol itself. In the…

Classical Analysis and ODEs · Mathematics 2020-12-25 Spyridon Kakaroumpas , Odí Soler i Gibert

We obtain a complete characterization of the weak-type $(1,1)$ for Haar shift operators in terms of generalized Haar systems adapted to a Borel measure $\mu$ in the operator-valued setting. The main technical tool in our method is a…

Classical Analysis and ODEs · Mathematics 2014-12-17 José M. Conde-Alonso , Luis Daniel López-Sánchez

We introduce multilinear analogues of dyadic paraproduct operators and Haar Multipliers, and study boundedness properties of these operators and their commutators. We also characterize dyadic BMO functions via the boundedness of certain…

Classical Analysis and ODEs · Mathematics 2015-12-15 Ishwari Kunwar

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…

Data Structures and Algorithms · Computer Science 2022-04-26 Ruixi Luo , Taikun Zhu , Kai Jin

We characterize the orderings of pairs of sets induced by several distances: Hamming, Jaccard, S\o rensen-Dice and Overlap. We also characterize these distances.

Discrete Mathematics · Computer Science 2025-07-09 Thierry Marchant , Sandip Sarkar

We determine the extrapolation law for rearrangement operators of the Haar system on vector valued Hardy spaces.

Functional Analysis · Mathematics 2014-02-26 Paul F. X. Mueller

We study the number of linear extensions of a partial order with a given proportion of comparable pairs of elements, and estimate the maximum and minimum possible numbers. We also consider a random interval partial order on $n$ elements,…

Combinatorics · Mathematics 2018-10-16 Colin McDiarmid , David Penman , Vasileios Iliopoulos

We investigate the category of ``matricial order operator spaces,'' which generalize operator systems, being equipped with both matricial norms and matricial order. For these objects, we develop duality theory. Taking a cue from the theory…

Functional Analysis · Mathematics 2026-05-22 Roy Araiza , Timur Oikhberg

This paper revisits the ordered statistics decoding (OSD). It provides a comprehensive analysis of the OSD algorithm by characterizing the statistical properties, evolution and the distribution of the Hamming distance and weighted Hamming…

Information Theory · Computer Science 2021-05-10 Chentao Yue , Mahyar Shirvanimoghaddam , Branka Vucetic , Yonghui Li

We study the reverse mathematics of interval orders. We establish the logical strength of the implications between various definitions of the notion of interval order. We also consider the strength of different versions of the…

Logic · Mathematics 2008-11-21 Alberto Marcone

We analyze the ordinal structure of long-range dependent time series. To this end, we use so called ordinal patterns which describe the relative position of consecutive data points. We provide two estimators for the probabilities of ordinal…

‹ Prev 1 2 3 10 Next ›