相关论文: On the automorphisms of designs constructed from f…

This paper focuses on the derivations and automorphism groups of certain finite-dimensional associative algebras over the field of complex numbers. Using classification results for algebras of dimensions two, three, and four, along with…

In this article we study the automorphism groups of binary cyclic codes. In particular, we provide explicit constructions for codes whose automorphism groups can be described as (a) direct products of two symmetric groups or (b) iterated…

We introduce a general method to count unlabeled combinatorial structures and to efficiently generate them at random. The approach is based on pointing unlabeled structures in an "unbiased" way that a structure of size n gives rise to n…

This is a survey on the automorphism groups in various classes of affine algebraic surfaces and the algebraic group actions on such surfaces. Being infinite-dimensional, these automorphism groups share some important features of algebraic…

We consider an experimental design problem for permutations: given a fixed set $X$, and an integer $t$, construct a list $L$ of permutations of $X$ such that every ordered $t$-tuple of distinct elements of $X$ occurs as a consecutive…

We show how to count and randomly generate finitely generated subgroups of the modular group $\textsf{PSL}(2,\mathbb{Z})$ of a given isomorphism type. We also prove that almost malnormality and non-parabolicity are negligible properties for…

Combinatorial $t$-designs have nice applications in coding theory, finite geometries and several engineering areas. There are two major methods of constructing $t$-designs. One of them is via group actions of certain permutation groups…

In this paper, we construct explicitely polynomial automorphisms of affine n-space for certain n. More precisely, we construct algebraic subgroups of the general polynomial group GA_n(k) where k is an arbitrary base ring of characteristic…

We start by introducing the basics of configurations of points and lines, and then move into discussing symmetry groups of these configurations. Specifically, we explore how we might classify the symmetries of $(9_3)$ and $(10_3)$ geometric…

We show that the automorphism groups of countably categorical linear orders are extremely amenable. Using methods of Kechris, Pestov, and Todorcevic, we use this fact to derive a structural Ramsey theorem for certain families of finite…

In this paper, we deal with stable homology computations with twisted coefficients for mapping class groups of surfaces and of 3-manifolds, automorphism groups of free groups with boundaries and automorphism groups of certain right-angled…

We determine the automorphism group for some well known constructions of finite semifields. In particular, we compute the automorphism group of Sandler's semifields and in certain cases the automorphism groups of the Hughes-Kleinfeld and…

A point set $\mathrm X_N$ on the unit sphere is a spherical $t$-design is equivalent to the nonnegative quantity $A_{N,t+1}$ vanished. We show that if $\mathrm X_N$ is a stationary point set of $A_{N,t+1}$ and the minimal singular value of…

In earlier work we initiated a program to study relationships between finite groups and arithmetic geometric invariants of modular curves in a systematic way. In the present work we continue this program, with a focus on the two smallest…

We classify finite groups acting by birational transformations of a non-trivial Severi--Brauer surface over a field of characteristc zero that are not conjugate to subgroups of the automorphism group. Also, we show that the automorphism…

In this note we prove that every finite collection of connected algebraic subgroups of the group of triangular automorphisms of the affine space generates a connected solvable algebraic subgroup.

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…

We show that the only random orderings of finite graphs that are invariant under isomorphism and induced subgraph are the uniform random orderings. We show how this implies the unique ergodicity of the automorphism group of the random…

We study domains in complex $n$-space with automorphism group that does not depend on the full $n$ dimensions of the ambient space. A sufficient geometric condition is obtained to guarantee that a domain has such a "thin" automorphism…

It is known that every finite group can be represented as the full group of automorphisms of a suitable compact dessin d'enfant. In this paper, we give a constructive and easy proof that the same holds for any countable group by considering…