Search results for " set"
showing 10 items of 2095 documents
Characterizing varieties of colength ≤4
2009
Let A be an associative algebra over a field F of characteristic zero, and let χ n (A), n = 1,2,…, be the sequence of cocharacters of A. For every n ≥ 1, let l n (A) denote the nth colength of A, counting the number of S n -irreducibles appearing in χ n (A). In this article, we classify the algebras A such that the sequence of colengths l n (A), n = 1,2,…, is bounded by four. Moreover we construct a finite number of algebras A 1,…, A d , such that l n (A) ≤ 4 if and only if A 1,…, A d ∉ var(A).
Absolutely summing operators on C[0,1] as a tree space and the bounded approximation property
2010
Abstract Let X be a Banach space. For describing the space P ( C [ 0 , 1 ] , X ) of absolutely summing operators from C [ 0 , 1 ] to X in terms of the space X itself, we construct a tree space l 1 tree ( X ) on X. It consists of special trees in X which we call two-trunk trees. We prove that P ( C [ 0 , 1 ] , X ) is isometrically isomorphic to l 1 tree ( X ) . As an application, we characterize the bounded approximation property (BAP) and the weak BAP in terms of X ∗ -valued sequence spaces.
On n–Fold Blocking Sets
1986
An n-fold blocking set is a set of n-disjoint blocking sets. We shall prove upper and lower bounds for the number of components in an n-fold blocking set in projective and affine spaces.
M-valued Measure of Roughness for Approximation of L-fuzzy Sets and Its Topological Interpretation
2015
We develop a scheme allowing to measure the “quality” of rough approximation of fuzzy sets. This scheme is based on what we call “an approximation quadruple” \((L,M,\varphi ,\psi )\) where L and M are cl-monoids (in particular, \(L=M=[0,1]\)) and \(\psi : L \rightarrow M\) and \(\varphi : M \rightarrow L\) are satisfying certain conditions mappings (in particular, they can be the identity mappings). In the result of realization of this scheme we get measures of upper and lower rough approximation for L-fuzzy subsets of a set equipped with a reflexive transitive M-fuzzy relation R. In case the relation R is also symmetric, these measures coincide and we call their value by the measure of rou…
Estimating the length of minimal spanning trees in compression of files
1984
Compression of a formatted file by a minimal spanning tree (MST) is studied. Here the records of the file are considered as the nodes of a weighted undirected graph. Each record pair is connected in the graph and the corresponding arc is weighted by the sum of field lengths of those fields which differ in the two records. The actual compression is made by constructing an MST of the graph and by storing it in an economic way to preserve the information of the file. The length of the MST is a useful measure in the estimation of the power of the compression. In the paper we study upper bounds of this length, especially in the case where the field lengths of the different fields may vary. The u…
Partial Finitely Generated Bi-Ideals
2016
Partial words have been studied by Blanchet-Sadri et al., but bi-ideals or reccurrent words have been studied for centuries by many researchers. This paper gives a solution for some problems for partial reccurrent words. This paper gives an algorithm for a given finitely generated bi-ideal, how to construct a new basis of ultimately finitely generated bi-ideal, which generates the same given bi-ideal. The paper states that it is always possible to find a basis for a given finitely generated bi-ideal. The main results of this paper are presented in third section. At first, we show that if two irreduciable bi-ideals are different, they will differ in infinitely many places. This led to the st…
Countable connected spaces and bunches of arcs in R3
2006
Abstract We investigate the images (also called quotients) of countable connected bunches of arcs in R 3 , obtained by shrinking the arcs to points (see Section 2 for definitions of new terms). First, we give an intrinsic description of such images among T 1 -spaces: they are precisely countable and weakly first countable spaces. Moreover, an image is first countable if and only if it can be represented as a quotient of another bunch with its projection hereditarily quotient (Theorem 2.7). Applying this result we see, for instance, that two classical countable connected T 2 -spaces—the Bing space [R.H. Bing, A connected countable Hausdorff space, Proc. Amer. Math. Soc. 4 (1953) 474], and th…
Ranking fuzzy interval numbers in the setting of random sets – further results
1999
Abstract We present some new properties of several fuzzy order relations, defined on the set of fuzzy numbers, from among those introduced in [S. Chanas, M. Delgado, J.L. Verdegay, M.A. Vila, Information Sciences 69 (1993) 201–217]. The main result is proving that four from among the relations considered in [S. Chanas, M. Delgado, J.L. Verdegay, M.A. Vila, Information Sciences 69 (1993) 201–217] are strongly transitive (s-transitive).
Uncountable classical and quantum complexity classes
2018
It is known that poly-time constant-space quantum Turing machines (QTMs) and logarithmic-space probabilistic Turing machines (PTMs) recognize uncountably many languages with bounded error (A.C. Cem Say and A. Yakaryılmaz, Magic coins are useful for small-space quantum machines. Quant. Inf. Comput. 17 (2017) 1027–1043). In this paper, we investigate more restricted cases for both models to recognize uncountably many languages with bounded error. We show that double logarithmic space is enough for PTMs on unary languages in sweeping reading mode or logarithmic space for one-way head. On unary languages, for quantum models, we obtain middle logarithmic space for counter machines. For binary la…
Uncountable Realtime Probabilistic Classes
2018
We investigate the minimal cases for realtime probabilistic machines that can define uncountably many languages with bounded error. We show that logarithmic space is enough for realtime PTMs on unary languages. On non-unary case, we obtain the same result for double logarithmic space, which is also tight. When replacing the work tape with a few counters, we can still achieve similar results for unary linear-space two-counter automata, unary sublinear-space three-counter automata, and non-unary sublinear-space two-counter automata. We also show how to slightly improve the sublinear-space constructions by using more counters.