Related papers: KMS weights on graph C*-algebras II Factor types a…
We prove a connection between Schmidt-rank and weight of quadratic forms. This provides a new tool for the classification of graph states based on entanglement. Our main tool arises from a reformulation of previously known results…
We study the behavior of averages for functions defined on finite graphs $G$, in terms of the Hardy-Littlewood maximal operator $M_G$. We explore the relationship between the geometry of a graph and its maximal operator and prove that $M_G$…
We undertake a general study of the boundary (or edge) modes that arise in gauge and gravitational theories defined on a space with boundary, either asymptotic or at finite distance, focusing on efficient techniques for computing the…
We prove new lower bounds on the likely size of a maximum independent set in a random graph with a given average degree. Our method is a weighted version of the second moment method, where we give each independent set a weight based on the…
A weighted graph is a graph in which every edge is assigned a non-negative real number. In a weighted graph, the weight of a path is the sum of the weights of its edges, and the weighed degree of a vertex is the sum of the weights of the…
A total weighting of a graph $G$ is a mapping $f$ which assigns to each element $z \in V(G) \cup E(G)$ a real number $f(z)$ as its weight. The vertex sum of $v$ with respect to $f$ is $\phi_f(v)=\sum_{e \in E(v)}f(e)+f(v)$. A total…
We consider the problem of covariant gauge-fixing in the most general setting of the field-antifield formalism, where the action W and the gauge-fixing part X enter symmetrically and both satisfy the Quantum Master Equation. Analogous to…
In this paper, we study two examples of minimum weight random graphs with edge constraints. First we consider the complete graph on ${n}$ vertices equipped with uniformly heavy edge weights and use iteration methods to obtain deviation…
A random graph evolution based on the interactions of N vertices is studied. During the evolution both the preferential attachment method and the uniform choice of vertices are allowed. The weight of a vertex means the number of its…
Geometric modeling by constraints, whose applications are of interest to communities from various fields such as mechanical engineering, computer aided design, symbolic computation or molecular chemistry, is now integrated into standard…
We introduce a revised notion of gauge action in relation with Leavitt path algebras. This notion is based on group schemes and captures the full information of the grading on the algebra as it is the case of the gauge action of the graph…
An action of a locally compact group or quantum group on a factor is said to be strictly outer when the relative commutant of the factor in the crossed product is trivial. We show that all locally compact quantum groups can act strictly…
We compute the KMS (equilibrium) states for the canonical time evolution on C*-algebras from actions of congruence monoids on rings of algebraic integers. We show that for each $\beta\in[1,2]$, there is a unique KMS$_\beta$ state, and we…
We construct two new classes of topological dynamical systems; one is a factor of a one-sided shift of finite type while the second is a factor of the two-sided shift. The data is a finite graph which presents the shift of finite type, a…
We consider a family of operator-algebraic dynamical systems involving the Toeplitz algebras of higher-rank graphs. We explicitly compute the KMS states (equilibrium states) of these systems built from small graphs with up to four connected…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
In this paper, we defined three kinds of measures depending on the given finite directed graphs. For the given finite directed graph, we can construct the free semigroupoid, the diagram set and the reduced diagram set, as algebraic…
Given a topologically free action of a countable group $G$ on a compact metric space $X$, there is a canonical correspondence between continuous 1-cocycles for this group action and diagonal 1-parameter groups of automorphisms of the…
To every $C^*$ correspondence over a $C^*$-algebra one can associate a Cuntz-Pimsner algebra generalizing crossed product constructions, graph $C^*$-algebras, and a host of other classes of operator algebras. Cuntz-Pimsner algebras come…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.