We deene noncommutative analogues of the characters of the symmetric group which are induced by transitive cyclic subgroups (cyclic characters). We investigate their properties by means of the formalism of noncommutative symmetric functions. The main result is a multiplication formula whose commutative projection gives a combinatorial formula for the resolution of the Kronecker product of two c...

In a recent paper (arXiv:1505.01475 ) Estélyi and Pisanski raised a question whether there exist vertex-transitive Haar graphs that are not Cayley graphs. In this note we construct an infinite family of trivalent Haar graphs that are vertex-transitive but non-Cayley. The smallest example has 40 vertices and is the well-known Kronecker cover over the dodecahedron graph G(10, 2), occurring as the...

The isomorphism problem of Cayley graphs has been well studied in the literature, such as characterizations of CI (DCI)-graphs and CI (DCI)-groups. In this paper, we generalize these to vertex-transitive graphs and establish parallel results. Some interesting vertex-transitive graphs are given, including a first example of connected symmetric non-Cayley non-GI-graph. Also, we initiate the study...

Block sensitivity, which was introduced by Nisan [5], is one of the most useful measures of boolean functions. In this paper we investigate the block sensitivity of weakly symmetric functions (functions invariant under some transitive group action). We prove a Ω(N) lower bound for the block sensitivity of weakly symmetric functions. We also construct a weakly symmetric function which has block ...

In a non-complete graph $Gamma$, a vertex triple $(u,v,w)$ with $v$ adjacent to both $u$ and $w$ is called a $2$-geodesic if $uneq w$ and $u,w$ are not adjacent. The graph $Gamma$ is said to be   $2$-geodesic transitive if its automorphism group is transitive on arcs, and also on 2-geodesics. We first produce a reduction theorem for the family of $2$-geodesic transitive graphs of prime power or...

Abstract The properties of being shift invariant and reflexive or transitive in the case space (asymmetric) truncated Toeplitz operators, dual operators are investigated. Most results obtained new even for symmetric case. A characterization asymmetric is also given.

We develop the relationship between minimal transitive star factorizations and noncrossing partitions. This gives a new combinatorial proof of result by Irving Rattan, specialization Kreweras. It also arises in poset on symmetric group whose definition is motivated Subword Property Bruhat order.

Dividing independence for ultraimaginaries is neither symmetric nor transitive. Moreover, any notion of independence satisfying certain axioms (weaker than those for independence in a simple theory) and defined for all ultraimaginary sorts, is necessarily trivial.

For two normal edge-transitive Cayley graphs on groups H and K which have no common direct factor and $gcd(|H/H^prime|,|Z(K)|)=1=gcd(|K/K^prime|,|Z(H)|)$, we consider four standard products of them and it is proved that only tensor product of factors can be normal edge-transitive.

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...