Related papers: Smallest order closed sublattices and option spann…
We consider semiflows in general Banach spaces motivated by monotone cyclic feedback systems or differential equations with integer-valued Lyapunov functionals. These semiflows enjoy strong monotonicity properties with respect to cones of…
Let $G$ be a graph and let $f$ be a positive integer-valued function on $V(G)$. In this paper, we show that if for all $S\subseteq V(G)$, $\omega(G\setminus S)<\sum_{v\in S}(f(v)-2)+2+\omega(G[S])$, then $G$ has a spanning tree $T$…
An alternative proof is given of the existence of greatest lower bounds in the imbalance order of binary maximal instantaneous codes of a given size. These codes are viewed as maximal antichains of a given size in the infinite binary tree…
For a left vector space V over a totally ordered division ring F, let Co(V) denote the lattice of convex subsets of V. We prove that every lattice L can be embedded into Co(V) for some left F-vector space V. Furthermore, if L is finite…
In our previous work, we introduced the notion of the twisted Alexander vanishing order of knots, defined as the order of the smallest finite group for which the corresponding twisted Alexander polynomial vanishes. In this paper, we explore…
It has been shown that, regarding a terminating right-linear overlay term rewrite system (TRS), any rewrite sequence ending with a normal form can be simulated by the innermost reduction. In this paper, using this simulation property, we…
Let $(x_n)$ be a sequence in a Banach space $X$ which does not converge in norm, and let $E$ be an isomorphically precisely norming set for $X$ such that \[ \sum_n |x^*(x_{n+1}-x_n)|< \infty, \; \forall x^* \in E. \qquad (*) \] Then there…
We prove that the join of two sets may actually fall into a lower level of the extended low hierarchy than either of the sets. In particular, there exist sets that are not in the second level of the extended low hierarchy, EL_2, yet their…
We employ the theory of elementary submodels to improve a recent result by Aron, Jaramillo and Le Donne (Ann. Acad. Sci. Fenn. Math., to appear) concerning restricting uniformly open, continuous surjections to smaller subspaces where they…
Every reduced ring $R$ has a natural partial order defined by $a\le b$ if $a^2=ab$; it generalizes the natural order on a boolean ring. The article examines when $R$ is a lower semi-lattice in this order with examples drawn from weakly Baer…
We study the closures of subgroups, semilattices and different kinds of semigroup extensions in semitopological inverse semigroups with continuous inversion. In particularly we show that a topological group $G$ is $H$-closed in the class of…
Let $G=(V,E)$ be a strongly biconnected directed graph. In this paper we consider the problem of computing an edge subset $H \subseteq E$ of minimum size such that the directed subgraph $(V,H)$ is strongly biconnected.
We study the Borel subsets of the plane that can be made closed by refining the Polish topology on the real line. These sets are called potentially closed. We first compare Borel subsets of the plane using products of continuous functions.…
We investigate the problem of simultaneously dominating all spanning trees of a given graph. We prove that on 2-connected graphs, a subset of the vertices dominates all spanning trees of the graph if and only if it is a vertex cover. Using…
Minimal spanning trees on infinite vertex sets are investigated. A criterion for minimality of a spanning tree having a finite length is obtained, which generalizes the corresponding classical result for finite sets. It is given an analytic…
Strassen's theorem asserts that for given marginal probabilities $\mu,\nu$ there exists a martingale starting in $\mu$ and terminating in $\nu$ if and only if $\mu,\nu$ are in convex order. From a financial perspective, it guarantees the…
We define a new lattice structure on the elements of a finite Coxeter group W. This lattice, called the shard intersection order, is weaker than the weak order and has the noncrossing partition lattice NC(W) as a sublattice. The new…
Ceballos and Pons generalized weak order on permutations to a partial order on certain labeled trees, thereby introducing a new class of lattices called $s$-weak order. They also generalized the Tamari lattice by defining a particular…
In this paper, we consider a condition on subspaces in order to improve bounds given in the Bernstein's Lethargy Theorem (BLT) for Banach spaces. Let $d_1 \geq d_2 \geq \dots d_n \geq \dots > 0$ be an infinite sequence of numbers converging…
Subgraph complementation is an operation that toggles all adjacencies inside a selected vertex set. Given a graph \(G\) and a target class \(\mathcal{C}\), the Minimum Subgraph Complementation problem asks for a minimum-size vertex set…