SearcharxivSearch

arXiv subjects

Daniel C. Cohen

Publications and source records attributed to Daniel C. Cohen.

At least 19 recordsLinked to original sources

Monodromy of supersolvable toric arrangements

We study topological aspects of supersolvable abelian arrangements, toric arrangements in particular. The complement of such an arrangement sits atop a tower of fiber bundles, and we investigate the relationship between these bundles and bundles involving classical configuration spaces. In the toric case, we show that the monodromy of a supersolvable arrangement bundle factors through the Artin braid group, and that of a strictly supersolvable arrangement bundle factors further through the Artin pure braid group. The latter factorization is particularly informative -- we use it to determine a number of invariants of the complement of a strictly supersolvable arrangement, including the cohomology ring and the lower central series Lie algebra of the fundamental group.

math.AT

Chen ranks and resonance

The Chen groups of a group $G$ are the lower central series quotients of the maximal metabelian quotient of $G$. Under certain conditions, we relate the ranks of the Chen groups to the first resonance variety of $G$, a jump locus for the cohomology of $G$. In the case where $G$ is the fundamental group of the complement of a complex hyperplane arrangement, our results positively resolve Suciu's Chen ranks conjecture. We obtain explicit formulas for the Chen ranks of a number of groups of broad interest, including pure Artin groups associated to Coxeter groups, and the group of basis-conjugating automorphisms of a finitely generated free group.

math.AG

Parametrized topological complexity of collision-free motion planning in the plane

Parametrized motion planning algorithms have high degrees of universality and flexibility, as they are designed to work under a variety of external conditions, which are viewed as parameters and form part of the input of the underlying motion planning problem. In this paper, we analyze the parameterized motion planning problem for the motion of many distinct points in the plane, moving without collision and avoiding multiple distinct obstacles with a priori unknown positions. This complements our prior work [arXiv:2009.06023], where parameterized motion planning algorithms were introduced, and the obstacle-avoiding collision-free motion planning problem in three-dimensional space was fully investigated. The planar case requires different algebraic and topological tools than its spatial analog.

math.AT

On the topological complexity of manifolds with abelian fundamental group

We find conditions which ensure that the topological complexity of a closed manifold $M$ with abelian fundamental group is nonmaximal, and see through examples that our conditions are sharp. This generalizes results of Costa and Farber on the topological complexity of spaces with small fundamental group. Relaxing the commutativity condition on the fundamental group, we also generalize results of Dranishnikov on the Lusternik-Schnirelmann category of the cofibre of the diagonal map $Δ: M \to M \times M$ for nonorientable surfaces by establishing the nonmaximality of this invariant for a large class of manifolds.

math.AT

Topology of parametrised motion planning algorithms

In this paper we introduce and study a new concept of parametrised topological complexity, a topological invariant motivated by the motion planning problem of robotics. In the parametrised setting, a motion planning algorithm has high degree of universality and flexibility, it can function under a variety of external conditions (such as positions of the obstacles etc). We explicitly compute the parameterised topological complexity of obstacle-avoiding collision-free motion of many particles (robots) in 3-dimensional space. Our results show that the parameterised topological complexity can be significantly higher than the standard (nonparametrised) invariant.

math.AT

Discriminantal bundles, arrangement groups, and subdirect products of free groups

We construct bundles $E_k(\A,\F) \to M$ over the complement $M$ of a complex hyperplane arrangement \A, depending on an integer $k \geq 1$ and a set $\F=\{f_1, \ldots, f_μ\}$ of continuous functions $f_i \colon M \to \C$ whose differences are nonzero on $M$, generalizing the configuration space bundles arising in the Lawrence-Krammer-Bigelow representation of the pure braid group. We display such families \F\ for rank two arrangements, reflection arrangements of types $A_\ell$, $B_\ell$, $D_\ell$, $F_4$, and for arrangements supporting multinet structures with three classes, with the resulting bundles having nontrivial monodromy around each hyperplane. The construction extends to arbitrary arrangements by pulling back these bundles along products of inclusions arising from subarrangements of these types. We then consider the faithfulness of the resulting representations of the arrangement group $π_1(M)$. We describe the kernel of the product $ρ_\X \colon G \to \prod_{S \in \X} G_S$ of homomorphisms of a finitely-generated group $G$ onto quotient groups $G_S$ determined by a family \X\ of subsets of a fixed set of generators of $G$, extending a result of T.~Stanford about Brunnian braids. When the projections $G \to G_S$ split in a compatible way, we show the image of $ρ_\X$ is normal with free abelian quotient, and identify the cohomological finiteness type of $G$. These results apply to some well-studied arrangements, implying several qualitative and residual properties of $π_1(M)$, including an alternate proof of a result of Artal, Cogolludo, and Matei on arrangement groups and Bestvina-Brady groups, and a dichotomy for a decomposable arrangement \A: either $π_1(M)$ has a conjugation-free presentation or it is not residually nilpotent.

math.GT

Motion planning in connected sums of real projective spaces

The topological complexity ${\sf TC}(X)$ is a homotopy invariant of a topological space $X$, motivated by robotics, and providing a measure of the navigational complexity of $X$. The topological complexity of a connected sum of real projective planes, that is, a high genus nonorientable surface, is known to be maximal. We use algebraic tools to show that the analogous result holds for connected sums of higher dimensional real projective spaces.

math.AT

Topological Complexity of the Klein bottle

We show that the (normalized) topological complexity of the Klein bottle is $4$. We also show that, for any $g\geq 2$, $TC(N_g)=4$. This completes the recent work by Dranishnikov on the topological complexity of non-orientable surfaces.

math.AT

Vanishing products of one-forms and critical points of master functions

Let \A be an affine hyperplane arrangement in $\C^\ell$ with complement $U$. Let $f_1, \..., f_n$ be linear polynomials defining the hyperplanes of \A, and $A^\cdot$ the algebra of differential forms generated by the 1-forms $d \log f_1, \..., d \log f_n$. To each $l \in \C^n$ we associate the master function $Φ=Φ_l = \prod_{i=1}^n f_i^{l_i}$ on $U$ and the closed logarithmic 1-form $ω= d \log Φ$. We assume $ω$ is an element of a rational linear subspace $D$ of $A^1$ of dimension $q>1$ such that the multiplication map $\bigwedge^k(D) \to A^k$ is zero for $p<k\leq q$. With this assumption, we prove every component of the critical locus $\crit(Φ)$ of $Φ$ has codimension at most $p$, and $\crit(Φ)$ is a union of intersections of level sets of rational master functions. We give conditions that guarantee $\crit(Φ)$ is nonempty and every component has codimension equal to $p$, in terms of syzygies among polynomial master functions. If \A is $p$-generic, then $D$ is contained in the degree $p$ resonance variety $\R^p(\A)$ -- in this sense the present work complements previous work on resonance and critical loci of master functions. Any arrangement is 1-generic; in case $p=1$ we give a precise description of $\crit(Φ_l)$ in case $l$ lies in an isotropic subspace $D$ of $A^1$, using the multinet structure on \A corresponding to $D\subseteq \R^1(\A)$. This is carried out in detail for the Hessian arrangement. Finally, for arbitrary $p$ and \A, we establish necessary and sufficient conditions for a set of integral one-forms to span such a subspace, in terms of nested sets of \A, using tropical implicitization.

math.AG

Pure braid groups are not residually free

We show that the Artin pure braid group on at least four strands is not residually free. Our results also show that the pure braid group on at least three strands has corank two.

math.GR

The homotopical dimension of random 2-complexes

In this paper we study the Linial-Meshulam model of random two-dimensional complexes. We prove that a random 2-complex is homotopically one dimensional, with probability tending to one as n tends to infitnity, assuming that the probability parameter p satisfies pn --> 0.

math.AT

Topological complexity of collision-free motion planning on surfaces

The topological complexity TC(X) is a numerical homotopy invariant of a topological space X which is motivated by robotics and is similar in spirit to the classical Lusternik-Schnirelmann category of X. Given a mechanical system with configuration space X, the invariant TC(X) measures the complexity of all possible motion planning algorithms designed for the system. In this paper, we compute the topological complexity of the configuration space of n distinct ordered points on an orientable surface. Our main tool is a theorem of B. Totaro describing the cohomology of configuration spaces of algebraic varieties.

math.AT

Cohomology rings of almost-direct products of free groups

An almost-direct product of free groups is an iterated semidirect product of finitely generated free groups in which the action of the constituent free groups on the homology of one another is trivial. We determine the structure of the cohomology ring of such a group. This is used to analyze the topological complexity of the associated Eilenberg-Mac Lane space.

math.AT

Motion planning in tori

Let X be a subcomplex of the standard CW-decomposition of the n-dimensional torus. We exhibit an explicit optimal motion planning algorithm for X. This construction is used to calculate the topological complexity of complements of general position arrangements and Eilenberg-Mac Lane spaces associated to right-angled Artin groups.

math.GT