Additive idempotence preservers
نویسندگان
چکیده
منابع مشابه
Better Distance Preservers and Additive Spanners
Wemake improvements to the current upper bounds on pairwise distance preservers and additive spanners. A distance preserver is a sparse subgraph that exactly preserves all distances in a given pair set P . We show that every undirected unweighted graph has a distance preserver on O(max{n|P |, n|P |}) edges, and we conjecture that O(n|P |+ n) is possible. An additive subset spanner is a sparse s...
متن کاملEla Additive Preservers of Tensor Product of Rank One Hermitian Matrices
Let K be a field of characteristic not two or three with an involution and F be its fixed field. Let Hm be the F -vector space of all m-square Hermitian matrices over K. Let ρm denote the set of all rank-one matrices in Hm. In the tensor product space ⊗ k i=1 Hmi , let ⊗ k i=1 ρmi denote the set of all decomposable elements ⊗ k i=1 Ai such that Ai ∈ ρmi , i = 1, . . . , k. In this paper, additi...
متن کاملAn Extension of Parikh's Theorem beyond Idempotence
The commutative ambiguity cambG,X of a context-free grammar G with start symbol X assigns to each Parikh vector v the number of distinct leftmost derivations yielding a word with Parikh vector v. Based on the results on the generalization of Newton’s method to ω-continuous semirings [EKL07b, EKL07a, EKL10], we show how to approximate cambG,X by means of rational formal power series, and give a ...
متن کاملSCT and the idempotence condition Draft
These notes show how to get rid of the idempotence condition (G = G;G) in (δ)-Size Change Termination. Both the “graph algorithm” of the original SCT paper [LJBA01] and the δSCT criterion of BenAmram [BA06] use some kind of idempotence on the potential cycles. This idempotence condition can be replaced by a more semantical condition on the cycles. The new condition is probably not easier to com...
متن کاملLinear Size Distance Preservers
The famous shortest path tree lemma states that, for any node s in a graph G = (V,E), there is a subgraph on O(n) edges that preserves all distances between node pairs in the set {s}×V . A very basic question in distance sketching research, with applications to other problems in the field, is to categorize when else graphs admit sparse subgraphs that preserve distances between a set P of p node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2002
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(02)00340-3