Related papers: Macdonald's solid-angle sum for real dilations of …
Consider the Riemann sum of a smooth compactly supported function h(x) on a polyhedron in R^d, sampled at the points of the lattice Z^d/t. We give an asymptotic expansion when t goes to infinity, writing each coefficient of this expansion…
The twisted $T$-adic exponential sum associated to a polynomial in one variable is studied. An explicit arithmetic polygon in terms of the highest two exponents of the polynomial is proved to be a lower bound of the Newton polygon of the…
Let P(x) be a one-variable Laurent polynomial of degree (d_1,d_2) over a finite field of characteristic p. For any fixed positive integer s not divisible by p, we prove that the (normalized) p-adic Newton polygon of the L-functions of…
We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…
For any lattice polytope $P$, we consider an associated polynomial $\bar{\delta}_{P}(t)$ and describe its decomposition into a sum of two polynomials satisfying certain symmetry conditions. As a consequence, we improve upon known…
Given a multivariate real (or complex) polynomial $p$ and a domain $\cal D$, we would like to decide whether an algorithm exists to evaluate $p(x)$ accurately for all $x \in {\cal D}$ using rounded real (or complex) arithmetic. Here…
We give the explicit analytic development of any Jack or Macdonald polynomial in terms of elementary (resp. modified complete) symmetric functions. These two developments are obtained by inverting the Pieri formula.
We give an elementary geometric re-proof of a formula discovered by Michel Brion as well as two variants thereof. A subset of R^n gives rise to a formal Laurent series with monomials corresponding to lattice points in the set. Under…
We use an interpolative technique from \cite{abps} to introduce the notion of multiple $N$-separately summing operators. Our approach extends and unifies some recent results; for instance we recover the best known estimates of the…
The paper investigates the problem of performing correlation analysis when the number of observations is very large. In such a case, it is often necessary to combine the random observations to achieve dimensionality reduction of the…
In this paper we construct a discrete linear operator $K$ which transforms $A_2$ Macdonald polynomials into the product of two basic $3\phi_2$ hypergeometric series with known arguments. The action of the operator $K$ on power sums in two…
The Euler--Maclaurin (EM) summation formula is used in many theoretical studies and numerical calculations. It approximates the sum $\sum_{k=0}^{n-1} f(k)$ of values of a function $f$ by a linear combination of a corresponding integral of…
We present two new methods for multivariate exponential analysis. In [7], we developed a new algorithm for reconstruction of univariate exponential sums by exploiting the rational structure of their Fourier coefficients and reconstructing…
We prove an Euler-Maclaurin formula for double polygonal sums and, as a corollary, we obtain approximate quadrature formulas for integrals of smooth functions over polygons with integer vertices. Our Euler-Maclaurin formula is in the spirit…
Let $S = \{ {A_1},{A_2}, \cdots ,{A_n}\} $ be a finite point set in m-dimensional Euclidean space ${E^m}$, and$\left\| {{A_i}{A_j}} \right\|$ be the distance between $A_i$ and $A_j$. Define $\sigma (S) = \sum\limits_{1 \le i < j \le n}…
An asymptotic expansion formula of Riemann sums over lattice polytopes is given. The formula is an asymptotic form of the local Euler-Maclaurin formula due to Berline-Vergne. The proof given here for Delzant lattice polytopes is independent…
Major Percy A. MacMahon's first paper on plane partitions included a conjectured generating function for symmetric plane partitions. This conjecture was proven almost simultaneously by George Andrews and Ian Macdonald, Andrews using the…
Macdonald polynomials are orthogonal polynomials associated to root systems, and in the type A case, the symmetric kind is a common generalization of Schur functions, Macdonald spherical functions, and Jack polynomials. We use the…
In this paper, we consider universal sums of generalized polygonal numbers. Fixing $m\in\mathbb{N}_{\geq 3}$, we show two finiteness theorems for universal sums of generalized polygonal numbers whose inputs have a restricted number $L$ of…
We obtain a first non-trivial estimate for the sum of dilates problem in the case of groups of prime order, by showing that if $t$ is an integer different from $0, 1$ or -1 and if $\A \subset \Zp$ is not too large (with respect to $p$),…