Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn weighted covering numbers and the Levi-Hadwiger conjecture
300
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We define new natural variants of the notions of weighted covering and separation numbers and discuss them in detail. We prove a strong duality relation between weighted covering and separation numbers and prove a few relations between the classical and weighted covering numbers, some of which hold true without convexity assumptions and for general metric spaces. As a consequence, together with some volume bounds that we discuss, we provide a bound for the famous Levi-Hadwiger problem concerning covering a convex body by homothetic slightly smaller copies of itself, in the case of centrally symmetric convex bodies, which is qualitatively the same as the best currently known bound. We also introduce the weighted notion of the Levi-Hadwiger covering problem, and settle the centrally-symmetric case, thus also confirm Nasz{o}dis equivalent fractional illumination conjecture in the case of centrally symmetric convex bodies (including the characterization of the equality case, which was unknown so far).
rate research
Read More
We propose an algorithm to reduce a k-chromatic graph to a complete graph of largest possible order through a well defined sequence of contractions. We introduce a new matrix called transparency matrix and state its properties. We then define correct contraction procedure to be executed to get largest possible complete graph from given connected graph. We finally give a characterization for k-chromatic graphs and use it to settle Hadwigers conjecture.
Hadwiger Conjecture has been an open problem for over a half century1,6, which says that there is at most a complete graph Kt but no Kt+1 for every t-colorable graph. A few cases of Hadwiger Conjecture, such as 1, 2, 3, 4, 5, 6-colorable graphs have been completely proved to convince all1-5, but the proofs are tremendously difficult for over the 5-colorable graph6,7. Although the development of graph theory inspires scientists to understand graph coloring deeply, it is still an open problem for over 7-colorable graphs6,7. Therefore, we put forward a brand new chromatic graph configuration and show how to describe the graph coloring issues in chromatic space. Based on this idea, we define a chromatic plane and configure the chromatic coordinates in Euler space. Also, we find a method to prove Hadwiger Conjecture for every 8-coloring graph feasible.
Given a convex disk $K$ and a positive integer $k$, let $vartheta_T^k(K)$ and $vartheta_L^k(K)$ denote the $k$-fold translative covering density and the $k$-fold lattice covering density of $K$, respectively. Let $T$ be a triangle. In a very recent paper, K. Sriamorn proved that $vartheta_L^k(T)=frac{2k+1}{2}$. In this paper, we will show that $vartheta_T^k(T)=vartheta_L^k(T)$.
Let $V$ be a Banach space where for fixed $n$, $1<n<dim(V)$, all of its $n$-dimensional subspaces are isometric. In 1932, Banach asked if under this hypothesis $V$ is necessarily a Hilbert space. Gromov, in 1967, answered it positively for even $n$ and all $V$. In this paper we give a positive answer for real $V$ and odd $n$ of the form $n=4k+1$, with the possible exception of $n=133.$ Our proof relies on a new characterization of ellipsoids in ${mathbb{R}}^n$, $ngeq 5$, as the only symmetric convex bodies all of whose linear hyperplane sections are linearly equivalent affine bodies of revolution.
We define covering and separation numbers for functions. We investigate their properties, and show that for some classes of functions there is exact equality of separation and covering. We provide analogues for various geometric inequalities on covering numbers, such as volume bounds, bounds connected with Hadwigers conjecture, and inequalities about M-positions for geometric log-concave functions. In particular, we obtain stro
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
