Related papers: The Frobenius problem, rational polytopes, and Fou…

Gathering different results from singularity theory, geometry and combinatorics, we show that the spectrum at infinity of a tame Laurent polynomial counts lattice points in polytopes and we deduce an effective algorithm in order to compute…

We prove that a rational pseudointegral triangle with exactly one lattice point in its interior has at most $9$ lattice points on its boundary, where a polygon $P$ is called pseudointegral if the Ehrhart function of $P$ is a polynomial. We…

Let $Z$ be a quadratic hypersurface of $\mathbb{P}^n(\mathbb{R})$ defined over $\mathbb{Q}$ containing points whose coordinates are linearly independent over $\mathbb{Q}$. We show that, among these points, the largest exponent of uniform…

We show that the higher Pythagoras numbers for the polynomial ring are infinite $p_{2s}(K[x_1,x_2,\dots,x_n])=\infty$ provided that $K$ is a formally real field, $n\geq2$ and $s\geq 1$. This almost fully solves an old question \cite[Problem…

We evaluate the mean square limit of exponential sums related with a rational ellipsoid, extending a work of Marklof. Moreover, as a result of it, we study the asymptotic values of the normalized deviations of the number of lattice points…

Let $D=(V,A)$ be a digraph whose underlying undirected graph is $2$-edge-connected, and let $P$ be the polytope whose vertices are the incidence vectors of arc sets whose reversal makes $D$ strongly connected. We study the lattice theoretic…

A long-standing open conjecture in combinatorics asserts that a Gorenstein lattice polytope with the integer decomposition property (IDP) has a unimodal (Ehrhart) $h^\ast$-polynomial. This conjecture can be viewed as a strengthening of a…

We discuss generalizations of some results on lattice polygons to certain piecewise linear loops which may have a self-intersection but have vertices in the lattice $\mathbb{Z}^2$. We first prove a formula on the rotation number of a…

Let $\mathbb{F}_q$ denote the finite field of odd characteristic $p$ with $q$ elements ($q=p^{n},n\in \mathbb{N} $) and $\mathbb{F}_q^*$ represent the nonzero elements of $\mathbb{F}_{q}$. In this paper, by using the Smith normal form we…

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…

Given coprime positive integers $a_1 < ...< a_d$, the Frobenius number $F$ is the largest integer which is not representable as a non-negative integer combination of the $a_i$. Let $g$ denote the number of all non-representable positive…

We express the number of lattice points inside certain simplices via Dedekind-Rademacher sums. As an application, we prove a conjecture of Kronheimer and Mrowka in the special case of Brieskorn spheres (with at most 4 singular fibers). This…

In this article, we establish an analogue of the dimension growth conjecture, which is regarding the density of rational points on projective varieties, for compact submanifolds of $\mathbb{R}^n$ with non-vanishing curvature. We also…

The Frobenius number g(a) of an integer vector a with positive coprime coefficients is defined as the largest integer that does not have a representation as a non-negative integer linear combination of the coefficients of a. According to a…

For a non-negative integer $p$, one of the generalized Frobenius numbers, that is called the $p$-Frobenius number, is the largest integer that is represented at most in $p$ ways as a linear combination with nonnegative integer coefficients…

Let f(n)=1 if n=1, 2^(2^(n-2)) if n \in {2,3,4,5}, (2+2^(2^(n-4)))^(2^(n-4)) if n \in {6,7,8,...}. We conjecture that if a system T \subseteq {x_i+1=x_k, x_i \cdot x_j=x_k: i,j,k \in {1,...,n}} has only finitely many solutions in positive…

We study the problem of placing effective upper bounds for the number of zeros of solutions of Fuchsian systems on the Riemann sphere. The principal result is an explicit (non-uniform) upper bound, polynomially growing on the frontier of…

Let $P$ be a convex $d$-polytope and $0 \leq k \leq d-1$. In 2023, this author proved the following inequalities, resolving a question of B\'ar\'any: \[ \frac{f_k(P)}{f_0(P)} \geq \frac{1}{2}\biggl[{\lceil \frac{d}{2} \rceil \choose k} +…

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

Let $S=\{x^2+c_1, x^2+c_2,\dots, x^2+c_s\}$ be a set of quadratic polynomials with rational coefficients, and let $P$ be a rational basepoint. We classify the pairs $(S,P)$ for which $P$ has finite orbit for $S$, assuming that the maximum…