Search results for "range"

showing 10 items of 4508 documents

An exact and efficient approach for computing a cell in an arrangement of quadrics

2006

AbstractWe present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and provide the correct mathematical results in all, even degenerate, cases. By projection, the spatial problem is reduced to the one of computing planar arrangements of algebraic curves. We succeed in locating all event points in these arrangements, including tangential intersections and singular points. By introducing an additional curve, which we call the Jacobi curve, we are able to find non-singular tangential intersections. We show that the coordinates of the singular points in our special projected plana…

Discrete mathematicsPure mathematicsArrangementsControl and OptimizationFunction field of an algebraic varietyAlgebraic curvesMathematicsofComputing_NUMERICALANALYSISComputational geometryComputer Science ApplicationsComputational MathematicsComputational Theory and MathematicsJacobian curveAlgebraic surfaceComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONReal algebraic geometryAlgebraic surfacesExact algebraic computationAlgebraic functionGeometry and TopologyAlgebraic curveAlgebraic numberRobustnessMathematicsSingular point of an algebraic varietyComputational Geometry
researchProduct

On the Range of Two Convolution Operators

2000

Discrete mathematicsPure mathematicsRange (mathematics)General MathematicsMathematicsConvolutionMathematische Nachrichten
researchProduct

Periodic and Chaotic Orbits of a Neuron Model

2015

In this paper we study a class of difference equations which describes a discrete version of a single neuron model. We consider a generalization of the original McCulloch-Pitts model that has two thresholds. Periodic orbits are investigated accordingly to the different range of parameters. For some parameters sufficient conditions for periodic orbits of arbitrary periods have been obtained. We conclude that there exist values of parameters such that the function in the model has chaotic orbits. Models with chaotic orbits are not predictable in long-term.

Discrete mathematicsQuantitative Biology::Neurons and CognitionGeneralizationMathematical analysisChaoticBiological neuron modelFunction (mathematics)stabilityDynamical systemStability (probability)dynamical systemModeling and Simulationiterative processRange (statistics)Orbit (dynamics)QA1-939chaotic mappingnonlinear problemAnalysisMathematicsMathematicsMathematical Modelling and Analysis
researchProduct

Logics for context-free languages

1995

We define matchings, and show that they capture the essence of context-freeness. More precisely, we show that the class of context-free languages coincides with the class of those sets of strings which can be defined by sentences of the form ∃ bϕ, where ϕ is first order, b is a binary predicate symbol, and the range of the second order quantifier is restricted to the class of matchings. Several variations and extensions are discussed.

Discrete mathematicsRange (mathematics)Class (set theory)Quantifier (logic)Symbol (programming)Context-free languageAbstract family of languagesOrder (group theory)Of the formAlgorithmMathematics
researchProduct

A general metric regularity in asplund banach spaces

1998

This paper establishes a simple and easily-applied criterion for determining whether a multivalued mapping is metrically regular relatively to a subset in the range space.

Discrete mathematicsRange (mathematics)Control and OptimizationSimple (abstract algebra)Signal ProcessingMetric (mathematics)Banach spaceSpace (mathematics)AnalysisComputer Science ApplicationsMathematicsNumerical Functional Analysis and Optimization
researchProduct

On the longest common factor problem

2008

The Longest Common Factor (LCF) of a set of strings is a well studied problem having a wide range of applications in Bioinformatics: from microarrays to DNA sequences analysis. This problem has been solved by Hui (2000) who uses a famous constant-time solution to the Lowest Common Ancestor (LCA) problem in trees coupled with use of suffix trees. A data structure for the LCA problem, although linear in space and construction time, introduces a multiplicative constant in both space and time that reduces the range of applications in many biological applications. In this article we present a new method for solving the LCF problem using the suffix tree structure with an auxiliary array that take…

Discrete mathematicsSettore INF/01 - InformaticaSuffix tree[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]Generalized suffix treeDAWGsuffix tree[INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]Data structureLongest common substring problemlaw.inventionCombinatoricsSet (abstract data type)Range (mathematics)lawLongest Common Factor ProblemSuffixLowest common ancestorMathematics
researchProduct

Triple planes with $p_g=q=0$

2019

We show that general triple planes with p_g=q=0 belong to at most 12 families, that we call surfaces of type I,..., XII, and we prove that the corresponding Tschirnhausen bundle is direct sum of two line bundles in cases I, II, III, whereas is a rank 2 Steiner bundle in the remaining cases. We also provide existence results and explicit constructions for surfaces of type I,..., VII, recovering all classical examples and discovering several new ones. In particular, triple planes of type VII provide counterexamples to a wrong claim made in 1942 by Bronowski.

Discrete mathematicsSteiner bundleApplied MathematicsGeneral Mathematics010102 general mathematicsprojective varietiesspaceadjunction theorysurfaces01 natural sciences14E20bundlesunstable hyperplanesMathematics - Algebraic GeometryTriple plane0103 physical sciencesFOS: Mathematics010307 mathematical physicsarrangements[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]0101 mathematicsMSc: Primary 14E20 14J60Algebraic Geometry (math.AG)Mathematicscovers
researchProduct

Impact of common property (E.A.) on fixed point theorems in fuzzy metric spaces

2011

We observe that the notion of common property (E.A.) relaxes the required containment of range of one mapping into the range of other which is utilized to construct the sequence of joint iterates. As a consequence, a multitude of recent fixed point theorems of the existing literature are sharpened and enriched.

Discrete mathematicsT57-57.97QA299.6-433Containment (computer programming)Pure mathematicsSequenceApplied mathematics. Quantitative methodsApplied MathematicsFixed-point theoremConstruct (python library)Fuzzy metric space property (E.A.) common property (E.A.) common fixed point generalized fuzzy contractionRange (mathematics)Differential geometryIterated functionSettore MAT/05 - Analisi MatematicaCommon propertyGeometry and TopologyAnalysisMathematics
researchProduct

Fixed points of weakly compatible mappings satisfying generalized $\varphi$-weak contractions

2014

In this paper, utilizing the notion of the common limit range property, we prove some new integral type common fixed point theorems for weakly compatible mappings satisfying a \(\varphi \)-weak contractive condition in metric spaces. Moreover, we extend our results to four finite families of self mappings, and furnish an illustrative example and an application to support our main theorem. Our results improve, extend, and generalize well-known results on the topic in the literature.

Discrete mathematicsWeakly compatibleProperty (philosophy)(CLR_{ST}) property(CLR_S) propertyGeneral Mathematicsmetric spaceFixed pointType (model theory)weakly compatible mappingRange (mathematics)Metric spacefixed pointSettore MAT/05 - Analisi MatematicaCommon fixed pointLimit (mathematics)Mathematics
researchProduct

Leitfahigkeitsmessungen an Polystyrylnatrium in Dimethoxiäthan (DME) und Tetrahydrofuran (THF)

1971

An Polystyrylnatrium werden in zwei polaren organischen Losungsmitteln Leitfahigkeitsmessungen uber einen groseren Temperaturbereich ausgefuhrt. Aus der Temperaturabhangigkeit der Dissoziationskonstante ergibt sich, das die undissoziierte Verbindung in zwei Formen, dem Kontaktionenpaar (I) und dem solvatgetrennten Ionenpaar (II), vorkommt. Enthalpie- und Entropiedifferenz beim ubergang von I nach II, sowie die entsprechenden thermodynamischen Parameter der Dissoziation von II werden ermittelt. Der effektive Ladungsabstand im solvatgetrennten Ionenpaar betragt etwa 7 A. Conductivity measurements were carried out with polystyryl sodium in two polar solvents within a large temperature range. T…

Dissociation constantSolventchemistry.chemical_compoundchemistryGeneral Chemical EngineeringEnthalpyPolymer chemistryPhysical chemistryAtmospheric temperature rangeIon pairsConductivityTetrahydrofuranEffective nuclear chargeBerichte der Bunsengesellschaft für physikalische Chemie
researchProduct