Related papers: Postorder rearrangement operators
Mechanical systems are often characterized only by their response to certain loads known from experiments or simulations. The obtained data can be used for various purposes: system analysis, design of mathematical models, or construction of…
We consider the problem of binary string reconstruction from the multiset of its substring compositions, i.e., referred to as the substring composition multiset, first introduced and studied by Acharya et al. We introduce a new algorithm…
We give a complete description of order isomorphisms between operator intervals in general von Neumann algebras. For the description, we use Jordan $^*$-isomorphisms and locally measurable operators. Our results generalize several works by…
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
In this paper we use abstract vector spaces and their duals without any canonical basis. Some of our results can be extended to infinite dimensional vector spaces too, but here we consider only finite dimensional spaces. We focus on a…
In this paper we describe a novel a procedure to build a linear order from an arbitrary poset which (i) preserves the original ordering and (ii) allows to extend monotonic and antitonic mappings defined over the original poset to monotonic…
Dynamical systems are pervasive in almost all engineering and scientific applications. Simulating such systems is computationally very intensive. Hence, Model Order Reduction (MOR) is used to reduce them to a lower dimension. Most of the…
Fix integers $m\ge 2$, $n\ge 1$. We prove the existence of a bounded linear extension operator for $C^{m-1,1}(\R^n)$ with operator norm at most $\exp(\gamma D^k)$, where $D := \binom{m+n-1}{n}$ is the number of multiindices of length $n$…
In this study we consider the approximation numbers of differences of composition operators acting on the Hardy-Hilbert space H 2 (D). We obtain both upper and lower bounds for these approximation numbers and by applying these general…
In this paper we study those generic intervals in the Bruhat order of the symmetric group that are isomorphic to the principal order ideal of a permutation w, and consider when the minimum and maximum elements of those intervals are related…
The termination method of weakly monotonic algebras, which has been defined for higher-order rewriting in the HRS formalism, offers a lot of power, but has seen little use in recent years. We adapt and extend this method to the alternative…
We investigate the stability properties of discrete and hybrid stochastic nonlinear dynamical systems. More precisely, we extend the stochastic contraction theorems (which were formulated for continuous systems) to the case of discrete and…
The concept of operator residuation for bounded posets with unary operation was introduced by the first two authors. It turns out that in some cases when these operators are transformed into lattice terms and the poset ${\mathbf P}$ is…
The interval poset of a permutation is the set of intervals of a permutation, ordered with respect to inclusion. It has been introduced and studied recently in [B. Tenner, arXiv:2007.06142]. We study this poset from the perspective of the…
The $2$-adic complexity has been well-analyzed in the periodic case. However, we are not aware of any theoretical results on the $N$th $2$-adic complexity of any promising candidate for a pseudorandom sequence of finite length $N$ or…
Dependency distance minimization (DDm) is a well-established principle of word order. It has been predicted theoretically that DDm implies compression, namely the minimization of word lengths. This is a second order prediction because it…
Reachability analysis aims at identifying states reachable by a system within a given time horizon. This task is known to be computationally expensive for linear hybrid systems. Reachability analysis works by iteratively applying continuous…
We study higher-order elliptic operators on one-dimensional ramified structures (networks). We introduce a general variational framework for fourth-order operators that allows us to study features of both hyperbolic and parabolic equations…
We prove that, for every norm on $\mathbb{R}^d$ and every $E \subseteq \mathbb{R}^d$, the Hausdorff dimension of the distance set of $E$ with respect to that norm is at least $\dim_{\mathrm{H}} E - (d-1)$. An explicit construction follows,…
Network data has become widespread, larger, and more complex over the years. Traditional network data is dyadic, capturing the relations among pairs of entities. With the need to model interactions among more than two entities, significant…