Search results for "Normal form"

showing 10 items of 20 documents

Entanglement in continuous-variable systems: recent advances and current perspectives

2007

We review the theory of continuous-variable entanglement with special emphasis on foundational aspects, conceptual structures, and mathematical methods. Much attention is devoted to the discussion of separability criteria and entanglement properties of Gaussian states, for their great practical relevance in applications to quantum optics and quantum information, as well as for the very clean framework that they allow for the study of the structure of nonlocal correlations. We give a self-contained introduction to phase-space and symplectic methods in the study of Gaussian states of infinite-dimensional bosonic systems. We review the most important results on the separability and distillabil…

High Energy Physics - TheoryStatistics and ProbabilityINFORMATIONField (physics)Computer scienceGaussianStructure (category theory)FOS: Physical sciencesGeneral Physics and AstronomyQuantum entanglementMultipartite entanglementUnitary statesymbols.namesakeRADIATION-FIELDSEPARABILITY CRITERIONStatistical physicsQuantum informationNORMAL FORMSCondensed Matter - Statistical MechanicsMathematical PhysicsQuantum opticsQuantum PhysicsStatistical Mechanics (cond-mat.stat-mech)ERROR-CORRECTIONENTROPYStatistical and Nonlinear PhysicsQUANTUM TELEPORTATION NETWORK MIXED-STATE ENTANGLEMENT GAUSSIAN STATES SEPARABILITY CRITERION ERROR-CORRECTION RADIATION-FIELD NORMAL FORMS INEQUALITIES INFORMATION ENTROPYMathematical Physics (math-ph)Quantum PhysicsMIXED-STATE ENTANGLEMENTGAUSSIAN STATESHigh Energy Physics - Theory (hep-th)QUANTUM TELEPORTATION NETWORKModeling and SimulationINEQUALITIESsymbolsQuantum Physics (quant-ph)Physics - OpticsOptics (physics.optics)
researchProduct

Modified post-bifurcation dynamics and routes to chaos from double-Hopf bifurcations in a hyperchaotic system

2012

In order to understand the onset of hyperchaotic behavior recently observed in many systems, we study bifurcations in the modified Chen system leading from simple dynamics into chaotic regimes. In particular, we demonstrate that the existence of only one fixed point of the system in all regions of parameter space implies that this simple point attractor may only be destabilized via a Hopf or double Hopf bifurcation as system parameters are varied. Saddle-node, transcritical and pitchfork bifurcations are precluded. The normal form immediately following double Hopf bifurcations is constructed analytically by the method of multiple scales. Analysis of this generalized double Hopf normal form …

Hopf bifurcationApplied MathematicsMechanical EngineeringMathematical analysisAerospace EngineeringOcean EngineeringContext (language use)Parameter spaceBiological applications of bifurcation theoryNonlinear Sciences::Chaotic Dynamicssymbols.namesakePitchfork bifurcationControl and Systems EngineeringControl theoryQuasiperiodic functionAttractorsymbolsElectrical and Electronic EngineeringDouble-Hopf bifurcations – Normal forms – Modified post-bifurcation dynamicsSettore MAT/07 - Fisica MatematicaNonlinear Sciences::Pattern Formation and SolitonsBifurcationMathematicsNonlinear Dynamics
researchProduct

Normal forms and embeddings for power-log transseries

2016

First return maps in the neighborhood of hyperbolic polycycles have their asymptotic expansion as Dulac series, which are series with power-logarithm monomials. We extend the class of Dulac series to an algebra of power-logarithm transseries. Inside this new algebra, we provide formal normal forms of power-log transseries and a formal embedding theorem. The questions of classifications and of embeddings of germs into flows of vector fields are common problems in dynamical systems. Aside from that, our motivation for this work comes from fractal analysis of orbits of first return maps around hyperbolic polycycles. This is a joint work with Pavao Mardešić, Jean-Philippe Rolin and Vesna Župano…

Mathematics::Dynamical Systems[ MATH.MATH-CA ] Mathematics [math]/Classical Analysis and ODEs [math.CA]TransseriesGeneral Mathematics[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS][ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS]MSC: 34C20 37C10 39B12 46A19 28A75 58K50 26A12[MATH.MATH-CA]Mathematics [math]/Classical Analysis and ODEs [math.CA]Normal forms01 natural sciencesIteration theory ; Dulac map ; normal forms ; embedding in a flow ; transseries.0101 mathematicsAlgebra over a fieldMathematicsSeries (mathematics)Dulac mapIteration theoryformal normal forms parabolic transseriesMathematics::History and Overview010102 general mathematicsPower (physics)010101 applied mathematicsAlgebraEmbeddingEmbedding in a flowIteration theoryAdvances in Mathematics
researchProduct

Identification of Distributed Systems with Logical Interaction Structure

2012

This paper focuses on the structure identification problem for a class of networked systems, where the interaction among components or agents is described through logical maps. In particular, agents are heterogeneous cooperating systems, i.e. they may have different individual dynamics and different interaction rules depending on input events. While we assume that the individual agents' dynamics are known, each agent has partial knowledge of the logical map encoding the interaction of another agent with its neighbors. Based on the so-called algebraic normal form for binary functions, we present a technique by which the network structure described by a logical function can be dynamically est…

Partial knowledgeTheoretical computer scienceInteraction ruleDistributed computingBinary numberClass (philosophy)Individual dynamicAlgebraic normal formLogical functionAlgebraic normal forms; Binary functions; Cooperating systems; Distributed systems; Individual agent; Individual dynamics; Interaction rules; Interaction structures; Logical functions; Logical maps; Lower approximation; Network structures; Networked systems; Partial knowledge; Real systems; Structure identification; Truth tablesBinary functionSettore ING-INF/04 - AutomaticaLogical mapMathematicsCooperating systemStructure (mathematical logic)Networked systemStructure identificationTruth tablesTruth tableMobile robotReal systemParameter identification problemAlgebraic normal formIdentification (information)Lower approximationInteraction structureIndividual agentDistributed systemNetwork structure
researchProduct

Pattern formation and bifurcation analysis for some chemotaxis-reaction-diffusion systems

Pattern formation Chemotaxis Reaction-diffusion system bifurcation normal formSettore MAT/07 - Fisica Matematica
researchProduct

The Fatou coordinate for parabolic Dulac germs

2017

We study the class of parabolic Dulac germs of hyperbolic polycycles. For such germs we give a constructive proof of the existence of a unique Fatou coordinate, admitting an asymptotic expansion in the power-iterated log scale.

Pure mathematicsMonomialClass (set theory)Mathematics::Dynamical SystemsConstructive proofLogarithmTransseries[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]orbitsDulac germAsymptotic expansionDynamical Systems (math.DS)01 natural sciencesMSC: 37C05 34C07 30B10 30B12 39A06 34E05 37C10 37C1537C05 34C07 30B10 30B12 39A06 34E05 37C10 37C15Mathematics::Algebraic GeometryFOS: Mathematics0101 mathematicsMathematics - Dynamical SystemsMathematicsDulac germ ; Fatou coordinate ; Embedding in a flow ; Asymptotic expansion ; TransseriesdiffeomorphismsMathematics::Complex VariablesApplied Mathematics010102 general mathematicsFatou coordinate010101 applied mathematicsclassificationnormal formsepsilon-neighborhoodsEmbedding in a flowAsymptotic expansionAnalysis
researchProduct

Extending CSG with projections: Towards formally certified geometric modeling

2015

We extend traditional Constructive Solid Geometry (CSG) trees to support the projection operator. Existing algorithms in the literature prove various topological properties of CSG sets. Our extension readily allows these algorithms to work on a greater variety of sets, in particular parametric sets, which are extensively used in CAD/CAM systems. Constructive Solid Geometry allows for algebraic representation which makes it easy for certification tools to apply. A geometric primitive may be defined in terms of a characteristic function, which can be seen as the zero-set of a corresponding system along with inequality constraints. To handle projections, we exploit the Disjunctive Normal Form,…

[ INFO ] Computer Science [cs]Disjoint setsDisjunctive normal formIndustrial and Manufacturing EngineeringProjection (linear algebra)Interval arithmeticConstructive solid geometryConstructive solid geometry[INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI][INFO.INFO-RB]Computer Science [cs]/Robotics [cs.RO]Homotopy equivalenceGeometric primitiveBinary expression tree[INFO]Computer Science [cs]ProjectionComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematics[INFO.INFO-DB]Computer Science [cs]/Databases [cs.DB]HomotopyFormal methodsDisjunctive normal formComputer Graphics and Computer-Aided Design[INFO.INFO-GR]Computer Science [cs]/Graphics [cs.GR]Computer Science ApplicationsAlgebra[INFO.INFO-TI]Computer Science [cs]/Image Processing [eess.IV][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]
researchProduct

Normal, Abby Normal, Prefix Normal

2014

A prefix normal word is a binary word with the property that no substring has more 1s than the prefix of the same length. This class of words is important in the context of binary jumbled pattern matching. In this paper we present results about the number \(\textit{pnw}(n)\) of prefix normal words of length n, showing that \(\textit{pnw}(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)\) for some c and \(\textit{pnw}(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)\). We introduce efficient algorithms for testing the prefix normal property and a “mechanical algorithm” for computing prefix normal forms. We also include games which can be played with prefix normal words. In these games Alice wishes t…

binary jumbled pattern matchingEfficient algorithmmembership testBinary numberContext (language use)Prefix Normal Word AlgorithmData_CODINGANDINFORMATIONTHEORYprefix normal wordsOmegaSubstringenumerationCombinatoricsPrefixprefix normal words; binary jumbled pattern matching; normal forms; enumeration; membership test; binary languagesEnumerationnormal formsbinary languagesWord (group theory)Mathematics
researchProduct

Introduction to Mathematical Logic (Edition 2017)

2017

Hyper-textbook for students in mathematical logic, Edition 2017

first order logiclogicresolution methodpredicate logicMathematicsofComputing_GENERALresolutionintuitionistic logicHerbrand theorempropositional logicmodel theoryconstructive logicData_FILESComputingMilieux_COMPUTERSANDEDUCATIONnormal formsmathematical logicHardware_ARITHMETICANDLOGICSTRUCTUREScompleteness theorem
researchProduct

Natural Addition of Ordinals

2019

Summary In [3] the existence of the Cantor normal form of ordinals was proven in the Mizar system [6]. In this article its uniqueness is proven and then used to formalize the natural sum of ordinals.

natural sumApplied Mathematicshessenberg sumcantor normal form68t99ordinal numbersAlgebraMathematics::LogicComputational Mathematics03e1003b35QA1-939Natural (music)MathematicsMathematicsFormalized Mathematics
researchProduct