Related papers: On higher-dimensional symmetric designs

In practice symmetries of combinatorial structures are computed by transforming the structure into an annotated graph whose automorphisms correspond exactly to the desired symmetries. An automorphism solver is then employed to compute the…

We prove the automorphism conjecture for ordered sets of width less than or equal to 11. The proof supports the meta conjecture that a large number of automorphisms is achievable only as some type of product of independent automorphisms on…

We determine the permutation groups that arise as the automorphism groups of cyclic combinatorial objects. As special cases we classify the automorphism groups of cyclic codes. We also give the permutations by which two cyclic combinatorial…

In this article, we study symmetric $(v, k, \lambda)$ designs admitting a flag-transitive and point-primitive automorphism group $G$ whose socle is a projective special unitary group of dimension at most five. We, in particular, determine…

A set-system $S\subseteq \{0,1\}^n$ is cube-ideal if its convex hull can be described by capacity and generalized set covering inequalities. In this paper, we use combinatorics, convex geometry, and polyhedral theory to give exponential…

It is shown that in various categories, including many consisting of maps or hypermaps, oriented or unoriented, of a given hyperbolic type, every countable group $A$ is isomorphic to the automorphism group of uncountably many non-isomorphic…

We construct explicity the automorphism group of the folded hypercube $FQ_n$ of dimension $n>3$, as a semidirect product of $N$ by $M$, where $N$ is isomorphic to the Abelian group $Z_2^n$, and $M$ is isomorphic to $Sym(n+1)$, the symmetric…

We study finite groups that occur as combinatorial automorphism groups or geometric symmetry groups of convex polytopes. When $\Gamma$ is a subgroup of the combinatorial automorphism group of a convex $d$-polytope, $d\geq 3$, then there…

We use the cylindrical homomorphism and a geometric construction introduced by J. Lewis to study the Lawson homology groups of certain hypersurfaces $X\subset \mathbb{P}^{n+1}$ of degree $d\leq n+1$. As an application, we compute the…

As a generalization of the modular isomorphism problem we study the behavior of defect groups under Morita equivalence of blocks of finite groups over algebraically closed fields of positive characteristic. We prove that the Morita…

We study the relationship between the sizes of sets $B,S$ in $\mathbb{R}^n$ where $B$ contains the $k$-skeleton of an axes-parallel cube around each point in $S$, generalizing the results of Keleti, Nagy, and Shmerkin about such sets in the…

The descent algebra of the symmetric group, over a field of non-zero characteristic p, is studied. A homomorphism into the algebra of generalised p-modular characters of the symmetric group is defined. This is then used to determine the…

Let $\mathcal{S}$ be a finite set of integer points in $\mathbb{R}^d$, which we assume has many symmetries, and let $P\in\mathbb{R}^d$ be a fixed point. We calculate the distances from $P$ to the points in $\mathcal{S}$ and compare the…

Classical block designs are important combinatorial structures with a wide range of applications in Computer Science and Statistics. Here we give a new abstract description of block designs based on the arrow category construction. We show…

Generically an almost complex structure has no symmetries at all, but there exist symmetric structures. In this paper we describe how to guarantee that the pseudogroup of local symmetries is small (finite-dimensional). It will be indicated…

To certain types of generic distributions (subbundles in a tangent bundle) one can associate canonical Cartan connections. Many of these constructions fall into the class of parabolic geometries. The aim of this article is to show how…

A binary linear code whose permutation automorphism group has a fixed point free permutation of order $3$ is called a binary cubic code. The scope of this paper is to investigate the structural properties of binary cubic codes. Let $C$ be a…

Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…

Two isometry groups of combinatorial codes are described: the group of automorphisms and the group of monomial automorphisms, which is the group of those automorphisms that extend to monomial maps. Unlike the case of classical linear codes,…

The notion of global higher-form symmetries has received much attention, but leaves room for a more systematic mathematical formulation. In this article, we highlight the concept of higher automorphism bundles from the field of higher…