惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

P
Proofpoint News Feed
T
The Blog of Author Tim Ferriss
aimingoo的专栏
aimingoo的专栏
M
MIT News - Artificial intelligence
N
Netflix TechBlog - Medium
Y
Y Combinator Blog
B
Blog RSS Feed
H
Help Net Security
Blog — PlanetScale
Blog — PlanetScale
Vercel News
Vercel News
Google DeepMind News
Google DeepMind News
Microsoft Security Blog
Microsoft Security Blog
G
Google Developers Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 司徒正美
L
LangChain Blog
IT之家
IT之家
F
Fortinet All Blogs
V
V2EX
C
Check Point Blog
The Cloudflare Blog
博客园_首页
阮一峰的网络日志
阮一峰的网络日志
A
About on SuperTechFans

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
On the chromatic number and equilateral dimension of $\ma...
Amnon Rosenmann · 2026-06-15 · via math.CO updates on arXiv.org

We study the tropical chromatic number of $\mathbb{R}^n$, $χ_{\mathrm{tr}}(\mathbb{R}^n)$, the tropical analogue of the well-known Hadwiger-Nelson problem in $\mathbb{R}^2$. An upper bound to $χ_{\mathrm{tr}}(\mathbb{R}^n)$ is $2^n$. It is conjectured that $χ_{\mathrm{tr}}(\mathbb{R}^n) = 2^n$, which is known to be the case for the measurable chromatic number. Asymptotically we get that $\displaystyle χ_{\mathrm{tr}}(\mathbb{R}^n) = Θ\!\left(\frac{2^n}{\sqrt{n}}\right)$. By constructing a graph with 62 vertices and 577 edges we demonstrate that $χ_{\mathrm{tr}}(\mathbb{R}^3)=8$. A related problem is the tropical equilateral dimension of $\mathbb{R}^n$, $\mathrm{e}_{\mathrm{tr}}(\mathbb{R}^n)$, the maximum size of a set $S$ of points of the same tropical distance from one another. We show that $\displaystyle \mathrm{e}_{\mathrm{tr}}(\mathbb{Z}^n) \geq \binom{n+1}{\lfloor (n+1)/2 \rfloor}$ and conjecture that $\mathrm{e}_{\mathrm{tr}}(\mathbb{R}^n)$ is exactly this Sperner's antichain bound. The conjecture is verified in dimension $n \leq 3$ and also when $S$ is an equilateral set of tropical distance $2R$ contained in a tropical sphere of radius $R$. We are not aware of the appearance of Sperner's bound in the context of chromatic number or equilateral set.