Search results for "Data type"

showing 10 items of 1183 documents

Topologically complex molecules obtained by transition metal templation: it is the presentation that determines the synthesis strategy

2013

Topological constructions made from closed curves range from simple links to intricate knots and started to capture the chemists' attention in the early sixties. These mathematical objects result from particular embeddings of a single or a set of closed curves in the three-dimensional space that show an infinite variety of presentations. Simple catenanes, higher order interlocked macrocycles, and molecular knots can be synthesized via the metal template approach, just as simple macrocycles. However, this requires that rigid presentations with appropriate geometrical characteristics be identified prior to molecular design, and those selected for the metal-templated synthesis of some of these…

Pure mathematicsChemistryCatenaneOrder (ring theory)NanotechnologyGeneral ChemistrySpace (mathematics)CatalysisSet (abstract data type)Range (mathematics)Simple (abstract algebra)Materials ChemistryMoleculeVariety (universal algebra)New J. Chem.
researchProduct

On a class of compactly epi-Lipschitzian sets

2003

The paper is devoted to the study of the so-called compactly epi-Lipschitzian sets. These sets are needed for many aspects of generalized differentiation, particulary for necessary optimality conditions, stability of mathematical programming problems and calculus rules for subdifferentials and normal cones. We present general conditions under which sets defined by general constraints are compactly epi-Lipschitzian. This allows us to show how the compact epi-Lipschitzness properties behave under set intersections.

Pure mathematicsClass (set theory)Mathematical optimizationcompactly epi-lipschitzian setsnonsmooth analysisApplied MathematicsPhysics::Medical PhysicsStability (learning theory)Mathematics::Optimization and ControlSubderivativeSet (abstract data type)locally compact cones49J52AnalysisMathematicsNumerical stability
researchProduct

All congruences below stability-preserving fair testing or CFFD

2020

AbstractIn process algebras, a congruence is an equivalence that remains valid when any subsystem is replaced by an equivalent one. Whether or not an equivalence is a congruence depends on the set of operators used in building systems from subsystems. Numerous congruences have been found, differing from each other in fine details, major ideas, or both, and none of them is good for all situations. The world of congruences seems thus chaotic, which is unpleasant, because the notion of congruence is at the heart of process algebras. This study continues attempts to clarify the big picture by proving that in certain sub-areas, there are no other congruences than those that are already known or …

Pure mathematicsComputer Networks and CommunicationsMathematics::Number TheoryStability (learning theory)Contrast (statistics)020207 software engineering0102 computer and information sciences02 engineering and technologyCongruence relation01 natural sciencesSmall setSet (abstract data type)Congruence (geometry)010201 computation theory & mathematicsrinnakkaiskäsittelyTheory of computation0202 electrical engineering electronic engineering information engineeringEquivalence (measure theory)SoftwaretietojenkäsittelyInformation SystemsMathematics
researchProduct

Lattice of closure endomorphisms of a Hilbert algebra

2019

A closure endomorphism of a Hilbert algebra [Formula: see text] is a mapping that is simultaneously an endomorphism of and a closure operator on [Formula: see text]. It is known that the set [Formula: see text] of all closure endomorphisms of [Formula: see text] is a distributive lattice where the meet of two elements is defined pointwise and their join is given by their composition. This lattice is shown in the paper to be isomorphic to the lattice of certain filters of [Formula: see text], anti-isomorphic to the lattice of certain closure retracts of [Formula: see text], and compactly generated. The set of compact elements of [Formula: see text] coincides with the adjoint semilattice of …

Pure mathematicsEndomorphismHilbert algebraGeneral Mathematics010102 general mathematicsAstrophysics::Instrumentation and Methods for AstrophysicsClosure (topology)Computer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)010103 numerical & computational mathematics01 natural sciencesSet (abstract data type)Lattice (module)Computer Science::General LiteratureClosure operator0101 mathematicsMathematicsAsian-European Journal of Mathematics
researchProduct

Bifurcations of links of periodic orbits in non-singular Morse–Smale systems with a rotational symmetry on S3

2000

Abstract In this paper we consider a rotational symmetry on a non-singular Morse–Smale (NMS) system analyzing the restrictions this symmetry imposes on the links defined by the set of its periodic orbits and to the appearance of local generic codimension one bifurcations in the set of NMS flows on S 3 . The topological characterization is obtained by writing the involved links in terms of Wada operations. It is also obtained that symmetry implies that in general bifurcations have to be multiple. On the other hand, we also see that there exists a set of links that cannot be related to any other by sequences of this kind of bifurcation.

Pure mathematicsExistential quantificationRotational symmetryCodimensionCharacterization (mathematics)Morse codeTopologyNMS systemslaw.inventionSet (abstract data type)BifurcationslawSymmetric linksGeometry and TopologySymmetry (geometry)BifurcationMathematicsTopology and its Applications
researchProduct

A characterization of regular circular languages generated by marked splicing systems

2009

AbstractSplicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. A splicing system is defined by giving an initial set I and a set R of rules. Some unanswered questions are related to the computational power of circular splicing systems. In particular, a still open question is to find a characterization of circular languages generated by finite circular splicing systems (i.e., circular splicing systems with both I and R finite sets). In this paper we introduce a special class of the latter systems named marked systems. We prove that a marked system S generates a regular circular language if an…

Pure mathematicsGeneral Computer ScienceMolecular computing Splicing systems Circular words Formal languages Automata theoryMolecular computingQuantitative Biology::GenomicsDecidabilityTheoretical Computer ScienceSet (abstract data type)Formal languagesRegular languageFormal languageRNA splicingAutomata theorySplicing systemsCircular wordsFinite setAlgorithmWord (computer architecture)Automata theoryMathematicsComputer Science(all)
researchProduct

Set-valued Brownian motion

2015

Brownian motions, martingales, and Wiener processes are introduced and studied for set valued functions taking values in the subfamily of compact convex subsets of arbitrary Banach space $X$. The present paper is an application of one the paper of the second author in which an embedding result is obtained which considers also the ordered structure of $ck(X)$ and f-algebras.

Pure mathematicsGeneral MathematicsBanach spaceStructure (category theory)Vector LatticesSpace (mathematics)01 natural sciencesSet (abstract data type)Radstrom embedding theoremMathematics::ProbabilityFOS: MathematicsMarginal distributions0101 mathematicsBrownian motionMathematicsgeneralized Hukuhara differenceApplied MathematicsProbability (math.PR)010102 general mathematicsRegular polygonBrownian motion · Rådström embedding theorem · Vector lattices · Marginal distributions · Generalized Hukuhara difference60J65 58C06 46A40Functional Analysis (math.FA)010101 applied mathematicsMathematics - Functional AnalysisBrownian motion Radstrom embedding theorem Vector Lattices Marginal distributions generalized Hukuhara differenceEmbeddingBrownian motionMarginal distributionMathematics - Probability
researchProduct

Weyl's Theorems and Extensions of Bounded Linear Operators

2012

A bounded operator $T\in L(X)$, $X$ a Banach space, is said to satisfy Weyl's theorem if the set of all spectral points that do not belong to the Weyl spectrum coincides with the set of all isolated points of the spectrum which are eigenvalues and having finite multiplicity. In this article we give sufficient conditions for which Weyl's theorem for an extension $\overline T$ of $T$ (respectively, for $T$) entails that Weyl's theorem holds for $T$ (respectively, for $\overline T$).

Pure mathematicsGeneral MathematicsSpectrum (functional analysis)Extension of bounded operators Weyl type theoremsBanach spaceMultiplicity (mathematics)Extension (predicate logic)Mathematics::Spectral TheoryBounded operatorSet (abstract data type)47A1047A1147A55Settore MAT/05 - Analisi MatematicaBounded function47A53Mathematics::Representation TheoryEigenvalues and eigenvectorsMathematics
researchProduct

Torsors for Difference Algebraic Groups

2016

We introduce a cohomology set for groups defined by algebraic difference equations and show that it classifies torsors under the group action. This allows us to compute all torsors for large classes of groups. We also develop some tools for difference algebraic geometry and present an application to the Galois theory of differential equations depending on a discrete parameter.

Pure mathematicsGroup (mathematics)Applied MathematicsGeneral Mathematics12H10 20G10 14L15 39A05Mathematics - Rings and AlgebrasCommutative Algebra (math.AC)Mathematics - Commutative AlgebraCohomologyAction (physics)Set (abstract data type)Mathematics - Algebraic GeometryRings and Algebras (math.RA)Mathematics::K-Theory and HomologyFOS: MathematicsAlgebraic numberAlgebraic Geometry (math.AG)Mathematics
researchProduct

An invariant analytic orthonormalization procedure with an application to coherent states

2007

We discuss a general strategy which produces an orthonormal set of vectors, stable under the action of a given set of unitary operators Aj, j=1,2,n, starting from a fixed normalized vector in H and from a set of unitary operators. We discuss several examples of this procedure and, in particular, we show how a set of coherentlike vectors can be produced and in which condition over the lattice spacing this can be done. © 2007 American Institute of Physics.

Pure mathematicsHilbert spaceFOS: Physical sciencesStatistical and Nonlinear PhysicsMathematical Physics (math-ph)coherent statesUnitary stateMathematical OperatorsSet (abstract data type)symbols.namesakeUnit vectorsymbolsSet theoryInvariant (mathematics)Settore MAT/07 - Fisica MatematicaOrthonormalityComputer Science::DatabasesMathematical PhysicsMathematics
researchProduct