Related papers: Lattice Properties of Oriented Exchange Graphs and…
It is well-known that concentrators are sparse graphs of high connectivity, which play a key role in the construction of switching networks; and any semi-vertex transitive graph is isomorphic to a bi-coset graph. In this paper, we prove…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
In this paper we detail the lattice constructions of several classes of supersymmetric quiver gauge theories in two and three Euclidean spacetime dimensions possessing exact supersymmetry at finite lattice spacing. Such constructions are…
We derive representation theorems for exchangeable distributions on finite and infinite graphs using elementary arguments based on geometric and graph-theoretic concepts. Our results elucidate some of the key differences, and their…
We study 4d superconformal indices for a large class of N=1 superconformal quiver gauge theories realized combinatorially as a bipartite graph or a set of "zig-zag paths" on a two-dimensional torus T^2. An exchange of loops, which we call a…
An embedding of a graph on an orientable surface is orientably-regular (or rotary, in an equivalent terminology) if the group of orientation-preserving automorphisms of the embedding is transitive (and hence regular) on incident vertex-edge…
Let $L$ be an alternating prime non-split link in $S^3$. We use the category of flypes between reduced alternating diagrams for $L$ to classify involutions on $L$. As consequences, we show that the quotient of an alternating periodic link…
The main goal of this note is to suggest an algebraic approach to the quasi-isometric classification of partially commutative groups (alias right-angled Artin groups). More precisely, we conjecture that if the partially commutative groups…
A vertex with neighbours of degrees $d_1 \geq ... \geq d_r$ has {\em vertex type} $(d_1, ..., d_r)$. A graph is {\em vertex-oblique} if each vertex has a distinct vertex-type. While no graph can have distinct degrees, Schreyer, Walther and…
In this work, we establish an analogue result of the Erd\"os-Stone theorem of weighted digraphs using Regularity Lemma of digraphs. We give a stability result of oriented graphs and digraphs with forbidden blow-up transitive triangle and…
We study the class of 1-perfectly orientable graphs, that is, graphs having an orientation in which every out-neighborhood induces a tournament. 1-perfectly orientable graphs form a common generalization of chordal graphs and circular arc…
Commuting involution graphs have been studied for finite Coxeter groups and for affine groups of classical type. The purpose of this short note is to establish some general results for commuting involution graphs in affine Coxeter groups,…
We propose feasible scenarios for revealing the modified exchange statistics in one-dimensional anyon models in optical lattices based on an extension of the multicolor lattice-depth modulation scheme introduced in [{Phys. Rev. A 94, 023615…
We study algebras encoding stable range branching rules for the pairs of complex classical groups of the same type in the context of toric degenerations of spherical varieties. By lifting affine semigroup algebras constructed from…
We characterize Leavitt path algebras which are exchange rings in terms of intrinsic properties of the graph and show that the values of the stable rank for these algebras are 1, 2 or $\infty$. Concrete criteria in terms of properties of…
A quiver is an oriented graph. Quiver mutation is an elementary operation on quivers. It appeared in physics in Seiberg duality in the nineties and in mathematics in the definition of cluster algebras by Fomin-Zelevinsky in 2002. We show,…
We study a special class of graphs with a strong transience feature called uniform transience. We characterize uniform transience via a Feller-type property and via validity of an isoperimetric inequality. We then give a further…
Divisible residuated lattices are algebraic structures corresponding to a more comprehensive logic than Hajek's basic logic with an important significance in the study of fuzzy logic. The purpose of this paper is to investigate commutative…
We generalise the standard constructions of a Cayley graph in terms of a group presentation by allowing some vertices to obey different relators than others. The resulting notion of presentation allows us to represent every vertex…
Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…