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

推荐订阅源

爱范儿
爱范儿
T
The Blog of Author Tim Ferriss
G
Google Developers Blog
博客园_首页
博客园 - 【当耐特】
量子位
S
SegmentFault 最新的问题
B
Blog RSS Feed
酷 壳 – CoolShell
酷 壳 – CoolShell
V
Visual Studio Blog
T
Tailwind CSS Blog
阮一峰的网络日志
阮一峰的网络日志
V
V2EX
Y
Y Combinator Blog
博客园 - 聂微东
The Cloudflare Blog
小众软件
小众软件
J
Java Code Geeks
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
月光博客
月光博客
H
Help Net Security
Jina AI
Jina AI
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
宝玉的分享
宝玉的分享

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}}$
A Measure Theoretic Paradox from a continuous colouring rule
Robert Simon, Grzegorz Tomkowicz · 2022-03-22 · via math.CO updates on arXiv.org

Given a probability space $(X, {\cal B}, m)$, measure preserving transformations $g_1, \dots , g_k$ of $X$, and a colour set $C$, a colouring rule is a way to colour the space with $C$ such that the colours allowed for apoint $x$ are determined by that point's location and the colours of the finitely $g_1 (x), \dots , g_k(x)$ with $g_i(x) \not= x$ for all $i$ and almost all $x$. We represent a colouring rule as a correspondence $F$ defined on $X\times C^k$ with values in $C$. A function $f: X\rightarrow C$ satisfies the rule at $x$ if $f(x) \in F( x, f(g_1 x), \dots , f(g_k x))$. A colouring rule is paradoxical if it can be satisfied in some way almost everywhere with respect to $m$, but not in {\bf any} way that is measurable with respect to a finitely additive measure that extends the probability measure $m$ defined on ${\cal B}$ and for which the finitely many transformations $g_1, \dots , g_k$ remain measure preserving. Can a colouring rule be paradoxical if both $X$ and the colour set $C$ are convex and compact sets and the colouring rule says if $c: X\rightarrow C$ is the colouring function then the colour $c(x)$ must lie ($m$ a.e.) in $F(x, c(g_1(x) ), \dots , c(g_k(x)))$ for a non-empty upper-semi-continuous convex-valued correspondence $F$ defined on $X\times C^k$? The answer is yes, and we present such an example. We show that this result is robust, including that any colouring that approximates the correspondence by $ε$ for small enough positive $ε$ also cannot be measurable in the same finitely additive way. Because non-empty upper-semi-continuous convex-valued correspondences on Euclidean space can be approximated by continuous functions, there are paradoxical colouring rules that are defined by continuous functions.