English
Related papers

Related papers: Explicit Formula for Counting Lattice Points of Po…

200 papers

Given a lattice polytope $P$ (with underlying lattice $\lo$), the universal counting function $\uu_P(\lo')=|P\cap \lo'|$ is defined on all lattices $\lo'$ containing $\lo$. Motivated by questions concerning lattice polytopes and the Ehrhart…

Combinatorics · Mathematics 2007-05-23 Imre Bárány , Jean-Michel Kantor

In this paper we find the solutions of the functional equation $$f(xy) = g(x)h(y) + \sum_{j=1}^n g_j(x)h_j(y), \;x,y \in M,$$ where $M$ is a monoid, $n\geq 2$, and $g_j$ (for $j=1,...,n$) are linear combinations of at least $2$ distinct…

Classical Analysis and ODEs · Mathematics 2019-07-24 Belfakih Keltouma , Elqorachi Elhoucien

Consider an irreducible finite Coxeter system. We show that for any nonnegative integer n the sum of the nth powers of the Coxeter exponents can be written uniformly as a polynomial in four parameters: h (the Coxeter number), r (the rank),…

Combinatorics · Mathematics 2012-08-13 John M. Burns , Ruedi Suter

We present the geometry lying behind counting twin prime polynomials in $\mathbb{F}_q[T]$ in general. We compute cohomology and explicitly count points by means of a twisted Lefschetz trace formula applied to these parametrizing varieties…

Number Theory · Mathematics 2019-11-13 Lior Bary-Soroker , Jakob Stix

We give a precise estimate for the number of lattice points in certain bounded subsets of $\mathbb{R}^{n}$ that involve `hyperbolic spikes' and occur naturally in multiplicative Diophantine approximation. We use Wilkie's o-minimal structure…

Number Theory · Mathematics 2019-05-10 Reynold Fregoli

We describe an algorithm to count the number of rational points of an hyperelliptic curve defined over a finite field of odd characteristic which is based upon the computation of the action of the Frobenius morphism on a basis of the…

Algebraic Geometry · Mathematics 2008-06-02 Gweltaz Chatel , David Lubicz

This paper proposes a novel and simple algorithm of facet enumeration for convex polytopes. The complexity of the algorithm is discussed. The algorithm is implemented in Matlab. Some simple polytopes with known H-representations and…

Optimization and Control · Mathematics 2025-01-23 Yaguang Yang

Every symmetric polynomial $h(x)$ with center of symmetry $n/2$ can be expressed as a linear combination in the basis $x^i(1+x)^{n-2i}$. The $\gamma$-polynomial of $h(x)$, which we denote $\gamma_h(x)$, records the coefficients of this…

Combinatorics · Mathematics 2025-06-17 Luis Ferroni , Greta Panova , Lorenzo Venturello

In this note we prove that for all $a \in \mathbb{N}$, $x \in \mathbb{R}_+ \cup \{0\}$, and $s \in \mathbb{C}$ with $\Re(s) > a + 2$, the (alternating) weighted series of the Hurwitz zeta function, $$ \sum_{k \geq 1} (\pm 1)^k (k +…

Number Theory · Mathematics 2023-02-06 Matthew Fox , Chaitanya Karamchedu

Given an integer $q$ and a polynomial $f\in \mathbb Z_{q}[X]$ of degree $d$ with coefficients in the residue ring $\mathbb Z_q=\mathbb Z/q\mathbb Z,$ we obtain new results concerning the number of solutions to congruences of the form…

Number Theory · Mathematics 2018-03-29 Bryce Kerr , Ali Mohammadi

We consider the radial and Heisenberg-homogeneous norms on the Heisenberg groups given by $N_{\alpha,A}((z,t)) = \left(|z|^\alpha + A |t|^{\alpha/2}\right)^{1/\alpha}$, for $\alpha \ge 2$ and $A>0$. This natural family includes the…

Number Theory · Mathematics 2014-04-25 Rahul Garg , Amos Nevo , Krystal Taylor

We study rational points on the elliptic surface given by the equation: $$y^2 = x^3 + AxQ(u,v)^2 + BQ(u,v)^3,$$ where $A,B\in \mathbb{Z}$ satisfy that $4A^3-27B^2\neq 0$ and $Q(u,v)$ is a positive-definite quadratic form. We prove…

Number Theory · Mathematics 2026-04-22 Katharine Woo

The illumination conjecture is a classical open problem in convex and discrete geometry, asserting that every compact convex body~$K$ in $\mathbb R^n$ can be illuminated by a set of no more than $2^n$ points. If $K$ has smooth boundary, it…

Metric Geometry · Mathematics 2025-03-31 Lenny Fukshansky

We consider polyhedral approximations of strictly convex compacta in finite dimensional Euclidean spaces (such compacta are also uniformly convex). We obtain the best possible estimates for errors of considered approximations in the…

Functional Analysis · Mathematics 2010-10-13 Maxim V. Balashov , Dušan Repovš

The class of convex sets that admit approximations as Minkowski sum of a compact convex set and a closed convex cone in the Hausdorff distance is introduced. These sets are called approximately Motzkin-decomposable and generalize the notion…

Optimization and Control · Mathematics 2024-01-25 Daniel Dörfler , Andreas Löhne

In order to express a polyhedron as the (Minkowski) sum of a polytope and a polyhedral cone, Motzkin (1936) made a transition from the polyhedron to a polyhedral cone. Based on his excellent idea, we represent a set by a characteristic…

Optimization and Control · Mathematics 2015-04-01 Mahmood Mehdiloozad , Kaoru Tone , Rahim Askarpour , Mohammad Bagher Ahmadi

Let $a, b,c $ and $k$ be positive integers such that $1\leq a\leq b,a<c<2(a+b), c\ne b$ and $(a,b,c)=1$. Define the arithmetic function $f_k(a,b;c;n)$ by $$ \sum_{n=1}^{\infty}\frac{f_k(a,b;c;n)}{n^s}=\frac{\zeta (as)\zeta…

Number Theory · Mathematics 2013-01-22 Xiaodong Cao , Wenguang Zhai

This paper gives an explicit formula for the Ehrhart quasi-polynomial of certain 2-dimensional polyhedra in terms of invariants of surface quotient singularities. Also, a formula for the dimension of the space of quasi-homogeneous…

Algebraic Geometry · Mathematics 2016-09-07 J. I. Cogolludo-Agustin , J. Martin-Morales , J. Ortigas-Galindo

We show that a recent identity of Beck-Gessel-Lee-Savage on the generating function of symmetrically contrained compositions of integers generalizes naturally to a family of convex polyhedral cones that are invariant under the action of a…

Combinatorics · Mathematics 2013-10-07 Matthias Beck , Thomas Bliem , Benjamin Braun , Carla Savage

For a prime $p$ and an absolutely irreducible modulo $p$ polynomial $f(U,V) \in \Z[U,V]$ we obtain an asymptotic formulas for the number of solutions to the congruence $f(x,y) \equiv a \pmod p$ in positive integers $x \le X$, $y \le Y$,…

Number Theory · Mathematics 2007-05-23 I. E. Shparlinski , J. F. Voloch