Related papers: Local Euler-Maclaurin formula for polytopes
The Gauss-Bonnet theorem for a polyhedron (a union of finitely many compact convex polytopes) in $n$-dimensional Euclidean space expresses the Euler characteristic of the polyhedron as a sum of certain curvatures, which are different from…
An equidistant polytope is a special equidistant set in the space $\mathbb{R}^n$ all of whose boundary points have equal distances from two finite systems of points. Since one of the finite systems of the given points is required to be in…
Exploring the general analytical solutions to the Euler equations for ideal fluids holds significant theoretical and practical importance. The steady flows in two-dimensional spaces are considered whether there is an analytical solution in…
We provide a multidimensional weighted Euler--MacLaurin summation formula on polytopes and a multidimensional generalization of a result due to L. J. Mordell on the series expansion in Bernoulli polynomials. These results are consequences…
A set $\mathcal{S}$ of points in $\mathbb{R}^n$ is called a rationally parameterisable hypersurface if $\mathcal{S}=\{\boldsymbol{\sigma}(\mathbf{t}): \mathbf{t} \in D\}$, where $\boldsymbol{\sigma}: \mathbb{R}^{n-1} \rightarrow…
Consider the random polytope, that is given by the convex hull of a Poisson point process on a smooth convex body in $\mathbb{R}^d$. We prove central limit theorems for continuous motion invariant valuations including the Will's functional…
Let Delta be an integral convex polytope containing the origin of dimension n in the n-dim real space and it is simplicial at all origin-less facets. Let A(Delta) be the space of all Laurent polynomials f parametered by its coefficients…
Integral representations for continuous polynomial local functionals on convex functions are established in terms of a finite family of polynomials. This result is obtained by approximation from a classification of the dense subspace of…
Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…
For a given elliptic curve $E$ over a finite local ring, we denote by $E^{\infty}$ its subgroup at infinity. Every point $P \in E^{\infty}$ can be described solely in terms of its $x$-coordinate $P_x$, which can be therefore used to…
A $d$-dimensional simplex in Euclidean space is called orthocentric if all of its altitudes intersect at a single point, referred to as the orthocenter. We explicitly compute the internal and external angles at all faces of an orthocentric…
A rational polytope is the convex hull of a finite set of points in $\R^d$ with rational coordinates. Given a rational polytope $P \subseteq \R^d$, Ehrhart proved that, for $t\in\Z_{\ge 0}$, the function $#(tP \cap \Z^d)$ agrees with a…
We present a polynomial time algorithm to compute any fixed number of the highest coefficients of the Ehrhart quasi-polynomial of a rational simplex. Previously such algorithms were known for integer simplices and for rational polytopes of…
Orthogonal rational functions (ORF) on the unit circle generalize orthogonal polynomials (poles at infinity) and Laurent polynomials (poles at zero and infinity). In this paper we investigate the properties of and the relation between these…
We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…
Macdonald studied a discrete volume measure for a rational polytope $P$, called solid angle sum, that gives a natural discrete volume for $P$. We give a local formula for the codimension two quasi-coefficient of the solid angle sum of $P$.…
Given a polynomial or a rational map f we associate to it a space of maps. We introduce local coordinates in this space, which are essentially the set of critical values of the map. Then we consider an arbitrary periodic orbit of f with…
We present algorithms for classifying rational polygons with fixed denominator and number of interior lattice points. Our approach is to first describe maximal polygons and then compute all subpolygons, where we eliminate redundancy by a…
In this paper, we establish a local regularity result for $W^{2,p}_{\mathrm{loc}}$ solutions to complex degenerate nonlinear elliptic equations $F(D^2_{\mathbb{C}} u)=f$ when they are comparable to the Monge-Amp\`ere equation. Notably, we…
Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…