Search results for "Crete"

showing 10 items of 2495 documents

Quasi Conjunction and Inclusion Relation in Probabilistic Default Reasoning

2011

We study the quasi conjunction and the Goodman & Nguyen inclusion relation for conditional events, in the setting of probabilistic default reasoning under coherence. We deepen two recent results given in (Gilio and Sanfilippo, 2010): the first result concerns p-entailment from a family F of conditional events to the quasi conjunction C(S) associated with each nonempty subset S of F; the second result, among other aspects, analyzes the equivalence between p-entailment from F and p-entailment from C(S), where S is some nonempty subset of F. We also characterize p-entailment by some alternative theorems. Finally, we deepen the connections between p-entailment and the Goodman & Nguyen inclusion…

Discrete mathematicsClass (set theory)goodman & nguyen inclusion relationSettore MAT/06 - Probabilita' E Statistica MatematicaSettore INF/01 - Informaticap-entailment.; quasi conjunction; goodman & nguyen inclusion relation; qand rule; coherence; probabilistic default reasoning; p-entailmentProbabilistic logicqand ruleprobabilistic default reasoningConsistency (knowledge bases)Coherence (philosophical gambling strategy)p-entailmentCoherence probabilistic default reasoning quasi conjunction Goodman & Nguyen inclusion relation QAND rule p-entailment.coherenceConjunction (grammar)Default reasoningquasi conjunctionGreatest elementAlgorithmEquivalence (measure theory)Mathematics
researchProduct

ℓp-solutions of countable infinite systems of equations and applications to electrical circuits

1991

In the preceding chapter we have studied a lumped parameter model of a class of circuits containing a finite number of elements. Here we are interested in qualitative properties of the network in Figure 3.1.

Discrete mathematicsClass (set theory)lawTruncation error (numerical integration)Electrical networkCountable setInfinite systemsFinite setMathematicslaw.inventionNormed vector spaceElectronic circuit
researchProduct

Unitary Groups Acting on Grassmannians Associated with a Quadratic Extension of Fields

2006

Let (V, H) be an anisotropic Hermitian space of finite dimension over the algebraic closure of a real closed field K. We determine the orbits of the group of isometries of (V, H) in the set of K-subspaces of V . Throughout the paper K denotes a real closed field and K its algebraic closure. Then it is well known (see, for example, [4, Chapter 2], [23]; see also [8]) that K = K(i) with i = √−1. Also we let (V,H) be an anisotropic Hermitian space (with respect to the involution underlying the quadratic field extension K/K) of finite dimension n over K. In this context we consider the natural action of the unitary group U = U(V,H) of isometries of (V,H) on the set Xd of all ddimensional K-subs…

Discrete mathematicsClassical groupPure mathematicsDouble cosetProjective unitary groupGeneral Mathematics15A21Unitary matrixSettore MAT/04 - Matematiche ComplementariAlgebraic closure11E39Unitary group51N30Quadratic fieldGeometry of classical groups Canonical forms reductions classificationSpecial unitary groupMathematicsRocky Mountain Journal of Mathematics
researchProduct

Quantum Walks with Multiple or Moving Marked Locations

2008

We study some properties of quantum walks on the plane. First, we discuss the behavior of quantum walks when moving marked locations are introduced. Second, we present an exceptional case, when quantum walk fails to find any of the marked locations.

Discrete mathematicsClassical mechanicsMathematics::ProbabilityPlane (geometry)Quantum walkMathematics
researchProduct

An approximate Rolle's theorem for polynomials of degree four in a Hilbert space

2005

We show that the fourth degree polynomials that satisfy Rolle’s Theorem in the unit ball of a real Hilbert space are dense in the space of polynomials that vanish in the unit sphere. As a consequence, we obtain a sort of approximate Rolle’s Theorem for those polynomials.

Discrete mathematicsClassical orthogonal polynomialsPure mathematicsMacdonald polynomialsRolle's theoremDifference polynomialsGeneral MathematicsDiscrete orthogonal polynomialsOrthogonal polynomialsWilson polynomialsMathematicsMean value theoremPublications of the Research Institute for Mathematical Sciences
researchProduct

Some properties of vertex-oblique graphs

2016

The type t G ( v ) of a vertex v ? V ( G ) is the ordered degree-sequence ( d 1 , ? , d d G ( v ) ) of the vertices adjacent with v , where d 1 ? ? ? d d G ( v ) . A graph G is called vertex-oblique if it contains no two vertices of the same type. In this paper we show that for reals a , b the class of vertex-oblique graphs G for which | E ( G ) | ? a | V ( G ) | + b holds is finite when a ? 1 and infinite when a ? 2 . Apart from one missing interval, it solves the following problem posed by Schreyer et?al. (2007): How many graphs of bounded average degree are vertex-oblique? Furthermore we obtain the tight upper bound on the independence and clique numbers of vertex-oblique graphs as a fun…

Discrete mathematicsClique-sumNeighbourhood (graph theory)020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesTheoretical Computer ScienceMetric dimensionCombinatoricsIndifference graphNew digraph reconstruction conjecture010201 computation theory & mathematicsChordal graphIndependent set0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsBound graphirregular graphsindependence numbervertex-oblique graphslexicographic productMathematicsDiscrete Mathematics
researchProduct

On a generalization of Goguen's category Set(L)

2007

The paper considers a category which generalizes Goguen's category Set(L) of L-fuzzy sets with a fixed basis L. We show the necessary and sufficient conditions for the generalized category to be a quasitopos and consider additional inner structure supplied by the latter property.

Discrete mathematicsClosed categoryArtificial IntelligenceLogicDiagram (category theory)Complete categoryMathematics::Category TheoryCategoryConcrete categoryCategory of setsEnriched categoryMathematicsTopological categoryFuzzy Sets and Systems
researchProduct

Precise bounds for the sequential order of products of some Fréchet topologies

1998

Abstract The sequential order of a topological space is the least ordinal for which the corresponding iteration of the sequential closure is idempotent. Lower estimates for the sequential order of the product of two regular Frechet topologies and upper estimates for the sequential order of the product of two subtransverse topologies are given in terms of their fascicularity and sagittality. It is shown that for every countable ordinal α, there exists a Lasnev topology such that the sequential order of its square is equal to α.

Discrete mathematicsClosure (topology)Topological spaceSequential spaceSquare (algebra)CombinatoricsProduct (mathematics)IdempotenceOrder (group theory)Countable setGeometry and TopologySequential orderFréchet (Fréchet-Urysohn) topologyProductMathematicsTopology and its Applications
researchProduct

Lehmer code transforms and Mahonian statistics on permutations

2012

Abstract In 2000 Babson and Steingrimsson introduced the notion of vincular patterns in permutations. They show that essentially all well-known Mahonian permutation statistics can be written as combinations of such patterns. Also, they proved and conjectured that other combinations of vincular patterns are still Mahonian. These conjectures were proved later: by Foata and Zeilberger in 2001, and by Foata and Randrianarivony in 2006. In this paper we give an alternative proof of some of these results. Our approach is based on permutation codes which, like the Lehmer code, map bijectively permutations onto subexcedant sequences. More precisely, we give several code transforms (i.e., bijections…

Discrete mathematicsCode (set theory)Mathematics::CombinatoricsValue (computer science)020206 networking & telecommunications0102 computer and information sciences02 engineering and technologyMathematical proof01 natural sciencesPermutation codeTheoretical Computer ScienceCombinatoricsPermutation010201 computation theory & mathematicsLehmer codeStatistics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]FOS: Mathematics0202 electrical engineering electronic engineering information engineeringMathematics - CombinatoricsDiscrete Mathematics and CombinatoricsCombinatorics (math.CO)Bijection injection and surjectionComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Dimensions of random affine code tree fractals

2014

We calculate the almost sure Hausdorff dimension for a general class of random affine planar code tree fractals. The set of probability measures describing the randomness includes natural measures in random $V$-variable and homogeneous Markov constructions.

Discrete mathematicsCode (set theory)v-variable fractalsApplied MathematicsGeneral MathematicsProbability (math.PR)ta111Dynamical Systems (math.DS)self-similar setsTree (descriptive set theory)Box countingFractalIterated function systemMathematics - Classical Analysis and ODEsHausdorff dimensionClassical Analysis and ODEs (math.CA)FOS: MathematicsAffine transformationMathematics - Dynamical Systems28A80 60D05 37H99RandomnessMathematics - ProbabilityMathematics
researchProduct