中文
相关论文

相关论文: Colorful theorems for strong convexity

200 篇论文

In 2004, Karo\'nski, \L uczak and Thomason proposed $1$-$2$-$3$-conjecture: For every nice graph $G$ there is an edge weighting function $ w:E(G)\rightarrow\{1,2,3\} $ such that the induced vertex coloring is proper. After that, the total…

组合数学 · 数学 2022-05-02 Akbar Davoodi , Leila Maherani

L-convex sets are one of the most fundamental concepts in discrete convex analysis. Furthermore, the Minkowski sum of two L-convex sets, called L2-convex sets, is an intriguing object that is closely related to polymatroid intersection.…

组合数学 · 数学 2022-03-28 Satoko Moriguchi , Kazuo Murota

We give a variational proof of the existence and uniqueness of a convex cap with the given upper boundary. The proof uses the concavity of the total scalar curvature functional on the space of generalized convex caps. As a byproduct, we…

微分几何 · 数学 2007-05-23 Ivan Izmestiev

We investigate several closely related "homothety conjectures" for convex bodies on a plane. Using the modern language of differential geometry, we systematically derive the fundamental properties of bodies of flotation, bodies of buoyancy,…

微分几何 · 数学 2025-07-17 Bartłomiej Zawalski

We propose a new, precise integrality conjecture for the colored Kauffman polynomial of knots and links inspired by large N dualities and the structure of topological string theory on orientifolds. According to this conjecture, the natural…

高能物理 - 理论 · 物理学 2014-11-18 Marcos Marino

We show quantitative versions of classic results in discrete geometry, where the size of a convex set is determined by some non-negative function. We give versions of this kind for the selection theorem of B\'ar\'any, the existence of weak…

度量几何 · 数学 2015-10-27 David Rolnick , Pablo Soberón

We prove a no-dimensional version of Carath\'edory's theorem: given an $n$-element set $P\subset \Re^d$, a point $a \in \conv P$, and an integer $r\le d$, $r \le n$, there is a subset $Q\subset P$ of $r$ elements such that the distance…

度量几何 · 数学 2019-08-29 Karim Adiprasito , Imre Bárány , Nabil H. Mustafa , Tamás Terpai

High proved the following theorem. If the intersections of any two congruent copies of a plane convex body are centrally symmetric, then this body is a circle. In our paper we extend the theorem of High to the sphere and the hyperbolic…

度量几何 · 数学 2024-07-19 J. Jerónimo-Castro , E. Makai

We generalize a result of Tibor Gallai as follows: for any finite set of points $\mathcal{S}$ in the plane, if the plane is colored in finitely many colors, then there exist $2^{\aleph_0}$ monochromatic subsets of the plane homothetic to…

组合数学 · 数学 2015-08-11 Jeremy F. Alm

We study the Carath\'eodory number of homogeneous convex cones via their spectrahedral representations. A characterization of homogeneous convex cones whose ranks match their Carath\'eodory numbers is given. This characterization is then…

最优化与控制 · 数学 2025-11-24 Chek Beng Chua

In this article we discuss classical theorems from Convex Geometry in the context of topological drawings and beyond. In a simple topological drawing of the complete graph $K_n$, any two edges share at most one point: either a common vertex…

We introduce a special class of convex rational polyhedral cones which allows to construct generalized Calabi-Yau varieties of dimension $(d + 2(r-1))$, where $r$ is a positive integer and d is the dimension of critical string vacua with…

alg-geom · 数学 2008-02-03 Victor V. Batyrev , Lev A. Borisov

We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…

逻辑 · 数学 2013-05-21 Tarek Sayed Ahmed

We prove a Caratheodory-Fejer type interpolation theorem for certain matrix convex sets in $\C^d$ using the Blecher-Ruan-Sinclair characterization of abstract operator algebras. Our results generalize the work of Dmitry S.…

泛函分析 · 数学 2010-02-15 Sriram Balasubramanian

In this paper, we give a proof for four color theorem(four color conjecture). Our proof does not involve computer assistance and the most important is that it can be generalized to prove Hadwiger Conjecture. Moreover, we give algorithms to…

综合数学 · 数学 2017-01-03 Weiya Yue , Weiwei Cao

In this paper, we provide an equivalent condition for the Chvatal-Gomory (CG) closure of a closed convex set to be finitely-generated. Using this result, we are able to prove that, for any closed convex set that can be written as the…

最优化与控制 · 数学 2021-06-02 Haoran Zhu

We show that various analogs of Hindman's Theorem fail in a strong sense when one attempts to obtain uncountable monochromatic sets: Theorem 1: There exists a colouring $c:\mathbb R\rightarrow\mathbb Q$, such that for every…

逻辑 · 数学 2017-10-06 David Fernández-Bretón , Assaf Rinot

First, we shall formulate and prove Theorem of Lie-Kolchin type for a cone and derive some algebro-geometric consequences. Next, inspired by a recent result of Dinh and Sibony we pose a conjecture of Tits type for a group of automorphisms…

代数几何 · 数学 2018-06-20 JongHae Keum , Keiji Oguiso , De-Qi Zhang

Hadwiger's transversal theorem gives necessary and sufficient conditions for the existence of a line transversal to a family of pairwise disjoint convex sets in the plane. These conditions were subsequently generalized to hyperplane…

组合数学 · 数学 2024-09-06 Andreas F. Holmsen

Tverberg's theorem bounds the number of points $\mathbb{R}^d$ needed for the existence of a partition into $r$ parts whose convex hulls intersect. If the points are colored with $N$ colors, we seek partitions where each part has at most one…

组合数学 · 数学 2020-05-28 Sherry Sarkar , Pablo Soberón