English
Related papers

Related papers: Optimal line packings from nonabelian groups

200 papers

Semi-direct products of finite groups have permutation representations that are constructed from the permutation representations of their constituents. One can envision these in a metaphoric sense in which a rope is made from a bundle of…

Geometric Topology · Mathematics 2022-04-25 Yongju Bae , J. Scott Carter , Byeorhi Kim

Methods from additive number theory are applied to construct families of finitely generated linear semigroups with intermediate growth.

Group Theory · Mathematics 2007-05-23 Melvyn B. Nathanson

We study a family of Zariski dense finitely generated discrete subgroups of $\mathrm{Isom}(\mathbb{H}^d)$, $d \geqslant 2$, defined by the following property: any group in this family contains at least one reflection in a hyperplane. As an…

Group Theory · Mathematics 2024-01-18 Nikolay Bogachev , Alexander Kolpakov

We consider Heisenberg groups equipped with a sub-Finsler metric. Using methods of optimal control theory we prove that in this geometric setting the infinite geodesics are horizontal lines under the assumption that the sub-Finsler metric…

Differential Geometry · Mathematics 2018-07-30 Z. M. Balogh , A. Calogero

Totally symmetric self-complementary plane partitions (TSSCPPs) are boxed plane partitions with the maximum possible symmetry. We use the well-known representation of TSSCPPs as a dimer model on a honeycomb graph enclosed in one-twelfth of…

Probability · Mathematics 2021-11-01 Arvind Ayyer , Sunil Chhita

For nearly a century, mathematicians have been developing techniques for constructing abelian automorphism groups of combinatorial objects, and, conversely, constructing combinatorial objects from abelian groups. While abelian groups are a…

Combinatorics · Mathematics 2024-07-29 Eric Swartz , James A. Davis , John Polhill , Ken W. Smith

We obtain an effective enumeration of the family of finitely generated groups admitting a faithful, properly discontinuous action on some 2-manifold contained in the sphere. This is achieved by introducing a type of group presentation…

Combinatorics · Mathematics 2019-01-04 Agelos Georgakopoulos , Matthias Hamann

We investigate the saturation rank of a finite group scheme, defined over an algebraically closed field $\Bk$ of positive characteristic $p$. We begin by exploring the saturation rank for finite groups and infinitesimal group schemes.…

Representation Theory · Mathematics 2017-01-12 Yang Pan

We investigate braid group representations associated with unitary braided vector spaces, focusing on a conjecture that such representations should have virtually abelian images in general and finite image provided the braiding has finite…

Quantum Algebra · Mathematics 2015-06-18 César Galindo , Eric C. Rowell

We develop the theory of $H$-graded manifolds for any finitely generated abelian group, using tools from representation theory. Furthermore, we introduce and investigate the notion of $H$-graded coverings of supermanifolds in the case where…

Differential Geometry · Mathematics 2025-11-24 Fernando A. Z. Santamaria , Elizaveta Vishnyakova

Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…

Numerical Analysis · Mathematics 2024-11-15 Andrew Horning , Adam R. Gerlach

We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…

Group Theory · Mathematics 2021-10-01 A. S. Detinko , D. L. Flannery

A packing of partial difference sets is a collection of disjoint partial difference sets in a finite group $G$. This configuration has received considerable attention in design theory, finite geometry, coding theory, and graph theory over…

Combinatorics · Mathematics 2021-09-22 Jonathan Jedwab , Shuxing Li

Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for…

Data Structures and Algorithms · Computer Science 2007-05-23 Sandor P. Fekete , Joerg Schepers

We prove that all finitely generated fully residually free groups (limit groups) have a sequence of finite dimensional unitary representations that `strongly converge' to the regular representation of the group. The corresponding statement…

Group Theory · Mathematics 2023-01-18 Larsen Louder , Michael Magee with Appendix by Will Hide , Michael Magee

This paper presents new research in infinitesimal algebra by introducing the concept of an infinitesimal group and exploring its properties and ramifications. The author investigates first- and second-order subgroups of Lie groups and…

Differential Geometry · Mathematics 2023-05-09 Filip Bár

Linear diagrams are an effective way to visualize set-based data by representing elements as columns and sets as rows with one or more horizontal line segments, whose vertical overlaps with other rows indicate set intersections and their…

Computational Geometry · Computer Science 2022-08-18 Alexander Dobler , Martin Nöllenburg

We define orbifold mapping class groups (with marked points) and study them using their action on certain orbifold analogs of arcs and simple closed curves. Moreover, we establish a Birman exact sequence for suitable subgroups of orbifold…

Geometric Topology · Mathematics 2023-05-09 Jonas Flechsig

Let $p$ be a prime number and suppose that every maximal subgroup of a finite group is either $p$-nilpotent or has prime index. Such group need not be $p$-solvable, and we study its structure by proving that only one nonabelian simple group…

Group Theory · Mathematics 2024-09-18 Antonio Beltrán , Changguo Shao

The group isomorphism problem asks whether two given groups are isomorphic or not. Whereas the case where both groups are abelian is well understood and can be solved efficiently, very little is known about the complexity of isomorphism…

Data Structures and Algorithms · Computer Science 2021-10-05 Francois Le Gall
‹ Prev 1 4 5 6 7 8 10 Next ›