Related papers: From spherical separation center set to the upper …

The main result of this article is a refinement of the well-known subgroup separability results of Hall and Scott for free and surface groups. We show that for any finitely generated subgroup, there is a finite dimensional representation of…

We derive a lower and an upper bound for the number of binary cyclotomic polynomials $\Phi_m$ with at most $m^{1/2+\epsilon}$ nonzero terms.

We apply the semidefinite programming approach developed in arxiv:math.MG/0608426 to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in…

Let $P\subset \mathbb R^n$ be a belt polytope, that is a polytope whose normal fan coincides with the fan of some hyperplane arrangement $\mathcal A$. Also, let $G:\mathbb R^n\to\mathbb R^d$ be a linear map of full rank whose kernel is in…

For any given natural number $k$, this paper gives upper bounds on the radius of a packing of a complete hyperbolic surface of finite area by $k$ equal-radius disks in terms of the surface's topology. We show that the bounds given here are…

In this paper, we give a comparison version of Pythagorean Theorem to judge the lower or upper bound of the curvature of Alexandrov spaces (including Riemannian manifolds).

Polytope numbers for a polytope are a sequence of nonnegative integers that are defined by the facial information of a polytope. Every polygon is triangulable and a higher dimensional analogue of this fact states that every polytope is…

The polynomials of degree $\frac{p-1}{2}$ of range sum $p$ was determined in {\tt arXiv:2311.06136 [math.NT]} for large enough primes. We extend this result by reducing the lower bound for the primes to $23$ by introducing a new and…

Let $p_{\textrm{dsd}} (n)$ be the number of partitions of $n$ into distinct squarefree divisors of $n$. In this note, we find a lower bound for $p_{\textrm{dsd}} (n)$, as well as a sequence of $n$ for which $p_{\textrm{dsd}} (n)$ is…

If F is a surface with boundary, then a finitely generated subgroup without peripheral elements of G = {\pi}_1(F) can be separated from finitely many other elements of G by a finite index subgroup of G corresponding to a finite cover F'…

In this paper we improve upon in terms of S the best known effective upper bounds for the solutions of S-unit equations and decomposable form equations.

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees…

Symmetric edge polytopes, also called adjacency polytopes, are lattice polytopes determined by simple undirected graphs. We introduce the integer array \(\mathrm{maxf}(n,m)\) giving the maximum number of facets of a symmetric edge polytope…

Let $G$ be a discrete group generated by reflections in hyperbolic or Euclidean space, and $H\subset G$ be a finite index subgroup generated by reflections. Suppose that the fundamental chamber of $G$ is a finite volume polytope with $k$…

A well-known conjecture asserts that there are infinitely many primes $p$ for which $p - 1$ is a perfect square. We obtain upper and lower bounds of matching order on the number of pairs of distinct primes $p,q \le x$ for which $(p - 1)(q -…

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…

We determine the extreme points and facets of the convex hull of all dual degree partitions of simple graphs on $n$ vertices.

An asymptotic formula for the number of partitions into p-cores is derived. As a byproduct some integer valued trigonometric sums are found

We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…