Related papers: Postorder rearrangement operators
We study second order consensus dynamics with random additive disturbances. We investigate three different performance measures: the steady-state variance of pairwise differences between vertex states, the steady-state variance of the…
This paper introduces new technique for efficient calculation of different Shannon information measures which operates Binary Decision Diagrams (BDDs). We offer an algorithm of BDD reordering which demonstrates the improvement of the…
Recent development in the reconstruction of the large-scale structure (LSS) has seen significant improvement in restoring the linear baryonic acoustic oscillation (BAO) from at least the non-linear matter field. This outstanding performance…
We study the space requirements of a sorting algorithm where only items that at the end will be adjacent are kept together. This is equivalent to the following combinatorial problem: Consider a string of fixed length n that starts as a…
In the early 1970's, Richard Stanley and Kenneth Johnson introduced and laid the groundwork for studying the order polynomial of partially ordered sets (posets). Decades later, Hamaker, Patrias, Pechenik, and Williams introduced the term…
The classical rearrangement inequality provides bounds for the sum of products of two sequences under permutations of terms and show that similarly ordered sequences provide the largest value whereas opposite ordered sequences provide the…
A preferential arrangement of a set is a total ordering of the elements of that set with ties allowed. A barred preferential arrangement is one in which the tied blocks of elements are ordered not only amongst themselves but also with…
We establish optimal order a priori error estimates for implicit-explicit BDF methods for abstract semilinear parabolic equations with time-dependent operators in a complex Banach space settings, under a sharp condition on the…
We establish the convergence of the forward-backward splitting algorithm based on Bregman distances for the sum of two monotone operators in reflexive Banach spaces. Even in Euclidean spaces, the convergence of this algorithm has so far…
A bi-level optimization framework (BiOPT) was proposed in [3] for convex composite optimization, which is a generalization of bi-level unconstrained minimization framework (BLUM) given in [20]. In this continuation paper, we introduce a…
In this paper, we study diffusions with bounded pairwise interaction. We show for the first time propagation of chaos on arbitrary time horizons in a stronger $L^2$-based distance, as opposed to the usual Wasserstein or relative entropy…
In this paper, we discuss reduced order modelling approaches to bifurcating systems arising from continuum mechanics benchmarks. The investigation of the beam's deflection is a relevant topic of investigation with fundamental implications…
Many topological data analysis (TDA) pipelines compute large collections of persistence diagrams, yet vectorizations and kernel methods discard the rank-induced implication relations among persistence intervals that are essential for…
Birational rowmotion is an action on the space of assignments of rational functions to the elements of a finite partially-ordered set (poset). It is lifted from the well-studied rowmotion map on order ideals (equivariantly on antichains) of…
We consider the number of linear extensions of an N-free order P. We give upper and lower bounds on this number in terms of parameters of the corresponding arc diagram. We propose a dynamic programming algorithm to calculate the number. The…
We carry out a systematic construction of the coarse-grained dynamical equation of motion for the orientational order parameter for a two-dimensional active nematic, that is a nonequilibrium steady state with uniaxial, apolar orientational…
We present a sorting algorithm for the case of recurrent random comparison errors. The algorithm essentially achieves simultaneously good properties of previous algorithms for sorting $n$ distinct elements in this model. In particular, it…
We study a class of rearrangement problems under a novel pick-n-swap prehensile manipulation model, in which a robotic manipulator, capable of carrying an item and making item swaps, is tasked to sort items stored in lattices of variable…
We show that the order complex of intervals of a poset, ordered by inclusion, is a Tchebyshev triangulation of the order complex of the original poset. Besides studying the properties of this transformation, we show that the dual of the…
The concept of operator left residuation has been introduced by the authors in a previous paper. Modifications of so-called quantum structures, in particular orthomodular posets, like pseudo-orthomodular, pseudo-Boolean and Boolean posets…