Transformations of partial matchings

DOI10.5666/KMJ.2021.61.2.409MaRDI QIDQ3384216zbMATH OpenFDO

Authors Inasa Nakamura

Publication date 15 December 2021

Full work available at URL https://arxiv.org/abs/1705.07401

zbMATH Keywords

latticematchingpolytope

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Applications of graph theory (05C90)

Abstract: We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between partial matchings. We introduce the notion of the lattice presentation of a partial matching, and the lattice polytope associated with a pair of lattice presentations, and we investigate transformations with minimal area.

Recommendations

• Matchings avoiding partial patterns and lattice paths
• Matchings and partial patterns
• Matchings in the Partition Lattice
• Reduced decompositions of matchings
• Partial matchings and pattern avoidance

Cites work

• Asymptotic enumeration of RNA structures with pseudoknots
• Combinatorial Computational Biology of RNA
• Combinatorics of RNA structures with pseudoknots
• Crossings and nestings of matchings and partitions
• Integer points in polyhedra
• RNA secondary structures and their prediction

Cited in

(3)

• On partial state matching
• Matching fields and lattice points of simplices
• Transformations of lattice diagrams and their associated dotted diagrams

This page was built for publication: Transformations of partial matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3384216)