相关论文: Mirror graphs: graph theoretical characterization …
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…
We prove basic facts about reflexivity in derived categories over noetherian schemes; and about related notions such as semidualizing complexes, invertible complexes, and Gorenstein-perfect maps. Also, we study a notion of rigidity with…
Structural pattern recognition describes and classifies data based on the relationships of features and parts. Topological invariants, like the Euler number, characterize the structure of objects of any dimension. Cohomology can provide…
The monoidal category of Soergel bimodules categorifies the Hecke algebra of a finite Weyl group. In the case of the symmetric group, morphisms in this category can be drawn as graphs in the plane. We define a quotient category, also given…
This work extends the theory of reciprocal diagrams in graphic statics to frameworks that are invariant under finite group actions by utilizing the homology and representation theory of cellular cosheaves, recent tools from applied…
Huang proved that every set of more than half the vertices of the $d$-dimensional hypercube $Q_d$ induces a subgraph of maximum degree at least $\sqrt{d}$, which is tight by a result of Chung, F\"uredi, Graham, and Seymour. Huang asked…
We give a construction of strongly regular Cayley graphs on finite fields $\F_q$ by using union of cyclotomic classes and index 4 Gauss sums. In particular, we obtain two infinite families of strongly regular graphs with new parameters.
For a group $G$ and subsets $S,T \subset G$ we introduce the mirror di-Cayley graph $MX(G;S,T)$ and mirror di-Cayley sum graph $MX^+(G;S,T)$ with connections sets $S$ and $T$ (MDCGs for short). We refer to them indistinctly by…
For the first time we represent every finite group in the form of a graph in this book. The authors choose to call these graphs as identity graph, since the main role in obtaining the graph is played by the identity element of the group.…
A Coxeter system is called two-dimensional if its associated Davis complex is two-dimensional (equivalently, every spherical subgroup has rank less than or equal to 2). We prove that given a two-dimensional system (W,S) and any other system…
We introduce priors and algorithms to perform Bayesian inference in Gaussian models defined by acyclic directed mixed graphs. Such a class of graphs, composed of directed and bi-directed edges, is a representation of conditional…
Let $G$ be a finite group, $S\subseteq G\setminus\{1\}$ be a set such that if $a\in S$, then $a^{-1}\in S$, where $1$ denotes the identity element of $G$. The undirected Cayley graph $Cay(G,S)$ of $G$ over the set $S$ is the graph whose…
A graph is called an integral graph when all eigenvalues of its adjacency matrix are integers. We study which Cayley graphs over a nonabelian group $$ T_{8n}=\left\langle a,b\mid a^{2n}=b^8=e,a^n=b^4,b^{-1}ab=a^{-1} \right \rangle $$ are…
Mirror symmetry has proven to be a powerful tool to study several properties of higher dimensional superconformal field theories upon compactification to three dimensions. We propose a quiver description for the mirror theories of the…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
Baker devised a powerful technique to obtain approximation schemes for various problems restricted to planar graphs. Her technique can be directly extended to various other graph classes, among the most general ones the graphs avoiding a…
A spline is an assignment of polynomials to the vertices of a graph whose edges are labeled by ideals, where the difference of two polynomials labeling adjacent vertices must belong to the corresponding ideal. The set of splines forms a…
Symmetric cohomology of groups, defined by M. Staic in [2], is similar to the way one defines the cyclic cohomology for algebras. We show that there is a well-defined restriction, conjugation and transfer map in symmetric cohomology, which…
We further develop the theory of $W\!$-graph ideals, first introduced by the authors in reference [6]. We discuss $W\!$-graph subideals, and induction and restriction of $W\!$-graph ideals for parabolic subgroups. We introduce $W\!$-graph…
In 1999, Khovanov showed that a link invariant known as the Jones polynomial is the Euler characteristic of a homology theory. The knot categorification problem is to find a general construction of knot homology groups, and to explain their…