Related papers: Primitive weakly distance-regular circulant digrap…
An association scheme is amorphous if it has as many fusion schemes as possible. Symmetric amorphous schemes were classified by A. V. Ivanov [A. V. Ivanov, Amorphous cellular rings II, in Investigations in algebraic theory of combinatorial…
A discrete drift-diffusion model is derived from a microscopic sequential tunneling model of charge transport in weakly coupled superlattices provided temperatures are low or high enough. Realistic transport coefficients and novel contact…
The conditional distribution of the next outcome given the infinite past of a stationary process can be inferred from finite but growing segments of the past. Several schemes are known for constructing pointwise consistent estimates, but…
We discuss integrable discretizations of 3-dimensional cyclic systems, that is, orthogonal coordinate systems with one family of circular coordinate lines. In particular, the underlying circle congruences are investigated in detail, and…
We show that under certain technical assumptions any weakly nonlocal Hamiltonian structure compatible with a given nondegenerate weakly nonlocal symplectic structure $J$ can be written as the Lie derivative of $J^{-1}$ along a suitably…
In this paper, we study association schemes on the anisotropic points of classical polar spaces. Our main result concerns non-degenerate elliptic and hyperbolic quadrics in PG$(n,q)$ with $q$ odd. We define relations on the anisotropic…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
An imprimitive symmetric indecomposable association scheme of rank 5 is said to be Higmanian. A divisible design graph is a graph whose adjacency matrix is an incidence matrix of a symmetric divisible design. We establish conditions which…
Directed acyclic graphs (DAGs) can be characterised as directed graphs whose strongly connected components are isolated vertices. Using this restriction on the strong components, we discover that when $m = cn$, where $m$ is the number of…
We introduce the concept of linked systems of symmetric group divisible designs. The connection with association schemes is established, and as a consequence we obtain an upper bound on the number of symmetric group divisible designs which…
A note on the property of weak contraction, which implies that all bounded solutions of a nonlinear system converge to a (possibly non-unique) equilibrium. We provide some simple results about interconnections of such systems, and a brief…
We introduce the first hom-associative Weyl algebras over a field of prime characteristic as a generalization of the first associative Weyl algebra in prime characteristic. First, we study properties of hom-associative algebras constructed…
Dolfi, Guralnick, Praeger and Spiga asked if there exist infinitely many primitive groups of twisted wreath type with nontrivial coprime subdegrees. Here we settle this question in the affirmative. We construct infinite families of…
In this paper, we define a class of auxiliary graphs associated with simple undirected graphs. This class of auxiliary graphs is based on the set of spanning trees of the original graph and the edges constituting those spanning trees. A…
A weak deletion sequence is a sequence $(G_1,\ldots,G_n)$ of graphs so that for each $i\in[n-1]$ either $G_i$ is isomorphic to a subgraph of $G_{i+1}$, or vice versa: $G_{i+1}$ is isomorphic to a subgraph of $G_i$. We prove that determining…
We present a novel general framework to deal with forward and backward components of the electromagnetic field in axially-invariant nonlinear optical systems, which include those having any type of linear or nonlinear transverse…
We introduce the affine Vogan diagrams of complex simple Lie algebras. These are generalizations of Vogan diagrams, and we study the involutions represented by them. We apply these diagrams to study the symmetric pairs, in particular the…
We study $G$-vertex-primitive and $(G,s)$-arc-transitive digraphs for almost simple groups $G$ with socle $\mathrm{PSL}_n(q)$. It turns out that $s\leqslant2$ for such digraphs, which provides the first step in determining an upper bound on…
We obtain estimates on the decay of correlations, Central Limit Theorem and Large Deviations for dynamical systems admitting an induced weak Gibbs--Markov map, for larger classes of observables with weaker regularity than H\"{o}lder,…
We organize and extend a set of computations and structural observations about the Grigoryan--Lin--Muranov--Yau (GLMY) path complex of circulant digraphs $\vec{C}_n^S$ and circulant graphs $C_n^S$. Using the shift automorphism $\tau$ and a…