8,735 research outputs found

    Collapsibility to a subcomplex of a given dimension is NP-complete

    Full text link
    In this paper we extend the works of Tancer and of Malgouyres and Franc\'es, showing that (d,k)(d,k)-collapsibility is NP-complete for d≥k+2d\geq k+2 except (2,0)(2,0). By (d,k)(d,k)-collapsibility we mean the following problem: determine whether a given dd-dimensional simplicial complex can be collapsed to some kk-dimensional subcomplex. The question of establishing the complexity status of (d,k)(d,k)-collapsibility was asked by Tancer, who proved NP-completeness of (d,0)(d,0) and (d,1)(d,1)-collapsibility (for d≥3d\geq 3). Our extended result, together with the known polynomial-time algorithms for (2,0)(2,0) and d=k+1d=k+1, answers the question completely

    The Class of Non-Desarguesian Projective Planes is Borel Complete

    Get PDF
    For every infinite graph Γ\Gamma we construct a non-Desarguesian projective plane PΓ∗P^*_{\Gamma} of the same size as Γ\Gamma such that Aut(Γ)≅Aut(PΓ∗)Aut(\Gamma) \cong Aut(P^*_{\Gamma}) and Γ1≅Γ2\Gamma_1 \cong \Gamma_2 iff PΓ1∗≅PΓ2∗P^*_{\Gamma_1} \cong P^*_{\Gamma_2}. Furthermore, restricted to structures with domain ω\omega, the map Γ↦PΓ∗\Gamma \mapsto P^*_{\Gamma} is Borel. On one side, this shows that the class of countable non-Desarguesian projective planes is Borel complete, and thus not admitting a Ulm type system of invariants. On the other side, we rediscover the main result of [15] on the realizability of every group as the group of collineations of some projective plane. Finally, we use classical results of projective geometry to prove that the class of countable Pappian projective planes is Borel complete

    On the local homology of Artin groups of finite and affine type

    Full text link
    We study the local homology of Artin groups using weighted discrete Morse theory. In all finite and affine cases, we are able to construct Morse matchings of a special type (we call them "precise matchings"). The existence of precise matchings implies that the homology has a square-free torsion. This property was known for Artin groups of finite type, but not in general for Artin groups of affine type. We also use the constructed matchings to compute the local homology in all exceptional cases, correcting some results in the literature

    Shellability of generalized Dowling posets

    Full text link
    A generalization of Dowling lattices was recently introduced by Bibby and Gadish, in a work on orbit configuration spaces. The authors left open the question as to whether these posets are shellable. In this paper we prove EL-shellability and use it to determine the homotopy type. We also show that subposets corresponding to invariant subarrangements are not shellable in general

    A Universal Homogeneous Simple Matroid of Rank 33

    Full text link
    We construct a ∧\wedge-homogeneous universal simple matroid of rank 33, i.e. a countable simple rank~33 matroid M∗M_* which ∧\wedge-embeds every finite simple rank 33 matroid, and such that every isomorphism between finite ∧\wedge-subgeometries of M∗M_* extends to an automorphism of M∗M_*. We also construct a ∧\wedge-homogeneous matroid M∗(P)M_*(P) which is universal for the class of finite simple rank 33 matroids omitting a given finite projective plane PP. We then prove that these structures are not ℵ0\aleph_0-categorical, they have the independence property, they admit a stationary independence relation, and that their automorphism group embeds the symmetric group Sym(ω)Sym(\omega). Finally, we use the free projective extension F(M∗)F(M_*) of M∗M_* to conclude the existence of a countable projective plane embedding all the finite simple matroids of rank 33 and whose automorphism group contains Sym(ω)Sym(\omega), in fact we show that Aut(F(M∗))≅Aut(M∗)Aut(F(M_*)) \cong Aut(M_*)

    Bargaining and Temporary Employment

    Get PDF
    This article studies the behavior of the …rm when it is searching to …ll a vacancy. The principal hypothesis is that the …rm can o¤er two kinds of contracts to the workers, short-term or long-term contracts. The short-term contract is like a probationary stage in which the …rm can learn the worker’s type. After this stage the …rm can propose a long-term contract to the worker, or it can decide to …nd another worker. We suppose that the …rm and the worker bargain over the wage of both types of contract, and that the worker’s bargaining power is di¤erent according to the type of contract. We utilize this framework to study the …rms’ optimal policy choice and its welfare implications.
    • …
    corecore