2,490 research outputs found

    James bundles

    Get PDF
    We study cubical sets without degeneracies, which we call {square}-sets. These sets arise naturally in a number of settings and they have a beautiful intrinsic geometry; in particular a {square}-set C has an infinite family of associated {square}-sets Ji(C), for i = 1, 2, ..., which we call James complexes. There are mock bundle projections pi: |Ji(C)| -> |C| (which we call James bundles) defining classes in unstable cohomotopy which generalise the classical James–Hopf invariants of {Omega}(S2). The algebra of these classes mimics the algebra of the cohomotopy of {Omega}(S2) and the reduction to cohomology defines a sequence of natural characteristic classes for a {square}-set. An associated map to BO leads to a generalised cohomology theory with geometric interpretation similar to that for Mahowald orientation

    K(Ï€,1)K(\pi,1) and word problems for infinite type Artin-Tits groups, and applications to virtual braid groups

    Full text link
    Let Γ\Gamma be a Coxeter graph, let (W,S)(W,S) be its associated Coxeter system, and let (A,Σ(A,\Sigma) be its associated Artin-Tits system. We regard WW as a reflection group acting on a real vector space VV. Let II be the Tits cone, and let EΓE_\Gamma be the complement in I+iVI +iV of the reflecting hyperplanes. Recall that Charney, Davis, and Salvetti have constructed a simplicial complex Ω(Γ)\Omega(\Gamma) having the same homotopy type as EΓE_\Gamma. We observe that, if T⊂ST \subset S, then Ω(ΓT)\Omega(\Gamma_T) naturally embeds into Ω(Γ)\Omega (\Gamma). We prove that this embedding admits a retraction πT:Ω(Γ)→Ω(ΓT)\pi_T: \Omega(\Gamma) \to \Omega (\Gamma_T), and we deduce several topological and combinatorial results on parabolic subgroups of AA. From a family \SS of subsets of SS having certain properties, we construct a cube complex Φ\Phi, we show that Φ\Phi has the same homotopy type as the universal cover of EΓE_\Gamma, and we prove that Φ\Phi is CAT(0) if and only if \SS is a flag complex. We say that X⊂SX \subset S is free of infinity if ΓX\Gamma_X has no edge labeled by ∞\infty. We show that, if EΓXE_{\Gamma_X} is aspherical and AXA_X has a solution to the word problem for all X⊂SX \subset S free of infinity, then EΓE_\Gamma is aspherical and AA has a solution to the word problem. We apply these results to the virtual braid group VBnVB_n. In particular, we give a solution to the word problem in VBnVB_n, and we prove that the virtual cohomological dimension of VBnVB_n is n−1n-1

    Size of Sets with Small Sensitivity: a Generalization of Simon's Lemma

    Full text link
    We study the structure of sets S⊆{0,1}nS\subseteq\{0, 1\}^n with small sensitivity. The well-known Simon's lemma says that any S⊆{0,1}nS\subseteq\{0, 1\}^n of sensitivity ss must be of size at least 2n−s2^{n-s}. This result has been useful for proving lower bounds on sensitivity of Boolean functions, with applications to the theory of parallel computing and the "sensitivity vs. block sensitivity" conjecture. In this paper, we take a deeper look at the size of such sets and their structure. We show an unexpected "gap theorem": if S⊆{0,1}nS\subseteq\{0, 1\}^n has sensitivity ss, then we either have ∣S∣=2n−s|S|=2^{n-s} or ∣S∣≥322n−s|S|\geq \frac{3}{2} 2^{n-s}. This is shown via classifying such sets into sets that can be constructed from low-sensitivity subsets of {0,1}n′\{0, 1\}^{n'} for n′<nn'<n and irreducible sets which cannot be constructed in such a way and then proving a lower bound on the size of irreducible sets. This provides new insights into the structure of low sensitivity subsets of the Boolean hypercube {0,1}n\{0, 1\}^n
    • …
    corecore