Search results for "loop"

showing 10 items of 608 documents

Bifurcations of cuspidal loops

1997

A cuspidal loop for a planar vector field X consists of a homoclinic orbit through a singular point p, at which X has a nilpotent cusp. This is the simplest non-elementary singular cycle (or graphic) in the sense that its singularities are not elementary (i.e. hyperbolic or semihyperbolic). Cuspidal loops appear persistently in three-parameter families of planar vector fields. The bifurcation diagrams of unfoldings of cuspidal loops are studied here under mild genericity hypotheses: the singular point p is of Bogdanov - Takens type and the derivative of the first return map along the orbit is different from 1. An analytic and geometric method based on the blowing up for unfoldings is propos…

Cusp (singularity)Applied MathematicsMathematical analysisHausdorff spaceGeneral Physics and AstronomyStatistical and Nonlinear PhysicsSingular point of a curveBlowing upLoop (topology)Homoclinic bifurcationHomoclinic orbitOrbit (control theory)SINGULARIDADESMathematical PhysicsMathematicsNonlinearity
researchProduct

Multiple catenanes based on tetraloop derivatives of calix[4]arenes

2009

Abstract Four novel tetraarylurea calix[4]arenes ( 4a – d ) have been synthesized, substituted by ω-alkenyloxy residues in 3,5-positions of the arylurea residues. The eight alkenyl groups were pairwise connected by olefin metathesis and subsequent hydrogenation. The ring-closure reaction was carried out with heterodimers exclusively formed by 4 with a tetratosylurea calix[4]arene 1 , which serves as a template in this reaction step. The potential trans-cavity bridging is entirely suppressed in this way. Bis- and tetraloop calix[4]arenes cannot form dimers due to overlapping loops. However, they readily form heterodimers with open-chain tetraureas, as long as their urea residues can pass thr…

Cyclic compoundReaction stepStereochemistryDimerOrganic ChemistryCatenaneMetathesisBiochemistryTetraloopchemistry.chemical_compoundchemistryDrug DiscoveryCalixareneCyclophaneTetrahedron
researchProduct

Observable geometric phase induced by a cyclically evolving dissipative process

2006

In a prevous paper (Phys. Rev. Lett. 96, 150403 (2006)) we have proposed a new way to generate an observable geometric phase on a quantum system by means of a completely incoherent phenomenon. The basic idea was to force the ground state of the system to evolve ciclically by "adiabatically" manipulating the environment with which it interacts. The specific scheme we have previously analyzed, consisting of a multilevel atom interacting with a broad-band squeezed vacuum bosonic bath whose squeezing parameters are smoothly changed in time along a closed loop, is here solved in a more direct way. This new solution emphasizes how the geometric phase on the ground state of the system is indeed du…

DECOHERENCEPhysicsQuantum PhysicsBerry phaseProcess (computing)Atom (order theory)FOS: Physical sciencesObservableSQUEEZED-LIGHTMarkovian processCondensed Matter PhysicsIndustrial and Manufacturing EngineeringAtomic and Molecular Physics and OpticsQUANTUM COMPUTATIONClassical mechanicsGeometric phaseQuantum systemDissipative systemGround stateQuantum Physics (quant-ph)InstrumentationClosed loop
researchProduct

Role of two operators in regulating the plasmid-borne raf operon of Escherichia coli

1994

The plasmid-borne raf operon encodes functions required for the inducible uptake and utilization of raffinose in Escherichia coli K12. The expression of three structural genes for alpha-galactosidase (rafA), Raf permease (rafB) and sucrose hydrolase (rafD) is negatively controlled by the binding of RafR repressor (rafR) to two operator sites, O1 and O2, that flank the -35 sequence of the raf promoter, PA. In vitro, O1 and O2 are occupied on increasing the concentration of RafR, without detectable preference for one site or the other or any indication of cooperative binding. Nucleotide substitutions at positions 3, 4 or 5 in an operator half-site prevented repressor binding, supporting a mod…

DNA BacterialOperator Regions GeneticOperonBase pairMolecular Sequence DataRepressorBiologyBinding CompetitiveRaffinoseTranscription (biology)OperonEscherichia coliGeneticsBinding siteSite-directed mutagenesisMolecular BiologyBase SequenceHelix-Loop-Helix MotifsStructural geneCooperative bindingGene Expression Regulation BacterialDNA-Binding ProteinsRepressor ProteinsBiochemistryGenes Bacterialalpha-GalactosidaseMutagenesis Site-DirectedAutoradiographyElectrophoresis Polyacrylamide GelPlasmidsMolecular and General Genetics MGG
researchProduct

In vivo fate mapping with SCL regulatory elements identifies progenitors for primitive and definitive hematopoiesis in mice.

2009

10 páginas, 6 figuras.-- et al.

Definitive hematopoiesisEmbryologyMyeloidPopulationConditional mouse modelIn vivo linage and fate tracingEmbryonic DevelopmentStem cell leukemia geneBiology03 medical and health sciencesMice0302 clinical medicineFate mappinghemic and lymphatic diseasesProto-Oncogene ProteinsCRE systemmedicineBasic Helix-Loop-Helix Transcription FactorsAnimalsCell LineageMesodermal blood cell specificationGene Knock-In TechniquesProgenitor celleducationGeneTetracycline systemT-Cell Acute Lymphocytic Leukemia Protein 1Primitive hematopoiesis030304 developmental biology0303 health scienceseducation.field_of_studyMicroscopy ConfocalStem CellsEmbryoFlow CytometryCell biologyHematopoiesisGastrulationHaematopoiesismedicine.anatomical_structureBlood cell precursors030220 oncology & carcinogenesisImmunologyIn vivo lineage markingDevelopmental BiologyMechanisms of development
researchProduct

Degree sequences of highly irregular graphs

1997

AbstractWe call a simple graph highly irregular if each of its vertices is adjacent only to vertices with distinct degrees. In this paper we examine the degree sequences of highly irregular graphs. We give necessary and sufficient conditions for a sequence of positive integers to be the degree sequence of a highly irregular graph.

Discrete mathematicsCombinatoricsSequenceLoop (graph theory)Simple graphDegree (graph theory)Frequency partition of a graphHighly irregular graphBiregular graphDiscrete Mathematics and CombinatoricsTheoretical Computer ScienceMathematicsMathematicsofComputing_DISCRETEMATHEMATICSDiscrete Mathematics
researchProduct

About Graph Complements

2020

Summary This article formalizes different variants of the complement graph in the Mizar system [3], based on the formalization of graphs in [6].

Discrete mathematicsComputational Mathematicsgraph complementApplied MathematicsQA1-93905c76Graph (abstract data type)loop68v20MathematicsComplement graphMathematicsofComputing_DISCRETEMATHEMATICSMathematicsFormalized Mathematics
researchProduct

A new formulation of the loop-tree duality at higher loops

2019

We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of the loop graph. In addition, the uncut propagators gain a modified $i \delta$-prescription, named dual-propagators. In this new framework one can go beyond graphs and calculate the integrand of loop amplitudes as a weighted sum of tree graphs, which form a tree-like object. These objects can be computed efficiently via recurrence relations.

Discrete mathematicsHigh Energy Physics - TheoryLoop (graph theory)Recurrence relationDuality (mathematics)PropagatorFOS: Physical sciencesObject (computer science)Tree (graph theory)Massless particleHigh Energy Physics - PhenomenologyAmplitudeHigh Energy Physics - Phenomenology (hep-ph)High Energy Physics - Theory (hep-th)Mathematics
researchProduct

A loopless algorithm for generating the permutations of a multiset

2003

AbstractMany combinatorial structures can be constructed from simpler components. For example, a permutation can be constructed from cycles, or a Motzkin word from a Dyck word and a combination. In this paper we present a constructor for combinatorial structures, called shuffle on trajectories (defined previously in a non-combinatorial context), and we show how this constructor enables us to obtain a new loopless generating algorithm for multiset permutations from similar results for simpler objects.

Discrete mathematicsMultisetMathematics::CombinatoricsGeneral Computer ScienceMultiset permutationsLoopless algorithmStructure (category theory)Context (language use)Gray codesTheoretical Computer ScienceCombinatoricsGray codePermutationLoopless generating algorithmsShuffle combinatorial objectsBinomial coefficientWord (computer architecture)Computer Science::Formal Languages and Automata TheoryMathematicsMathematicsofComputing_DISCRETEMATHEMATICSComputer Science(all)Theoretical Computer Science
researchProduct

Transportation cost inequalities on path and loop groups

2005

AbstractLet G be a connected Lie group with the Lie algebra G. The action of Cameron–Martin space H(G) on the path space Pe(G) introduced by L. Gross (Illinois J. Math. 36 (1992) 447) is free. Using this fact, we define the H-distance on Pe(G), which enables us to establish a transportation cost inequality on Pe(G). This method will be generalized to the path space over the loop group Le(G), so that we obtain a transportation cost inequality for heat measures on Le(G).

Discrete mathematicsPath (topology)Adjoint representationLie groupGirsanov theoremSpace (mathematics)Action (physics)Heat measuresLoop groupsLoop (topology)Loop groupLie algebraWasserstein distanceAnalysisMathematicsH-distanceJournal of Functional Analysis
researchProduct