Searcharxiv⌕ Search

arXiv subjects

Byung Hee An

Publications and source records attributed to Byung Hee An.

32 records · Page 2Linked to original sources
arXiv2019

Augmentations are sheaves for Legendrian graphs

In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two categorical Legendrian isotopy invariants: the augmentation category, a unital $A_{\infty}$-category, which lifts the set of augmentations of the associated Chekanov-Eliashberg DGA, and a DG category of constructible sheaves on the front plane, with micro-support at contact infinity controlled by the (bordered) Legendrian graph. In other words, generalizing [21], we prove "augmentations are sheaves" in the singular case.

math.SG↗
arXiv2019

Augmentations and ruling polynomials for Legendrian graphs

In this article, associated to a (bordered) Legendrian graph, we study and show the equivalence between two Legendrian isotopy invariants: augmentation number via point-counting over a finite field, for the augmentation variety of the associated Chekanov-Eliashberg differential graded algebra, and ruling polynomial via combinatorics of the decompositions of the associated front projection.

math.SG↗
arXiv2019

Ruling invariants for Legendrian graphs

We define ruling invariants for even-valence Legendrian graphs in standard contact three-space. We prove that rulings exist if and only if the DGA of the graph, introduced by the first two authors, has an augmentation. We set up the usual ruling polynomials for various notions of gradedness and prove that if the graph is four-valent, then the ungraded ruling polynomial appears in Kauffman-Vogel's graph version of the Kauffman polynomial. Our ruling invariants are compatible with certain vertex-identifying operations as well as vertical cuts and gluings of front diagrams. We also show that Leverson's definition of a ruling of a Legendrian link in a connected sum of $S^1 \times S^2$'s can be seen as a special case of ours.

math.SG↗
arXiv2019

Edge stabilization in the homology of graph braid groups

We introduce a novel type of stabilization map on the configuration spaces of a graph, which increases the number of particles occupying an edge. There is an induced action on homology by the polynomial ring generated by the set of edges, and we show that this homology module is finitely generated. An analogue of classical homological and representation stability for manifolds, this result implies eventual polynomial growth of Betti numbers. We calculate the exact degree of this polynomial, in particular verifying an upper bound conjectured by Ramos. Because the action arises from a family of continuous maps, it lifts to an action at the level of singular chains, which contains strictly more information than the homology level action. We show that the resulting differential graded module is almost never formal over the ring of edges.

math.GT↗
arXiv2019

A Chekanov-Eliashberg algebra for Legendrian graphs

We define a differential graded algebra for Legendrian graphs and tangles in the standard contact Euclidean three space. This invariant is defined combinatorially by using ideas from Legendrian contact homology. The construction is distinguished from other versions of Legendrian contact algebra by the vertices of Legendrian graphs. A set of countably many generators and a generalized notion of equivalence are introduced for invariance. We show a van Kampen type theorem for the differential graded algebras under the tangle replacement. Our construction recovers many known algebraic constructions of Legendrian links via suitable operations at the vertices.

math.SG↗
arXiv2017

Grid diagram for singular links

In this paper, we define the set of singular grid diagrams $\mathcal{SG}$ which provides a unified description for singular links, singular Legendrian links, singular transverse links, and singular braids. We also classify the complete set of all equivalence relations on $\mathcal{SG}$ which induce the bijection onto each singular object. This is an extension of the known result of Ng-Thurston for non-singular links and braids.

math.GT↗
arXiv2017

On the Chern numbers for pseudo-free circle actions

Let $(M,ψ)$ be a $(2n+1)$-dimensional oriented closed manifold equipped with a pseudo-free $S^1$-action $ψ: S^1 \times M \rightarrow M$. We first define a \textit{local data} $\mathcal{L}(M,ψ)$ of the action $ψ$ which consists of pairs $(C, (p(C) ; \overrightarrow{q}(C)))$ where $C$ is an exceptional orbit, $p(C)$ is the order of isotropy subgroup of $C$, and $\overrightarrow{q}(C) \in (\mathbb{Z}_{p(C)}^{\times})^n$ is a vector whose entries are the weights of the slice representation of $C$. In this paper, we give an explicit formula of the Chern number $\langle c_1(E)^n, [M/S^1] \rangle$ modulo $\mathbb{Z}$ in terms of the local data, where $E = M \times_{S^1} \mathbb{C}$ is the associated complex line orbibundle over $M/S^1$. Also, we illustrate several applications to various problems arising in equivariant symplectic topology.

math.SG↗
arXiv2017

Legendrian singular links and singular connected sums

We study Legendrian singular links up to contact isotopy. Using a special property of the singular points, we define the singular connected sum of Legendrian singular links. This concept is a generalization of the connected sum and can be interpreted as a tangle replacement, which provides a way to classify Legendrian singular links. Moreover, we investigate several phenomena only occur in the Legendrian setup.

math.GT↗
arXiv2016

On the f-vectors of Gelfand-Cetlin polytopes

A Gelfand-Cetlin polytope is a convex polytope obtained as an image of certain completely integrable system on a partial flag variety. In this paper, we give an equivalent description of the face structure of a GC-polytope in terms of so called the face structure of a ladder diagram. Using our description, we obtain a partial differential equation whose solution is the exponential generating function of f-vectors of GC-polytopes. This solves the open problem (2) posed by Gusev, Kritchenko, and Timorin in [GKT].

math.CO↗
arXiv2016

Automorphisms of braid groups on orientable surfaces

In this paper we compute the automorphism groups $\operatorname{Aut}(\mathbf{P}_n(Σ))$ and $\operatorname{Aut}(\mathbf{B}_n(Σ))$ of braid groups $\mathbf{P}_n(Σ)$ and $\mathbf{B}_n(Σ)$ on every orientable surface $Σ$, which are isomorphic to group extensions of the extended mapping class group $\mathcal{M}^*_n(Σ)$ by the transvection subgroup except for a few cases. We also prove that $\mathbf{P}_n(Σ)$ is always a characteristic subgroup of $\mathbf{B}_n(Σ)$ unless $Σ$ is a twice-punctured sphere and $n=2$.

math.GT↗
arXiv2015

On the structure of braid groups on complexes

We consider the braid groups $\mathbf{B}_n(X)$ on finite simplicial complexes $X$, which are generalizations of those on both manifolds and graphs that have been studied already by many authors. We figure out the relationships between geometric decompositions for $X$ and their effects on braid groups, and provide an algorithmic way to compute the group presentations for $\mathbf{B}_n(X)$ with the aid of them. As applications, we give complete criteria for both the surface embeddability and planarity for $X$, which are the torsion-freeness of the braid group $\mathbf{B}_n(X)$ and its abelianization $H_1(\mathbf{B}_n(X))$, respectively.

math.GT↗
arXiv2012

A family of pseudo-Anosov braids with large conjugacy invariant sets

We show that there is a family of pseudo-Anosov braids independently parameterized by the braid index and the (canonical) length whose smallest conjugacy invariant sets grow exponentially in the braid index and linearly in the length and conclude that the conjugacy problem remains exponential in the braid index under the current knowledge.

math.GT↗
arXiv2010

A family of representations of braid groups on surfaces

We propose a family of new representations of the braid groups on surfaces that extend linear representations of the braid groups on a disc such as the Burau representation and the Lawrence-Krammer-Bigelow representation.

math.GT↗