Related papers: Generalized parking function polytopes
A $q$-rank function is a real-valued function defined on the subspace lattice that is non-negative, upper bounded by the dimension function, non-drecreasing, and satisfies the submodularity law. Each such function corresponds to the rank…
We derive static spherically symmetric regular black holes as vacuum solutions to purely gravitational theories in four dimensions. To that end, we construct four-dimensional non-polynomial gravities starting from subclasses of…
We introduce the notion of the generalized-analytical function of the poly-number variable, which is a non-trivial generalization of the notion of analytical function of the complex variable and, therefore, may turn out to be fundamental in…
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…
The convex hull of N independent random points chosen on the boundary of a simple polytope in R^n is investigated. Asymptotic formulas for the expected number of vertices and facets, and for the expectation of the volume difference are…
We present dyonic BPS static black hole solutions for general d=4, N=2 supergravity theories coupled to vector and hypermultiplets. These solutions are generalisations of the spherically symmetric Majumdar-Papapetrou black hole solutions of…
For a connected graph $G$ with sink vertex $q$, a $G$-parking function is a vector of nonnegative integers whose entries are determined by cut-sets in $G$. Such objects also arise as the superstable configurations in the context of…
The Santal\'o point of a convex polytope is the interior point which leads to a polar dual of minimal volume. This minimization problem is relevant in interior point methods for convex optimization, where the logarithm of the dual volume is…
The polytope of integer partitions of $n$ is the convex hull of the corresponding $n$-dimensional integer points. Its vertices are of importance because every partition is their convex combination. Computation shows intriguing features of…
We construct generalized polygons (`parking garages') in which the billiard flow satisfies the Veech dichotomy, although the associated translation surface obtained from the Zemlyakov-Katok unfolding is not a lattice surface. We also…
Quantum polyhedra constructed from angular momentum operators are the building blocks of space in its quantum description as advocated by Loop Quantum Gravity. Here we extend previous results on the semiclassical properties of quantum…
This article presents numerical methods in order to solve problems of tolerance analysis. A geometric specification, a contact specification and a functional requirement can be respectively characterized by a finite set of geometric…
This work builds on the notion of record of rooted trees. We provide an alternative definition of parking functions, derive from it a record-preserving bijection between rooted trees and parking functions, and establish a join…
Computing mixed volume of convex polytopes is an important problem in computational algebraic geometry. This paper establishes sufficient conditions under which the mixed volume of several convex polytopes exactly equals the normalized…
Berget and Rhoades asked whether the permutation representation obtained by the action of $S_{n-1}$ on parking functions of length $n-1$ can be extended to a permutation action of $S_{n}$. We answer this question in the affirmative. We…
With the goal of obtaining strong relaxations for binary polynomial optimization problems, we introduce the pseudo-Boolean polytope defined as the convex hull of the set of binary points satisfying a collection of equations containing…
Motivated by problems of hyperbolic stochastic geometry we introduce and study the class of beta-star polytopes. A beta-star polytope is defined as the convex hull of an inhomogeneous Poisson processes on the complement of the unit ball in…
This paper is about a family of symmetric rational functions that form a one-parameter generalization of the classical Hall-Littlewood polynomials. We introduce two sets of (skew and non-skew) functions that are akin to P and Q…
Taking the convex hull of a curve is a natural construction in computational geometry. On the other hand, path signatures, central in stochastic analysis, capture geometric properties of curves, although their exact interpretation for…
This work investigates the duality between two discrete dynamical processes: parking functions, and the Abelian sandpile model (ASM). Specifically, we are interested in the extension of classical parking functions, called $G$-parking…