Related papers: Constructing highly arc transitive digraphs using …
Given an action of a finite group on a triangulated category, we investigate under which conditions one can construct a linearised triangulated category using DG-enhancements. In particular, if the group is a finite group of automorphisms…
We use the relations between quadrics, trace codes and algebraic curves to construct algebraic curves over finite fields with many points and to compute generalized Hamming weights of codes.
In this paper, we define a new construction of completely scrambled 0-dimensional systems using the inverse limit of sequences of directed graph covers. These examples are transitive and are not locally equicontinuous.
In this work, we introduce a purely combinatorial way to obtain realizable orientations of a gammoid from a total order on the arc set of the digraph representing it, without first obtaining a matrix representing the gammoid over the reals.
We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In…
In the context of additive manufacturing we present a novel technique for direct slicing of a dilated or eroded volume, where the input volume boundary is a triangle mesh. Rather than computing a 3D model of the boundary of the dilated or…
In this note, we demonstrate the existence of a Baker domain of a transcendental skew-product by constructing a domain that is shown to be absorbing using plurisubharmonic method.
Omnidirectional cameras are widely used in such areas as robotics and virtual reality as they provide a wide field of view. Their images are often processed with classical methods, which might unfortunately lead to non-optimal solutions as…
The concept of coreflexive set is introduced to study the structure of digraphs. New characterizations of line digraphs and nth-order line digraphs are given. Coreflexive sets also lead to another natural way of forming an intersection…
We affirm most open cases of a conjecture that first appeared in Alspach et al. (1987) which stipulates that the wreath (lexicographic) product of two hamiltonian decomposable directed graphs is also hamiltonian decomposable. Specifically,…
In this paper we present an iterative construction of irreducible polynomials over finite fields based upon repeated applications of transforms induced by endomorphisms of odd prime degree of ordinary elliptic curves.
We generalize graded Hecke algebras to include a twisting two-cocycle for the associated finite group. We give examples where the parameter spaces of the resulting twisted graded Hecke algebras are larger than that of the graded Hecke…
In this paper, we construct directed strongly regular graphs and divisible design graphs with new parameters merging some basic relations of so-called Tatra associations schemes. We also study the above association schemes, their fusions…
Consider a smooth affine algebraic variety $X$ over an algebraically closed field, and let a finite group $G$ act on it. We assume that the characteristic of the field is greater than the dimension of $X$ and the order of $G$. An explicit…
The operation of zig-zag products of graphs is the analogue of the semidirect product of groups. Using this observation, we present a categorical description of zig-zag products in order to generalize the construction for the category of…
We give a quick method of constructing strong homotopy associative algebra, namely, the higher derived product construction. This method is associative analogue of classical higher derived bracket construction in the category of Loday…
In this article, we give an explicit construction of the derived moduli stack of Harder-Narasimhan filtrations on a connected projective scheme over an algebraically closed field k of characteristic 0 by using methods by Behrend,…
One of the simplest way of combining codes to form new codes is to take their direct product. Direct product of cyclic codes and various generalizations have been studied for many years. In this note, we survey cyclic product codes, direct…
The structure of Terwilliger algebras of wreath products by thin schemes or one-class schemes was studied in [A. Hanaki, K. Kim, Y. Maekawa, Terwilliger algebras of direct and wreath products of association schemes, J. Algebra 343 (2011)…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…