Related papers: A Bennequin-type inequality and combinatorial boun…
In this paper we establish Parseval type identities and surprising new inequalities for Hilbert-Schmidt frames. Our results generalize and improve the remarkable results which have been obtained by Balan et al. and G{\u{a}}vru{\c{t}}a.
We present Chen-Ricci inequality and improved Chen-Ricci inequality for curvature like tensors. Applying our improved Chen-Ricci inequality we study Lagrangian and Kaehlerian slant submanifolds of complex space forms and C-totally real…
In this work, a generalization of Chebyshev functional is presented. New inequalities of Gruss type via Pompeiu's mean value theorem are established. Improvements of some old inequalities are proved. A generalization of pre-Gruss inequality…
We construct invariants of birational maps with values in the Kontsevich--Tschinkel group and in the truncated Grothendieck groups of varieties. These invariants are morphisms of groupoids and are well-suited to investigating the structure…
We develop a class of exponential bounds for the probability that a martingale sequence crosses a time-dependent linear threshold. Our key insight is that it is both natural and fruitful to formulate exponential concentration inequalities…
We prove a multiplier version of the Bernstein inequality on the complex sphere. Included in this is a new result relating a bivariate sum involving Jacobi polynomials and Gegenbauer polynomials, which relates the sum of reproducing kernels…
We study the Hardy identities and inequalities on Cartan-Hadamard manifolds using the notion of a Bessel pair. These Hardy identities offer significantly more information on the existence/nonexistence of the extremal functions of the Hardy…
We define combinatorial counterparts to the geometric string vertices of Sen-Zwiebach and Costello-Zwiebach, which are certain closed subsets of the moduli spaces of curves. Our combinatorial vertices contain the same information as the…
We propose new bounds on the domination number and on the independence number of a graph and show that our bounds compare favorably to recent ones. Our bounds are obtained by using the Bhatia-Davis inequality linking the variance, the…
In this article, we improve the classical Bukhgeim-Klibanov method presented in [1],which can be used to prove the conditional stability of inverse source problem for a hyperbolic equation from the measurement on the subboundary. A major…
It is known that the Lawrence-Krammer representation of the Artin group of type $A_{n-1}$ based on the two parameters $t$ and $q$ that was used by Krammer and independently by Bigelow to show the linearity of the braid group on $n$ strands…
The classical Brun--Titchmarsh theorem gives an upper bound, which is of correct order of magnitude in the full range, for the number of primes $p\leqslant x$ satisfying $p\equiv a\bmod q$. We strengthen this inequality for different ranges…
In this paper, we establish several new convex dominated functions and then we obtain new Hadamard type inequalities.
In this paper, we establish (presumably new type) integral inequalities for convex functions via the Hermite--Hadamard's inequalities. As applications, we apply these new inequalities to construct inequalities involving special means of…
We give a survey of recent results, due mainly to the authors, concerning Bernstein-Markov type inequalities and connections with potential theory.
In this paper, we continue to study some applications with respect to a Reilly type integral formula associated with the $\phi$-Laplacian. Some inequalities of Brascamp-Lieb type and Colesanti type are provided.
To a region $C$ of the plane satisfying a suitable convexity condition we associate a knot concordance invariant $\Upsilon^C$. For appropriate choices of the domain this construction gives back some known knot Floer concordance invariants…
We give a B\'ezout type inequality for mixed volumes, which holds true for any convex bodies. The key ingredient is the reverse Khovanskii-Teissier inequality for convex bodies, which was obtained in our previous work and inspired by its…
A Gauss diagram is a simple, combinatorial way to present a link. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting subdiagrams of certain combinatorial types. In this paper we…
In this paper, we introduce and generalize some combinatorial invariants of graphs such as matching number and induced matching number to hypergraphs. Then we compare them together and present some upper bounds for the regularity of…