Related papers: A matroid polytope approach to sharp affine isoper…
Rough sets are efficient for data pre-processing in data mining. As a generalization of the linear independence in vector spaces, matroids provide well-established platforms for greedy algorithms. In this paper, we apply rough sets to…
A mapping M(t) is considered to obtain some preliminary results and a new trapezoidal form of Fejer inequality related to the h-convex functions. Furthermore the obtained results are applied to achieve some new inequalities in connection…
The mathematical software system polymake provides a wide range of functions for convex polytopes, simplicial complexes, and other objects. A large part of this paper is dedicated to a tutorial which exemplifies the usage. Later sections…
The theory of intrinsic volumes of convex cones has recently found striking applications in areas such as convex optimization and compressive sensing. This article provides a self-contained account of the combinatorial theory of intrinsic…
Recursive formulas extending some known $_{2}F_{1}$ and $_{3}F_{2}$ summation formulas by using contiguous relations have been obtained. On the one hand, these recursive equations are quite suitable for symbolic and numerical evaluation by…
We obtain a sharp lower bound on the isoperimetric deficit of a general polygon in terms of the variance of its side lengths, the variance of its radii, and its deviation from being convex. Our technique involves a functional minimization…
We review recent results on the study of the isoperimetric problem on Riemannian manifolds with Ricci lower bounds. We focus on the validity of sharp second order differential inequalities satisfied by the isoperimetric profile of possibly…
Motivated by classical notions of bilinear matrix inequalities (BMIs) and partial convexity, this article investigates partial convexity for noncommutative functions. It is shown that noncommutative rational functions that are partially…
This paper is devoted to show a discrete adaptive finite element approximation result for the isotropic two-dimensional Griffith energy arising in fracture mechanics. The problem is addressed in the geometric measure theoretic framework of…
We investigate properties of Ehrhart polynomials for matroid polytopes, independence matroid polytopes, and polymatroids. In the first half of the paper we prove that for fixed rank their Ehrhart polynomials are computable in polynomial…
Equal-volume polygons are obtained from adequate discretizations of curves in 3-space, contained or not in surfaces. In this paper we explore the similarities of these polygons with the affine arc-length parameterized smooth curves to…
Using a new technique, we prove a rich family of special cases of the matroid intersection conjecture. Roughly, we prove the conjecture for pairs of tame matroids which have a common decomposition by 2-separations into finite parts.
The introduction of covering-based rough sets has made a substantial contribution to the classical rough sets. However, many vital problems in rough sets, including attribution reduction, are NP-hard and therefore the algorithms for solving…
The purpose of this paper is to introduce the new concept of weighted floating functions associated with log concave or $s$-concave functions. This leads to new notions of weighted functional affine surface areas. Their relation to more…
It is well-known that every convex function admits an affine support at every interior point of a domain. Convex functions of higher order (precisely of an odd order) have a similar property: they are supported by the polynomials of degree…
In the burgeoning field of medical imaging, precise computation of 3D volume holds a significant importance for subsequent qualitative analysis of 3D reconstructed objects. Combining multivariate calculus, marching cube algorithm, and…
This paper is concerned with applications of the theory of approximation and interpolation based on compensated convex transforms developed in [K. Zhang, E. Crooks, A. Orlando, Compensated convexity methods for approximations and…
A convolution approach leading to an explicit computation of a value of a 4F3 function is outlined. We also investigate about the role of the dilogarithm reflection formula, leading to a remarkable consequence: in some cases, values of 4F3…
For a real affine hyperplane arrangement, we define an integer intersection matrix with a natural $q$-deformation related to the intersections of bounded chambers of the arrangement. By connecting the integer matrix to a bilinear form of…
Given any polynomial system with fixed monomial term structure, we give explicit formulae for the generic number of roots with specified coordinate vanishing restrictions. For the case of affine space minus an arbitrary union of coordinate…