Related papers: A quantitative program for Hadwiger's covering con…
This paper presents an algorithmic study of a class of covering mixed-integer linear programming problems which encompasses classic cover problems, including multidimensional knapsack, facility location and supplier selection problems. We…
In this short note we present a class of conjectures on partitions of integers as summations of primes, which are extensions of Goldbach conjecture.
Motivated by string theory connection, a covariant procedure for perturbative calculation of the partition function of the two-dimensional generalized $\sigma$-model is considered. The importance of a consistent regularization of the…
In this note we provide a full conjugacy and subdifferential calculus for convex convex-composite functions in finite-dimensional space. Our approach, based on infimal convolution and cone-convexity, is straightforward and yields the…
The classical honeycomb conjecture asserts that any partition of the plane into regions of equal area has perimeter at least that of the regular hexagonal honeycomb tiling. Pappus discusses this problem in his preface to Book V. This paper…
For convex partitions of a convex body $B$ we prove that we can put a homothetic copy of $B$ into each set of the partition so that the sum of homothety coefficients is $\ge 1$. In the plane the partition may be arbitrary, while in higher…
We introduce an algorithm that conjectures the structure of a permutation class in the form of a disjoint cover of "rules"; similar to generalized grid classes. The cover is usually easily verified by a human and translated into an…
In this article we pose the problem of existence and uniqueness of convex body for which the projection curvature radius function coincides with given function. We find a necessary and sufficient condition that ensures a positive answer to…
The coarse geometric Novikov conjecture provides an algorithm to determine when the higher index of an elliptic operator on a noncompact space is nonzero. The purpose of this paper is to prove the coarse geometric Novikov conjecture for…
We provide a reformulation of the hyperplane conjecture (the slicing problem) in terms of the floating body and give upper and lower bounds on the logarithmic Hausdorff distance between an arbitrary convex body $K\subset \mathbb{R}^{d}$\…
We prove the basic trigonometric Korovkin approximation theorem for fuzzy valued functions of two variables and verify the approximation by the help of fuzzy modulus of continuity. Also, we introduce double level Fourier series of fuzzy…
In this paper we present a new approach for tightening upper bounds on the partition function. Our upper bounds are based on fractional covering bounds on the entropy function, and result in a concave program to compute these bounds and a…
We give a partial answer to an important open problem in descriptive set theory, the Decomposability Conjecture for Borel functions on an analytic subset of a Polish space to a separable metrizable space. Our techniques employ deep results…
An exact algorithm is presented for solving edge weighted graph partitioning problems. The algorithm is based on a branch and bound method applied to a continuous quadratic programming formulation of the problem. Lower bounds are obtained…
In this short note, we prove Hadwiger's conjecture for strongly monotypic polytopes.
A method is proposed for the characterisation of the entropy of cellular structures, based on the compactivity concept for granular packings. Hamiltonian-like volume functions are constructed both in two and in three dimensions, enabling…
Typically, when we are given the section (or projection) function of a convex body, it means that in each direction we know the size of the central section (or projection) perpendicular to this direction. Suppose now that we can only get…
We apply some recent developments of Baldoni-Beck-Cochet-Vergne on vector partition function, to Kostant's and Steinberg's formulae, for classical Lie algebras $A\_r$, $B\_r$, $C\_r$, $D\_r$. We therefore get efficient {\tt Maple} programs…
We study the computational complexity of determining the Hausdorff distance of two polytopes given in halfspace- or vertex-presentation in arbitrary dimension. Subsequently, a matching problem is investigated where a convex body is allowed…
We briefly describe the importance of division algebras and Poincar\'e conjecture in both mathematical and physical scenarios. Mathematically, we argue that using the torsion concept one can combine the formalisms of division algebras and…