Related papers: Counting Salem numbers arising from arithmetic hyp…
We prove prime geodesic theorems counting primitive closed geodesics on a compact hyperbolic 3-manifold with length and holonomy in prescribed intervals, which are allowed to shrink. Our results imply effective equidistribution of holonomy…
In this paper, we revisit the problem of classifying real algebraic and semialgebraic sets by their topological types, focusing on establishing the effectiveness of bounds rather than deriving new quantitative estimates. Building on Hardt's…
An open problem in complexity theory is to find the minimal degree of a polynomial representing the $n$-bit OR function modulo composite $m$. This problem is related to understanding the power of circuits with $\text{MOD}_m$ gates where $m$…
We count algebraic points of bounded height and degree on the graphs of certain functions analytic on the unit disk, obtaining a bound which is polynomial in the degree and in the logarithm of the multiplicative height. We combine this work…
For hyperbolic surfaces with geodesic boundary, we study the orthosystole, i.e. the length of a shortest essential arc from the boundary to the boundary. We recover and extend work by Bavard completely characterizing the surfaces maximizing…
Cohen, Lewin and Zagier found four ladders that entail the polylogarithms ${\rm Li}_n(\alpha_1^{-k}):=\sum_{r>0}\alpha_1^{-k r}/r^n$ at order $n=16$, with indices $k\le360$, and $\alpha_1$ being the smallest known Salem number, i.e. the…
We consider the Bernstein--Sato polynomial of a locally quasi-homogeneous polynomial $f \in R = \mathbb{C}[x_{1}, x_{2}, x_{3}]$. We construct, in the analytic category, a complex of $\mathscr{D}_{X}[s]$-modules that can be used to compute…
In this paper, we obtain several new factorization results for certain classes of polynomials having integer coefficients. In doing so, we use the information about prime factorization of the value taken up by such polynomials and their…
We present two new problems on lower bounds for resolution Betti numbers of monomial ideals generated in a fixed degree. The first concerns any such ideal and bounds the total Betti numbers, while the second concerns ideals that are…
In this paper we study numerical semigroups of Sally type of multiplicity $e$ and embedding dimension $\nu \ge e-2$. We construct the minimal resolutions for these semigroup rings when they are symmetric and compute their Betti numbers. We…
We find upper and lower bounds on the number of rational points that are $\psi$-approximations of some $n$-dimensional $p$-adic integer. Lattice point counting techniques are used to find the upper bound result, and a Pigeon-hole principle…
We obtain general criteria for giving a lower bound on the degree of numbers of the form $\prod_{n=1}^\infty \left(1+\frac{b_n}{\alpha_n}\right)$ or of the form $\prod_{m=1}^\infty \left(1+ \sum_{n=1}^\infty…
We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius…
We develop a new method of constructing non-arithmetic lattices in the projective orthogonal group $\text{PO}(n,1)$ for every integer $n$ larger than one. The technique is to consider anti-holomorphic involutions on a complex arithmetic…
The work of Reid, Chinburg--Hamilton--Long--Reid, Prasad--Rapinchuk, and the author with Reid have demonstrated that geodesics or totally geodesic submanifolds can sometimes be used to determine the commensurability class of an arithmetic…
By definition, a rigid graph in $\mathbb{R}^d$ (or on a sphere) has a finite number of embeddings up to rigid motions for a given set of edge length constraints. These embeddings are related to the real solutions of an algebraic system.…
Motivated by applications of algebraic geometry, we introduce the Galois width, a quantity characterizing the complexity of solving algebraic equations in a restricted model of computation allowing only field arithmetic and adjoining…
In this paper, we generalize the well-known hyperbolic numbers to certain numeric structures scaled by the real numbers. Under our scaling of $\mathbb{R}$, the usual hyperbolic numbers are understood to be our 1-scaled hyperbolic numbers.…
We study sets of integers that can be defined by the vanishing of a generalised polynomial expression. We show that this includes sets of values of linear recurrent sequences of Salem type and some linear recurrent sequences of Pisot type.…
In this paper, we prove that with high probability, random Reed-Solomon codes approach the half-Singleton bound - the optimal rate versus error tradeoff for linear insdel codes - with linear-sized alphabets. More precisely, we prove that,…