The following pages link to Giovanni Paolini (Q1702355):
Displaying 21 items.
- Collapsibility to a subcomplex of a given dimension is NP-complete (Q1702356) (← links)
- Weighted sheaves and homology of Artin groups (Q1713046) (← links)
- The action of Young subgroups on the partition complex (Q1983147) (← links)
- Proof of the \(K(\pi,1)\) conjecture for affine Artin groups (Q2030394) (← links)
- Discrete Morse theory on digraphs (Q2071461) (← links)
- Equilibrium stressability of multidimensional frameworks (Q2115329) (← links)
- Factoring isometries of quadratic spaces into reflections (Q2142474) (← links)
- Incidence geometry in a Weyl chamber. II: \(SL_n\) (Q2182616) (← links)
- Euclidean matchings and minimality of hyperplane arrangements (Q2222936) (← links)
- Representations of torsion-free arithmetic matroids (Q2225454) (← links)
- Configuration spaces of disks in an infinite strip (Q2239806) (← links)
- On the local homology of Artin groups of finite and affine type (Q2292412) (← links)
- Shellability of generalized Dowling posets (Q2299615) (← links)
- Shellability of posets of labeled partitions and arrangements defined by root systems (Q2327229) (← links)
- An algorithm for canonical forms of finite subsets of \(\mathbb {Z}^d\) up to affinities (Q2408208) (← links)
- On the classifying space of Artin monoids (Q4594742) (← links)
- The information complexity of learning tasks, their structure and their distance (Q5006482) (← links)
- A table of <i>n</i>-component handlebody links of genus <i>n+1</i> up to six crossings (Q5058457) (← links)
- Rectangular analogues of the square paths conjecture and the univariate Delta conjecture (Q6179326) (← links)
- The Information Complexity of Learning Tasks, their Structure and their Distance (Q6316770) (← links)
- Dual structures on Coxeter and Artin groups of rank three (Q6656656) (← links)
