Graph Coverings for Investigating Non Local Structures in Proteins, Music and Poems

We explore the structural similarities in three different languages, first in the protein language whose primary letters are the amino acids, second in the musical language whose primary letters are the notes, and third in the poetry language whose primary letters are the alphabet. For proteins, the non local (secondary) letters are the types of foldings in space (α-helices, β-sheets, etc.); for music, one is dealing with clear-cut repetition units called musical forms and for poems the structure consists of grammatical forms (names, verbs, etc.). We show in this paper that the mathematics of such secondary structures relies on finitely presented groups fp on r letters, where r counts the number of types of such secondary non local segments. The number of conjugacy classes of a given index (also the number of graph coverings over a base graph) of a group fp is found to be close to the number of conjugacy classes of the same index in the free group Fr−1 on r−1 generators. In a concrete way, we explore the group structure of a variant of the SARS-Cov-2 spike protein and the group structure of apolipoprotein-H, passing from the primary code with amino acids to the secondary structure organizing the foldings. Then, we look at the musical forms employed in the classical and contemporary periods. Finally, we investigate in much detail the group structure of a small poem in prose by Charles Baudelaire and that of the Bateau Ivre by Arthur Rimbaud.

Normal subgroups of SimpHAtic groups

A group is SimpHAtic if it acts geometrically on a simply connected simplicially hereditarily aspherical (SimpHAtic) complex. We show that finitely presented normal subgroups of the SimpHAtic groups are either: finite, or of finite index, or virtually free. This result applies, in particular, to normal subgroups of systolic groups. We prove similar strong restrictions on group extensions for other classes of asymptotically aspherical groups. The proof relies on studying homotopy types at infinity of groups in question. We also show that non-uniform lattices in SimpHAtic complexes (and in more general complexes) are not finitely presentable and that finitely presented groups acting properly on such complexes act geometrically on SimpHAtic complexes. In Appendix we present the topological two-dimensional quasi-Helly property of systolic complexes.

Relations between Control Mechanisms for Sequential Grammars1

We extend and refine previous results within the general framework for regulated rewriting based on the applicability of rules in sequential grammars [3]. Besides the well-known control mechanisms as control graphs, matrices, permitting and forbidden rules, partial order on rules, and priority relations on rules we also consider the new variant of activation and blocking of rules as investigated in [1, 2, 4]. Moreover, we exhibit special results for strings and multisets as well as for arrays in the general variant defined on Cayley grids of finitely presented groups. Especially we prove that array grammars defined on Cayley grids of finitely presented groups using #-context-free array productions together with control mechanisms as control graphs, matrices, permitting and forbidden rules, partial order on rules, priority relations on rules, or activation and blocking of rules have the same computational power as such array grammars using arbitrary array productions.

A three-player coherent state embezzlement game

We introduce a three-player nonlocal game, with a finite number of classical questions and answers, such that the optimal success probability of 1 in the game can only be achieved in the limit of strategies using arbitrarily high-dimensional entangled states. Precisely, there exists a constant 0<c≤1 such that to succeed with probability 1−ε in the game it is necessary to use an entangled state of at least Ω(ε−c) qubits, and it is sufficient to use a state of at most O(ε−1) qubits. The game is based on the coherent state exchange game of Leung et al.\ (CJTCS 2013). In our game, the task of the quantum verifier is delegated to a third player by a classical referee. Our results complement those of Slofstra (arXiv:1703.08618) and Dykema et al.\ (arXiv:1709.05032), who obtained two-player games with similar (though quantitatively weaker) properties based on the representation theory of finitely presented groups and C∗-algebras respectively.

Density of Metric Small Cancellation in Finitely Presented Groups

Small cancellation groups form an interesting class with many desirable properties. It is a well-known fact that small cancellation groups are generic; however, all previously known results of their genericity are asymptotic and provide no information about "small" group presentations. In this note, we give closed-form formulas for both lower and upper bounds on the density of small cancellation presentations, and compare our results with experimental data. Comment: 18 pages, 12 figures

A periodicity theorem for acylindrically hyperbolic groups

We generalize a well-known periodicity lemma from the case of free groups to the case of acylindrically hyperbolic groups. This generalization has been used to describe solutions of certain equations in acylindrically hyperbolic groups and to characterize verbally closed finitely generated acylindrically hyperbolic subgroups of finitely presented groups.

A two-player dimension witness based on embezzlement, and an elementary proof of the non-closure of the set of quantum correlations

We describe a two-player non-local game, with a fixed small number of questions and answers, such that an ϵ-close to optimal strategy requires an entangled state of dimension 2Ω(ϵ−1/8). Our non-local game is inspired by the three-player non-local game of Ji, Leung and Vidick \cite{ji2018three}. It reduces the number of players from three to two, as well as the question and answer set sizes. Moreover, it provides an (arguably) elementary proof of the non-closure of the set of quantum correlations, based on embezzlement and self-testing. In contrast, previous proofs \cite{slofstra2019set, dykema2017non, musat2018non} involved representation theoretic machinery for finitely-presented groups and C∗-algebras.

STABILITY, COHOMOLOGY VANISHING, AND NONAPPROXIMABLE GROUPS

Several well-known open questions (such as: are all groups sofic/hyperlinear?) have a common form: can all groups be approximated by asymptotic homomorphisms into the symmetric groups $\text{Sym}(n)$ (in the sofic case) or the finite-dimensional unitary groups $\text{U}(n)$ (in the hyperlinear case)? In the case of $\text{U}(n)$ , the question can be asked with respect to different metrics and norms. This paper answers, for the first time, one of these versions, showing that there exist finitely presented groups which are not approximated by $\text{U}(n)$ with respect to the Frobenius norm $\Vert T\Vert _{\text{Frob}}=\sqrt{\sum _{i,j=1}^{n}|T_{ij}|^{2}},T=[T_{ij}]_{i,j=1}^{n}\in \text{M}_{n}(\mathbb{C})$ . Our strategy is to show that some higher dimensional cohomology vanishing phenomena implies stability, that is, every Frobenius-approximate homomorphism into finite-dimensional unitary groups is close to an actual homomorphism. This is combined with existence results of certain nonresidually finite central extensions of lattices in some simple $p$ -adic Lie groups. These groups act on high-rank Bruhat–Tits buildings and satisfy the needed vanishing cohomology phenomenon and are thus stable and not Frobenius-approximated.