Related papers: Fourier transforms of polytopes, solid angle sums,…
A versatile method is described for the practical computation of the discrete Fourier transforms (DFT) of a continuous function $g(t)$ given by its values $g_{j}$ at the points of a uniform grid $F_{N}$ generated by conjugacy classes of…
The set $X$ of $k$-subsets of an $n$-set has a natural graph structure where two $k$-subsets are connected if and only if the size of their intersection is $k-1$. This is known as the Johnson graph. The symmetric group $S_n$ acts on the…
A polytope is integral if all of its vertices are lattice points. The constant term of the Ehrhart polynomial of an integral polytope is known to be 1. In previous work, we showed that the coefficients of the Ehrhart polynomial of a…
For a convex polytope P with rational vertices, we count the number of integer points in integral dilates of P and its interior. The Ehrhart-Macdonald reciprocity law gives an intimate relation between these two counting functions. A…
The Fourier transform plays a central role in many geometric and combinatorial problems cast in vector spaces over finite fields. If a set admits optimal $L^\infty$ bounds on its Fourier transform (that is, it is a Salem set), then it can…
We present a new method for the analysis of images, a fundamental task in observational astronomy. It is based on the linear decomposition of each object in the image into a series of localised basis functions of different shapes, which we…
Given a multi-variable polynomial, there is an associated divided symmetrization (in particular turning it into a symmetric function). Postinkov has found the volume of a permutohedron as a divided symmetrization (DS) of the power of a…
The Ehrhart polynomial of a lattice polytope $P$ encodes information about the number of integer lattice points in positive integral dilates of $P$. The $h^\ast$-polynomial of $P$ is the numerator polynomial of the generating function of…
This paper presents a novel algorithm for constructing a sum-of-squares (SOS) decomposition for positive semi-definite polynomials with rational coefficients. Unlike previous methods that typically yield SOS decompositions with…
We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…
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 $V$ be a real vector space of dimension $n$ and let $M\subset V$ be a lattice. Let $P\subset V$ be an $n$-dimensional polytope with vertices in $M$, and let $\varphi\colon V\rightarrow \CC $ be a homogeneous polynomial function of…
This report elaborates on approximations for the discrete Fourier transform by means of replacing the exact Cooley-Tukey algorithm twiddle-factors by low-complexity integers, such as $0, \pm \frac{1}{2}, \pm 1$.
We define the notion of the Fourier transform for the rook monoid (also called the symmetric inverse semigroup) and provide two efficient divide-and-conquer algorithms (fast Fourier transforms, or FFTs) for computing it. This paper marks…
We define and study a new family of polytopes which are formed as convex hulls of partial alternating sign matrices. We determine the inequality descriptions, number of facets, and face lattices of these polytopes. We also study partial…
We study the problem of counting lattice points of a polytope that are weighted by an Ehrhart quasi-polynomial of a family of parametric polytopes. As applications one can compute integrals and maximum values of such quasi-polynomials, as…
The goal of this paper is to introduce the notion of polyconvolution for Fourier-cosine, Laplace integral operators, and its applications. The structure of this polyconvolution operator and associated integral transforms are investigated in…
We establish a correspondence between one-parameter deformations of an affine Gorenstein toric pair $(X_P, \partial X_P)$, defined by a polytope $P$, and mutations of a Laurent polynomial $f$ with Newton polytope $\newt(f) = P$. For a…
We give a simple proof of the fact that there exist measures on the real line of discrete support, whose Fourier Transform is also a measure of discrete support, yet this Fourier pair cannot be constructed by repeatedly applying the Poisson…
We explain the orthogonal planes split (OPS) of quaternions based on the arbitrary choice of one or two linearly independent pure unit quaternions $f,g$. Next we systematically generalize the quaternionic Fourier transform (QFT) applied to…