Related papers: Bounds on numerical boundary slopes for Montesinos…
In this paper, we obtain the upper and lower bounds for two inequalities related to the range statistics. The first one is concerning the one-variable case and the second one is about the bivariate case.
Let $N_n(X)$ denote the number of degree $n$ number fields with discriminant bounded by $X$. In this note, we improve the best known upper bounds on $N_n(X)$, finding that $N_n(X) = O(X^{ c (\log n)^2})$ for an explicit constant $c$.
Upper bounds on the maximum number of codewords in a binary code of a given length and minimum Hamming distance are considered. New bounds are derived by a combination of linear programming and counting arguments. Some of these bounds…
This paper is devoted to the study of lower and upper bounds for the number of vertices of the polytope of $n\times n\times n$ stochastic tensors (i.e., triply stochastic arrays of dimension $n$). By using known results on polytopes (i.e.,…
We prove, under suitable conditions, a lower bound on the number of pinned distances determined by small subsets of two-dimensional vector spaces over fields. For finite subsets of the Euclidean plane we prove an upper bound for their…
We improve upon the upper bounds for the cardinality of the value set of a multivariable polynomial map over a finite field using the polytope of the polynomial. This generalizes earlier bounds only dependent on the degree of a polynomial.
We present deterministic techniques for computing upper and lower bounds on marginal probabilities in sigmoid and noisy-OR networks. These techniques become useful when the size of the network (or clique size) precludes exact computations.…
We show a lower estimate of the Milnor number of an isolated hypersurface singularity, via its Newton number. We also obtain analogous estimate of the Milnor number of an isolated singularity of a similar complete intersection variety.
An error analysis for some Newton-Cotes quadrature formulae is presented. Peano-like error bounds are obtained. They are generally, but not always, better than the usual Peano bounds.
In this paper we derive an estimate on the number of local maxima of the free boundary of some variational inequalities with pointwise gradient constraints. This also gives an estimate on the number of connected components of the free…
For a prime knot $K$, we give sufficient conditions for the existence of a component $\mathcal{C}$ of the irreducible ${\rm SL}(2,\mathbb{C})$-character variety of $K$ with $\dim\mathcal{C}>1$, and give a lower bound for $\dim\mathcal{C}$.…
A precise tie between a univariate spline's knots and its zeros abundance and dissemination is formulated. As an application, a conjecture formulated by De Concini and Procesi is shown to be true in the special univariate, unimodular case.…
We calculate the alternating number of torus knots with braid index 4 and less. For the lower bound, we use the upsilon-invariant recently introduced by Ozsv\'ath, Stipsicz, and Szab\'o. For the upper bound, we use a known bound for braid…
We construct small models of number fields and deduce a better bound for the number of number fields of given degree and bounded discriminant.
We improve the previuosly known bound for some vertex Folkman numbers.
The A-polynomial of a manifold whose boundary consists of a single torus is generalised to an eigenvalue variety of a manifold whose boundary consists of a finite number of tori, and the set of strongly detected boundary curves is…
We present some upper bounds on the size of non-linear codes and their restriction to systematic codes and linear codes. These bounds are independent of other known theoretical bounds, e.g. the Griesmer bound, the Johnson bound or the…
Upper bounds on the topological Betti numbers of Vietoris-Rips complexes are established, and examples of such complexes with high Betti numbers are given.
It is known that any surface knot can be transformed to an unknotted surface knot or a surface knot which has a diagram with no triple points by a finite number of 1-handle additions. The minimum number of such 1-handles is called the…
We prove a lower bound on the canonical height associated to polynomials over number fields evaluated at points with infinite forward orbit. The lower bound depends only on the degree of the polynomial, the degree of the number field, and…