Related papers: Constructing highly arc transitive digraphs using …
We show how derived categories build bridges across the current mathematical mainstream, linking geometric and algebraic, commutative and noncommutative, local and global banks. Arches in these bridges are pieces of semiorthogonal…
We present a simple yet highly generalizable method for explaining interacting parts within a neural network's reasoning process. First, we design an algorithm based on cross derivatives for computing statistical interaction effects between…
We extend the notion of an $H$-normal quotient digraph of an $H$-vertex-transitive digraph to that of an $H$-subnormal quotient digraph. Using these concepts, together with bipartite halves of bipartite digraphs, we show that, for each…
We determine the product structure on Hochschild cohomology of commutative algebras in low degrees, obtaining the answer in all degrees for complete intersection algebras. As applications, we consider cyclic extension algebras as well as…
A transitive decomposition of a graph is a partition of the edge or arc set giving a set of subgraphs which are preserved and permuted transitively by a group of automorphisms of the graph. In this paper we give some background to the study…
A digraph $D=(V,A)$ has a good decomposition if $A$ has two disjoint sets $A_1$ and $A_2$ such that both $(V,A_1)$ and $(V,A_2)$ are strong. Let $T$ be a digraph with $t$ vertices $u_1,\dots , u_t$ and let $H_1,\dots H_t$ be digraphs such…
A constructive method is given for obtaining cospectral vertices in undirected graphs, along with an operation that preserves this construction. We prove that the construction yields cospectral vertices, as well as strongly cospectral…
In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…
Let $\mathbb F_{q^2}$ be the finite field with $q^2$ elements. We provide a simple and effective method, using reciprocal polynomials, for the construction of algebraic curves over $\mathbb F_{q^2}$ with many rational points. The curves…
We introduce the notion of a bicocycle double cross product (resp. sum) Lie group (resp. Lie algebra), and a bicocycle double cross product bialgebra, generalizing the unified products. On the level of Lie groups the construction yields a…
Stratified digraphs are popular models for feedforward neural networks. However, computation of their path homologies has been limited to low dimensions due to high computational complexity. A recursive algorithm is proposed to compute…
We introduce the arrow product, a systematic generating function technique for directed graph enumeration. It provides short proofs for previous results of Gessel on the number of directed acyclic graphs and of Liskovets, Robinson and…
Although tensor product real-valued wavelets have been successfully applied to many high-dimensional problems, they can only capture well edge singularities along the coordinate axis directions. As an alternative and improvement of tensor…
Orthogonal array and a large set of orthogonal arrays are important research objects in combinatorial design theory, and they are widely applied to statistics, computer science, coding theory and cryptography. In this paper, some new series…
In this paper, we provide a new method for constructing tilting objects in a triangulated category via recollements. The $p$-cycle approach to exceptional curve processes significant advantages in constructing recollements and ladders, due…
Let K=Fq be a finite field. We introduce a family of projective Reed-Muller-type codes called projective Segre codes. Using commutative algebra and linear algebra methods, we study their basic parameters and show that they are direct…
We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…
This is the second report of our work on the construction of directed strongly regular graphs. In our previous work, we constructed a couple of infinite families of new directed strongly regular graphs on the sets of antiflags of partial…
We propose a systematic method to produce potentially good recursive towers over finite fields. The graph point of view, so as some magma and sage computations are used in this process. We also establish some theoretical functional…
We combine the idea of confluent drawings with Sugiyama style drawings, in order to reduce the edge crossings in the resultant drawings. Furthermore, it is easier to understand the structures of graphs from the mixed style drawings. The…