English
Related papers

Related papers: Detecting right-veering diffeomorphisms

200 papers

We consider a fixed contact 3-manifold that admits infinitely many compact Stein fillings which are all homeomorphic but pairwise non-diffeomorphic. Each of these fillings gives rise to a closed contact 5-manifold described as a contact…

Geometric Topology · Mathematics 2017-01-05 Burak Ozbagci , Otto van Koert

We adapt the Ozsv\'ath-Szab\'o full path algorithm to every star-shaped graph and establish a correspondence between negative-twisting tight contact structures on any Seifert fibred space over $S^2$, and its Heegaard Floer homology groups…

Geometric Topology · Mathematics 2026-05-04 Alberto Cavallo , Irena Matkovič

We study the action of the group of contact diffeomorphisms on CR deformations of compact three-dimensional CR manifolds. Using anisotropic function spaces and an anisotropic structure on the space of contact diffeomorphisms, we establish…

Differential Geometry · Mathematics 2010-07-14 John Bland , Tom Duchamp

Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…

Combinatorics · Mathematics 2026-03-17 Anthony Meunier , Lhouari Nourine , Simon Vilmin

We lay the foundations of convex hypersurface theory in contact topology, extending the work of Giroux in dimension three. Specifically, we prove that any closed hypersurface in a contact manifold can be $C^0$-approximated by a convex one.…

Symplectic Geometry · Mathematics 2026-04-30 Joseph Breen , Austin Christian , Ko Honda , Yang Huang

It is a basic question in contact geometry to classify all non-isotopic tight contact structures on a given 3-manifold. If the manifold has a boundary, we need also specify the dividing set on the boundary. In this paper, we answer the…

Geometric Topology · Mathematics 2020-07-24 Zhenkun Li , Jessica J. Zhang

The visibility graph of a finite set of points in the plane has the points as vertices and an edge between two vertices if the line segment between them contains no other points. This paper establishes bounds on the edge- and…

Combinatorics · Mathematics 2013-01-24 Michael S. Payne , Attila Pór , Pavel Valtr , David R. Wood

Contraction of an edge merges its end points into a new vertex which is adjacent to each neighbor of the end points of the edge. An edge in a $k$-connected graph is {\em contractible} if its contraction does not result in a graph of lower…

Discrete Mathematics · Computer Science 2009-02-10 N. S. Narayanaswamy , N. Sadagopan , Apoorve Dubey

We say that a graph $G$ on $n$ vertices is $\{H,F\}$-$o$-heavy if every induced subgraph of $G$ isomorphic to $H$ or $F$ contains two nonadjacent vertices with degree sum at least $n$. Generalizing earlier sufficient forbidden subgraph…

Combinatorics · Mathematics 2024-09-23 Wangyi Shang , Hajo Broersma , Shenggui Zhang , Binlong Li

We study the problem of conjugating a diffeomorphism of the interval to (positive) powers of itself. Although this is always possible for homeomorphisms, the smooth setting is rather interesting. Besides the obvious obstruction given by…

Dynamical Systems · Mathematics 2024-05-21 Hélène Eynard-Bontemps , Andrés Navas

Using tools and concepts from contact topology we show that non-vanishing twist implies conservation of the layer structure in cholesteric liquid crystals. This leads to a number of additional topological invariants for cholesteric…

Soft Condensed Matter · Physics 2018-06-04 Thomas Machon

We investigate the tractability of a simple fusion of two fundamental structures on graphs, a spanning tree and a perfect matching. Specifically, we consider the following problem: given an edge-weighted graph, find a minimum-weight…

Data Structures and Algorithms · Computer Science 2024-07-12 Kristóf Bérczi , Tamás Király , Yusuke Kobayashi , Yutaro Yamaguchi , Yu Yokoi

We prove gluing theorems for tight contact structures. In particular, we rederive (as special cases) gluing theorems due to Colin and Makar-Limanov, and present an algorithm for determining whether a given contact structure on a handlebody…

Geometric Topology · Mathematics 2007-05-23 Ko Honda

A graph is closed when its vertices have a labeling by [n] with a certain property first discovered in the study of binomial edge ideals. In this article, we prove that a connected graph has a closed labeling if and only if it is chordal,…

Combinatorics · Mathematics 2015-01-05 David A. Cox , Andrew Erskine

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification…

Computational Geometry · Computer Science 2009-08-10 Roberto Bagnara , Patricia M. Hill , Enea Zaffanella

We consider the probability that a dense wireless network confined within a given convex geometry is fully connected. We exploit a recently reported theory to develop a systematic methodology for analytically characterizing the connectivity…

Networking and Internet Architecture · Computer Science 2014-03-19 Justin P. Coon , Orestis Georgiou , Carl P. Dettmann

The proper parts of face lattices of convex polytopes are shown to satisfy a strong form of the Cohen--Macaulay property, namely that removing from their Hasse diagram all edges in any closed interval results in a Cohen--Macaulay poset of…

Combinatorics · Mathematics 2015-11-11 Christos A. Athanasiadis , Myrto Kallipoliti

We give a complete classification of left invariant para-K\"ahler structures on four-dimensional simply connected Lie groups up to an automorphism. As an application we discuss some curvatures properties of the canonical connection…

Symplectic Geometry · Mathematics 2021-04-20 Wadia Mansouri , Ahmad Oufkou

Networks of flexible filaments often involve regions of tight contact. Predictively understanding the equilibrium configurations of these systems is challenging due to intricate couplings between topology, geometry, large nonlinear…

Let $X_{2k}$ be a set of $2k$ labeled points in convex position in the plane. We consider geometric non-intersecting straight-line perfect matchings of $X_{2k}$. Two such matchings, $M$ and $M'$, are disjoint compatible if they do not have…

Combinatorics · Mathematics 2014-03-24 Oswin Aichholzer , Andrei Asinowski , Tillmann Miltzow