Related papers: Ehrhart-Macdonald reciprocity extended

We prove a compact embedding theorem in a class of spaces of piecewise H1 functions subordinated to a class of shape regular, but not necessarily quasi-uniform triangulations of a polygonal domain. This result generalizes the…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…

Alcoved polytopes are convex polytopes, which are the closure of a union of alcoves in an affine Coxeter arrangement. They are rational polytopes and, therefore, have Ehrhart quasipolynomials. Here we describe a method for computing the…

We prove two homotopy decomposition theorems for the loops on co-H-spaces, including a generalization of the Hilton-Milnor Theorem. These are applied to problems arising in algebra, representation theory, toric topology, and the study of…

The Macdonald symmetric functions are used to define measures on the set of all partitions of all integers. Probabilistic algorithms are given for growing partitions according to these measures. The case of Hall-Littlewood polynomials is…

The n'th Birkhoff polytope is the set of all doubly stochastic n-by-n matrices, that is, those matrices with nonnegative real coefficients in which every row and column sums to one. A wide open problem concerns the volumes of these…

This paper proves a reciprocity formula for modular inverses for non-zero integers and demonstrates some applications of the reciprocity formula in calculating or verifying some modular inverses of specific forms, including the modular…

Given an elliptic curve $E$ and a point $P$ in $E(\mathbb{R})$, we investigate the distribution of the points $nP$ as $n$ varies over the integers, giving bounds on the $x$ and $y$ coordinates of $nP$ and determining the natural density of…

In the first article of this series we have presented the history of auxiliary primes from Legendre's proof of the quadratic reciprocity law up to Artin's reciprocity law. We have also seen that the proof of Artin's reciprocity law consists…

We prove an estimate for the number of lattice points lying in certain non-convex Euclidean domains of interest in Diophantine approximation. As an application, we generalise a result of Kruse (1964) concerning the almost sure order of…

A projective rectangle is like a projective plane that has different lengths in two directions. We develop the basic theory of projective rectangles including incidence properties, projective subplanes, configuration counts, a partial…

In arXiv:1709.07504 Ardila and Aguiar give a Hopf monoid structure on hypergraphs as well as a general construction of polynomial invariants on Hopf monoids. Using these results, we define in this paper a new polynomial invariant on…

In this note we first give a new bound on $e_{HK}(\sim)$ the Hilbert-Kunz multiplicity of invariant rings, by the help of the Noether's bound. Then, we simplify, extend and present applications of the reciprocity formulae due to L. Smith.…

We study the equivariant Ehrhart theory of families of polytopes that are invariant under a non-trivial action of the group with order two. We study families of polytopes whose equivariant $H^*$-polynomial both succeed and fail to be…

The paper contained a preliminary version of a general theory of reciprocity laws on vector spaces.

We study arithmetic distribution relations and the inverse function theorem in algebraic and arithmetic geometry, with an emphasis on versions that can be applied uniformly across families of varieties and maps. In particular, we prove two…

Much has been written on reciprocity laws in number theory and their connections with group representations. In this paper we explore more on these connections. We prove a "reciprocity Law" for certain specific representations of semidirect…

In this paper, we address the problem of counting integer points in a rational polytope described by $P(y) = \{ x \in \mathbb{R}^m \colon Ax = y, x \geq 0\}$, where $A$ is an $n \times m$ integer matrix and $y$ is an $n$-dimensional integer…

A local lattice point counting formula, and more generally a local Euler-Maclaurin formula follow by comparing two natural families of meromorphic functions on the dual of a rational vector space $V$, namely the family of exponential sums…

Given positive coprime integers $a$ and $b$ and a natural number $h$, we obtain reciprocity relations which can be used to quickly evaluate summations like $\sum_{i=1}^{h} \{\frac{ib}{a}\}^2$ and $\sum_{i=1}^{h} \lfloor \frac{ib}{a}…