Related papers: A combinatorial model for computing volumes of flo…
For a class of flows on polytopes, including many examples from Evolutionary Game Theory, we describe a piecewise linear model which encapsulates the asymptotic dynamics along the heteroclinic network formed out of the polytope's vertexes…
We propose a version of the volume conjecture that would relate a certain limit of the colored Jones polynomials of a knot to the volume function defined by a representation of the fundamental group of the knot complement to the special…
I explore properties of the inflationary flow equations. I show that the flow equations do not correspond directly to inflationary dynamics. Nevertheless, they can be used as a rather complicated algorithm for generating inflationary…
We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…
We try to bring to light some combinatorial structure underlying formal proofs in logic. We do this through the study of the Craig Interpolation Theorem which is properly a statement about the structure of formal derivations. We show that…
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…
This paper proposes a new volume function for calculation of the entropy of planar granular assemblies. This function is extracted from the antisymmetric part of a new geometric tensor and is rigorously additive when summed over grains. It…
In this paper, we generalize the result on the average volume of random polytopes with vertices following beta distributionsto the case of non-identically distributed vectors. Specifically,we consider the convex hull of independent random…
This paper, about a fluid-like system of spatially confined particles, reveals the analytic structure for both, the canonical and grand canonical partition functions. The studied system is inhomogeneously distributed in a region whose…
Intrinsic volumes, which generalize both Euler characteristic and Lebesgue volume, are important properties of $d$-dimensional sets. A random cubical complex is a union of unit cubes, each with vertices on a regular cubic lattice,…
A polynomial triangle is an array whose inputs are the coefficients in integral powers of a polynomial. Although polynomial coefficients have appeared in several works, there is no systematic treatise on this topic. In this paper we plan to…
We introduce constrained polynomial zonotopes, a novel non-convex set representation that is closed under linear map, Minkowski sum, Cartesian product, convex hull, intersection, union, and quadratic as well as higher-order maps. We show…
This paper aims to construct a new family of numbers and polynomials which are related to the Bell numbers and polynomials by means of the confluent hypergeometric function. We give various properties of these numbers and polynomials…
We describe a new approach to the Schubert calculus on complete flag varieties using the volume polynomial associated with Gelfand-Zetlin polytopes. This approach allows us to compute the intersection products of Schubert cycles by…
Gelfand-Tsetlin polytopes are classical objects in algebraic combinatorics arising in the representation theory of $\mathfrak{gl}_n(\mathbb{C})$. The integer point transform of the Gelfand-Tsetlin polytope $\mathrm{GT}(\lambda)$ projects to…
A result of Haglund implies that the $(q,t)$-bigraded Hilbert series of the space of diagonal harmonics is a $(q,t)$-Ehrhart function of the flow polytope of a complete graph with netflow vector $(-n, 1, \dots, 1)$. We study the…
We present an efficient numerical scheme based on Monte Carlo integration to approximate statistical solutions of the incompressible Euler equations. The scheme is based on finite volume methods, which provide a more flexible framework than…
Aggregations of flexible loads can provide several power system services through demand response programs, for example load shifting and curtailment. The capabilities of demand response should therefore be represented in system operators'…
We formulate a generalization of the volume conjecture for planar graphs. Denoting by <G, c> the Kauffman bracket of the graph G whose edges are decorated by real "colors" c, the conjecture states that, under suitable conditions, certain…
Let $P$ be a bounded polyhedron defined as the intersection of the non-negative orthant ${\Bbb R}^n_+$ and an affine subspace of codimension $m$ in ${\Bbb R}^n$. We show that a simple and computationally efficient formula approximates the…