Related papers: Bounds on numerical boundary slopes for Montesinos…

This paper considers the difference of stop-loss payoffs where the underlying is a difference of two random variables. The goal is to study whether the comonotonic and countermonotonic modifications of those two random variables can be used…

We describe a set of $\Delta -1$ slopes that are universal for 1-bend planar drawings of planar graphs of maximum degree $\Delta \geq 4$; this establishes a new upper bound of $\Delta-1$ on the 1-bend planar slope number. By universal we…

Here, we give upper and lower bounds on the count of positive integers $n\le x$ dividing the $n$th term of a nondegenerate linearly recurrent sequence with simple roots.

We prove upper bounds on the face numbers of simplicial complexes in terms on their girths, in analogy with the Moore bound from graph theory. Our definition of girth generalizes the usual definition for graphs.

We study the number of degree $n$ number fields with discriminant bounded by $X$. In this article, we improve an upper bound due to Schmidt on the number of such fields that was previously the best known upper bound for $6 \leq n \leq 94$.

We give an upper bound that relates the minimum weight of a nonzero componentwise product of codewords from some given number of linear codes, with the dimensions of these codes. Its shape is a direct generalization of the classical…

We prove tight upper bounds for the number of vertices of a simple polygon that is the union or the intersection of two simple polygons with given numbers of convex and concave vertices. The similar question on graphs of the lower (or…

We provide linear lower bounds for the signature of positive braids in terms of the three genus of their braid closure. This yields linear bounds for the topological slice genus of knots that arise as closures of positive braids.

Finding upper and lower bounds to integrals with respect to copulas is a quite prominent problem in applied probability. In their 2014 paper, Hofer and Iaco showed how particular two dimensional copulas are related to optimal solutions of…

This article follows and completes [arXiv:2511.14222], where we study the problem of bounded deviations for homeomorphisms of closed surfaces of genus $\ge 2$. This second part deals with bounded deviations relative to geodesic minimal…

We establish upper bounds for the size of two-distance sets in Euclidean space and spherical two-distance sets. The main recipe for obtaining upper bounds is the spectral method. We construct Seidel matrices to encode the distance relations…

For a torus knot K, we bound the crosscap number c(K) in terms of the genus g(K) and crossing number n(K): c(K) \leq [(g(K)+9)/6] and c(K) \leq [(n(K) + 16)/12]. The (6n-2,3) torus knots show that these bounds are sharp.

We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.

We show the existence of infinitely many prime knots each of which having in their complements meridional essential surfaces with two boundary components and arbitrarily high genus.

We study M\"obius transformations (also known as linear fractional transformations) of quadratic numbers. We construct explicit upper and lower bounds on the period of the continued fraction expansion of a transformed number as a function…

We fix a counting function of multiplicities of algebraic points in a projective hypersurface over a number field, and take the sum over all algebraic points of bounded height and fixed degree. An upper bound for the sum with respect to…

We introduce two numerical invariants, the waist and the trunk of knots. The waist of a closed incompressible surface in the complement of a knot is defined as the minimal intersection number of all compressing disks for the surface in the…

We give a new asymptotic upper bound on the size of a code in the Grassmannian space. The bound is better than the upper bounds known previously in the entire range of distances except very large values.

In [3] L.Zapponi studied the arithmetic of plane bipartite trees with prime number of edges. He obtained a lower bound on the degree of tree's definition field. Here we obtain a similar lower bound in the following case. There exists a…

By relating the number of images of a function with finite domain to a certain parameter, we obtain both an upper and lower bound for the image set. Even though the arguments are elementary, the bounds are, in some sense, best possible. The…