Related papers: Primitive weakly distance-regular circulant digrap…
A strongly connected digraph is called a cactoid-type if each of its blocks is a digraph consisting of finitely many oriented cycles sharing a common directed path. In this article, we find the formula for the determinant of the distance…
Combining geometric group theory techniques with geometric topology tools, we show how primitive cohomologies provide useful insights towards unifying the mathematical formulation of Gromov-Witten invariants. In particular, we emphasise the…
We investigate inexact proximity operators for weakly convex functions. To this aim, we derive sum rules for proximal {\epsilon}-subdifferentials, by incorporating the moduli of weak convexity of the functions into the respective formulas.…
A connected symmetric graph of prime valency is {\em basic} if its automorphism group contains no nontrivial normal subgroup having more than two orbits. Let $p$ be a prime and $n$ a positive integer. In this paper, we investigate…
The most elusive problem around the class of circular-arc graphs is identifying all minimal graphs that are not in this class. The main obstacle is the lack of a systematic way of enumerating these minimal graphs. McConnell [FOCS 2001]…
In this paper, we develop a geometric approach to study derived tame finite dimensional associative algebras, based on the theory of non-commutative nodal curves.
A non-complete graph is \emph{$2$-distance-transitive} if, for $i=1,2$ and for any two vertex pairs $(u_1,v_1)$ and $(u_2,v_2)$ with the same distance $i$ in the graph, there exists an element of the graph automorphism group that maps…
A graph $\G$ is {\em symmetric} or {\em arc-transitive} if its automorphism group $\Aut(\G)$ is transitive on the arc set of the graph, and $\G$ is {\em basic} if $\Aut(\G)$ has no non-trivial normal subgroup $N$ such that the quotient…
We extend Hoffman's coclique bound for regular digraphs with the property that its adjacency matrix is normal, and discuss cocliques attaining the inequality. As a consequence, we characterize skew-Bush-type Hadamard matrices in terms of…
The first study related to this paper was on the notion of primitive holes. This paper reports on research in respect of clique parameters and related properties thereof within Jaco-type graphs.
We give a unified description of twisted forms of classical reductive groups schemes. Such group schemes are constructed from algebraic objects of finite rank, excluding some exceptions of small rank. These objects, augmented odd form…
If A is a finite-dimensional symmetric algebra, then it is well-known that the only silting complexes in $\mathrm{K^b}(\mathrm{proj}A)$ are the tilting complexes. In this note we investigate to what extent the same can be said for weakly…
Weak proregularity of an ideal in a commutative ring is a subtle generalization of the noetherian property of the ring. Weak proregularity is of special importance for the study of derived completion, and it occurs quite often in…
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct association schemes by using bent functions have been…
We develop a complex differential geometric approach to the theory of higher residues and primitive forms from the viewpoint of Kodaira-Spencer gauge theory, unifying the semi-infinite period maps for Calabi-Yau models and Landau-Ginzburg…
Local Irregularity Conjecture states that every simple connected graph, except special cacti, can be decomposed into at most three locally irregular graphs, i.e., graphs in which adjacent vertices have different degrees. The connected…
The notion of disjoint weighing matrices is introduced as a generalization of orthogonal designs. A recursive construction along with a computer search lead to some infinite classes of disjoint weighing matrices, which in turn are shown to…
A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
The possibilities for new or unusual kinds of topological, locally linear periodic maps of non-prime order on closed, simply connected 4-manifolds with positive definite intersection pairings are explored. On the one hand, certain…