We define a natural lattice structure on all subsets of a finite root system that extends the weak order on the elements of the corresponding Coxeter group. For crystallographic root systems, we show that the subposet of this lattice induced by antisymmetric closed subsets of roots is again a lattice. We then study further subposets of this lattice that naturally correspond to the elements, the intervals, and the faces of the permutahedron and the generalized associahedra of the corresponding Weyl group. These results extend to arbitrary finite crystallographic root systems the recent results of G. Chatel, V. Pilaud, and V. Pons on the weak order on posets and its induced subposets.

For a group $G$, let $\unicode[STIX]{x1D6E4}(G)$ denote the graph defined on the elements of $G$ in such a way that two distinct vertices are connected by an edge if and only if they generate $G$. Let $\unicode[STIX]{x1D6E4}^{\ast }(G)$ be the subgraph of $\unicode[STIX]{x1D6E4}(G)$ that is induced by all the vertices of $\unicode[STIX]{x1D6E4}(G)$ that are not isolated. We prove that if $G$ is a 2-generated noncyclic abelian group, then $\unicode[STIX]{x1D6E4}^{\ast }(G)$ is connected. Moreover, $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(G))=2$ if the torsion subgroup of $G$ is nontrivial and $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(G))=\infty$ otherwise. If $F$ is the free group of rank 2, then $\unicode[STIX]{x1D6E4}^{\ast }(F)$ is connected and we deduce from $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(\mathbb{Z}\times \mathbb{Z}))=\infty$ that $\text{diam}(\unicode[STIX]{x1D6E4}^{\ast }(F))=\infty$.

Approximation sequences and derived equivalences occur frequently in the research of mutation of tilting objects in representation theory, algebraic geometry and noncommutative geometry. In this paper, we introduce symmetric approximation sequences in additive categories and weakly n-angulated categories which include (higher) Auslander-Reiten sequences (triangles) and mutation sequences in algebra and geometry, and show that such sequences always give rise to derived equivalences between the quotient rings of endomorphism rings of objects in the sequences modulo some ghost and coghost ideals.

We present a new test for studying asphericity and diagrammatic reducibility of group presentations. Our test can be applied to prove diagrammatic reducibility in cases where the classical weight test fails. We use this criterion to generalize results of J. Howie and S.M. Gersten on asphericity of LOTs and of Adian presentations, and derive new results on solvability of equations over groups. We also use our methods to investigate a conjecture of S.V. Ivanov related to Kaplansky's problem on zero divisors: we strengthen Ivanov's result for locally indicable groups and prove a weak version of the conjecture.

Baumslag and Wiegold have recently proven that a finite group G is nilpotent if and only if o(xy) = o(x)o(y) for every x, y ∈ G with (o(x), o(y)) = 1. Motivated by this surprisingly new result, we have obtained related results that just consider sets of prime divisors of element orders. For instance, the first of our main results asserts that G is nilpotent if and only if π(o(xy)) = π(o(x)o(y)) for every x, y ∈ G of prime power order with (o(x), o(y)) = 1. As an immediate consequence, we recover the Baumslag–Wiegold Theorem. While this result is still elementary, we also obtain local versions that, for instance, characterize the existence of a normal Sylow p-subgroup in terms of sets of prime divisors of element orders. These results are deeper and our proofs rely on results that depend on the classification of finite simple groups.

We construct a linear system nonlocal game which can be played perfectly using a limit of finite-dimensional quantum strategies, but which cannot be played perfectly on any finite-dimensional Hilbert space, or even with any tensor-product strategy. In particular, this shows that the set of (tensor-product) quantum correlations is not closed. The constructed nonlocal game provides another counterexample to the ‘middle’ Tsirelson problem, with a shorter proof than our previous paper (though at the loss of the universal embedding theorem). We also show that it is undecidable to determine if a linear system game can be played perfectly with a finite-dimensional strategy, or a limit of finite-dimensional quantum strategies.

This paper explores the structure groups G(X,r) of finite non-degenerate set-theoretic solutions (X,r) to the Yang–Baxter equation. Namely, we construct a finite quotient $\overline {G}_{(X,r)}$ of G(X,r), generalizing the Coxeter-like groups introduced by Dehornoy for involutive solutions. This yields a finitary setting for testing injectivity: if X injects into G(X,r), then it also injects into $\overline {G}_{(X,r)}$. We shrink every solution to an injective one with the same structure group, and compute the rank of the abelianization of G(X,r). We show that multipermutation solutions are the only involutive solutions with diffuse structure groups; that only free abelian structure groups are bi-orderable; and that for the structure group of a self-distributive solution, the following conditions are equivalent: bi-orderable, left-orderable, abelian, free abelian and torsion free.

This paper provides some evidence for conjectural relations between extensions of (right) weak order on Coxeter groups, closure operators on root systems, and Bruhat order. The conjecture focused upon here refines an earlier question as to whether the set of initial sections of reflection orders, ordered by inclusion, forms a complete lattice. Meet and join in weak order are described in terms of a suitable closure operator. Galois connections are defined from the power set of $W$ to itself, under which maximal subgroups of certain groupoids correspond to certain complete meet subsemilattices of weak order. An analogue of weak order for standard parabolic subsets of any rank of the root system is defined, reducing to the usual weak order in rank zero, and having some analogous properties in rank one (and conjecturally in general).

We study the geometry of infinitely presented groups satisfying the small cancellation condition $C^{\prime }(1/8)$, and introduce a standard decomposition (called the criss-cross decomposition) for the elements of such groups. Our method yields a direct construction of a linearly independent set of power continuum in the kernel of the comparison map between the bounded and the usual group cohomology in degree 2, without the use of free subgroups and extensions.

A space X is said to be Lipschitz 1-connected if every Lipschitz loop 𝛾 : S1 → X bounds a O (Lip(𝛾))-Lipschitz disk f : D2 → X. A Lipschitz 1-connected space admits a quadratic isoperimetric inequality, but it is unknown whether the converse is true. Cornulier and Tessera showed that certain solvable Lie groups have quadratic isoperimetric inequalities, and we extend their result to show that these groups are Lipschitz 1-connected.

In this paper, we complete the ADE-like classification of simple transitive 2-representations of Soergel bimodules in finite dihedral type, under the assumption of gradeability. In particular, we use bipartite graphs and zigzag algebras of ADE type to give an explicit construction of a graded (non-strict) version of all these 2-representations.

Moreover, we give simple combinatorial criteria for when two such 2-representations are equivalent and for when their Grothendieck groups give rise to isomorphic representations.

Finally, our construction also gives a large class of simple transitive 2-representations in infinite dihedral type for general bipartite graphs.

In this paper we construct an abelian category of mixed perverse sheaves attached to any realization of a Coxeter group, in terms of the associated Elias–Williamson diagrammatic category. This construction extends previous work of the first two authors, where we worked with parity complexes instead of diagrams, and we extend most of the properties known in this case to the general setting. As an application we prove that the split Grothendieck group of the Elias–Williamson diagrammatic category is isomorphic to the corresponding Hecke algebra, for any choice of realization.

For a centre-by-metabelian pro-$p$ group $G$ of type $\text{FP}_{2m}$, for some $m\geqslant 1$, we show that $\sup _{M\in {\mathcal{A}}}$ rk $H_{i}(M,\mathbb{Z}_{p})<\infty$, for all $0\leqslant i\leqslant m$, where ${\mathcal{A}}$ is the set of all subgroups of $p$-power index in $G$ and, for a finitely generated abelian pro-$p$ group $V$, rk $V=\dim V\otimes _{\mathbb{Z}_{p}}\mathbb{Q}_{p}$.

This paper provides short proofs of two fundamental theorems of finite semigroup theory whose previous proofs were significantly longer, namely the two-sided Krohn-Rhodes decomposition theorem and Henckell’s aperiodic pointlike theorem. We use a new algebraic technique that we call the merge decomposition. A prototypical application of this technique decomposes a semigroup $T$ into a two-sided semidirect product whose components are built from two subsemigroups $T_{1}$, $T_{2}$, which together generate $T$, and the subsemigroup generated by their setwise product $T_{1}T_{2}$. In this sense we decompose $T$ by merging the subsemigroups $T_{1}$ and $T_{2}$. More generally, our technique merges semigroup homomorphisms from free semigroups.

We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible isomorphism types for these ideals. Following up on that work, we now analyze the possible degrees of the elements in such regular sequences. For each case of our classification, we provide some criteria guaranteeing the existence of regular sequences in certain degrees.

The profinite completion of the fundamental group of a closed, orientable $3$-manifold determines the Kneser–Milnor decomposition. If $M$ is irreducible, then the profinite completion determines the Jaco–Shalen–Johannson decomposition of $M$.

A problem in representation theory of $p$-adic groups is the computation of the Casselman basis of Iwahori fixed vectors in the spherical principal series representations, which are dual to the intertwining integrals. We shall express the transition matrix $(m_{u,v})$ of the Casselman basis to another natural basis in terms of certain polynomials that are deformations of the Kazhdan–Lusztig R-polynomials. As an application we will obtain certain new functional equations for these transition matrices under the algebraic involution sending the residue cardinality $q$ to $q^{-1}$. We will also obtain a new proof of a surprising result of Nakasuji and Naruse that relates the matrix $(m_{u,v})$ to its inverse.

We prove that the monodromy group of a reduced irreducible square system of general polynomial equations equals the symmetric group. This is a natural first step towards the Galois theory of general systems of polynomial equations, because arbitrary systems split into reduced irreducible ones upon monomial changes of variables. In particular, our result proves the multivariate version of the Abel–Ruffini theorem: the classification of general systems of equations solvable by radicals reduces to the classification of lattice polytopes of mixed volume 4 (which we prove to be finite in every dimension). We also notice that the monodromy of every general system of equations is either symmetric or imprimitive. The proof is based on a new result of independent importance regarding dual defectiveness of systems of equations: the discriminant of a reduced irreducible square system of general polynomial equations is a hypersurface unless the system is linear up to a monomial change of variables.

Let C be a set of positive integers. In this paper, we obtain an algorithm for computing all subsets A of positive integers which are minimals with the condition that if x1 + … + xn is a partition of an element in C, then at least a summand of this partition belongs to A. We use techniques of numerical semigroups to solve this problem because it is equivalent to give an algorithm that allows us to compute all the numerical semigroups which are maximals with the condition that has an empty intersection with the set C.