相关论文: A recursive description of automorphism groups of …

Bergman has given the following abstract characterisation of the inner automorphisms of a group $G$: they are exactly those automorphisms of $G$ which can be extended functorially along any homomorphism $G \rightarrow H$ to an automorphism…

We prove that every finite group is the automorphism group of a finite abstract polytope isomorphic to a face-to-face tessellation of a sphere by topological copies of convex polytopes. We also show that this abstract polytope may be…

Given two convex polytopes, the join, the cartesian product and the direct sum of them are well understood. In this paper we extend these three kinds of products to abstract polytopes and introduce a new product, called the topological…

We describe a provably complete algorithm for the generation of a tight, possibly exact superset of all combinatorially distinct simple n-facet polytopes in R^d, along with their graphs, f-vectors, and face lattices. The technique applies…

We derive a formula connecting the orders of the automorphism groups of a finite group and of its covering groups.

A factorization formula for certain automorphisms of a Poisson algebra associated to a quiver is proved, which involves framed versions of moduli spaces of quiver representations. This factorization formula is related to wall-crossing…

The unique prime factorization theorem is used to show the existence of a function on a countable set $\mathcal{X}$ so that the sum aggregator function is injective on all multisets of $\mathcal{X}$ of finite size.

Using a unified method, we determine the structure of automorphisms and representations of arbitrary polyadic groups. More precisely, for a polyadic group $(G, f)=der_{\theta, b}(G, \cdot)$, we obtain a complete description of automorphisms…

We present a new algorithm to compute all the chiral polytopes that have a given group $G$ as full automorphism group. This algorithm uses a new set of generators that characterize the group, all of them except one being involutions. It…

For a wide class of groups including polycyclic and finitely generated polynomial growth groups it is proved that the Reidemeister number of an automorphism f is equal to the number of finite-dimensional fixed points of the induced map f^…

It is proved that the generalized cluster complex defined by Fomin and Reading has a dihedral symmetry. Together with diagram symmetries, they generate its automorphism group. A consequence is a simple explicit formula for the order of this…

Let us consider a polynomial algebra in three variables equipped with an integer grading. We construct a system of group-generating automorphisms that preserve a given grading.

Using the theory of group action, we first introduce the concept of the automorphism group of an exponential family or a graphical model, thus formalizing the general notion of symmetry of a probabilistic model. This automorphism group…

Gaussian unitaries, generated by quadratic Hamiltonians, are fundamental in quantum optics and continuous-variable computing. Their structures correspond to symplectic (bosons) and orthogonal (fermions) groups, but physical realizations…

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Let $I(X,R)$ be the incidence algebra of the preordered set $X$ over the ring $R$. In the case of a finite connected partially ordered set $X$, we prove that the subgroup of inner multiplicative automorphisms is a direct factor of the group…

We describe the automorphism groups of elliptic Poisson algebras on polynomial algebras in three variables and give an explicit set of generators and defining relations for this group.

Let $K$ be a field and $f:\mathbb{P}^N \to \mathbb{P}^N$ a morphism. There is a natural conjugation action on the space of such morphisms by elements of the projective linear group $\text{PGL}_{N+1}$. The group of automorphisms, or…

In this article, we give an elementary combinatorial proof of a conjecture about the determination of automorphism group of the power graph of finite cyclic groups, proposed by Doostabadi, Erfanian and Jafarzadeh in 2013.

In this paper, we discuss a group-theoretical generalization of the well-known Gauss formula involving the functionthat counts the number of automorphisms of a finite group. This gives several characterizations of finite cyclic groups.