Related papers: Postorder rearrangement operators

This thesis develops exact analytical tools to study strongly correlated stochastic systems, with a focus on extreme value statistics, gap statistics, and full counting statistics in multi-particle processes. A central contribution is the…

A dilator is a particularly uniform transformation $X\mapsto T_X$ of linear orders that preserves well-foundedness. We say that $X$ is a Bachmann-Howard fixed point of $T$ if there is an almost order preserving collapsing function…

We study the behavior of Haar coefficients in Besov and Triebel-Lizorkin spaces on $\mathbb{R}$, for a parameter range in which the Haar system is not an unconditional basis. First, we obtain a range of parameters, extending up to…

Let H be a connected bipartite graph with n nodes and m edges. We give an O(nm) time algorithm to decide whether H is an interval bigraph. The best known algorithm has time complexity O(nm^6(m + n) \log n) and it was developed in 1997 [18].…

First-order stochastic methods are the state-of-the-art in large-scale machine learning optimization owing to efficient per-iteration complexity. Second-order methods, while able to provide faster convergence, have been much less explored…

We describe the spaces $H^1(R)$ and BMO$(R)$ in terms of their closely related, simpler dyadic and two-sided counterparts. As a result of these characterizations we establish when a bounded linear operator defined on dyadic or two-sided…

We consider the problem of online interval scheduling on a single machine, where intervals arrive online in an order chosen by an adversary, and the algorithm must output a set of non-conflicting intervals. Traditionally in scheduling…

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…

In this paper, we revisit the problem of finding the longest systematic-length $k$ for a linear minimum storage regenerating (MSR) code with optimal repair of only systematic part, for a given per-node storage capacity $l$ and an arbitrary…

In this article we explore several aspects concerning to the Moore-Penrose inverse of a bounded linear operator. On the one hand, we study monotonicity properties of the Moore-Penrose inverse with respect to the L\"owner, star, minus, sharp…

Exterior powers play important roles in persistent homology in computational geometry. In the present paper we study the problem of extracting the $K$ longest intervals of the exterior-power layers of a tame persistence module. We prove a…

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…

The recently introduced DeepONet operator-learning framework for PDE control is extended from the results for basic hyperbolic and parabolic PDEs to an advanced hyperbolic class that involves delays on both the state and the system output…

Activities such as the movement of passengers and goods, the transfer of physical or digital assets, web navigation and even successive passes in football, result in timestamped paths through a physical or virtual network. The need to…

We define and study the notions of ribbon dioperads and modular ribbon properads. We give a Lie algebra structure on the colimit total object and the limit total object of a ribbon dioperad, and we give a norm map between them. We give a…

In this article, we introduce and study accelerated Landweber methods for linear ill-posed problems obtained by an alteration of the coefficients in the three-term recurrence relation of the \nu-methods. The residual polynomials of the…

Proof terms are syntactic expressions that represent computations in term rewriting. They were introduced by Meseguer and exploited by van Oostrom and de Vrijer to study equivalence of reductions in (left-linear) first-order term rewriting…

Let H be a complex Hilbert space and denote by Bs(H) the set of all self-adjoint bounded linear operators on H. In this paper we describe the form of all bijective maps (no linearity or continuity is assumed) on Bs(H) which preserve the…

We study the problem of extending any order-preserving Lipschitz function that maps a subset of a partially ordered Hilbert space X into a Hadamard poset Y without increasing its Lipschitz constant and preserving its monotonicity. This sort…

S. Gudder and, later, S. Pulmanova and E. Vincekova, have studied in two recent papers a certain ordering of bounded self-adjoint operators on a Hilbert space. We present some further results on this ordering and show that some structure…