Search results for "Data type"
showing 10 items of 1183 documents
Lineability of non-differentiable Pettis primitives
2014
Let \(X\) be an infinite-dimensional Banach space. In 1995, settling a long outstanding problem of Pettis, Dilworth and Girardi constructed an \(X\)-valued Pettis integrable function on \([0,1]\) whose primitive is nowhere weakly differentiable. Using their technique and some new ideas we show that \(\mathbf{ND}\), the set of strongly measurable Pettis integrable functions with nowhere weakly differentiable primitives, is lineable, i.e., there is an infinite dimensional vector space whose nonzero vectors belong to \(\mathbf{ND}\).
A note on the distance set problem in the plane
2001
We use a simple geometric-combinatorial argument to establish a quantitative relation between the generalized Hausdorff measure of a set and its distance set, extending a result originally due to Falconer.
Loop-free Gray code algorithm for the e-restricted growth functions
2011
The subject of Gray codes algorithms for the set partitions of {1,2,...,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of [email protected]?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,...,n}, Ruskey and Savage (1994) [9] generalized [email protected]?s results and give two Gray codes for the set of partitions of {1,2,...,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques. In this paper, we introduce the set of e-restricte…
DEFECT THEOREMS FOR TREES
2000
We generalize different notions of a rank of a set of words to sets of trees. We prove that almost all of those ranks can be used to formulate a defect theorem. However, as we show, the prefix rank forms an exception.
A Newman property for BLD-mappings
2019
We define a Newman property for BLD-mappings and prove that for a BLD-mapping between generalized manifolds equipped with complete path-metrics, this property is equivalent to the branch set being porous when the codomain is LLC. peerReviewed
Generalized ``transition probability''
1975
An operationally meaningful symmetric function defined on pairs of states of an arbitrary physical system is constructed and is shown to coincide with the usual “transition probability” in the special case of systems admitting a quantum-mechanical description. It can be used to define a metric in the set of physical states. Conceivable applications to the analysis of certain aspects of Quantum Mechanics and to its possible modifications are mentioned.
Quantum walks on two-dimensional grids with multiple marked locations
2015
The running time of a quantum walk search algorithm depends on both the structure of the search space (graph) and the configuration (the placement and the number) of marked locations. While the first dependence has been studied in a number of papers, the second dependence remains mostly unstudied.We study search by quantum walks on the two-dimensional grid using the algorithm of Ambainis, Kempe and Rivosh [3]. The original paper analyses one and two marked locations only. We move beyond two marked locations and study the behaviour of the algorithm for several configurations of multiple marked locations.In this paper, we prove two results showing the importance of how the marked locations ar…
Thin Bases of Order Two
2001
AbstractA set A⊆N0 is called a basis of order two if A+A≔{a+a′∣a, a′∈A}=N0. If n∈N then A(n) denotes the number of a∈A with 1⩽a⩽n. In this paper bases A, B, C of order two are given such thatlimA(n)n=253,limB(n)n=72andlimC(n)n=101653.
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…