English
Related papers

Related papers: Postorder rearrangement operators

200 papers

We study Schauder basis properties for the Haar system in Besov spaces $B^s_{p,q}(\mathbb{R}^d)$. We give a complete description of the limiting cases, obtaining various positive results for $q\leq \min\{1,p\}$, and providing new…

Classical Analysis and ODEs · Mathematics 2022-12-02 Gustavo Garrigós , Andreas Seeger , Tino Ullrich

We investigate the spectral consequences of the uniquely determined Hermitian ordering of the Dirac Hamiltonian with spatially varying mass. In contrast to the nonrelativistic case, where continuous families of admissible prescriptions…

Mesoscale and Nanoscale Physics · Physics 2026-05-15 C. A. S. Almeida

We consider the problem of reconstructing the state of a network of nonlinear dynamical systems in the presence of directed higher-order interactions. Grounded on analytical convergence results, we propose an algorithmic observer design…

Systems and Control · Electrical Eng. & Systems 2026-05-12 Roberto Rizzello , Davide Salzano , Stefano Boccaletti , Pietro De Lellis

A poset $P= (X, \prec)$ has an interval representation if each $x \in X$ can be assigned a real interval $I_x$ so that $x \prec y$ in $P$ if and only if $I_x$ lies completely to the left of $I_y$. Such orders are called \emph{interval…

Combinatorics · Mathematics 2018-04-11 Simona Boyadzhiyska , Garth Isaak , Ann Trenk

The distributed operating room (OR) scheduling problem aims to find an assignment of surgeries to ORs across collaborating hospitals that share their waiting lists and ORs. We propose a stochastic extension of this problem where surgery…

Optimization and Control · Mathematics 2020-10-06 Cheng Guo , Merve Bodur , Dionne M. Aleman , David R. Urbach

For operators representing ill-posed problems, an ordering by ill-posedness is proposed, where one operator is considered more ill-posed than another one if the former can be expressed as a cocatenation of bounded operators involving the…

Functional Analysis · Mathematics 2025-02-06 Stefan Kindermann , Bernd Hofmann

Stationary ergodic processes with finite alphabets are estimated by finite memory processes from a sample, an n-length realization of the process, where the memory depth of the estimator process is also estimated from the sample using…

Statistics Theory · Mathematics 2013-07-25 Zsolt Talata

We study the phenomenon of composite operator renormalization and mixing in systems where time-translational invariance is broken and the evolution is out-of-equilibrium. We show that composite operators mix also through non-local memory…

High Energy Physics - Phenomenology · Physics 2013-07-16 Simone Dresti , Antonio Riotto

In this paper, we prove several new results that give new insights into bilinear systems. We discuss conditions for asymptotic stability using probabilistic arguments. Moreover, we provide a global characterization of reachability in…

Numerical Analysis · Mathematics 2021-04-02 Martin Redmann

We motivate and study an infinite sequence of binary operations on the ordinal numbers, extending the standard arithmetic on the ordinals to higher degrees of iteration. Connections to the hyperoperations on the natural numbers are…

Logic · Mathematics 2025-08-26 Adrian Ducourtial

We have analyzed numerically the localization length of light $\xi$ for nearly periodic arrangements of homogeneous stacks (formed exclusively by right-handed materials) and mixed stacks (with alternating right and left-handed…

Optics · Physics 2015-06-02 O. del Barco , M. Ortuño

A method for introducing the higher order terms in the potential expansion to study the continuous limits of the Toda hierarchy is proposed in this paper. The method ensures that the higher order terms are differential polynomials of the…

Exactly Solvable and Integrable Systems · Physics 2009-11-07 Runliang Lin , Wen-Xiu Ma , Yunbo Zeng

The localization length has been derived for one-dimensional bi-layered structures with random perturbations in the refractive indices for each type of layers. Main attention is paid to the comparison between conventional materials and…

Disordered Systems and Neural Networks · Physics 2015-05-30 E. J. Torres-Herrera , F. M. Izrailev , N. M. Makarov

We study the best approximation and distance problems in the operator space $\B(\HS)$ and in the space of trace class operators $\LS^1(\B(\HS))$. Formulations of distances are obtained in both cases. The case of finite-dimensional…

Functional Analysis · Mathematics 2025-05-20 Saikat Roy

We study rearrangement-invariant spaces $X$ over $[0,\infty)$ for which there exists a function $h:(0,\infty)\to (0,\infty)$ such that \[ \|D_rf\|_X = h(r)\|f\|_X \] for all $f\in X$ and all $r>0$, where $D_r$ is the dilation operator. It…

Functional Analysis · Mathematics 2026-01-27 Santiago Boza , Martin Křepela , Javier Soria

We study $L^p(\mu)$ estimates for the commutator $[H,b]$, where the operator $H$ is a dyadic model of the classical Hilbert transform introduced in \cite{arXiv:2012.10201,arXiv:2212.00090} and is adapted to a non-doubling Borel measure…

Classical Analysis and ODEs · Mathematics 2024-09-04 Tainara Borges , José M. Conde Alonso , Jill Pipher , Nathan A. Wagner

We characterize, in the context of rearrangement invariant spaces, the optimal range space for a class of monotone operators related to the Hardy operator. The connection between optimal range and optimal domain for these operators is…

Functional Analysis · Mathematics 2013-11-15 Javier Soria , Pedro Tradacete

Any sufficiently smooth one-dimensional Calderon-Zygmund convolution operator is the average of Haar shift operators. The latter are dyadic operators which can be efficiently expressed in terms of the Haar basis. This extends the result of…

Classical Analysis and ODEs · Mathematics 2009-11-30 Armen Vagharshakyan

The sequential structure of language, and the order of words in a sentence specifically, plays a central role in human language processing. Consequently, in designing computational models of language, the de facto approach is to present…

Computation and Language · Computer Science 2021-08-25 Rishi Bommasani

We introduce a new symbolic representation based on an original generalization of counter abstraction. Unlike classical counter abstraction (used in the analysis of parameterized systems with unordered or unstructured topologies) the new…

Logic in Computer Science · Computer Science 2015-03-20 Ahmed Rezine