Related papers: Completely Transitive Designs

We define the notion of $D$-set in an arbitrary semigroup, and with some mild restrictions we establish its dynamical and combinatorial characterizations. Assuming a weak form of cancellation in semigroups we have shown that the Cartesian…

A graph is said to be edge-transitive if its automorphism group acts transitively on its edges. It is known that edge-transitive graphs are either vertex-transitive or bipartite. In this paper we present a complete classification of all…

We construct centrally large subalgebras in crossed products of $C (X, D)$ by automorphisms in which $D$ is simple, $X$ is compact metrizable, the automorphism induces a minimal homeomorphism of $X$, and a mild technical assumption holds.…

A real morphism $f$ from a real algebraic curve $X$ to $\mathbb{P}^1$ is called separating if $f^{-1}(\mathbb{R} \mathbb{P}^1) = \mathbb{R} X$. A separating morphism defines a covering $\mathbb{R} X \to \mathbb{R} \mathbb{P}^1$. Let $X_1,…

A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…

Let $G=(V, E)$ be a graph, where $V$ and $E$ are the vertex and edge sets, respectively. For two disjoint subsets $A$ and $B$ of $V$, we say $A$ \textit{dominates} $B$ if every vertex of $B$ is adjacent to at least one vertex of $A$ in $G$.…

We consider the classification problem for several classes of countable structures which are "vertex-transitive", meaning that the automorphism group acts transitively on the elements. (This is sometimes called homogeneous.) We show that…

We address a natural question in noncommutative geometry, namely the rigidity observed in many examples, whereby noncommutative spaces (or equivalently their coordinate algebras) have very few automorphisms by comparison with their…

The paper is devoted to the study of abelian (in the sense defined by Godsil and Hensel) distance-regular $r$-covers of the complete graphs $K_n$. According to the construction by Coutinho, Godsil, Shirazi, and Zhan (2016), each such cover…

We study lines through the origin of finite-dimensional complex vector spaces that enjoy a doubly transitive automorphism group. This paper classifies those lines that exhibit almost simple symmetries. We introduce a general recipe…

A two-dimensional simplicial complex is called $d$-{\em regular} if every edge of it is contained in exactly $d$ distinct triangles. It is called $\epsilon$-expanding if its up-down two-dimensional random walk has a normalized maximal…

Let $X$ be an Abelian group of the form $X=\mathbb{R}^m\times K\times D$, where $m\geq 0$, $K$ is a compact totally disconnected group of the special form, $D$ is a discrete group. Let $\xi_i, i=1,2,...,n,n\geq 2,$ be independent random…

We prove that the automorphism group of a general complete intersection $X$ in a projective space is trivial with a few well-understood exceptions. We also prove that the automorphism group of a complete intersection $X$ acts on the…

A transitive permutation group is semiprimitive if each of its normal subgroups is transitive or semiregular. Interest in this class of groups is motivated by two sources: problems arising in universal algebra related to collapsing monoids…

In this article, we prove that if $\mathcal{D}$ is a $2$-design with $k=7$ admitting flag-transitive almost simple automorphism group with socle an alternating group, then $\mathcal{D}$ is $PG_{2}(3,2)$ with parameter set $(15,7,3)$ and…

A map $X$ on a surface is called vertex-transitive if the automorphism group of $X$ acts transitively on the set of vertices of $X$. If the face-cycles at all the vertices in a map are of same type then the map is called semi-equivelar. In…

We associate to every quandle $X$ and an associative ring with unity $\mathbf{k}$, a nonassociative ring $\mathbf{k}[X]$ following [3]. The basic properties of such rings are investigated. In particular, under the assumption that the inner…

This paper explores the concept of topological transitivity in nonautonomous dynamical systems, which are defined as sequences of continuous maps from a compact metric space to itself. It investigates various conditions (including…

A dessin is a 2-cell embedding of a connected bipartite graph into an orientable closed surface. An automorphism of a dessin is a permutation of the edges of the underlying graph which preserves the colouring of the vertices and extends to…

In this article, we study $2$-designs with $\lambda=2$ admitting a flag-transitive almost simple automorphism group with socle a finite simple exceptional group of Lie type, and we prove that such a $2$-design does not exist. In conclusion,…