相关论文: KMS weights on graph C*-algebras II Factor types a…

Given an assignment of weights w to the edges of a graph G, a matching M in G is called strongly w-maximal if for any matching N the sum of weights of the edges in N\M is at most the sum of weights of the edges in M\N. We prove that if w…

In this paper we study the action of the fundamental group of a finite metric graph on its universal covering tree. We assume the graph is finite, connected and the degree of each vertex is at least three. Further, we assume an…

Various kinds of spread of influence occur in real world social and virtual networks. These phenomena are formulated by activation processes and irreversible dynamic monopolies in combinatorial graphs representing the topology of the…

The Kac-Ward formula allows to compute the Ising partition function on any finite graph G from the determinant of 2^{2g} matrices, where g is the genus of a surface in which G embeds. We show that in the case of isoradially embedded graphs…

This is a continuation of our previous paper studying the structure of Cartan subalgebras of von Neumann factors of type II_1. We provide more examples of II_1 factors having either zero, one or several Cartan subalgebras. We also prove a…

Zero forcing and power domination are iterative processes on graphs where an initial set of vertices are observed, and additional vertices become observed based on some rules. In both cases, the goal is to eventually observe the entire…

The gauge invariant method for calculation of the effective action of the local composite fields in QFT is proposed. The effective action of the local composite fields in QED is studied up to 2-loop level. The graph rules for the local…

We give necessary and sufficient conditions for a weight system on multiloop chord diagrams to be obtainable from a metrized Lie algebra representation, in terms of a bound on the ranks of associated connection matrices. Here a multiloop…

Recently, a method was proposed and tested to find saddle points of the action in simulations of non-abelian lattice gauge theory. The idea, called `extremization', is to minimize $\int(\dl S/\dl A_\mu)^2$. The method was implemented in an…

Let m and r be two integers. Let G be a connected r-regular graph of order n and k an integer depending on m and r. For even kn, we find a best upper bound (in terms of r and m) on the third largest eigenvalue that is sufficient to…

Within the framework of the universal algebra of the electromagnetic field, the impact of globally neutral configurations of external charges on the field is analyzed. External charges are not affected by the field, but they induce…

Let G be an n-dimensional torus and $\tau$ a Hamiltonian action of G on a compact symplectic manifold, M. If M is pre-quantizable one can associate with $\tau$ a representation of G on a virtual vector space, Q(M), by…

In this thesis, we consider several aspects of over-extended and very-extended Kac-Moody algebras in relation with theories of gravity coupled to matter. In the first part, we focus on the occurrence of KM algebras in the cosmological…

Maxwell equation in geometric algebra formalism with equally weighted basic solutions is subjected to continuously acting Clifford translation. The received states, operators acting on observables, are analyzed with different values of the…

We construct ergodic actions of compact quantum groups on C^*-algebras and von Neumann algebras, and exhibit phenomena of such actions that are of a different nature from ergodic actions of compact Lie groups. In particular, we construct:…

It is postulated that quantum gravity is a sum over causal structures coupled to matter via scale evolution. Quantized causal structures can be described by studying simple matrix models where matrices are replaced by an algebra of quantum…

Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…

A graph $G$ is $k$-$weighted-list-antimagic$ if for any vertex weighting $\omega\colon V(G)\to\mathbb{R}$ and any list assignment $L\colon E(G)\to2^{\mathbb{R}}$ with $|L(e)|\geq |E(G)|+k$ there exists an edge labeling $f$ such that…

The complexity of a graph can be obtained as a derivative of a variation of the zeta function or a partial derivative of its generalized characteristic polynomial evaluated at a point [\textit{J. Combin. Theory Ser. B}, 74 (1998), pp.…

Given a unital C*-algebra A, an injective endomorphism \alpha:A --> A preserving the unit, and a conditional expectation E from A to the range of \alpha we consider the crossed-product of A by \alpha relative to the transfer operator…