English
Related papers

Related papers: Linear groupoids and the associated wreath product…

200 papers

A smooth cuboid can be identified with a $3\times 3$ matrix of linear forms, with coefficients in a field $K$, whose determinant describes a smooth cubic in the projective plane. To each such matrix one can associate a group scheme over…

Group Theory · Mathematics 2025-04-23 Joshua Maglione , Mima Stanojkovski

We introduce a notion of metric on a Lie groupoid, compatible with multiplication, and we study its properties. We show that many families of Lie groupoids admit such metrics, including the important class of proper Lie groupoids. The…

Differential Geometry · Mathematics 2018-04-03 Matias L. del Hoyo , Rui Loja Fernandes

S. Bigelow proved that the braid groups are linear. That is, there is a faithful representation of the braid group into the general linear group of some field. Using this, we deduce from previously known results that the mapping class group…

Geometric Topology · Mathematics 2007-05-23 Mustafa Korkmaz

Consider any sequence of finite groups $A^t$, where $t$ takes values in an integer index set $\mathbf{Z}$. A group system $A$ is a set of sequences with components in $A^t$ that forms a group under componentwise addition in $A^t$, for each…

Information Theory · Computer Science 2021-10-28 Kenneth M. Mackenthun

We show that planar graphs have bounded queue-number, thus proving a conjecture of Heath, Leighton and Rosenberg from 1992. The key to the proof is a new structural tool called layered partitions, and the result that every planar graph has…

Discrete Mathematics · Computer Science 2020-08-11 Vida Dujmović , Gwenaël Joret , Piotr Micek , Pat Morin , Torsten Ueckerdt , David R. Wood

We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…

Mathematical Physics · Physics 2021-05-12 Byung Hee An , Tomasz Maciazek

For some $k \in \mathbb{Z}_{\geq 0}\cup \infty$, we call a linear forest $k$-bounded if each of its components has at most $k$ edges. We will say a $(k,\ell)$-bounded linear forest decomposition of a graph $G$ is a partition of $E(G)$ into…

Combinatorics · Mathematics 2023-01-30 Rutger Campbell , Florian Hörsch , Benjamin Moore

A character identity which relates irreducible character values of the hyperoctahedral group $B_n$ to those of the symmetric group $S_{2n}$ was recently proved by L\"ubeck and Prasad. Their proof is algebraic and involves Lie theory. We…

Representation Theory · Mathematics 2022-06-17 Ron M. Adin , Yuval Roichman

A linear group is called unisingular if every element of it has eigenvalue 1. A certain aspect of the theory of abelian varieties requires the knowledge of unisingular irreducible subgroups of the symplectic groups over the field of two…

Group Theory · Mathematics 2024-01-30 Alexandre Zalesski

We consider finite sequences $s\in D^n$ where $D$ is a commutative, unital, integral domain. We prove three sets of identities (possibly with repetitions), each involving $2n$ polynomials associated to $s$. The right-hand side of these…

Information Theory · Computer Science 2010-09-14 Graham H. Norton

A variety is a class of algebraic structures axiomatized by a set of equations. An equation is linear if there is at most one occurrence of an operation symbol on each side. We show that a variety axiomatized by linear equations has the…

Logic · Mathematics 2024-08-28 Paolo Lipparini

The Linearization Theorem for proper Lie groupoids organizes and generalizes several results for classic geometries. Despite the various approaches and recent works on the subject, the problem of understanding invariant linearization…

Differential Geometry · Mathematics 2021-08-20 Matias del Hoyo , Mateus de Melo

For the first time we represent every finite group in the form of a graph in this book. The authors choose to call these graphs as identity graph, since the main role in obtaining the graph is played by the identity element of the group.…

General Mathematics · Mathematics 2009-06-30 W. B. Vasantha Kandasamy , Florentin Smarandache

The main objective of this work is to study mathematical properties of computational paths. Originally proposed by de Queiroz \& Gabbay (1994) as `sequences or rewrites', computational paths are taken to be terms of the identity type of…

Logic in Computer Science · Computer Science 2016-09-09 Arthur F. Ramos , Ruy J. G. B. de Queiroz , Anjolina G. de Oliveira

Presentations of categories are a well-known algebraic tool to provide descriptions of categories by means of generators, for objects and morphisms, and relations on morphisms. We generalize here this notion, in order to consider situations…

Logic in Computer Science · Computer Science 2019-03-14 Pierre-Louis Curien , Samuel Mimram

In a previous work [11], the author considered a representation of the braid group \rho: B_n\to GL_m(\Bbb Z[q^{\pm 1},t^{\pm 1}]) (m=n(n-1)/2), and proved it to be faithful for n=4. Bigelow [3] then proved the same representation to be…

Group Theory · Mathematics 2007-05-23 Daan Krammer

Consider the generalized iterated wreath product $\mathbb{Z}_{r_1}\wr \mathbb{Z}_{r_2}\wr \ldots \wr \mathbb{Z}_{r_k}$ where $r_i \in \mathbb{N}$. We prove that the irreducible representations for this class of groups are indexed by a…

Representation Theory · Mathematics 2018-09-11 Mee Seong Im , Angela Wu

We give a geometric proof based on recent work of Eskin, Fisher and Whyte that the lamplighter group $L_n$ has infinitely many twisted conjugacy classes for any automorphism $\vp$ only when $n$ is divisible by 2 or 3, originally proved by…

Group Theory · Mathematics 2011-05-11 Jennifer Taback , Peter Wong

We consider semigroup algorithmic problems in the wreath product $\mathbb{Z} \wr \mathbb{Z}$. Our paper focuses on two decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain the…

Group Theory · Mathematics 2023-06-22 Ruiwen Dong

We show that MIF (mixed-identity-free) linear groups are sharply MIF and linearly MIF. Along the way we provide a self contained proof of the strong approximation theorem, and a new (probabilistic) variant of the super approximation…

Group Theory · Mathematics 2025-10-07 Nir Avni , Tsachik Gelander