Search results for "Decompositions"

showing 4 items of 4 documents

Homological Projective Duality for Determinantal Varieties

2016

In this paper we prove Homological Projective Duality for crepant categorical resolutions of several classes of linear determinantal varieties. By this we mean varieties that are cut out by the minors of a given rank of a n x m matrix of linear forms on a given projective space. As applications, we obtain pairs of derived-equivalent Calabi-Yau manifolds, and address a question by A. Bondal asking whether the derived category of any smooth projective variety can be fully faithfully embedded in the derived category of a smooth Fano variety. Moreover we discuss the relation between rationality and categorical representability in codimension two for determinantal varieties.

Pure mathematicsGeneral MathematicsHomological projective dualitySemi-orthogonal decompositionsDeterminantal varieties01 natural sciencesDerived categoryMathematics - Algebraic GeometryMathematics::Algebraic GeometryMathematics::Category Theory0103 physical sciencesFOS: MathematicsProjective spaceCategory Theory (math.CT)0101 mathematicsAlgebraic Geometry (math.AG)Categorical variableMathematics::Symplectic GeometryPencil (mathematics)Projective varietyComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsDerived category010308 nuclear & particles physicsProjective varietiesComplex projective space010102 general mathematicsFano varietyMathematics - Category TheoryCodimension[ MATH.MATH-AG ] Mathematics [math]/Algebraic Geometry [math.AG]Rationality questions[MATH.MATH-AG]Mathematics [math]/Algebraic Geometry [math.AG]
researchProduct

Dehn surgeries and smooth structures on 3-dimensional transitive Anosov flows.

2020

The present thesis is about Dehn surgeries and smooth structures associated with transitive Anosov flows in dimension three. Anosov flows constitute a very important class of dynamical systems, because of its persistent chaotic behaviour, as well as for its rich interaction with the topology of the ambient space. Even if a lot is known about the dynamical and ergodic properties of these systems, there is not a clear understanding about how to classify its different orbital equivalence classes. Until now, the biggest progress has been done in dimension three, where there is a family of techniques intended for the construction of Anosov flows called surgeries.During the realization of this th…

3-ManifoldsHyperbolic DynamicsDehn surgeriesFlots d' AnosovDynamique hyperboliqueSections de BirkhoffDécompositions en livre ouvert[MATH.MATH-GN] Mathematics [math]/General Topology [math.GN]Chirurgies de DehnOpen book decompositions[MATH.MATH-GN]Mathematics [math]/General Topology [math.GN]Anosov flowsBirkhoff sections3-Variétés
researchProduct

Bridges, channels and Arnold's invariants for generic plane curves

2002

Abstract We define sums of plane curves that generalize the idea of connected sum and show how Arnol'd's invariants behave with respect to them. We also consider the inverse process of decomposition of a curve and as an application, obtain a new method that reduces considerably the amounts of computation involved in the calculation of Arnold's invariants.

Pure mathematicsPlane curveComputationProcess (computing)InverseSumsConnected sumCombinatoricsIsotopy invariantsDecomposition (computer science)Geometry and TopologyDecompositionsStable closed curvesMathematicsTopology and its Applications
researchProduct

K4-free Graphs as a Free Algebra

2017

International audience; Graphs of treewidth at most two are the ones excluding the clique with four vertices (K4) as a minor, or equivalently, the graphs whose biconnected components are series-parallel. We turn those graphs into a finitely presented free algebra, answering positively a question by Courcelle and Engelfriet, in the case of treewidth two. First we propose a syntax for denoting these graphs: in addition to parallel composition and series composition, it suffices to consider the neutral elements of those operations and a unary transpose operation. Then we give a finite equational presentation and we prove it complete: two terms from the syntax are congruent if and only if they …

Completeness000 Computer science knowledge general worksGraph minors[INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]Graph theoryTree decompositions[INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM]Àlgebra universalUniversal Algebra[INFO.INFO-FL]Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]Computer Science::Discrete MathematicsComputer ScienceAxiomatisation[INFO.INFO-FL] Computer Science [cs]/Formal Languages and Automata Theory [cs.FL]
researchProduct