scholarly journals Catalogue of the Star graph eigenvalue multiplicities

Author(s):  
Ekaterina Khomyakova ◽  
Elena V. Konstantinova

AbstractThe Star graph $$S_n$$Sn, $$n\geqslant 2$$n⩾2, is the Cayley graph over the symmetric group $$\mathrm {Sym}_n$$Symn generated by transpositions $$(1~i),\,2\leqslant i \leqslant n$$(1i),2⩽i⩽n. This set of transpositions plays an important role in the representation theory of the symmetric group. The spectrum of $$S_n$$Sn contains all integers from $$-(n-1)$$-(n-1) to $$n-1$$n-1, and also zero for $$n\geqslant 4$$n⩾4. In this paper we observe methods for getting explicit formulas of eigenvalue multiplicities in the Star graphs $$S_n$$Sn, present such formulas for the eigenvalues $$\pm (n-k)$$±(n-k), where $$2\leqslant k \leqslant 12$$2⩽k⩽12, and finally collect computational results of all eigenvalue multiplicities for $$n\leqslant 50$$n⩽50 in the catalogue.

10.37236/9147 ◽  
2020 ◽  
Vol 27 (2) ◽  
Author(s):  
Vladislav Kabanov ◽  
Elena V. Konstantinova ◽  
Leonid Shalaginov ◽  
Alexandr Valyuzhenich

The Star graph $S_n$, $n\ge 3$, is the Cayley graph on the symmetric group $Sym_n$ generated by the set of transpositions $\{(12),(13),\ldots,(1n)\}$. In this work we study eigenfunctions of $S_n$ corresponding to the second largest eigenvalue $n-2$. For $n\ge 8$ and $n=3$, we find the minimum cardinality of the support of an eigenfunction of $S_n$ corresponding to the second largest eigenvalue and obtain a characterization of eigenfunctions with the minimum cardinality of the support.


10.37236/1809 ◽  
2004 ◽  
Vol 11 (1) ◽  
Author(s):  
Anthony Mendes ◽  
Jeffrey Remmel ◽  
Jennifer Wagner

A $\lambda$-ring version of a Frobenius characteristic for groups of the form $G \wr S_n$ is given. Our methods provide natural analogs of classic results in the representation theory of the symmetric group. Included is a method decompose the Kronecker product of two irreducible representations of $G\wr S_n$ into its irreducible components along with generalizations of the Murnaghan-Nakayama rule, the Hall inner product, and the reproducing kernel for $G\wr S_n$.


1950 ◽  
Vol 2 ◽  
pp. 334-343 ◽  
Author(s):  
G. DE B. Robinson

1. Introduction. The problem of the expression of an invariant matrix of an invariant matrix as a direct sum of invariant matrices is intimately associated with the representation theory of the full linear group on the one hand and with the representation theory of the symmetric group on the other. In a previous paper the author gave an explicit formula for this reduction in terms of characters of the symmetric group. Later J. A. Todd derived the same formula using Schur functions, i.e. characters of representations of the full linear group.


2019 ◽  
Vol 19 (02) ◽  
pp. 1950002 ◽  
Author(s):  
SHIYING WANG ◽  
YINGYING WANG

The diagnosability of a multiprocessor system plays an important role. The bubble-sort star graph BSn has many good properties. In this paper, we study the diagnosis on BSn under the comparison model. Following the concept of the local diagnosability, the strong local diagnosability property is discussed. This property describes the equivalence of the local diagnosability of a node and its degree. We prove that BSn (n ≥ 5) has this property, and it keeps this strong property even if there exist (2n − 5) missing edges in it, and the result is optimal with respect to the number of missing edges.


1954 ◽  
Vol 6 ◽  
pp. 486-497 ◽  
Author(s):  
G. de B. Robinson

The study of the modular representation theory of the symmetric group has been greatly facilitated lately by the introduction of the graph (9, III ), the q-graph (5) and the hook-graph (4) of a Young diagram [λ]. In the present paper we seek to coordinate these ideas and relate them to the r-inducing and restricting processes (9, II ).


Symmetry ◽  
2019 ◽  
Vol 11 (2) ◽  
pp. 185
Author(s):  
Ram Band ◽  
Sven Gnutzmann ◽  
August Krueger

We consider stationary waves on nonlinear quantum star graphs, i.e., solutions to the stationary (cubic) nonlinear Schrödinger equation on a metric star graph with Kirchhoff matching conditions at the centre. We prove the existence of solutions that vanish at the centre of the star and classify them according to the nodal structure on each edge (i.e., the number of nodal domains or nodal points that the solution has on each edge). We discuss the relevance of these solutions in more applied settings as starting points for numerical calculations of spectral curves and put our results into the wider context of nodal counting, such as the classic Sturm oscillation theorem.


1964 ◽  
Vol 16 ◽  
pp. 191-203 ◽  
Author(s):  
G. de B. Robinson

The purpose of this paper is to clarify and sharpen the argument in the last two chapters of the author's Representation theory of the symmetric group(3). When these chapters were written the peculiar properties of the case p = 2 were not fully appreciated. No difficulty arises in the definition of the block in terms of the p-core, or in the application of the general modular theory based on the formula


2009 ◽  
Vol 10 (03) ◽  
pp. 189-204 ◽  
Author(s):  
EDDIE CHENG ◽  
KE QIU ◽  
ZHIZHANG SHEN

An important and interesting parameter of an interconnection network is the number of vertices of a specific distance from a specific vertex. This is known as the surface area or the Whitney number of the second kind. In this paper, we give explicit formulas for the surface areas of the (n, k)-star graphs and the arrangement graphs via the generating function technique. As a direct consequence, these formulas will also provide such explicit formulas for the star graphs, the alternating group graphs and the split-stars since these graphs are related to the (n, k)-star graphs and the arrangement graphs. In addition, we derive the average distances for these graphs.


2015 ◽  
Vol 13 (07) ◽  
pp. 1550049
Author(s):  
Haixia Chang ◽  
Vehbi E. Paksoy ◽  
Fuzhen Zhang

By using representation theory and irreducible characters of the symmetric group, we introduce character dependent states and study their entanglement via geometric measure. We also present a geometric interpretation of generalized matrix functions via this entanglement analysis.


1991 ◽  
Vol 01 (01) ◽  
pp. 43-74 ◽  
Author(s):  
JUNG-SING JWO ◽  
S. LAKSHMIVARAHAN ◽  
S. K. DHALL

The use of the star graph as a viable interconnection scheme for parallel computers has been examined by a number of authors in recent times. An attractive feature of this class of graphs is that it has sublogarithmic diameter and has a great deal of symmetry akin to the binary hypercube. In this paper we describe a new class of algorithms for embedding (a) Hamiltonian cycle (b) the set of all even cycles and (c) a variety of two- and multi-dimensional grids in a star graph. In addition, we also derive an algorithm for the ranking and the unranking problem with respect to the Hamiltonian cycle.


Sign in / Sign up

Export Citation Format

Share Document