Search results for " set"

showing 10 items of 2095 documents

Algebraic Structures of Rough Sets in Representative Approximation Spaces

2003

Abstract In this paper a generalized notion of an approximation space is considered. By an approximation space we mean an ordered pair (U, C ), where U is a finite nonempty set and C is a covering of U. According to connections between rough sets and concepts we define two types of approximation operations. Hence we obtain two families of rough sets. We show that these families form lattices in special types of representative approximation spaces. The operations on rough sets defined in the above lattices are analogous to classical operations on sets.

Discrete mathematicsGeneral Computer ScienceAlgebraic structureRough setsSpace (mathematics)representative approximation spaceTheoretical Computer ScienceSet (abstract data type)Ordered pairalgebra of rough sets.Rough setapproximation operationsMathematicsComputer Science(all)Electronic Notes in Theoretical Computer Science
researchProduct

On the hardness of optimization in power-law graphs

2008

Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y"i of a given degree i is proportional to i^-^@b where @b>0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent @b? Our main result is the proof that many classical NP-hard graph-theoretic optimizati…

Discrete mathematicsGeneral Computer ScienceVertex coverPower-law graphsGraph construction algorithmsClique (graph theory)Theoretical Computer ScienceCombinatoricsIndifference graphDominating setChordal graphIndependent setNP-hardnessCombinatorial optimizationGraph optimization problemsMaximal independent setMathematicsComputer Science(all)Theoretical Computer Science
researchProduct

Bounds for minimum feedback vertex sets in distance graphs and circulant graphs

2008

Graphs and Algorithms

Discrete mathematicsGeneral Computer Science[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Neighbourhood (graph theory)[ INFO.INFO-DM ] Computer Science [cs]/Discrete Mathematics [cs.DM][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Feedback arc setTheoretical Computer ScienceCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Circulant graphChordal graphIndependent setDiscrete Mathematics and CombinatoricsMaximal independent setFeedback vertex setRegular graph[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]MathematicsMathematicsofComputing_DISCRETEMATHEMATICS
researchProduct

On set-valued cone absolutely summing maps

2009

Spaces of cone absolutely summing maps are generalizations of Bochner spaces Lp(μ, Y), where (Ω, Σ, μ) is some measure space, 1 ≤ p ≤ ∞ and Y is a Banach space. The Hiai-Umegaki space \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) of integrably bounded functions F: Ω → cbf(X), where the latter denotes the set of all convex bounded closed subsets of a separable Banach space X, is a set-valued analogue of L1(μ, X). The aim of this work is to introduce set-valued cone absolutely summing maps as a generalization of \( \mathcal{L}^1 \left[ {\sum ,cbf(X)} \right] \) , and to derive necessary and sufficient conditions for a set-valued map to be such a set-valued cone absolutely summing map. We …

Discrete mathematicsGeneral MathematicsBanach spaceBochner spaceSpace (mathematics)Measure (mathematics)Separable spaceCombinatoricsBanach lattice Bochner space Cone absolutely summing operator Integrably bounded set-valued function Set-valued operatorNumber theoryCone (topology)Settore MAT/05 - Analisi MatematicaBounded functionMathematicsCentral European Journal of Mathematics
researchProduct

Countable recognizability of primitive periodic finitary linear groups

1997

Discrete mathematicsGeneral MathematicsCountable setFinitaryMathematicsMathematical Proceedings of the Cambridge Philosophical Society
researchProduct

Characterizing extreme points of polyhedra an extension of a result by Wolfgang Bühler

1982

This paper reconsiders the characterization given by Buhler admitting convex polyhedra of probability distributions on a finite or countable set which are given by systems of linear inequalities more complex than those considered before.

Discrete mathematicsGeneral MathematicsRegular polygonInteger points in convex polyhedraManagement Science and Operations ResearchCombinatoricsPolyhedronLinear inequalityConvex polytopeCountable setExtreme pointSoftwareSpherical polyhedronMathematicsZeitschrift für Operations Research
researchProduct

Description of the limit set of Henstock–Kurzweil integral sums of vector-valued functions

2015

Abstract Let f be a function defined on [ 0 , 1 ] and taking values in a Banach space X . We show that the limit set I HK ( f ) of Henstock–Kurzweil integral sums is non-empty and convex when the function f has an integrable majorant and X is separable. In the same setting we give a complete description of the limit set.

Discrete mathematicsHenstock–Kurzweil integralApplied MathematicsMathematics::Classical Analysis and ODEsBanach spaceRiemann integralFunction (mathematics)Separable spacesymbols.namesakeSettore MAT/05 - Analisi MatematicaImproper integralsymbolsHenstock–Kurzweil integral Limit set of integral sums Multifunction Aumann integralLimit setVector-valued functionAnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Categories of lattice-valued sets as categories of arrows

2006

In this paper we introduce a category X(A) which is a generalization of the category of lattice-valued subsets of sets Set(JCPos) introduced by us earlier. We show the necessary and sufficient conditions for X(A) to be topological over XxA.

Discrete mathematicsHigher category theoryClosed categoryArtificial IntelligenceLogicMathematics::Category TheoryCategoryConcrete categoryCategory of topological spacesCategory of setsTopological category2-categoryMathematicsFuzzy Sets and Systems
researchProduct

Constructive proofs of representation theorems in separable Hilbert space

1964

Discrete mathematicsHilbert's second problemPure mathematicsHilbert manifoldRiesz representation theoremApplied MathematicsGeneral MathematicsRigged Hilbert spaceCylinder set measureHilbert's basis theoremConstructivesymbols.namesakesymbolsKuiper's theoremMathematicsCommunications on Pure and Applied Mathematics
researchProduct

Generalized iterated function systems on the spacel∞(X)

2014

Abstract In the last decades there has been a current effort to extend the classical Hutchinson theory of iterated function systems composed by contractions on a metric space X into itself to more general spaces and infinitely many mappings. In this paper we consider the (countable) iterated function systems consisting of some generalized contractions on the product space X I into X , where I is an arbitrary set of natural numbers. Some approximations of the attractors of the respective iterated function systems are given.

Discrete mathematicsHutchinson operatorMetric spaceIterated function systemCollage theoremApplied MathematicsCountable setContraction mappingTopological conjugacySpace (mathematics)AnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct