相关论文: Proof of a Conjecture of Chan, Robbins, and Yuen
Volume computation for $d$-polytopes $\mathcal{P}$ is fundamental in mathematics. There are known volume computation algorithms, mostly based on triangulation or signed-decomposition of $\mathcal{P}$. We consider $…
A flexible polyhedron in an n-dimensional space of constant curvature, namely, in the Euclidean space, or in the Lobachevsky space, or in the sphere, is a polyhedron with rigid (n-1)-dimensional faces and hinges at (n-2)-dimensional faces.…
Recently, Chapoton found a $q$-analog of Ehrhart polynomials, which are polynomials in $x$ whose coefficients are rational functions in $q$. Chapoton conjectured the shape of the Newton polygon of the numerator of the $q$-Ehrhart polynomial…
Let $d$ be a nonnegative integer, and let $P \subset \mathbb R^d$ be a $d$-dimensional convex lattice polytope. In this article, we prove that the ratio of the volume of a normal-sized miniature of $P$ to that of $P$ is $1:\binom{2d+1}{d},$…
This paper proves four conjectured generating series, due to Chapoton, which concern invariants of posets and polytopes associated with a specific sequence of arbors. Two of these conjectures provide closed-form formulas for the generating…
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…
Using equivariant topology, we prove that it is always possible to find $n$ points in the $d$-dimensional faces of a $nd$-dimensional convex polytope $P$ so that their center of mass is a target point in $P$. Equivalently, the $n$-fold…
Consider $n$ points $X_1,\ldots,X_n$ in $\mathbb R^d$ and denote their convex hull by $\Pi$. We prove a number of inclusion-exclusion identities for the system of convex hulls $\Pi_I:=conv(X_i\colon i\in I)$, where $I$ ranges over all…
In a $d$-dimensional convex body $K$, for $n \leq d+1$, random points $X_0, \dots, X_{n-1}$ are chosen according to the uniform distribution in $K$. Their convex hull is a random $(n-1)$-simplex with probability $1$. We denote its…
The random polytope $K_n$, defined as the convex hull of $n$ points chosen uniformly at random on the boundary of a smooth convex body, is considered. Proofs for lower and upper variance bounds, strong laws of large numbers and central…
Moore's Conjecture is shown to hold for generalized moment-angle complexes and a criterion is proved that determines when a polyhedral product is elliptic or hyperbolic.
From a rational convex polytope of dimension $r\ge 2$ J.P. Hansen constructed an error correcting code of length $n=(q-1)^r$ over the finite field $\fq$. A rational convex polytope is the same datum as a normal toric variety and a Cartier…
In this note, I will discuss a possible relation between the Mahler measure of the colored Jones polynomial and the volume conjecture. In particular, I will study the colored Jones polynomial of the figure-eight knot on the unit circle. I…
The Jacobian conjecture in dimension $n$ asserts that any polynomial endomorphism of $n$-dimensional affine space over a field of zero characteristic, with the Jacobian equal 1, is invertible. The Dixmier conjecture in rank $n$ asserts that…
The volume conjecture relates the quantum invariant and the hyperbolic geometry. Bonahon-Wong-Yang introduced a new version of the volume conjecture by using the intertwiners between two isomorphic irreducible representations of the skein…
Dyson's celebrated constant term conjecture ({\em J. Math. Phys.}, 3 (1962): 140--156) states that the constant term in the expansion of $\prod_{1\leqq i\neq j\leqq n} (1-x_i/x_j)^{a_j}$ is the multinomial coefficient $(a_1 + a_2 + \cdots +…
We prove that the volume of central hyperplane sections of a unit cube in $\mathbb{R}^n$ orthogonal to a diameter of the cube is a strictly monotonically increasing function of the dimension for $n\geq 3$. Our argument uses an integral…
The Besson-Courtois-Gallot theorem is proven for noncompact finite volume Riemannian manifolds. In particular, no bounded geometry assumptions are made. This proves the minimal entropy conjecture for nonuniform rank one lattices.
During the study of dual sequences, Sun introduced the polynomials \[ D_n(x,y)=\sum_{k=0}^{n}{n\choose k}{x\choose k}y^k\text{ and } S_n(x,y)=\sum_{k=0}^{n}\binom{n}{k}\binom{x}{k}\binom{-1-x}{k} y^k. \] Many related congruences have been…
We consider the systems of diffusion-orthogonal polynomials, defined in the work [1] of D. Bakry, S. Orevkov and M. Zani and (particularly) explain why these systems with boundary of maximal possible degree should always come from the…