44 research outputs found

    On the spectral moments of trees with a given bipartition

    Full text link
    For two given positive integers pp and qq with p⩽qp\leqslant q, we denote \mathscr{T}_n^{p, q}={T: T is a tree of order nn with a (p,q)(p, q)-bipartition}. For a graph GG with nn vertices, let A(G)A(G) be its adjacency matrix with eigenvalues λ1(G),λ2(G),...,λn(G)\lambda_1(G), \lambda_2(G), ..., \lambda_n(G) in non-increasing order. The number Sk(G):=∑i=1nλik(G) (k=0,1,...,n−1)S_k(G):=\sum_{i=1}^{n}\lambda_i^k(G)\,(k=0, 1, ..., n-1) is called the kkth spectral moment of GG. Let S(G)=(S0(G),S1(G),...,Sn−1(G))S(G)=(S_0(G), S_1(G),..., S_{n-1}(G)) be the sequence of spectral moments of GG. For two graphs G1G_1 and G2G_2, one has G1≺sG2G_1\prec_s G_2 if for some k∈1,2,...,n−1k\in {1,2,...,n-1}, Si(G1)=Si(G2)(i=0,1,...,k−1)S_i(G_1)=S_i(G_2) (i=0,1,...,k-1) and Sk(G1)<Sk(G2)S_k(G_1)<S_k(G_2) holds. In this paper, the last four trees, in the SS-order, among Tnp,q(4⩽p⩽q)\mathscr{T}_n^{p, q} (4\leqslant p\leqslant q) are characterized.Comment: 11 pages, 7 figure

    Institutional Cognition

    Get PDF
    We generalize a recent mathematical analysis of Bernard Baars' model of human consciousness to explore analogous, but far more complicated, phenomena of institutional cognition. Individual consciousness is limited to a single, tunable, giant component of interacting cogntivie modules, instantiating a Global Workspace. Human institutions, by contrast, seem able to multitask, supporting several such giant components simultaneously, although their behavior remains constrained to a topology generated by cultural context and by the path-dependence inherent to organizational history. Surprisingly, such multitasking, while clearly limiting the phenomenon of inattentional blindness, does not eliminate it. This suggests that organizations (or machines) explicitly designed along these principles, while highly efficient at certain sets of tasks, would still be subject to analogs of the subtle failure patterns explored in Wallace (2005b, 2006). We compare and contrast our results with recent work on collective efficacy and collective consciousness

    Darwin's Rainbow: Evolutionary radiation and the spectrum of consciousness

    Get PDF
    Evolution is littered with paraphyletic convergences: many roads lead to functional Romes. We propose here another example - an equivalence class structure factoring the broad realm of possible realizations of the Baars Global Workspace consciousness model. The construction suggests many different physiological systems can support rapidly shifting, sometimes highly tunable, temporary assemblages of interacting unconscious cognitive modules. The discovery implies various animal taxa exhibiting behaviors we broadly recognize as conscious are, in fact, simply expressing different forms of the same underlying phenomenon. Mathematically, we find much slower, and even multiple simultaneous, versions of the basic structure can operate over very long timescales, a kind of paraconsciousness often ascribed to group phenomena. The variety of possibilities, a veritable rainbow, suggests minds today may be only a small surviving fraction of ancient evolutionary radiations - bush phylogenies of consciousness and paraconsciousness. Under this scenario, the resulting diversity was subsequently pruned by selection and chance extinction. Though few traces of the radiation may be found in the direct fossil record, exaptations and vestiges are scattered across the living mind. Humans, for instance, display an uncommonly profound synergism between individual consciousness and their embedding cultural heritages, enabling efficient Lamarkian adaptation

    Machine Hyperconsciousness

    Get PDF
    Individual animal consciousness appears limited to a single giant component of interacting cognitive modules, instantiating a shifting, highly tunable, Global Workspace. Human institutions, by contrast, can support several, often many, such giant components simultaneously, although they generally function far more slowly than the minds of the individuals who compose them. Machines having multiple global workspaces -- hyperconscious machines -- should, however, be able to operate at the few hundred milliseconds characteistic of individual consciousness. Such multitasking -- machine or institutional -- while clearly limiting the phenomenon of inattentional blindness, does not eliminate it, and introduces characteristic failure modes involving the distortion of information sent between global workspaces. This suggests that machines explicitly designed along these principles, while highly efficient at certain sets of tasks, remain subject to canonical and idiosyncratic failure patterns analogous to, but more complicated than, those explored in Wallace (2006a). By contrast, institutions, facing similar challenges, are usually deeply embedded in a highly stabilizing cultural matrix of law, custom, and tradition which has evolved over many centuries. Parallel development of analogous engineering strategies, directed toward ensuring an 'ethical' device, would seem requisite to the sucessful application of any form of hyperconscious machine technology

    Spectral properties of digraphs with a fixed dichromatic number

    Get PDF

    ON SPECTRUM OF I-GRAPHS AND ITS ORDERING WITH RESPECT TO SPECTRAL MOMENTS

    Get PDF
    Suppose GG is a graph, A(G)A(G) its adjacency matrix, and μ1(G),μ2(G),⋯ , μn(G)μ_1(G), μ_2(G), \cdots, μ_n(G) are eigenvalues of A(G)A(G). The numbers Sk(G)=∑i=1n μik(G)S_k(G) = \sum_{i=1}^n μ^k_i(G), 0≤k≤n−10 \leq k \leq n − 1, are said to be the k−th spectral moment of GG and the sequenceS(G) = (S_0(G), S_1(G), \sdots, S_{n−1}(G)) is called the spectral moments sequence of GG. For two graphs G1G_1 and G2G_2, we define G1≤SG2G_1 \leq_S G_2, if there exists an integerkk, 1≤k≤n−11 \leq k \leq n − 1, such that for each ii, 0≤i≤k−10 \leq i \leq k − 1, Si(G1)=Si(G2)S_i(G_1) = S_i(G_2) andS_k(G_1) < S_k(G_2).The I−graph I(n,j,k)I(n, j, k) is a graph of order 2n2n with the vertex and edge setsV(I(n,j,k)={u0,u1,⋯ ,un−1,v0,v1,⋯ ,vn−1}V(I(n, j, k) = \{u_0, u_1, \cdots, u_{n−1}, v_0, v_1, \cdots, v_{n−1}\},E(I(n,j,k)={uiuu+j,uivi,vivi+k;0≤i≤n−1}E(I(n, j, k) = \{u_iu{u+j}, u_iv_i, v_iv_{i+k} ; 0 \leq i \leq n − 1\},respectively. The aim of this paper is to compute the spectrum of an arbitraryI−graph and the extremal I−graphs with respect to the S−order
    corecore