Related papers: A Degree Six Inequality on Convex Quadrilaterals
We prove an inequality that extends to arbitrary measures the hyperplane inequality for volume of unconditional convex bodies originally observed by Bourgain.
We discuss the attainability of sharp constants for the Maz'ya--Sobolev inequalities in wedges, "perturbed" wedges and bounded domains.
In this paper we achieve some new Hadamard type inequalities using elementary well known inequalities for functions whose first derivatives absolute values are s-geometrically and geometrically convex. And also we get some applications for…
We investigate prime character degree graphs of solvable groups that have six vertices. There are one hundred twelve non-isomorphic connected graphs with six vertices, of which all except nine are classified in this paper. We also…
In this article we proved an interesting property of the class of continuous convex functions. This leads to the form of pre-Hermite-Hadamard inequality which in turn admits a generalization of the famous Hermite-Hadamard inequality. Some…
Let $\mathcal{Q}_1$ and $\mathcal{Q}_2$ be two arbitrary quadrics with no common hyperplane in ${\mathbb{P}}^n(\mathbb{F}_q)$. We give the best upper bound for the number of points in the intersection of these two quadrics. Our result…
In this article we prove several new uniform upper bounds on the number of points of bounded height on varieties over $\mathbb{F}_q[t]$. For projective curves, we prove the analogue of Walsh' result with polynomial dependence on $q$ and the…
Given an SO(3)-bundle with connection, the associated two-sphere bundle carries a natural closed 2-form. Asking that this be symplectic gives a curvature inequality first considered by Reznikov. We study this inequality in the case when the…
We prove a number of basic vanishing results for modified diagonal classes. We also obtain some sharp results for modified diagonals of curves and abelian varieties, and we prove a conjecture of O'Grady about modified diagonals on double…
In this paper, we prove that every graph with average degree at least $s+t+2$ has a vertex partition into two parts, such that one part has average degree at least $s$, and the other part has average degree at least $t$. This solves a…
We prove the McKay conjecture on characters of odd degree. A major step in the proof is the verification of the inductive McKay condition for groups of Lie type and primes $\ell$ such that a Sylow $\ell$-subgroup or its maximal normal…
We construct an equivalence between the derived category of sheaves on an elliptic threefold without a section and a derived category of twisted sheaves (modules over an Azumaya algebra) on any small resolution of its relative Jacobian.
Gr\"unbaum's inequality gives sharp bounds between the volume of a convex body and its part cut off by a hyperplane through the centroid of the body. We provide a generalization of this inequality for hyperplanes that do not necessarily…
In 2017 M. Bessenyei and Z. P\'ales introduced a definition of a triangle function which generates a concept of a generalized triangle inequality in semimetric spaces. Inspired by this concept we discuss already known inequalities in metric…
In this paper, we obtain some new integral inequalities like Hermite-Hadamard type for third derivatives absolute value are log-convex. We give some applications to quadrature formula for midpoint error estimate.
In this paper we established new integral inequalities which are more general results for coordinated convex functions on the coordinates by using some classical inequalities.
In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
At the heart of convex geometry lies the observation that the volume of convex bodies behaves as a polynomial. Many geometric inequalities may be expressed in terms of the coefficients of this polynomial, called mixed volumes. Among the…
We study a combinatorial notion where given a set of lattice points one takes the set of all sums of subsets of a fixed size, and we ask if the given set comes from a convex lattice polytope whether the resulting set also comes from a…