English
Related papers

Related papers: String C-groups of 2-power order project onto a co…

200 papers

A certain family of orthogonal groups (called "Clifford groups" by G. E. Wall) has arisen in a variety of different contexts in recent years. These groups have a simple definition as the automorphism groups of certain generalized…

Combinatorics · Mathematics 2007-07-16 G. Nebe , E. M. Rains , N. J. A. Sloane

A partial automorphism of a semigroup $S$ is any isomorphism between its subsemigroups, and the set all partial automorphisms of $S$ with respect to composition is the inverse monoid called the partial automorphism monoid of $S$. Two…

Rings and Algebras · Mathematics 2011-07-26 Simon M. Goberstein

We define a certain merging operation that given two $d$-polytopes $P$ and $Q$ such that $P$ has a simplex facet $F$ and $Q$ has a simple vertex $v$ produces a new $d$-polytope $P\hspace{0.1em}\triangleright Q$ with $f_0(P)+f_0(Q)-(d+1)$…

Combinatorics · Mathematics 2023-05-04 Isabella Novik , Hailun Zheng

Let $D \subseteq A$ be a quasi-Cartan pair of algebras. Then there exists a unique discrete groupoid twist $\Sigma \to G$ whose twisted Steinberg algebra is isomorphic to $A$ in a way that preserves $D$. In this paper, we show there is a…

Rings and Algebras · Mathematics 2024-11-26 Jonathan H. Brown , Lisa Orloff Clark , Adam H. Fuller

A finite group $G$ is called a DCI-group if two Cayley digraphs over $G$ are isomorphic if and only if their connection sets are conjugate by a group automorphism. We prove that the group $C_4\times C_p^2$, where $p$ is a prime, is a…

Combinatorics · Mathematics 2021-05-26 Grigory Ryabov

We further develop Weber's notion of elementary 2-topos by proposing certain new axioms. We show that in a 2-category C satisfying these axioms, the "discrete opfibration (DOF) classifier" S is always an internal elementary 1-topos, in an…

Category Theory · Mathematics 2024-07-30 Joseph Helfer

We show that almost all circulant graphs have automorphism groups as small as possible. Of the circulant graphs that do not have automorphism group as small as possible, we give some families of integers such that it is not true that almost…

Combinatorics · Mathematics 2012-03-06 Soumya Bhoumik , Edward Dobson , Joy Morris

We derive the codimension-two defects of 4d $\mathcal{N} = 4$ Super Yang-Mills (SYM) theory from the (2, 0) little string. The origin of the little string is type IIB theory compactified on an ADE singularity. The defects are D-branes…

High Energy Physics - Theory · Physics 2024-10-01 Nathan Haouzi , Christian Schmid

Many common finite p-groups admit automorphisms of order coprime to p, and when p is odd, it is reasonably difficult to find finite p-groups whose automorphism group is a p-group. Yet the goal of this paper is to prove that the automorphism…

Group Theory · Mathematics 2013-05-09 Geir T. Helleloid , Ursula Martin

Symmetric edge polytopes are a recent and well-studied family of centrally symmetric polytopes arising from graphs. In this paper, we introduce a generalization of this family to arbitrary simplicial complexes. We show how topological…

Combinatorics · Mathematics 2026-02-20 Torben Donzelmann , Thiago Holleben , Martina Juhnke

The power graph of a group is the graph whose vertex set is the set of nontrivial elements of group, two elements being adjacent if one is a power of the other. We introduce some way for find the automorphism groups of some graphs. As an…

Group Theory · Mathematics 2019-02-15 Sayyed Heidar Jafari

Let $d$ be a positive integer. A finite group is called $d$-maximal if it can be generated by precisely $d$ elements, while its proper subgroups have smaller generating sets. For $d\in\{1,2\}$, the $d$-maximal groups have been classified up…

Group Theory · Mathematics 2025-02-07 Andrea Lucchini , Luca Sabatini , Mima Stanojkovski

New continuous group transforms, together with their discretization over a lattice of any density and admissible symmetry, are defined for a general compact simple Lie groups of rank $2\leq n<\infty$. Rank 1 transforms are known. Rank 2…

Mathematical Physics · Physics 2008-04-24 Jiri Patera

We give a rank augmentation technique for rank 3 string C-group representations of the symmetric group $S_n$ and list the hypotheses under which it yields a valid string C-group representation of rank 4 thereof.

Group Theory · Mathematics 2022-12-27 Julie De Saedeleer , Dimitri Leemans , Jessica Mulpas

We prove a dichotomy for $D$-rank 1 types in simple theories that generalizes Buechler's dichotomy for $D$-rank 1 minimal types in stable theories: every $D$-rank 1 type is either 1-based or part of its algebraic closure, defined by a…

Logic · Mathematics 2019-09-20 Ziv Shami

We consider symmetric d-linear forms of dimension n over an algebraically closed field k of characteristic 0. The "center" of a form is the analogous of the space of symmetric matrices of a bilinear form. For d>2 the center is a commutative…

Representation Theory · Mathematics 2008-09-29 M. O'Ryan , S. Ryom-Hansen

The distinguishing number $D(\Gamma)$ of a graph $\Gamma$ is the least size of a partition of the vertices of $\Gamma$ such that no non-trivial automorphism of $\Gamma$ preserves this partition. We show that if the automorphism group of a…

Combinatorics · Mathematics 2020-06-16 Mariusz Grech , Andrzej Kisielewicz

We introduce a class of good endofunctors of $C^{*}$-algebras, endow it with a structure of a bimonoidal category, and define homotopies of natural transformations between such endofunctors. For every pair of $C^{*}$-algebras and a good…

Operator Algebras · Mathematics 2025-09-03 Georgii S. Makeev

A stacking operation adds a $d$-simplex on top of a facet of a simplicial $d$-polytope while maintaining the convexity of the polytope. A stacked $d$-polytope is a polytope that is obtained from a $d$-simplex and a series of stacking…

Computational Geometry · Computer Science 2017-03-03 Erik D. Demaine , Andre Schulz

For a finite point set $P \subset \mathbb{R}^d$, denote by $\text{diam}(P)$ the ratio of the largest to the smallest distances between pairs of points in $P$. Let $c_{d, \alpha}(n)$ be the largest integer $c$ such that any $n$-point set $P…

Combinatorics · Mathematics 2025-01-30 Boris Bukh , Zichao Dong