Let $S_n$ be the symmetric group on the set $[n]={1, 2, ldots, n}$. For $gin S_n$ let $fix(g)$ denote the number of fixed points of $g$. A subset $S$ of $S_n$ is called $t$-emph{transitive} if for any two $t$-tuples $(x_1,x_2,ldots,x_t)$ and $(y_1,y_2,ldots ,y_t)$ of distinct elements of $[n]$, there exists $gin S$ such that $x_{i}^g=y_{i}$ for any $1leq ileq t$ and additionally $S$ is called e...

A collineation group F of PG(d, q), d >= 3, which is transitive on lines is shown to be 2-transitive on points unless d = 4, q = 2 and ] F ] = 31'5. m m

the main goal of this research is to study, through the minimalist program, the mechanism of checking phi(φ)-features (person & number) and nominative case in persian sentences. different syntactic structures are examined in this paper. it is shown that verb raising is overt in persian and that the uninterpretable φ-features of the finite tense head are valued & checked by the interpretable φ-f...

we consider the transitive linear maps on the operator algebra $b(x)$for a separable banach space $x$. we show if a bounded linear map is norm transitive on $b(x)$,then it must be hypercyclic with strong operator topology. also we provide a sot-transitivelinear map without being hypercyclic in the strong operator topology.

We find a natural construction of a large class of symmetric graphs from pointand block-transitive 1-designs. The graphs in this class can be characterized as G-symmetric graphs whose vertex sets admit a G-invariant partition B of block size at least 3 such that, for any two blocks B,C of B, either there is no edge between B and C , or there exists only one vertex in B not adjacent to any verte...

A set of vertices of the q-ary n-dimensional Hamming space is called a distance-2 MDS code if it has exactly one element in intersection with every line. By an isotopism we mean an isometric transformation of the Hamming space that independently permutes the symbols in every coordinate but does not change the coordinate order. A set M of vertices is called transitive if its automorphism group (...

We consider the structure of groups that act on a p−regular tree in a vertex transitive way with the local action (i.e. the action of the vertex stabilizer on the link) isomorphic to the group of affine transformations on a finite affine line. Mathematics Subject Classification (1991): Primary 20E; Secondary 05C25,22E40,20F32

In this paper, we provide an extension of the scalable algorithm proposed in [1] for the design of Plug-and-Play (PnP) controllers for AC Islanded microGrids (ImGs). The method in [1] assumes Distributed Generation Units (DGUs) are arranged in a load-connected topology, i.e. loads can appear only at the output terminals of inverters. For handling totally general interconnections of DGUs and loa...

Let G be a negatively curved group. This paper continues the classiication of limit points of G that began in part I. A probability measure is constructed on the space at innnity and with respect to this measure almost every point at innnity is shown to be line transitive.

Symmetric properties of some molecular graphs on the torus are studied. In particular we determine which cubic cyclic Haar graphs are 1-regular, which is equivalent to saying that their line graphs are 1 2-arc-transitive. Although these symmetries make all vertices and all edges indistinguishable , they imply intrinsic chirality of the corresponding molecular graph.