Separating versus strictly separating vectors
نویسندگان
چکیده
منابع مشابه
Separating invariants
This paper studies separating subsets of an invariant ring or, more generally, of any set consisting of functions. We prove that a subset of a finitely generated algebra always contains a finite separating subset. We also show that a general version of Noether’s degree bound holds for separating invariants, independently of the characteristic. The paper also contains a conceptual investigation ...
متن کاملOn the gap between separating words and separating their reversals
A deterministic finite automaton (DFA) separates two strings w and x if it accepts w and rejects x. The minimum number of states required for a DFA to separate w and x is denoted by sep(w, x). The present paper shows that the difference ∣∣sep(w, x)− sep(w, xR)∣∣ is unbounded for a binary alphabet; here w stands for the mirror image of w. This solves an open problem stated in [Demaine, Eisenstat...
متن کاملBanach module valued separating maps and automatic continuity
For two algebras $A$ and $B$, a linear map $T:A longrightarrow B$ is called separating, if $xcdot y=0$ implies $Txcdot Ty=0$ for all $x,yin A$. The general form and the automatic continuity of separating maps between various Banach algebras have been studied extensively. In this paper, we first extend the notion of separating map for module case and then we give a description of a linear se...
متن کاملOn Partitions Separating Words
Partitions {Lk}k=1 of A + into m pairwise disjoint languages L1, L2, . . . , Lm such that Lk = L + k for k = 1, 2, . . . , m are considered. It is proved that such a closed partition of A+ can separate the words u1, u2, . . . , um ∈ A+ (i.e. each Lk contains exactly one word of the sequence u1, u2, . . . , um) if and only if for each pair i, j of distinct elements in {1, 2, . . . , m}, the word...
متن کاملNon-separating subgraphs
Lovász conjectured that there is a smallest integer f (l) such that for every f (l)-connected graph G and every two vertices s, t of G there is a path P connecting s and t such that G − V (P) is l-connected. This conjecture is still open for l ≥ 3. In this paper, we generalize this conjecture to a k-vertex version: is there a smallest integer f (k, l) such that for every f (k, l)-connected grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1996
ISSN: 0002-9939,1088-6826
DOI: 10.1090/s0002-9939-96-03381-3