Every Borel automorphism without finite invariant measures admits a two-set generator
نویسندگان
چکیده
منابع مشابه
Every Set of Disjoint Line Segments Admits a Binary
Given a set of n disjoint line segments in the plane, we show that it is always possible to form a tree with the endpoints of the segments such that each line segment is an edge of the tree, the tree has no crossing edges, and the maximum vertex degree of the tree is 3. Furthermore, there exist conngurations of line segments where any such tree requires degree 3. We provide an O(n log n) time a...
متن کاملA dedekind finite borel set
In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B ⊆ 2 is a Gδσ-set then either B is countable or B contains a perfect subset. Second, we prove that if 2 is the countable union of countable sets, then there exists an Fσδ set C ⊆ 2 such that C is uncountable but contains no perfect subset. Finally, we c...
متن کاملEvery finite non-solvable group admits an oriented regular representation
In this paper we give a partial answer to a 1980 question of Lazslo Babai: “Which [finite] groups admit an oriented graph as a DRR?” That is, which finite groups admit an oriented regular representation (ORR)? We show that every finite non-solvable group admits an ORR, and provide a tool that may prove useful in showing that some families of finite solvable groups admit ORRs. We also completely...
متن کاملEvery place admits local uniformization in a finite extension of the function field
We prove that every place P of an algebraic function field F |K of arbitrary characteristic admits local uniformization in a finite extension F of F . We show that F|F can be chosen to be Galois, after a finite purely inseparable extension of the ground field K. Instead of being Galois, the extension can also be chosen such that the induced extension FP |FP of the residue fields is purely insep...
متن کاملEvery Graph Admits an Unambiguous Bold Drawing
Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the European Mathematical Society
سال: 2018
ISSN: 1435-9855
DOI: 10.4171/jems/836