Related papers: On an upper bound for central binomial coefficient…
An upper bound for the Castelnuovo-Mumford regularity of the associated graded module of an one-dimension module is given in term of its Hilbert coeffcients. It is also investigated when the bound is attained.
Lower bounds for some explicit decision problems over the complex numbers are given.
Ratios of integrals can be bounded in terms of ratios of integrands under certain monotonicity conditions. This result, related with L'H\^{o}pital's monotone rule, can be used to obtain sharp bounds for cumulative distribution functions. We…
Let $m,r\in\mathbb{Z}$ and $\omega\in\mathbb{R}$ satisfy $0\leqslant r\leqslant m$ and $\omega\geqslant1$. Our main result is a generalized continued fraction for an expression involving the partial binomial sum $s_m(r) =…
We obtain strong upper bounds for the Betti numbers of compact complex-hyperbolic manifolds. We use the unitary holonomy to improve the results given by the most direct application of the techniques of [DS17]. We also provide effective…
In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…
In this article, we give upper bounds for cyclotomic numbers of order e over a finite field with q elements, where e is a divisor of q-1. In particular, we show that under certain assumptions, cyclotomic numbers are at most…
New upper bounds on the pointwise behaviour of Christoffel function on convex domains in ${\mathbb{R}}^d$ are obtained. These estimates are established by explicitly constructing the corresponding "needle"-like algebraic polynomials having…
An effective upper bound is established for the least non-trivial integer solution to the system of cubic forms \[ \begin{cases} F = c_{1}x_1^3 + c_{2}x_2^3 + \cdots + c_{n}x_n^3 = 0, \\ G = d_{1}x_1^3 + d_{2}x_2^3 + \cdots + d_{n}x_n^3 =…
We establish rigorous upper and lower bounds for the speed of pulled fronts with a cutoff. We show that the Brunet-Derrida formula corresponds to the leading order expansion in the cut-off parameter of both the upper and lower bounds. For…
One method to determine whether or not a system of partial differential equations is consistent is to attempt to construct a solution using merely the "algebraic data" associated to the system. In technical terms, this translates to the…
We obtain new lower and upper bounds for probabilities of unions of events.These bounds are sharp. They are stronger than earlier ones. General bounds maybe applied in arbitrary measurable spaces.We have improved the method that has been…
In the paper we give an upper bound for the Waldschmidt constants of the wide class of ideals. This generalizes the result obtained by Dumnicki, Harbourne, Szemberg and Tutaj-Gasinska, Adv. Math. 2014. Our bound is given by a root of a…
We present a $q$-analog of the super Catalan number $(2m)!(2n)!/2m!n!(m+n)!$, which also generalizes the $q$-Catalan numbers $c_n(\lambda)$, due to F\"urlinger and Hofbauer, for $\lambda=0$ and $\lambda=1$. We give a combinatorial…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
An apriori bound for the condition number associated to each of the following problems is given: general linear equation solving, minimum squares, non-symmetric eigenvalue problems, solving univariate polynomials, solving systems of…
The multivariate integer Chebyshev problem is to find polynomials with integer coefficients that minimize the supremum norm over a compact set in $\C^d.$ We study this problem on general sets, but devote special attention to product sets…
We investigate approximation to a given real number by algebraic numbers and algebraic integers of prescribed degree. We deal with both best and uniform approximation, and highlight the similarities and differences compared with the…
In this article, we obtain upper bounds on the number of irreducible factors of some classes of polynomials having integer coefficients, which in particular yield some of the well known irreducibility criteria. For devising our results, we…
For any elements b,c of a number field K, let G(b,c) denote the backwards orbit of b under the map f_c: C-->C given by f_c(x)=x^2+c. We prove an upper bound on the number of elements of G(b,c) whose degree over K is at most some constant B.…