中文
相关论文

相关论文: Volumes of generalized Chan-Robbins-Yuen polytopes

200 篇论文

The Chan-Robbins-Yuen polytope can be thought of as the flow polytope of the complete graph with netflow vector $(1, 0, \ldots, 0, -1)$. The normalized volume of the Chan-Robbins-Yuen polytope equals the product of consecutive Catalan…

组合数学 · 数学 2016-12-02 Sylvie Corteel , Jang Soo Kim , Karola Mészáros

Intrigued by the product formula prod_{i=1}^{n-2} C_i for the volume of the Chan-Robbins-Yuen polytope CRY_n, where C_i is the ith Catalan number, we construct a family of polytopes P_{m,n}, whose volumes are given by the product…

组合数学 · 数学 2011-11-28 Karola Meszaros

Using the celebrated Morris Constant Term Identity, we deduce a recent conjecture of Chan, Robbins, and Yuen (math.CO/9810154), that asserts that the volume of a certain $n(n-1)/2$-dimensional polytope is given by the product of the first…

组合数学 · 数学 2007-05-23 Doron Zeilberger

Flow polytopes are an important class of polytopes in combinatorics whose lattice points and volumes have interesting properties and relations. The Chan-Robbins-Yuen (CRY) polytope is a flow polytope with normalized volume equal to the…

组合数学 · 数学 2022-05-11 Alejandro H. Morales , William Shi

We establish the relationship between volumes of flow polytopes associated to signed graphs and the Kostant partition function. A special case of this relationship, namely, when the graphs are signless, has been studied in detail by Baldoni…

组合数学 · 数学 2015-10-21 Karola Meszaros , Alejandro H. Morales

The Chan-Robbins-Yuen polytope ($CRY_n$) of order $n$ is a face of the Birkhoff polytope of doubly stochastic matrices that is also a flow polytope of the directed complete graph $K_{n+1}$ with netflow $(1,0,0, \ldots , 0, -1)$. The volume…

组合数学 · 数学 2024-09-25 William T. Dugan

We introduce new families of combinatorial objects whose enumeration computes volumes of flow polytopes. These objects provide an interpretation, based on parking functions, of Baldoni and Vergne's generalization of a volume formula…

Using the Morris-Selberg Constant Term Identity, I sketch a proof of a recent conjecture by Karola Meszaros and Alejandro Morales, that I believe could be easily made fully rigorous by a sufficiently skilled and, sufficiently interested,…

组合数学 · 数学 2014-07-11 Doron Zeilberger

We study the calculation of the volume of the polytope B_n of n by n doubly stochastic matrices; that is, the set of real non-negative matrices with all row and column sums equal to one. We describe two methods. The first involves a…

组合数学 · 数学 2007-05-23 Clara S. Chan , David P. Robbins

The type-PQ adjacency polytope associated to a simple graph is a $0/1$-polytope containing valuable information about an underlying power network. Chen and the first author have recently demonstrated that, when the underlying graph $G$ is…

组合数学 · 数学 2024-07-17 Robert Davis , Joakim Jakovleski , Qizhe Pan

The volume and the number of lattice points of the permutohedron P_n are given by certain multivariate polynomials that have remarkable combinatorial properties. We give several different formulas for these polynomials. We also study a more…

组合数学 · 数学 2007-05-23 Alexander Postnikov

This note provides a simple proof for the equality between the normalized volume of a convex polytope with $m$ vertices and the mixed volume of $m$ simplices and thus shows the seemingly restrictive problem of computing mixed volume of…

度量几何 · 数学 2021-08-31 Tianran Chen

In this paper, we use multivariate splines to investigate the volume of polytopes. We first present an explicit formula for the multivariate truncated power, which can be considered as a dual version of the famous Brion's formula for the…

数值分析 · 数学 2010-10-19 Zhiqiang Xu

Given a knot in 3-space, one can associate a sequence of Laurrent polynomials, whose $n$th term is the $n$th colored Jones polynomial. The Generalized Volume Conjecture states that the value of the $n$-th colored Jones polynomial at $\exp(2…

几何拓扑 · 数学 2007-05-23 Stavros Garoufalidis , Thang TQ Le

Let n >= 2 be an integer and consider the set T_n of n by n permutation matrices pi for which pi_{ij}=0 for j>=i+2. In this paper we study the convex hull of T_n, which we denote by P_n. P_n is a polytope of dimension binom{n}{2}. Our main…

组合数学 · 数学 2007-05-23 Clara S. Chan , David P. Robbins , David S. Yuen

We establish central limit theorems for natural volumes of random inscribed polytopes in projective Riemannian or Finsler geometries. In addition, normal approximation of dual volumes and the mean width of random polyhedral sets are…

度量几何 · 数学 2020-05-22 Florian Besau , Daniel Rosen , Christoph Thäle

Although previous research has found several facts concerning chord lengths of regular polytopes, none of these investigations has considered whether any of these facts define relationships that might generalize to the chord lengths of all…

度量几何 · 数学 2019-03-19 Jessica N. Copher

Choose $n$ random, independent points in $\R^d$ according to the standard normal distribution. Their convex hull $K_n$ is the {\sl Gaussian random polytope}. We prove that the volume and the number of faces of $K_n$ satisfy the central…

组合数学 · 数学 2007-05-23 I. Barany , V. H. Vu

Let $X_1,\ldots,X_n$ be a standard normal sample in $\mathbb R^d$. We compute exactly the expected volume of the Gaussian polytope $\mathrm{conv}[X_1,\ldots,X_n]$, the symmetric Gaussian polytope $\mathrm{conv}[\pm X_1,\ldots,\pm X_n]$, and…

概率论 · 数学 2017-06-27 Zakhar Kabluchko , Dmitry Zaporozhets

This note is a comment to the paper by D.R.Heath-Brown and B.Z.Moroz (Math Proc. Camb. Phil. Soc. 125 (1999)). That paper concerns with the projective surface $S$ in $\mathbb{P}^{3}$ defined by the equation $x_{1}x_{2}x_{3}=x_{4}^{3}$. It…

度量几何 · 数学 2007-05-23 Anna Felikson , Pavel Tumarkin
‹ 上一页 1 2 3 10 下一页 ›