Search results for "Bounds"

showing 10 items of 298 documents

A note on rank 2 diagonals

2020

<p>We solve two questions regarding spaces with a (G<sub>δ</sub>)-diagonal of rank 2. One is a question of Basile, Bella and Ridderbos about weakly Lindelöf spaces with a G<sub>δ</sub>-diagonal of rank 2 and the other is a question of Arhangel’skii and Bella asking whether every space with a diagonal of rank 2 and cellularity continuum has cardinality at most continuum.</p>

DiagonalCardinal invariantsMathematics::General TopologyWeakly Lindelöflcsh:AnalysisSpace (mathematics)01 natural sciencesCombinatoricsBELLACardinalitydual propertiesCardinality boundsFOS: MathematicsRank (graph theory)Continuum (set theory)0101 mathematicsDual propertiesMathematics - General TopologyMathematicsweakly LindelofGδ- diagonallcsh:Mathematics010102 general mathematicsGeneral Topology (math.GN)neighbourhood assignmentGδ-diagonallcsh:QA299.6-433lcsh:QA1-939gδ-diagonal010101 applied mathematicscardinality boundsMathematics::LogicNeighbourhood assignmentSettore MAT/03 - GeometriaGeometry and Topologyweakly lindelöf
researchProduct

A Motzkin filter in the Tamari lattice

2015

The Tamari lattice of order n can be defined on the set T n of binary trees endowed with the partial order relation induced by the well-known rotation transformation. In this paper, we restrict our attention to the subset M n of Motzkin trees. This set appears as a filter of the Tamari lattice. We prove that its diameter is 2 n - 5 and that its radius is n - 2 . Enumeration results are given for join and meet irreducible elements, minimal elements and coverings. The set M n endowed with an order relation based on a restricted rotation is then isomorphic to a ranked join-semilattice recently defined in Baril and Pallo (2014). As a consequence, we deduce an upper bound for the rotation distan…

Discrete mathematicsMathematics::CombinatoricsBinary tree010102 general mathematicsLattice (group)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesUpper and lower boundsTheoretical Computer ScienceCombinatoricsJoin and meet010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Discrete Mathematics and CombinatoricsOrder (group theory)Ideal (order theory)0101 mathematicsFilter (mathematics)Tamari latticeComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Structure formation during an early period of matter domination

2014

In this work we show that modifying the thermal history of the Universe by including an early period of matter domination can lead to the formation of astronomical objects. However, the survival of these objects can only be possible if the dominating matter decays to a daughter particle which is not only almost degenerate with the parent particle but also has an open annihilation channel. This requirement translates in an upper bound for the coupling of such a channel and makes the early structure formation viable.

PhysicsAstronomical ObjectsNuclear and High Energy PhysicsParticle physicsCosmology and Nongalactic Astrophysics (astro-ph.CO)Structure formation010308 nuclear & particles physicsDegenerate energy levelsFOS: Physical sciencesFísicaAstrophysics16. Peace & justice01 natural sciencesUpper and lower boundsHigh Energy Physics - PhenomenologyHigh Energy Physics - Phenomenology (hep-ph)0103 physical sciencesParticle010303 astronomy & astrophysicsPeriod (music)Astrophysics - Cosmology and Nongalactic AstrophysicsJournal of High Energy Physics
researchProduct

A Criterion for Attaining the Welch Bounds with Applications for Mutually Unbiased Bases

2008

The paper gives a short introduction to mutually unbiased bases and the Welch bounds and demonstrates that the latter is a good technical tool to explore the former. In particular, a criterion for a system of vectors to satisfy the Welch bounds with equality is given and applied for the case of MUBs. This yields a necessary and sufficient condition on a set of orthonormal bases to form a complete system of MUBs. This condition takes an especially elegant form in the case of homogeneous systems of MUBs. We express some known constructions of MUBs in this form. Also it is shown how recently obtained results binding MUBs and some combinatorial structures (such as perfect nonlinear functions an…

CombinatoricsSet (abstract data type)Discrete mathematicsNonlinear systemWelch boundsHomogeneousOrthonormal basisAbelian groupNuclear ExperimentMutually unbiased basesHadamard matrixMathematics
researchProduct

Alignment-free sequence comparison using absent words

2018

Sequence comparison is a prerequisite to virtually all comparative genomic analyses. It is often realised by sequence alignment techniques, which are computationally expensive. This has led to increased research into alignment-free techniques, which are based on measures referring to the composition of sequences in terms of their constituent patterns. These measures, such as $q$-gram distance, are usually computed in time linear with respect to the length of the sequences. In this paper, we focus on the complementary idea: how two sequences can be efficiently compared based on information that does not occur in the sequences. A word is an {\em absent word} of some sequence if it does not oc…

0301 basic medicineFOS: Computer and information sciencesFormal Languages and Automata Theory (cs.FL)Computer Science - Formal Languages and Automata TheorySequence alignmentInformation System0102 computer and information sciencesCircular wordAbsent words01 natural sciencesUpper and lower boundsSequence comparisonTheoretical Computer ScienceCombinatorics03 medical and health sciencesComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Absent wordCircular wordsMathematicsSequenceSettore INF/01 - InformaticaProcess (computing)q-gramComputer Science Applications1707 Computer Vision and Pattern Recognitionq-gramsComposition (combinatorics)Computer Science Applications030104 developmental biologyComputational Theory and MathematicsForbidden words010201 computation theory & mathematicsFocus (optics)Forbidden wordWord (computer architecture)Information SystemsInteger (computer science)
researchProduct

Failure of topological rigidity results for the measure contraction property

2014

We give two examples of metric measure spaces satisfying the measure contraction property MCP(K,N) but having different topological dimensions at different regions of the space. The first one satisfies MCP(0,3) and contains a subset isometric to $\mathbb{R}$, but does not topologically split. The second space satisfies MCP(2,3) and has diameter $\pi$, which is the maximal possible diameter for a space satisfying MCP(N-1,N), but is not a topological spherical suspension. The latter example gives an answer to a question by Ohta.

Mathematics - Differential Geometrymetric measure spacesGeodesicPhysics::Instrumentation and DetectorsQuantitative Biology::Tissues and Organsmeasure contraction propertyMetric Geometry (math.MG)53C23 (Primary) 28A33 49Q20 (Secondary)Ricci curvature lower boundsTopologyPotential theorymaximal diameter theoremnonbranchingRigidity (electromagnetism)Mathematics - Metric GeometryDifferential Geometry (math.DG)splitting theoremFOS: MathematicsSplitting theoremContraction (operator theory)AnalysisMathematicsgeodesics
researchProduct

Numerical approach for signal delay in general distributed networks

2003

The authors consider a general network with telegraph equations modelling distributed elements and having, additionally, nonlinear capacitors. A global asymptotic exponential stability of the solution is given. A simple computable upper bound of the delay time is given. Numerical examples illustrate the usefulness of the results. >

Signal delayNumerical analysisMathematical analysisTime-scale calculusLambdaUpper and lower boundslaw.inventionNonlinear capacitanceCapacitorTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESIntelligent NetworkExponential stabilityControl theorySimple (abstract algebra)lawApplied mathematicsDelay timeHardware_LOGICDESIGNMathematicsNetwork analysisVoltage[1987] NASECODE V: Proceedings of the Fifth International Conference on the Numerical Analysis of Semiconductor Devices and Integrated Circuits
researchProduct

Nearly tight bounds on the learnability of evolution

2002

Evolution is often modeled as a stochastic process which modifies DNA. One of the most popular and successful such processes are the Cavender-Farris (CF) trees, which are represented as edge weighted trees. The Phylogeny Construction Problem is that of, given /spl kappa/ samples drawn from a CF tree, output a CF tree which is close to the original. Each CF tree naturally defines a random variable, and the gold standard for reconstructing such trees is the maximum likelihood estimator of this variable. This approach is notoriously computationally expensive. We show that a very simple algorithm, which is a variant on one of the most popular algorithms used by practitioners, converges on the t…

CombinatoricsTree rotationMetric (mathematics)Weight-balanced treeMetric treeTree (graph theory)Upper and lower boundsRandom variableRange treeMathematics
researchProduct

Analytic Exact Upper Bound for the Lyapunov Dimension of the Shimizu–Morioka System

2015

In applied investigations, the invariance of the Lyapunov dimension under a diffeomorphism is often used. However, in the case of irregular linearization, this fact was not strictly considered in the classical works. In the present work, the invariance of the Lyapunov dimension under diffeomorphism is demonstrated in the general case. This fact is used to obtain the analytic exact upper bound of the Lyapunov dimension of an attractor of the Shimizu–Morioka system. peerReviewed

Lyapunov functionPure mathematicsMathematics::Dynamical SystemsGeneral Physics and Astronomylcsh:AstrophysicsLyapunov exponentUpper and lower boundssymbols.namesakeShimizu-Morioka systemDimension (vector space)Attractorlcsh:QB460-466Lyapunov equationLyapunov redesignlcsh:ScienceMathematicsta111Mathematical analysisShimizu–Morioka systemlcsh:QC1-999Nonlinear Sciences::Chaotic DynamicssymbolsLyapunov dimensionlcsh:QDiffeomorphismLyapunov exponentlcsh:PhysicsEntropy
researchProduct

Study of annihilation at rest into ωηπ0

1994

Abstract We have studied p p annihilations at rest in liquid hydrogen into the final state ωηπ 0 where ω decays to π 0 γ . This reaction is dominated by the production of α 0 (980) and contributions from a 2 (1320) and b 1 0 (1235). Upper limits for the production of an axial vector h ′ 1 (1380) meson and vector mesons ω(1390), ω(1600), and φ(1680) decaying to ωη are given. The branching ratio of p p annihilation into ωηπ 0 was determined to be (0.68±0.01±0.05)%.

PhysicsNuclear physicsNuclear and High Energy PhysicsParticle decayAnnihilationMesonBranching fractionElementary particleState (functional analysis)Atomic physicsUpper and lower boundsPseudovectorPhysics Letters B
researchProduct