affine hyperplane
Recently Published Documents


TOTAL DOCUMENTS

7
(FIVE YEARS 2)

H-INDEX

1
(FIVE YEARS 0)

Author(s):  
YIFTACH DAYAN

Abstract We show that fractal percolation sets in $\mathbb{R}^{d}$ almost surely intersect every hyperplane absolutely winning (HAW) set with full Hausdorff dimension. In particular, if $E\subset\mathbb{R}^{d}$ is a realisation of a fractal percolation process, then almost surely (conditioned on $E\neq\emptyset$ ), for every countable collection $\left(f_{i}\right)_{i\in\mathbb{N}}$ of $C^{1}$ diffeomorphisms of $\mathbb{R}^{d}$ , $\dim_{H}\left(E\cap\left(\bigcap_{i\in\mathbb{N}}f_{i}\left(\text{BA}_{d}\right)\right)\right)=\dim_{H}\left(E\right)$ , where $\text{BA}_{d}$ is the set of badly approximable vectors in $\mathbb{R}^{d}$ . We show this by proving that E almost surely contains hyperplane diffuse subsets which are Ahlfors-regular with dimensions arbitrarily close to $\dim_{H}\left(E\right)$ . We achieve this by analysing Galton–Watson trees and showing that they almost surely contain appropriate subtrees whose projections to $\mathbb{R}^{d}$ yield the aforementioned subsets of E. This method allows us to obtain a more general result by projecting the Galton–Watson trees against any similarity IFS whose attractor is not contained in a single affine hyperplane. Thus our general result relates to a broader class of random fractals than fractal percolation.


2020 ◽  
Vol 4 (4) ◽  
pp. 397-446
Author(s):  
Giovanna Carnovale ◽  
Francesco Esposito

Author(s):  
Bernhard M¨uhlherr ◽  
Holger P. Petersson ◽  
Richard M. Weiss

This chapter presents some results about groups generated by reflections and the standard metric on a Bruhat-Tits building. It begins with definitions relating to an affine subspace, an affine hyperplane, an affine span, an affine map, and an affine transformation. It then considers a notation stating that the convex closure of a subset a of X is the intersection of all convex sets containing a and another notation that denotes by AGL(X) the group of all affine transformations of X and by Trans(X) the set of all translations of X. It also describes Euclidean spaces and assumes that the real vector space X is of finite dimension n and that d is a Euclidean metric on X. Finally, it discusses Euclidean representations and the standard metric.


2017 ◽  
Vol 2019 (11) ◽  
pp. 3376-3458 ◽  
Author(s):  
Alexander Varchenko ◽  
Charles Young

Abstract We identify a class of affine hyperplane arrangements that we call cyclotomic discriminantal arrangements. We establish correspondences between the flag and Aomoto complexes of such arrangements and chain complexes for nilpotent subalgebras of Kac–Moody type Lie algebras with diagram automorphisms. As part of this construction, we find that flag complexes naturally give rise to a certain cocycle on the fixed-point subalgebras of such diagram automorphisms. As a byproduct, we show that the Bethe vectors of cyclotomic Gaudin models associated to diagram automorphisms are nonzero. We also obtain the Poincare polynomial for the cyclotomic discriminantal arrangements.


2015 ◽  
Vol 50 ◽  
pp. 30-37 ◽  
Author(s):  
Sylvie Corteel ◽  
David Forge ◽  
Véronique Ventos

10.37236/137 ◽  
2009 ◽  
Vol 16 (1) ◽  
Author(s):  
Aisling Kenny

For any finite, real reflection group $W$, we construct a geometric basis for the homology of the corresponding non-crossing partition lattice. We relate this to the basis for the homology of the corresponding intersection lattice introduced by Björner and Wachs using a general construction of a generic affine hyperplane for the central hyperplane arrangement defined by $W$.


2005 ◽  
Vol 72 (3) ◽  
pp. 477-480 ◽  
Author(s):  
David L. Fearnley ◽  
L. Fearnley ◽  
J. W. Lamoreaux

We show that, for any positive integers n and m, if a set S ⊂ Rm intersects every m − 1 dimensional affine hyperplane in Rm in exactly n points, then S is not an Fσ set. This gives a natural extension to results of Khalid Bouhjar, Jan J. Dijkstra, and R. Daniel Mauldin, who have proven this result for the case when m = 2, and also Jan J. Dijkstra and Jan van Mill, who have shown this result for the case when n = m.


Sign in / Sign up

Export Citation Format

Share Document