Results 1 to 10 of about 1,103 (233)
Journal of Inequalities and Applications, 2023 Let X $\mathcal {X}$ be an infinite-dimensional complex Banach space, B ( X ) $\mathcal {B}(\mathcal {X})$ the algebra of all bounded linear operators on X $\mathcal {X}$ .
Ying Wang
doaj +1 more source
Von Staudt's theorem revisited [PDF]
, 2013 We establish a version of von Staudt's theorem on mappings which preserve harmonic quadruples for projective lines over (not necessarily commutative) rings with "sufficiently many" units, in particular 2 has to be a unit.Comment: More typos ...
Havlicek, Hans
core +1 more source
Quelle politique linguistique pour un développement inclusif et durable en Côte d’Ivoire ? [PDF]
AkofenaRésumé : Riche de sa diversité sociolinguistique et culturelle, la Côte d’Ivoire fait face à une double réalité en lien avec la mosaïque (une soixantaine) de langues sur son terroir.
Tiendaga Sékou KONÉ & Alain Albert ADÉKPATÉ
doaj +1 more source
Preserving Distances in Very Faulty Graphs [PDF]
, 2017 Preservers and additive spanners are sparse (hence cheap to store) subgraphs that preserve the distances between given pairs of nodes exactly or with some small additive error, respectively. Since real-world networks are prone to failures, it makes sense
Bodwin, Greg +3 more
core +2 more sources
Improved Purely Additive Fault-Tolerant Spanners [PDF]
, 2015 Let $G$ be an unweighted $n$-node undirected graph. A \emph{$\beta$-additive spanner} of $G$ is a spanning subgraph $H$ of $G$ such that distances in $H$ are stretched at most by an additive term $\beta$ w.r.t. the corresponding distances in $G$.
Bilò, Davide +4 more
core +1 more source
Spectrum-preserving additive maps
Linear Algebra and its Applications, 1991 Let \(X,Y\) be Banach spaces over the complex field, and \(B(X),B(Y)\) denote the algebra of bounded linear operators on \(X,Y\) respectively. A map \(\Phi: B(X)\to B(Y)\) is said to be spectrum preserving if \(\sigma(\Phi(T))=\sigma(T)\), for every \(T\in B(X)\). The authors prove the following main result.
Omladič, Matjaž, Šemrl, Peter
openaire +1 more source
Linear rank preservers of tensor products of rank one matrices
, 2016 Let $n_1,\ldots,n_k $ be integers larger than or equal to 2. We characterize linear maps $\phi: M_{n_1\cdots n_k}\rightarrow M_{n_1\cdots n_k}$ such that $${\mathrm rank}\,(\phi(A_1\otimes \cdots \otimes A_k))=1\quad\hbox{whenever}\quad{\mathrm rank ...
Huang, Zejun, Shi, Shiyu, Sze, Nung-Sing
core +1 more source
A Linear-Size Logarithmic Stretch Path-Reporting Distance Oracle for General Graphs [PDF]
, 2014 In 2001 Thorup and Zwick devised a distance oracle, which given an $n$-vertex undirected graph and a parameter $k$, has size $O(k n^{1+1/k})$. Upon a query $(u,v)$ their oracle constructs a $(2k-1)$-approximate path $\Pi$ between $u$ and $v$.
Elkin, Michael, Pettie, Seth
core +1 more source
Antioxidants versus Food Antioxidant Additives and Food Preservatives [PDF]
Antioxidants, 2019 Natural and processed foods are fragile and can become unpalatable and/or rotten. The processed food industry uses preservatives to enable distribution, even to different continents, and to extend the useful life of their products. Preservatives impede oxidation, a mandatory step in rotting, either by aerobic or anaerobic mechanisms.
Rafael Franco +2 more
openaire +5 more sources
Reachability Preservers: New Extremal Bounds and Approximation Algorithms
, 2023 We abstract and study \emph{reachability preservers}, a graph-theoretic primitive that has been implicit in prior work on network design. Given a directed graph $G = (V, E)$ and a set of \emph{demand pairs} $P \subseteq V \times V$, a reachability ...
Abboud, Amir, Bodwin, Greg
core