Related papers: Postorder rearrangement operators
Consider a linear ordering equipped with a finite sequence of monadic predicates. If the ordering contains an interval of order type \omega or -\omega, and the monadic second-order theory of the combined structure is decidable, there exists…
We characterize the Borel measures $\mu$ on $\mathbb{R}$ for which the associated dyadic Hilbert transform, or its adjoint, is of weak-type $(1,1)$ and/or strong-type $(p,p)$ with respect to $\mu$. Surprisingly, the class of such measures…
The Landau-Lifshitz equation is the first in an infinite series of approximations to the Lorentz-Abraham-Dirac equation obtained from `reduction of order'. We show that this series is divergent, predicting wildly different dynamics at…
We consider Quantum OBDD model. It is restricted version of read-once Quantum Branching Programs, with respect to "width" complexity. It is known that maximal complexity gap between deterministic and quantum model is exponential. But there…
We provide a simple method and relevant theoretical analysis for efficiently estimating higher-order lp distances. While the analysis mainly focuses on l4, our methodology extends naturally to p = 6,8,10..., (i.e., when p is even).…
Linearizing two partial orders to maximize the number of adjacencies and minimize the number of breakpoints is APX-hard. This holds even if one of the two partial orders is already a linear order and the other is an interval order, or if…
Let (W, S) be a Coxeter system. We investigate combinatorially certain partial orders, called extended Bruhat orders, on a (W x W)-set W(N,C), which depends on W, a subset N of S, and a component C of N. We determine the length of the…
The structure of all the permutations of a sequence can be represented as a permutohedron, a graph where vertices are permutations and two vertices are linked if a swap of adjacent elements in the permutation of one of the vertices produces…
We study large linear structures inside sets arising in the theory of norm-attaining operators. We provide several results in the context of lineability, spaceability, maximal-spaceability, and $(\alpha, \beta)$-spaceability for sets of…
A poset $P = (X,\prec)$ is a unit OC interval order if there exists a representation that assigns an open or closed real interval $I(x)$ of unit length to each $x \in P$ so that $x \prec y$ in $P$ precisely when each point of $I(x)$ is less…
When analyzing stellarator configurations, it is common to perform an asymptotic expansion about the magnetic axis. This so-called near-axis expansion is convenient for the same reason asymptotic expansions often are, namely, it reduces the…
This paper considers single-machine scheduling problems in which a given solution, i.e. an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts,…
Effectively performing object rearrangement is an essential skill for mobile manipulators, e.g., setting up a dinner table or organizing a desk. A key challenge in such problems is deciding an appropriate manipulation order for objects to…
We discuss some issues arising in the evaluation of confidence intervals in the presence of nuisance parameters (systematic uncertainties) by means of direct Neyman construction in multi-dimensional space. While this kind of procedure…
We propose a study of structured non-convex non-concave min-max problems which goes beyond standard first-order approaches. Inspired by the tight understanding established in recent works [Adil et al., 2022, Lin and Jordan, 2022b], we…
Let $H$ be a reflexive, dense, separable, infinite dimensional complex Hilbert space and let $B(H)$ be the algebra of all bounded linear operators on $H$. In this paper, we carry out characterizations of norm-attainable operators in normed…
We will investigate proof-theoretic and linguistic aspects of first-order linear logic. We will show that adding partial order constraints in such a way that each sequent defines a unique linear order on the antecedent formulas of a sequent…
This work proposes a Bayesian inference method for the reduced-order modeling of time-dependent systems. Informed by the structure of the governing equations, the task of learning a reduced-order model from data is posed as a Bayesian…
We construct orthogonal arrays OA$_{\lambda} (k,n)$ (of strength two) having a row that is repeated $m$ times, where $m$ is as large as possible. In particular, we consider OAs where the ratio $m / \lambda$ is as large as possible; these…
We study approximately orthogonality (in the sense of Dragomir) preserving and reversing operators. We show that for some orthogonality notations, an operator defined from a finite-dimensional Banach space to a normed linear space is…