Related papers: Windmills and extreme 2-cells

We study finitely generated pairs of groups $H \leq G$ such that the Schreier graph of $H$ has at least two ends and is \emph{narrow}. Examples of narrow Schreier graphs include those that are quasi-isometric to finitely ended trees or have…

Symmetry invariants of a group specify the classes of quasiparticles, namely the classes of projective irreducible co-representations in systems having that symmetry. More symmetry invariants exist in discrete point groups than the full…

We consider control-linear left-invariant time-optimal problems on step 2 Carnot groups with strictly convex set of control parameters (in particular, sub-Finsler problems). We describe all linear-in-momenta Casimirs on the dual of the Lie…

Let $G$ be a classical algebraic group, $X$ a maximal rank reductive subgroup and $P$ a parabolic subgroup. This paper classifies when $X\G/P$ is finite. Finiteness is proven using geometric arguments about the action of $X$ on subspaces of…

In a graph, $k$ cycles are {\em admissible} if their lengths form an arithmetic progression with common difference one or two. Let $G$ be a 2-connected graph with minimum degree at least $k\geqslant 4$. We prove that \begin{itemize} \item…

Developing an idea of Kapranov and Voevodsky, we introduce a model of weak omega-categories based on directed complexes, combinatorial presentations of pasting diagrams. We propose this as a convenient framework for higher-dimensional…

We introduce a class of cycles, called nondegenerate, strictly decomposable cycles, and show that the image of each cycle in this class under the refined cycle map to an extension group in the derived category of arithmetic mixed Hodge…

Applying geometric methods of $2$-dimensional cell complex theory, we construct a Galois covering of a bimodule problem satisfying some structure, triangularity and finiteness conditions in order to describe the objects of finite…

We study quasi-cyclic codes of index 2 over finite fields. We give a classification of such codes. Their duals with respect to the Euclidean, symplectic and Hermitian inner products are investigated. We describe self-orthogonal and…

Dirac proved that any graph with minimum vertex degree $\delta$ contains either a cycle of length at least $2\delta$ or a Hamilton cycle. Motivated by this result, we characterize those graphs having no cycle longer than $2\delta$.

New exact modular branching rules are obtained for modules over the symmetric groups that are close to completely splittable modules. These results are based on some upper bounds for the Ext^1-spaces between simple modules.

We introduce and study "2-roots", which are symmetrized tensor products of orthogonal roots of Kac--Moody algebras. We concentrate on the case where $W$ is the Weyl group of a simply laced Y-shaped Dynkin diagram $Y_{a,b,c}$ having $n$…

We present new data structures for quasistrict higher categories, in which associativity and unit laws hold strictly. Our approach has low axiomatic complexity compared to traditional algebraic definitions of higher categories, and we use…

This expository article revolves around the question to find short presentations of finite simple groups. This subject is one of the most active research areas of group theory in recent times. We bring together several known results on…

A graph is diameter-2-critical if its diameter is 2 but the removal of any edge increases the diameter. A well-studied conjecture, known as the Murty-Simon conjecture, states that any diameter-2-critical graph of order n has at most…

We show that many $2$-dimensional Artin groups are residually finite. This includes $3$-generator Artin groups with labels $\geq 4$ except for $(2m+1, 4,4)$ for any $m\geq 2$. As a first step towards residual finiteness we show that these…

We study the low energy behaviour of N=(2,2) supersymmetric gauge theories in 1+1 dimensions, with orthogonal and symplectic gauge groups and matters in the fundamental representation. We observe supersymmetry breaking in super-Yang-Mills…

In this paper, we prove a tight minimum degree condition in general graphs for the existence of paths between two given endpoints, whose lengths form a long arithmetic progression with common difference one or two. This allows us to obtain…

We prove the dichotomy that every Coxeter group either has a strongly solid group von Neumann algebra or contains the product of an infinite cyclic group and a free group of rank 2. This generalizes the same dichotomy for right-angled…

In this note, we show that among finite nilpotent groups of a given order or finite groups of a given odd order, the cyclic group of that order has the minimum number of edges in its cyclic subgroup graph. We also conjecture that this holds…