The Class of Non-Desarguesian Projective Planes is Borel Complete

For every infinite graph $\Gamma$ we construct a non-Desarguesian projective plane $P^*_{\Gamma}$ of the same size as $\Gamma$ such that $Aut(\Gamma) \cong Aut(P^*_{\Gamma})$ and $\Gamma_1 \cong \Gamma_2$ iff $P^*_{\Gamma_1} \cong P^*_{\Gamma_2}$. Furthermore, restricted to structures with domain $\omega$, the map $\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

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

A Finite Axiomatization of G-Dependence

We show that a form of dependence known as G-dependence (originally introduced by Grelling) admits a very natural finite axiomatization, as well as Armstrong relations. We also give an explicit translation between functional dependence and G-dependence

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

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

Shellability of generalized Dowling posets

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

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

Bargaining and Temporary Employment

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.