Related papers: Weighted theta functions for non-commutative graph…
Starting from a standard noncommutative gauge theory and using the Seiberg-Witten map we propose a new version of a noncommutative gravity. We use consistent deformation theory starting from a free gauge action and gauging a killing…
This letter addresses an open question concerning a variant of the Lov\'{a}sz $\vartheta$ function, which was introduced by Schrijver and independently by McEliece et al. (1978). The question of whether this variant provides an upper bound…
The area of graph property testing seeks to understand the relation between the global properties of a graph and its local statistics. In the classical model, the local statistics of a graph is defined relative to a uniform distribution…
We study a model of fully-packed dimer configurations (or perfect matchings) on a bipartite periodic graph that is two-dimensional but not planar. The graph is obtained from $\mathbb Z^2$ via the addition of an extensive number of extra…
A review of the relationships between matrix models and noncommutative gauge theory is presented. A lattice version of noncommutative Yang-Mills theory is constructed and used to examine some generic properties of noncommutative quantum…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
We define a new family of noncommutative generalizations of cluster algebras called polygonal cluster algebras. These algebras generalize the noncommutative surfaces of Berenstein-Retakh, and are inspired by the emerging theory of…
We introduce an operator-algebraic framework for Morita equivalence of quantum graphs based on $\Delta$-equivalence of operator systems introduced by Eleftherakis, Kakariadis and Todorov. Adopting the perspective of Weaver, we view quantum…
It is pointed out that the usual $\theta$-algebra assumed for non-commuting coordinates is not $P$- and $T$-invariant, unless one {\it formally} transforms the non-commutativity parameter $\theta^{\mu\nu}$ in an appropriate way. On the…
There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…
In this work, we propose to study noncommutative geometry using the language of categories of sheaves of algebras with polynomial identities and their properties, introducing new (graded) noncommutative geometries. These include, for…
The well-known 1-2-3 Conjecture asserts that the edges of every graph without an isolated edge can be weighted with $1$, $2$ and $3$ so that adjacent vertices receive distinct weighted degrees. This is open in general. We prove that every…
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total weight $1$. In $1994$, Mahadev et al.~introduced a subclass of equistable graphs,…
A generalization of topos theory is proposed giving an abstract realization of such categories as, say, the categories of manifolds and of Grothendieck schemes on the one hand, and permitting one, on the other hand, a view on…
We classify topologically trivial Legendrian $\Theta$-graphs and identify the complete family of nondestabilizeable Legendrian realizations in this topological class. In contrast to all known results for Legendrian knots, this is an…
Associated to any uniform finite layered graph Gamma there is a noncommutative graded quadratic algebra A(Gamma) given by a construction due to Gelfand, Retakh, Serconek and Wilson. It is natural to ask when these algebras are Koszul.…
We consider weighted tiling systems to represent functions from graphs to a commutative semiring such as the Natural semiring or the Tropical semiring. The system labels the nodes of a graph by its states, and checks if the neighbourhood of…
The \textit{generalized Tur\'an number} $\mathrm{ex}(n, T, F)$ is the maximum possible number of copies of $T$ in an $F$-free graph on $n$ vertices for any two graphs $T$ and $F$. For the book graph $B_t$, there is a close connection…
We prove a version of the classical 'generic smoothness' theorem with smooth varieties replaced by non-commutative resolutions of singular varieties. This in particular implies a non-commutative version of the Bertini theorem.
A dominating set $S$ in a graph $G$ is said to be perfect if every vertex of $G$ not in $S$ is adjacent to just one vertex of $S$. Given a vertex subset $S'$ of a side $P_m$ of an $m\times n$ grid graph $G$, the perfect dominating sets $S$…