Related papers: New upper bound for a class of vertex Folkman numb…

In this paper we establish a new explicit upper and lower bound for the $n$-th prime number, which improve the currently best estimates given by Dusart in 2010. As the main tool we use some recently obtained explicit estimates for the prime…

We establish an upper bound on the tails of a random variable that arises as a solution of a stochastic difference equation. In the non--negative case our bound is similar to a lower bound obtained by Goldie and Gr\"ubel in 1996.

Certain new inequalities for the sums of factorials are presented.

We derive two upper bounds for the probability of deviation of a vector-valued Lipschitz function of a collection of random variables from its expected value. The resulting upper bounds can be tighter than bounds obtained by a direct…

We construct a non - improved exponential bounds for distribution of normed sums of i.,i.d. random variables with random numbers of summand.

We improve on Gonek-Montgomery's quantitative version of Kronecker's approximation theorem.

The vertices of the integer hull are the integral equivalent to the well-studied basic feasible solutions of linear programs. In this paper we give new bounds on the number of non-zero components -- their support -- of these vertices…

In this paper we give an improved upper bound, as compared to the one given in [3] for the number of extreme points of the convex set of all G-invariant probability measures on X*Y with given marginals of full support.

Much recent progress has been made concerning the probable existence of Odd Perfect Numbers, forming part of what has come to be known as Sylvester's Web Of Conditions. This paper proves some results concerning certain properties of the…

We prove a new converse theorem for Borcherds' multiplicative theta lift which improves the previously known results. To this end we develop a newform theory for vector valued modular forms for the Weil representation, which might be of…

We prove that the ratio of the Newman sum over numbers multiple of a fixed integer which is not multiple of 3 and the Newman sum over numbers multiple of a fixed integer divisible by 3 is o(1) when the upper limit of summing tends to…

We give results on the question of code optimality for linear codes over finite Frobenius rings for the homogeneous weight. This article improves on the existing Plotkin bound derived in an earlier paper, and suggests a version of a…

We develop a new analysis for the length of controlled bad sequences in well-quasi-orderings based on Higman's Lemma. This leads to tight multiply-recursive upper bounds that readily apply to several verification algorithms for…

We give some new relations for Newman digit sums respectively different modulos and put some problems. In particular, for the odd prime modulos we put an important conjecture.

We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.

In this work, we obtain some new lower bounds for the number $\mathcal N_B(x)$ of Nov\'ak numbers less than or equal to $x$. We also prove, conditionally on Generalized Riemann Hypothesis, the upper estimates for the number of primes…

Upper bounds are derived for codes in Stiefel and Grassmann manifolds with given minimal chordal distance. They stem from upper bounds for codes in products of unit spheres and projective spaces. The new bounds are asymptotically better…

In this short note we improve the best to date bound in Godbersen's conjecture, and show some implications for unbalanced difference bodies.

In this paper, building among others on earlier works by U. Krause and C. Zahlten (dealing with the case of cyclic groups), we obtain a new upper bound for the little cross number valid in the general case of arbitrary finite Abelian…

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…