English
Related papers

Related papers: Towards inductive proofs in algebraic combinatoric…

200 papers

An automorphism $\alpha$ of a group $G$ is called a commuting automorphism if each element $x$ in $G$ commutes with its image $\alpha(x)$ under $\alpha$. Let $A(G)$ denote the set of all commuting automorphisms of $G$. Rai [Proc. Japan…

Group Theory · Mathematics 2015-06-22 Sandeep Singh , Deepak Gumber

Inspired by the commutator and anticommutator algebras derived from algebras graded by groups, we introduce noncommutatively graded algebras. We generalize various classical graded results to the noncommutatively graded situation concerning…

Rings and Algebras · Mathematics 2017-11-01 Patrik Nystedt

We describe the automorphism groups of finite $p$-groups arising naturally via Hessian determinantal representations of elliptic curves defined over number fields. Moreover, we derive explicit formulas for the orders of these automorphism…

Group Theory · Mathematics 2023-09-25 Mima Stanojkovski , Christopher Voll

We develop some foundations of commutative algebra, with a view towards algebraic geometry, in symmetric tensor categories. Most results establish analogues of classical theorems, in tensor categories which admit a tensor functor to some…

Category Theory · Mathematics 2026-02-20 Kevin Coulembier

It is known that isomorphisms of graph Jacobians induce cyclic bijections on the associated graphs. We characterize when such cyclic bijections can be strengthened to graph isomorphisms, in terms of an easily computed divisor. The result…

Combinatorics · Mathematics 2023-07-25 Sarah Griffith

Inductive algebras for a compact group are self-adjoint

Functional Analysis · Mathematics 2022-11-24 Promod Sharma , M. K. Vemuri

The Johnson graph J(v,k) has, as vertices, the k-subsets of a v-set V, and as edges the pairs of k-subsets with intersection of size k-1. We introduce the notion of a neighbour-transitive code in J(v,k). This is a vertex subset \Gamma such…

Combinatorics · Mathematics 2013-11-04 Robert A. Liebler , Cheryl E. Praeger

We will consider P-graph complexes, where P is a cyclic operad. P-graph complexes are natural generalizations of Kontsevich's graph complexes -- for P = the operad for associative algebras it is the complex of ribbon graphs, for P = the…

Quantum Algebra · Mathematics 2016-09-07 Martin Markl

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

The problem of efficiently characterizing degree sequences of simple hypergraphs is a fundamental long-standing open problem in Graph Theory. Several results are known for restricted versions of this problem. This paper adds to the list of…

Discrete Mathematics · Computer Science 2017-05-02 Syed Mohammad Meesum

We extend the notion of induced conjugacy classes in reductive groups, introduced by Lusztig and Spaltenstein for unipotent classes, to arbitrary classes. We study properties of equivariant fibrations of prehomogeneous affine spaces,…

Group Theory · Mathematics 2013-01-07 Werner Hoffmann

Word-representable graphs, which are the same as semi-transitively orientable graphs, generalize several fundamental classes of graphs. In this paper we propose a novel approach to study word-representability of graphs using a technique of…

Combinatorics · Mathematics 2023-12-19 Sumin Huang , Sergey Kitaev , Artem Pyatkin

In the present paper, we show that many combinatorial and topological objects, such as maps, hypermaps, three-dimensional pavings, constellations and branched coverings of the two--sphere admit any given finite automorphism group. This…

Combinatorics · Mathematics 2020-01-16 Rémi Bottinelli , Laura Grave de Peralta , Alexander Kolpakov

Let $G$ be a finite $p$-group of order $p^5$, where $p$ is a prime. We give necessary and sufficient conditions on $G$ such that $G$ has a non-inner class-preserving automorphism. As a consequence, we give short and alternate proofs of…

Group Theory · Mathematics 2014-07-23 Mahak Sharma , Deepak Gumber

The class of word-representable graphs, introduced in connection with the study of the Perkins semigroup by Kitaev and Seif, has attracted significant attention in combinatorics and theoretical computer science due to its deep connections…

Combinatorics · Mathematics 2025-12-16 Eshwar Srinivasan , Ramesh Hariharasubramanian

We develop a theory of $p$-adic automorphic forms on unitary groups that allows $p$-adic interpolation in families and holds for all primes $p$ that do not ramify in the reflex field $E$ of the associated unitary Shimura variety. If the…

Number Theory · Mathematics 2021-02-04 E. Eischen , E. Mantovan

We classify non-complete prime valency graphs satisfying the property that their automorphism group is transitive on both the set of arcs and the set of $2$-geodesics. We prove that either $\Gamma$ is 2-arc transitive or the valency $p$…

Combinatorics · Mathematics 2015-04-20 Alice Devillers , Wei Jin , Cai Heng Li , Cheryl E. Praeger

!-graphs provide a means of reasoning about infinite families of string diagrams and have proven useful in manipulation of (co)algebraic structures like Hopf algebras, Frobenius algebras, and compositions thereof. However, they have…

Logic in Computer Science · Computer Science 2015-03-05 Aleks Kissinger , David Quick

We show that if the Sylow $p$-subgroup of a finite group $G$ is of order $p$, then the normalized unit group of the integral group ring of $G$ contains a normalized unit of order $pq$ if and only if $G$ contains an element of order $pq$,…

Group Theory · Mathematics 2021-01-06 Mauricio Caicedo , Leo Margolis

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