Related papers: Postorder rearrangement operators
In this paper, the order boundedness and essential norm of generalized weighted composition operators on Bergman spaces with doubling weights are characterized. Specially, we estimate the essential norm of these operators on weighted…
We show that for every orthomodular poset P of finite height there can be defined two operators forming an adjoint pair with respect to an order-like relation defined on the power set of P. This enables us to introduce the so-called…
Let $\mathcal{H}$ be a complex infinite dimensional Hilbert space and $\mathcal{B}(\mathcal{H})$ the algebra of all bounded linear operators on $\mathcal H$. The star partial order is defined by $A\overset{*}{\leq}B$ if and only if…
We give an alternative proof of recent results by the authors on uniform boundedness of dyadic averaging operators in (quasi-)Banach spaces of Hardy-Sobolev and Triebel-Lizorkin type. This result served as the main tool to establish…
We continue the study (initiated in [1]) of Borel measures whose time evolution is provided by an interacting Hamiltonian structure. Here, the principal focus is the development and advancement of deficency in the measure caused by…
We investigate the order of the variance of the optimal alignments score of two independent iid binary random words having the same length. The letters are equiprobable, but the scoring function is such that one letter has a larger score…
We show that any total preorder on a set with $\binom{n}{2}$ elements coincides with the order on pairwise distances of some point collection of size $n$ in $\mathbb{R}^{n-1}$. For linear orders, a collection of $n$ points in…
Motivated by applications in single-cell biology and metagenomics, we investigate the problem of matrix reordering based on a noisy disordered monotone Toeplitz matrix model. We establish the fundamental statistical limit for this problem…
The Isometry Theorem of Chazal et al. and Lesnick is a fundamental result in persistence theory, which states that the interleaving distance between two one-parameter persistence modules is equal to the bottleneck distance between their…
The norm distance between two composition operators is calculated in select cases.
It is often desired that ordinal regression models yield unimodal predictions. However, in many recent works this characteristic is either absent, or implemented using soft targets, which do not guarantee unimodal outputs at inference. In…
We develop elements of a general dilation theory for operator-valued measures and bounded linear maps between operator algebras that are not necessarily completely-bounded. We prove our main results by extending and generalizing some known…
Consider a set $P$ of $n$ points picked uniformly and independently from $[0,1]^d$ for a constant dimension $d$ -- such a point set is extremely well behaved in many aspects. For example, for a fixed $r \in [0,1]$, we prove a new…
We prove well-posedness for higher-order equations in the so-called dNLS hierarchy (also known as part of the Kaup-Newell hierarchy) in almost critical Fourier-Lebesgue and in modulation spaces. Leaning in on estimates proven by the author…
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…
This paper proposes a bilevel hierarchy of strengthened complex moment relaxations for complex polynomial optimization. The key trick entails considering a class of positive semidefinite conditions that arise naturally in characterizing the…
The \textit{biharmonic distance} (BD) is a fundamental metric that measures the distance of two nodes in a graph. It has found applications in network coherence, machine learning, and computational graphics, among others. In spite of BD's…
We study an interval ordering problem introduced by D\"urr et al. [Discrete Appl. Math. 2012] which is motivated by applications in bioinformatics. The task is to order a given set of n intervals with the goal of minimizing a certain…
We give necessary and sufficient conditions for the Hardy operator to be bounded on a rearrangement invariant quasi-Banach space in terms of its Boyd indices.
The superposition calculus for reasoning in first-order logic with equality relies on simplification orderings on terms. Modern saturation provers use the Knuth-Bendix order (KBO) and the lexicographic path order (LPO) for discovering…