Search results for "Rete"

showing 10 items of 3470 documents

Set-Valued Generalizations of Baire′s Category Theorem

1995

Abstract We prove some generalizations of Baire′s category theorem for chains of iterates of multifunctions defined on Cech-complete spaces. In particular, we extend Lennard′s results stated for functions on complete metric spaces.

Discrete mathematicsApplied MathematicsMathematics::General TopologyBaire spaceBaire measureComplete metric spaceS categoryMetric spaceIterated functionMathematics::Category TheoryBaire category theoremOpen mapping theorem (functional analysis)AnalysisMathematicsJournal of Mathematical Analysis and Applications
researchProduct

Generic unfoldings with the same bifurcation diagram which are not (C0, C0)— equivalent

1997

Discrete mathematicsApplied MathematicsPlanar vector fieldsBifurcation diagramAnalysisMathematicsNonlinear Analysis: Theory, Methods & Applications
researchProduct

A decidable word problem without equivalent canonical term rewriting system

1989

We present a weak associative single-axiom system having the following property: the word problem is decidable with an efficient algorithm even though there does not exist any finite equivalent canonical term rewriting system.

Discrete mathematicsApplied MathematicsPost canonical systemComputer Science ApplicationsDecidabilityPhilosophy of languageComputational Theory and MathematicsConfluenceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONWord problem (mathematics)RewritingEquivalence (formal languages)Computer Science::Formal Languages and Automata TheoryAssociative propertyMathematicsInternational Journal of Computer Mathematics
researchProduct

Erratum to “Testing for selectivity in the dependence of random variables on external factors” [J. Math. Psych. 52 (2008) 128–144]

2010

Discrete mathematicsApplied MathematicsRandom variableGeneral PsychologyMathematicsJournal of Mathematical Psychology
researchProduct

Grundy coloring for power graphs

2003

International audience

Discrete mathematicsApplied Mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][ 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]Power (physics)Brooks' theoremGreedy coloring[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Discrete Mathematics and Combinatorics[ INFO.INFO-DS ] Computer Science [cs]/Data Structures and Algorithms [cs.DS]ComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Partially Square Graphs, Hamiltonicity and Circumference II

2000

Abstract Given a graph G, its partially square graph G∗ is a graph obtained by adding an edge uv for each pair u, v of vertices of G at distance 2 whenever the vertices u and v have a common neighbor x satisfying the condition NG(x) ⊆ NG[u] ∪ NG[v], where NG[x]= NG(x) ∪ {x}. In case G is a claw-free graph, G∗ is equal to G2, We define σ ∗ t = min{ ∑ x∈ d ∗ G (x): S is an independent set in G ∗ and ∣S∣ = t} , where d ∗ G (x) = ∣{y ∈ V∣ xy ∈ E(G∗)}∣ . We give for hamiltonicity and circumference new sufficient conditions depending on and we improve some known results.

Discrete mathematicsApplied Mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]CircumferenceDistance-regular graphGraphCombinatorics[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Graph powerIndependent setCommon neighborDiscrete Mathematics and CombinatoricsBound graphComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Forbidden words in symbolic dynamics

2000

AbstractWe introduce an equivalence relation≃between functions from N to N. By describing a symbolic dynamical system in terms of forbidden words, we prove that the≃-equivalence class of the function that counts the minimal forbidden words of a system is a topological invariant of the system. We show that the new invariant is independent from previous ones, but it is not characteristic. In the case of sofic systems, we prove that the≃-equivalence of the corresponding functions is a decidable question. As a more special application, we show, by using the new invariant, that two systems associated to Sturmian words having “different slope” are not conjugate.

Discrete mathematicsApplied Mathematicsautomata and formal languages010102 general mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Symbolic dynamics[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]0102 computer and information sciencesFunction (mathematics)16. Peace & justice01 natural sciencesDecidabilitysymbolic dynamics010201 computation theory & mathematicsEquivalence relationcombinatoric on words0101 mathematicsInvariant (mathematics)Dynamical system (definition)Equivalence (measure theory)Computer Science::Formal Languages and Automata TheoryWord (group theory)ComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Regular Minimality and Thurstonian-type modeling

2009

Abstract A Thurstonian-type model for pairwise comparisons is any model in which the response (e.g., “they are the same” or “they are different”) to two stimuli being compared depends, deterministically or probabilistically, on the realizations of two randomly varying representations (perceptual images) of these stimuli. The two perceptual images in such a model may be stochastically interdependent but each has to be selectively dependent on its stimulus. It has been previously shown that all possible discrimination probability functions for same–different comparisons can be generated by Thurstonian-type models of the simplest variety, with independent percepts and deterministic decision ru…

Discrete mathematicsApplied Mathematicsmedia_common.quotation_subjectHausdorff spaceMultivariate normal distributionDecision ruleMaxima and minimaSymmetric relationPerceptionEuclidean geometryPairwise comparisonGeneral Psychologymedia_commonMathematicsJournal of Mathematical Psychology
researchProduct

Domains of accretive operators in Banach spaces

2016

LetD(A)be the domain of anm-accretive operatorAon a Banach spaceE. We provide sufficient conditions for the closure ofD(A)to be convex and forD(A)to coincide withEitself. Several related results and pertinent examples are also included.

Discrete mathematicsApproximation propertyGeneral Mathematics010102 general mathematicsBanach spaceClosure (topology)Finite-rank operatorResolvent formalism01 natural sciencesDomain (mathematical analysis)010101 applied mathematicsOperator (computer programming)0101 mathematicsC0-semigroupMathematicsProceedings of the Royal Society of Edinburgh: Section A Mathematics
researchProduct

Exact, efficient, and complete arrangement computation for cubic curves

2006

AbstractThe Bentley–Ottmann sweep-line method can compute the arrangement of planar curves, provided a number of geometric primitives operating on the curves are available. We discuss the reduction of the primitives to the analysis of curves and curve pairs, and describe efficient realizations of these analyses for planar algebraic curves of degree three or less. We obtain a complete, exact, and efficient algorithm for computing arrangements of cubic curves. Special cases of cubic curves are conics as well as implicitized cubic splines and Bézier curves.The algorithm is complete in that it handles all possible degeneracies such as tangential intersections and singularities. It is exact in t…

Discrete mathematicsArrangementsControl and OptimizationComputationAlgebraic curvesMathematical analysisBézier curveSweep line algorithmComputer Science ApplicationsModuli of algebraic curvesComputational MathematicsGeometric designComputational Theory and MathematicsFamily of curvesSweep-line algorithmExact geometric computationGeometric primitiveAlgebraic curveGeometry and TopologyRobustnessComputingMethodologies_COMPUTERGRAPHICSMathematicsComputational Geometry
researchProduct