Related papers: Constructing highly arc transitive digraphs using …
We wish to renew the discussion over recent combinatorial structures that are 3-uniform hypergraph expanders, viewing them in a more general perspective, shedding light on a previously unknown relation to the zig-zag product. We do so by…
In this paper, we construct a partially hyperbolic skew-product diffeomorphism $f$ on $\mathbb{T}^3$, such that $f$ is accessible and chain transitive, but not transitive.
We present a method to construct new tilting complexes from existing ones using tensor products, generalizing a result of Rickard. The endomorphism rings of these complexes are generalized matrix rings that are "componentwise" tensor…
We consider the task of drawing a graph on multiple horizontal layers, where each node is assigned a layer, and each edge connects nodes of different layers. Known algorithms determine the orders of nodes on each layer to minimize crossings…
Many large, real-world complex networks have rich community structure that a network scientist seeks to understand. These communities may overlap or have intricate internal structure. Extracting communities with particular topological…
We give a new way to produce examples of Lagrangians in shifted symplectic derived stacks, based on multiple intersections. Specifically, we show that an m-fold fiber product of Lagrangians in a shifted symplectic derived stack its itself…
The lexicographic product $G[H]$ of two graphs $G$ and $H$ is obtained from $G$ by replacing each vertex with a copy of $H$ and adding all edges between any pair of copies corresponding to adjacent vertices of $G$. We consider also the…
We define a "mirror version" of Brzezinski's crossed product and we prove that, under certain circumstances, a Brzezinski crossed product D\otimes_{R, \sigma}V and a mirror version W\bar{\otimes}_{P, \nu}D may be iterated, obtaining an…
We propose a tensor product structure that is compatible with the hypergraph structure. We define the algebraic connectivity of the $(m+1)$-uniform hypergraph in this product, and prove the relationship with the vertex connectivity. We…
In this paper, we introduce a new approach for drawing diagrams that have applications in software visualization. Our approach is to use a technique we call confluent drawing for visualizing non-planar diagrams in a planar way. This…
We study the multiplicative structure of orbifold Hochschild cohomology in an attempt to generalize the results of Kontsevich and Calaque-Van den Bergh relating the Hochschild and polyvector field cohomology rings of a smooth variety. We…
A classical t-tensor product expander is a natural way of formalising correlated walks of t particles on a regular expander graph. A quantum t-tensor product expander is a completely positive trace preserving map that is a straightforward…
In this article we deal with the problems of finding the disimplicial arcs of a digraph and recognizing some interesting graph classes defined by their existence. A diclique of a digraph is a pair $V \to W$ of sets of vertices such that $v…
In this paper we study a new product of graphs called {\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\times V(G_2)$ and both projection maps $V(H)\to V(G_1)$…
Graphs, and sequences of growing graphs, can be used to specify the architecture of mathematical models in many fields including machine learning and computational science. Here we define structured graph "lineages" (ordered by level…
In this paper, we construct recollements and ladders for exceptional curves by using reduction/insertion functors due to $p$-cycle construction. As applications to weighted projective lines, we classify recollements for the category of…
Tilings of the plane resemble the simplicial and other complexes from algebraic topology, but have not been studied from this perspective. We construct finite categories corresponding to polygons with labeled directed edges, and introduce…
We derive certain systems of differential equations for matrix elements of products and iterates of logarithmic intertwining operators among strongly graded generalized modules for a strongly graded conformal vertex algebra under suitable…
In this paper we consider the directed path-width and directed tree-width of recursively defined digraphs. As an important combinatorial tool, we show how the directed path-width and the directed tree-width can be computed for the disjoint…
We propose a new operator defined between two tensors, the broadcast product. The broadcast product calculates the Hadamard product after duplicating elements to align the shapes of the two tensors. Complex tensor operations in libraries…