Searcharxiv⌕ Search

arXiv subjects

Kyungyong Lee

Publications and source records attributed to Kyungyong Lee.

At least 37 records · Page 2Linked to original sources
arXiv2022

On the two-dimensional Jacobian conjecture: Magnus' formula revisited, II

This article is part of an ongoing investigation of the two-dimensional Jacobian conjecture. In the first paper of this series, we proved the generalized Magnus' formula. In this paper, inspired by cluster algebras, we introduce a sequence of new conjectures including the remainder vanishing conjecture. This makes the generalized Magnus' formula become a useful tool to show the two-dimensional Jacobian conjecture. In the forthcoming paper(s), we plan to prove the remainder vanishing conjecture.

math.AC↗
arXiv2022

Chain decompositions of q,t-Catalan numbers: tail extensions and flagpole partitions

This article is part of an ongoing investigation of the combinatorics of $q,t$-Catalan numbers $\textrm{Cat}_n(q,t)$. We develop a structure theory for integer partitions based on the partition statistics dinv, deficit, and minimum triangle height. Our goal is to decompose the infinite set of partitions of deficit $k$ into a disjoint union of chains $\mathcal{C}_μ$ indexed by partitions of size $k$. Among other structural properties, these chains can be paired to give refinements of the famous symmetry property $\textrm{Cat}_n(q,t)=\textrm{Cat}_n(t,q)$. Previously, we introduced a map that builds the tail part of each chain $\mathcal{C}_μ$. Our first main contribution here is to extend this map to construct larger second-order tails for each chain. Second, we introduce new classes of partitions called flagpole partitions and generalized flagpole partitions. Third, we describe a recursive construction for building the chain $\mathcal{C}_μ$ for a (generalized) flagpole partition $μ$, assuming that the chains indexed by certain specific smaller partitions (depending on $μ$) are already known. We also give some enumerative and asymptotic results for flagpole partitions and their generalized versions.

math.CO↗
arXiv2022

On the two-dimensional Jacobian conjecture: Magnus' formula revisited, I

Let $K$ be an algebraically closed field of characteristic 0. When the Jacobian $({\partial f}/{\partial x})({\partial g}/{\partial y}) - ({\partial g}/{\partial x})({\partial f}/{\partial y})$ is a constant for $f,g\in K[x,y]$, Magnus' formula from [A. Magnus, Volume preserving transformations in several complex variables, Proc. Amer. Math. Soc. 5 (1954), 256--266] describes the relations between the homogeneous degree pieces $f_i$'s and $g_i$'s. We show a more general version of Magnus' formula and prove a special case of the two-dimensional Jacobian conjecture as its application.

math.AG↗
arXiv2021

Permutations whose reverse shares the same recording tableau in the RSK correspondence

The RSK correspondence is a bijection between permutations and pairs of standard Young tableaux with identical shape, where the tableaux are commonly denoted $P$ (insertion) and $Q$ (recording). It has been an open problem to demonstrate $$ |\{w \in \mathfrak{S}_n | \, Q(w) = Q(w^r)\}| = \begin{cases} \displaystyle 2^{\frac{n-1}{2}}{n-1 \choose \frac{n-1}{2}} & n \text{ odd} \newline \displaystyle 0 & n \text{ even} \end{cases}, $$ where $w^r$ is the reverse permutation of $w$. First we show that for each $w$ where $Q(w) = Q(w^r)$ the recording tableau $Q(w)$ has a symmetric hook shape and satisfies a certain simple property. From these two results, we succeed in proving the desired identity.

math.CO↗
arXiv2021

Mutations of reflections and existence of pseudo-acyclic orderings for type $A_n$

In a recent paper by K.-H. Lee, K. Lee and M. Mills, a mutation of reflections in the universal Coxeter group is defined in association with a mutation of a quiver. A matrix representation of these reflections is determined by a linear ordering on the set of vertices of the quiver. It was conjectured that there exists an ordering (called a pseudo-acyclic ordering in this paper) such that whenever two mutation sequences of a quiver lead to the same labeled seed, the representations of the associated reflections also coincide. In this paper, we prove this conjecture for every quiver mutation-equivalent to an orientation of a type $A_n$ Dynkin diagram by decomposing a mutation sequence into a product of elementary swaps and checking relations studied by Barot and Marsh.

math.RT↗
arXiv2021

Universal quivers

We show that for any positive integer $n$, there exists a quiver $Q$ with $O(n^2)$ vertices and $O(n^2)$ edges such that any quiver on $n$ vertices is a full subquiver of a quiver mutation equivalent to $Q$. We generalize this statement to skew-symmetrizable matrices and obtain other related results. In particular, we show that any quiver is a full subquiver of a quiver mutation equivalent to a quiver of a plabic graph.

math.CO↗
arXiv2020

Newton polytopes of rank 3 cluster variables

We characterize the cluster variables of skew-symmetrizable cluster algebras of rank 3 by their Newton polytopes. The Newton polytope of the cluster variable $z$ is the convex hull of the set of all $\mathbf{p}\in\mathbb{Z}^3$ such that the Laurent monomial ${\bf x}^{\mathbf{p}}$ appears with nonzero coefficient in the Laurent expansion of $z$ in the cluster ${\bf x}$. We give an explicit construction of the Newton polytope in terms of the exchange matrix and the denominator vector of the cluster variable. Along the way, we give a new proof of the fact that denominator vectors of non-initial cluster variables are non-negative in a cluster algebra of arbitrary rank.

math.AC↗
arXiv2020

A Combinatorial Formula for Kazhdan-Lusztig Polynomials of Sparse Paving Matroids

We prove the positivity of Kazhdan-Lusztig polynomials for sparse paving matroids, which are known to be logarithmically almost all matroids, but are conjectured to be almost all matroids. The positivity follows from a remarkably simple combinatorial formula we discovered for these polynomials using skew young tableaux. This supports the conjecture that Kazhdan-Lusztig polynomials for all matroids have non-negative coeffiecients. In special cases, such as uniform matroids, our formula has a nice combinatorial interpretation.

math.CO↗
arXiv2020

Chain Decompositions of $q,t$-Catalan Numbers via Local Chains

The $q,t$-Catalan number $\mathrm{Cat}_n(q,t)$ enumerates integer partitions contained in an $n\times n$ triangle by their dinv and external area statistics. The paper [LLL18 (Lee, Li, Loehr, SIAM J. Discrete Math. 32(2018))] proposed a new approach to understanding the symmetry property $\mathrm{Cat}_n(q,t)=\mathrm{Cat}_n(t,q)$ based on decomposing the set of all integer partitions into infinite chains. Each such global chain $\mathcal{C}_μ$ has an opposite chain $\mathcal{C}_{μ^*}$; these combine to give a new small slice of $\mathrm{Cat}_n(q,t)$ that is symmetric in $q$ and $t$. Here we advance the agenda of [LLL18] by developing a new general method for building the global chains $\mathcal{C}_μ$ from smaller elements called local chains. We define a local opposite property for local chains that implies the needed opposite property of the global chains. This local property is much easier to verify in specific cases compared to the corresponding global property. We apply this machinery to construct all global chains for partitions with deficit at most $11$. This proves that for all $n$, the terms in $\mathrm{Cat}_n(q,t)$ of degree at least $\binom{n}{2}-11$ are symmetric in $q$ and $t$.

math.CO↗
arXiv2019

A Combinatorial Formula for Kazhdan-Lusztig Polynomials of $ρ$-Removed Uniform Matroids

Let $ρ$ be a non-negative integer. A $ρ$-removed uniform matroid is a matroid obtained from a uniform matroid by removing a collection of $ρ$ disjoint bases. We present a combinatorial formula for Kazhdan-Lusztig polynomials of $ρ$-removed uniform matroids, using skew Young Tableaux. Even for uniform matroids, our formula is new, gives manifestly positive integer coefficients, and is more manageable than known formulas.

math.CO↗
arXiv2018

Frieze varieties : A characterization of the finite-tame-wild trichotomy for acyclic quivers

We introduce a new class of algebraic varieties which we call frieze varieties. Each frieze variety is determined by an acyclic quiver. The frieze variety is defined in an elementary recursive way by constructing a set of points in affine space. From a more conceptual viewpoint, the coordinates of these points are specializations of cluster variables in the cluster algebra associated to the quiver. We give a new characterization of the finite--tame--wild trichotomy for acyclic quivers in terms of their frieze varieties. We show that an acyclic quiver is representation finite, tame, or wild, respectively, if and only if the dimension of its frieze variety is $0,1$, or $\ge2$, respectively.

math.RT↗
arXiv2018

Rigid reflections and Kac--Moody algebras

Given any Coxeter group, we define rigid reflections and rigid roots using non-self-intersecting curves on a Riemann surface with labeled curves. When the Coxeter group arises from an acyclic quiver, they are related to the rigid representations of the quiver. For a family of rank 3 Coxeter groups, we show that there is a surjective map from the set of reduced positive roots of a rank 2 Kac--Moody algebra onto the set of rigid reflections. We conjecture that this map is bijective.

math.RT↗
arXiv2017

Cluster algebras and Jones polynomials

We present a new and very concrete connection between cluster algebras and knot theory. This connection is being made via continued fractions and snake graphs. It is known that the class of 2-bridge knots and links is parametrized by continued fractions, and it has recently been shown that one can associate to each continued fraction a snake graph, and hence a cluster variable in a cluster algebra. We show that up to normalization by the leading term the Jones polynomial of the 2-bridge link is equal to the specialization of this cluster variable obtained by setting all initial cluster variables to 1 and specializing the initial principal coefficients of the cluster algebra as follows $y_1=t^{-2}$ and $ y_i=-t^{-1}$, for all $i> 1$. As a consequence we obtain a direct formula for the Jones polynomial of a 2-bridge link as the numerator of a continued fraction of Laurent polynomials in $q=-t^{-1}$. We also obtain formulas for the degree and the width of the Jones polynomial, as well as for the first three and the last three coefficients. Along the way, we also develop some basic facts about even continued fractions and construct their snake graphs. We show that the snake graph of an even continued fraction is ismorphic to the snake graph of a positive continued fraction if the continued fractions have the same value. We also give recursive formulas for the Jones polynomials.

math.GT↗
arXiv2017

New Combinatorial Formulas for Cluster Monomials of Type A Quivers

Lots of research focuses on the combinatorics behind various bases of cluster algebras. This paper studies the natural basis of a type A cluster algebra, which consists of all cluster monomials. We introduce a new kind of combinatorial formulas for the cluster monomials in terms of the so-called globally compatible collections. We give bijective proofs of these formulas by comparing with the well-known combinatorial models of the T-paths and of the perfect matchings in a snake diagram. For cluster variables of a type A cluster algebra, we give a bijection that relates our new formula with the theta functions constructed by Gross, Hacking, Keel and Kontsevich.

math.CO↗
arXiv2016

A Combinatorial Approach to the Symmetry of $q,t$-Catalan Numbers

The \emph{$q,t$-Catalan numbers} $C_n(q,t)$ are polynomials in $q$ and $t$ that reduce to the ordinary Catalan numbers when $q=t=1$. These polynomials have important connections to representation theory, algebraic geometry, and symmetric functions. Haglund and Haiman discovered combinatorial formulas for $C_n(q,t)$ as weighted sums of Dyck paths (or equivalently, integer partitions contained in a staircase shape). This paper undertakes a combinatorial investigation of the joint symmetry property $C_n(q,t)=C_n(t,q)$. We conjecture some structural decompositions of Dyck objects into "mutually opposite" subcollections that lead to a bijective explanation of joint symmetry in certain cases. A key new idea is the construction of infinite chains of partitions that are independent of $n$ but induce the joint symmetry for all $n$ simultaneously. Using these methods, we prove combinatorially that for $0\leq k\leq 9$ and all $n$, the terms in $C_n(q,t)$ of total degree $\binom{n}{2}-k$ have the required symmetry property.

math.CO↗
arXiv2015

A Combinatorial Formula for Certain Elements of Upper Cluster Algebras

We develop an elementary formula for certain non-trivial elements of upper cluster algebras. These elements have positive coefficients. We show that when the cluster algebra is acyclic these elements form a basis. Using this formula, we show that each non-acyclic skew-symmetric cluster algebra of rank 3 is properly contained in its upper cluster algebra.

math.RA↗