Alexander Postnikov
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Alexander Postnikov has a total of 48 co-authors. Here are the top co-authors by number of shared publications:
- Ron M. Adin
Bar Ilan Univ, Dept Math, IL-52900 Ramat Gan, Israel
5 shared publications - Yuval Roichman
Bar Ilan Univ, Dept Math, IL-52900 Ramat Gan, Israel
5 shared publications - Karola Mészáros
Department of Mathematics, Cornell University, Ithaca, USA
4 shared publications - Tamás Kálmán
Department of Mathematics Institute of Science Tokyo H-214 2-12-1 Ookayama Meguro-ku 152-8551 Tokyo Japan
4 shared publications - Thomas Lam
Department of Mathematics, University of Michigan, Ann Arbor, USA
4 shared publications - Cristian Lenart
Department of Mathematics and Statistics, State University of New York at Albany, Albany, New York 12222
3 shared publications
Latest Publications
- Open Access
Trapezodial property of the generalized Alexander polynomial
Fox's conjecture from 1962, that the absolute values of the coefficients of the Alexander polynomial of an alternating link are trapezoidal, has remained stubbornly open to this date. Recently Fox's conjecture was settled for all special alternating links. In this paper we take a broad view of the Alexander polynomials of special alternating links, showing that they are a generating function for a statistic on certain vector configurations. We study three types of vector configurations: (1) vectors arising from cographic matroids, (2) vectors arising from graphic matroids, (3) vectors arising from totally positive matrices. We prove that Alexander polynomials of special alternating links belong to both classes (1) and (2), and prove log-concavity, respectively trapezoidal, properties for classes (2) and (3). As a special case of our results, we obtain a new proof of Fox's conjecture for special alternating links.
Open AccessTrapezodial property of the generalized Alexander polynomial
Fox's conjecture from 1962, that the absolute values of the coefficients of the Alexander polynomial of an alternating link are trapezoidal, has remained stubbornly open to this date. Recently Fox's conjecture was settled for all special alternating links. In this paper we take a broad view of the Alexander polynomials of special alternating links, showing that they are a generating function for a statistic on certain vector configurations. We study three types of vector configurations: (1) vectors arising from cographic matroids, (2) vectors arising from graphic matroids, (3) vectors arising from totally positive matrices. We prove that Alexander polynomials of special alternating links belong to both classes (1) and (2), and prove log-concavity, respectively trapezoidal, properties for classes (2) and (3). As a special case of our results, we obtain a new proof of Fox's conjecture for special alternating links.
- Open Access
- 27 September 2024
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 4 (2)
Repeatable patterns and the maximum multiplicity of a generator in a reduced word
We study the maximum multiplicity \(\mathcal{M}(k,n)\) of a simple transposition \(s_k=(k \: k+1)\) in a reduced word for the longest permutation \(w_0=n \: n-1 \: \cdots \: 2 \: 1\), a problem closely related to much previous work on sorting networks and on the "\(k\)-set" problem. After reinterpreting the problem in terms of monotone weakly separated paths, we show that, for fixed \(k\) and sufficiently large \(n\), the optimal density is realized by paths which are periodic in a precise sense, so that \[ \mathcal{M}(k,n)=c_k n + p_k(n) \] for a periodic function \(p_k\) and constant \(c_k\). In fact we show that \(c_k\) is always rational, and compute several bounds and exact values for this quantity with repeatable patterns, which we introduce.Mathematics Subject Classifications: 05A05, 05A16, 05E99Keywords: Reduced words, permutations, \(k\)-sets, wiring diagram, weakly separated- 27 September 2024
- Published by California Digital Library (CDL) in Combinatorial Theory
- Vol. 4 (2)
Open AccessRepeatable patterns and the maximum multiplicity of a generator in a reduced word
We study the maximum multiplicity \(\mathcal{M}(k,n)\) of a simple transposition \(s_k=(k \: k+1)\) in a reduced word for the longest permutation \(w_0=n \: n-1 \: \cdots \: 2 \: 1\), a problem closely related to much previous work on sorting networks and on the "\(k\)-set" problem. After reinterpreting the problem in terms of monotone weakly separated paths, we show that, for fixed \(k\) and sufficiently large \(n\), the optimal density is realized by paths which are periodic in a precise sense, so that \[ \mathcal{M}(k,n)=c_k n + p_k(n) \] for a periodic function \(p_k\) and constant \(c_k\). In fact we show that \(c_k\) is always rational, and compute several bounds and exact values for this quantity with repeatable patterns, which we introduce.Mathematics Subject Classifications: 05A05, 05A16, 05E99Keywords: Reduced words, permutations, \(k\)-sets, wiring diagram, weakly separated - Open Access
- 18 March 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12
Polypositroids
- 18 March 2024
- Published by Cambridge University Press (CUP) in Forum of Mathematics, Sigma
- Vol. 12
Open AccessPolypositroids
- Open Access
Universal Tutte polynomial
The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is related to previous works of Cameron and Fink and of K\'alm\'an and Postnikov. We then define the universal Tutte polynomial $\T_n$, which is a polynomial of degree $n$ in $2+(2^n-1)$ variables that specializes to the Tutte polynomials of all polymatroids (hence all matroids) on a ground set with $n$ elements. The universal polynomial $\T_n$ admits three kinds of symmetries: translation invariance, $S_n$-invariance, and duality.Open AccessUniversal Tutte polynomial
The Tutte polynomial is a well-studied invariant of graphs and matroids. We first extend the Tutte polynomial from graphs to hypergraphs, and more generally from matroids to polymatroids, as a two-variable polynomial. Our definition is related to previous works of Cameron and Fink and of K\'alm\'an and Postnikov. We then define the universal Tutte polynomial $\T_n$, which is a polynomial of degree $n$ in $2+(2^n-1)$ variables that specializes to the Tutte polynomials of all polymatroids (hence all matroids) on a ground set with $n$ elements. The universal polynomial $\T_n$ admits three kinds of symmetries: translation invariance, $S_n$-invariance, and duality. - Open Access
Coxeter submodular functions and deformations of Coxeter permutahedra
We describe the cone of deformations of a Coxeter permutahedron, or equivalently, the nef cone of the toric variety associated to a Coxeter complex. This family of polytopes contains polyhedral models for the Coxeter-theoretic analogs of compositions, graphs, matroids, posets, and associahedra. Our description extends the known correspondence between generalized permutahedra, polymatroids, and submodular functions to any finite reflection group.
Open AccessCoxeter submodular functions and deformations of Coxeter permutahedra
We describe the cone of deformations of a Coxeter permutahedron, or equivalently, the nef cone of the toric variety associated to a Coxeter complex. This family of polytopes contains polyhedral models for the Coxeter-theoretic analogs of compositions, graphs, matroids, posets, and associahedra. Our description extends the known correspondence between generalized permutahedra, polymatroids, and submodular functions to any finite reflection group.
- Open Access
A positive formula for the Ehrhart-like polynomials from root system chip-firing
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart polynomials of lattice polytopes, which we termed the symmetric and truncated Ehrhart-like polynomials. We conjectured that these polynomials have nonnegative integer coefficients. Here we affirm "half" of this positivity conjecture by providing a positive, combinatorial formula for the coefficients of the symmetric Ehrhart-like polynomials. This formula depends on a subtle integrality property of slices of permutohedra, and in turn a lemma concerning dilations of projections of root polytopes, which both may be of independent interest. We also discuss how our formula very naturally suggests a conjecture for the coefficients of the truncated Ehrhart-like polynomials that turns out to be false in general, but which may hold in some cases.
Open AccessA positive formula for the Ehrhart-like polynomials from root system chip-firing
In earlier work in collaboration with Pavel Galashin and Thomas McConville we introduced a version of chip-firing for root systems. Our investigation of root system chip-firing led us to define certain polynomials analogous to Ehrhart polynomials of lattice polytopes, which we termed the symmetric and truncated Ehrhart-like polynomials. We conjectured that these polynomials have nonnegative integer coefficients. Here we affirm "half" of this positivity conjecture by providing a positive, combinatorial formula for the coefficients of the symmetric Ehrhart-like polynomials. This formula depends on a subtle integrality property of slices of permutohedra, and in turn a lemma concerning dilations of projections of root polytopes, which both may be of independent interest. We also discuss how our formula very naturally suggests a conjecture for the coefficients of the truncated Ehrhart-like polynomials that turns out to be false in general, but which may hold in some cases.
- Open Access
Root system chip-firing II: Central-firing
Jim Propp recently proposed a labeled version of chip-firing on a line and conjectured that this process is confluent from some initial configurations. This was proved by Hopkins-McConville-Propp. We reinterpret Propp's labeled chip-firing moves in terms of root systems: a "central-firing" move consists of replacing a weight $\lambda$ by $\lambda+\alpha$ for any positive root $\alpha$ that is orthogonal to $\lambda$. We show that central-firing is always confluent from any initial weight after modding out by the Weyl group, giving a generalization of unlabeled chip-firing on a line to other types. For simply-laced root systems we describe this unlabeled chip-firing as a number game on the Dynkin diagram. We also offer a conjectural classification of when central-firing is confluent from the origin or a fundamental weight.Open AccessRoot system chip-firing II: Central-firing
Jim Propp recently proposed a labeled version of chip-firing on a line and conjectured that this process is confluent from some initial configurations. This was proved by Hopkins-McConville-Propp. We reinterpret Propp's labeled chip-firing moves in terms of root systems: a "central-firing" move consists of replacing a weight $\lambda$ by $\lambda+\alpha$ for any positive root $\alpha$ that is orthogonal to $\lambda$. We show that central-firing is always confluent from any initial weight after modding out by the Weyl group, giving a generalization of unlabeled chip-firing on a line to other types. For simply-laced root systems we describe this unlabeled chip-firing as a number game on the Dynkin diagram. We also offer a conjectural classification of when central-firing is confluent from the origin or a fundamental weight. - Open Access
Root system chip-firing I: Interval-firing
Jim Propp recently introduced a variant of chip-firing on a line where the chips are given distinct integer labels. Hopkins, McConville, and Propp showed that this process is confluent from some (but not all) initial configurations of chips. We recast their set-up in terms of root systems: labeled chip-firing can be seen as a root-firing process which allows the moves $\lambda \to \lambda + \alpha$ for $\alpha\in \Phi^{+}$ whenever $\langle\lambda,\alpha^\vee\rangle = 0$, where $\Phi^{+}$ is the set of positive roots of a root system of Type A and $\lambda$ is a weight of this root system. We are thus motivated to study the exact same root-firing process for an arbitrary root system. Actually, this central root-firing process is the subject of a sequel to this paper. In the present paper, we instead study the interval root-firing processes determined by $\lambda \to \lambda + \alpha$ for $\alpha\in \Phi^{+}$ whenever $\langle\lambda,\alpha^\vee\rangle \in [-k-1,k-1]$ or $\langle\lambda,\alpha^\vee\rangle \in [-k,k-1]$, for any $k \geq 0$. We prove that these interval-firing processes are always confluent, from any initial weight. We also show that there is a natural way to consistently label the stable points of these interval-firing processes across all values of $k$ so that the number of weights with given stabilization is a polynomial in $k$. We conjecture that these Ehrhart-like polynomials have nonnegative integer coefficients.Open AccessRoot system chip-firing I: Interval-firing
Jim Propp recently introduced a variant of chip-firing on a line where the chips are given distinct integer labels. Hopkins, McConville, and Propp showed that this process is confluent from some (but not all) initial configurations of chips. We recast their set-up in terms of root systems: labeled chip-firing can be seen as a root-firing process which allows the moves $\lambda \to \lambda + \alpha$ for $\alpha\in \Phi^{+}$ whenever $\langle\lambda,\alpha^\vee\rangle = 0$, where $\Phi^{+}$ is the set of positive roots of a root system of Type A and $\lambda$ is a weight of this root system. We are thus motivated to study the exact same root-firing process for an arbitrary root system. Actually, this central root-firing process is the subject of a sequel to this paper. In the present paper, we instead study the interval root-firing processes determined by $\lambda \to \lambda + \alpha$ for $\alpha\in \Phi^{+}$ whenever $\langle\lambda,\alpha^\vee\rangle \in [-k-1,k-1]$ or $\langle\lambda,\alpha^\vee\rangle \in [-k,k-1]$, for any $k \geq 0$. We prove that these interval-firing processes are always confluent, from any initial weight. We also show that there is a natural way to consistently label the stable points of these interval-firing processes across all values of $k$ so that the number of weights with given stabilization is a polynomial in $k$. We conjecture that these Ehrhart-like polynomials have nonnegative integer coefficients. - Open Access
Positive Grassmannian and polyhedral subdivisions
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial structures appeared in many other areas of mathematics and physics, e.g., in the study of cluster algebras, scattering amplitudes, and solitons. We discuss new ways to think about these structures. In particular, we identify plabic graphs and more general Grassmannian graphs with polyhedral subdivisions induced by 2-dimensional projections of hypersimplices. This implies a close relationship between the positive Grassmannian and the theory of fiber polytopes and the generalized Baues problem. This suggests natural extensions of objects related to the positive Grassmannian.
Open AccessPositive Grassmannian and polyhedral subdivisions
The nonnegative Grassmannian is a cell complex with rich geometric, algebraic, and combinatorial structures. Its study involves interesting combinatorial objects, such as positroids and plabic graphs. Remarkably, the same combinatorial structures appeared in many other areas of mathematics and physics, e.g., in the study of cluster algebras, scattering amplitudes, and solitons. We discuss new ways to think about these structures. In particular, we identify plabic graphs and more general Grassmannian graphs with polyhedral subdivisions induced by 2-dimensional projections of hypersimplices. This implies a close relationship between the positive Grassmannian and the theory of fiber polytopes and the generalized Baues problem. This suggests natural extensions of objects related to the positive Grassmannian.
- Open Access
Trianguloids and Triangulations of Root Polytopes
Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized permutohedra. We introduce a new approach to these objects, identifying a triangulation of a root polytope with a certain bijection between lattice points of two generalized permutohedra. In order to study such bijections, we define trianguloids as edge-colored graphs satisfying simple local axioms. We prove that trianguloids are in bijection with triangulations of root polytopes.
Open AccessTrianguloids and Triangulations of Root Polytopes
Triangulations of a product of two simplices and, more generally, of root polytopes are closely related to Gelfand-Kapranov-Zelevinsky's theory of discriminants, to tropical geometry, tropical oriented matroids, and to generalized permutohedra. We introduce a new approach to these objects, identifying a triangulation of a root polytope with a certain bijection between lattice points of two generalized permutohedra. In order to study such bijections, we define trianguloids as edge-colored graphs satisfying simple local axioms. We prove that trianguloids are in bijection with triangulations of root polytopes.