相关论文: Amorphic association schemes with negative Latin s…

For prime powers $q$ and $q+\varepsilon$ where $\varepsilon\in\{1,2\}$, an affine resolvable design from $\mathbb{F}_q$ and Latin squares from $\mathbb{F}_{q+\varepsilon}$ yield a set of symmetric designs if $\varepsilon=2$ and a set of…

We present groupoid morphisms as an algebraic structure for nonautonomous dynamics, as well as a generalization of group morphisms, which describe classic dynamical systems. We introduce the structure of cotranslations, as a specific kind…

An infinite family of association schemes obtained from the general unitary groups acting transitively on the sets of isotropic vectors in the finite unitary spaces are investigated. We compute the parameters and determine the character…

We present some simple examples of smooth projective varieties in positive characteristic, arising from linear algebra, which do not admit a lifting neither to characteristic zero, nor to the ring of second Witt vectors. Our first…

We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different…

We construct lattices on six dimensional not completely solvable almost abelian Lie groups, for which the Mostow condition does not hold. For the corresponding compact quotients, we compute the de Rham cohomology (which does not agree in…

Associative spectra of graph algebras are examined with the help of homomorphisms of DFS trees. Undirected graphs are classified according to the associative spectra of their graph algebras; there are only three distinct possibilities:…

Chaotic hyperbolic dynamical systems enjoy a surprising degree of rigidity, a fact which is well known in the mathematics community but perhaps less so in theoretical physics circles. Low-dimensional hyperbolic systems are either conjugate…

We study a structure of the group of unitriangular automorphisms of a free associative algebra and a polynomial algebra and prove that this group is a semi direct product of abelian groups. Using this decomposition we describe a structure…

The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…

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…

Separable coordinate systems are introduced in the complex and real four-dimensional flat spaces. We use maximal Abelian subgroups to generate coordinate systems with a maximal number of ignorable variables. The results are presented (also…

Motivated by the necessities of the invariant theory of binary forms J. J. Sylvester constructed in 1878 for each graph with possible multiple edges but without loops its symmetrized graph monomial which is a polynomial in the vertex labels…

For any positive integer $m$, the complete graph on $2^{2m}(2^m+2)$ vertices is decomposed into $2^m+1$ commuting strongly regular graphs, which give rise to a symmetric association scheme of class $2^{m+2}-2$. Furthermore, the…

We construct a wide subcategory of the category of finite association schemes with a collection of desirable properties. Our subcategory has a first isomorphism theorem analogous to that of groups. Also, standard constructions taking…

An association scheme is called skew-symmetric if it has no symmetric adjacency relations other than the diagonal one. In this paper, we study 4-class skew-symmetric association schemes. In J. Ma [On the nonexistence of skew-symmetric…

In the field of complex networks and graph theory, new results are typically tested on graphs generated by a variety of algorithms such as the Erd\H{o}s-R\'{e}nyi model or the Barab\'{a}si-Albert model. Unfortunately, most graph generating…

This paper deals with lattice congruences of the weak order on the symmetric group, and initiates the investigation of the cover graphs of the corresponding lattice quotients. These graphs also arise as the skeleta of the so-called…

In their previous works arXiv:2105.11026, arXiv:2206.10749, Cristofaro-Gardiner, Humili\`ere, Mak, Seyfaddini and Smith defined links spectral invariants on connected compact surfaces and used them to show various results on the algebraic…

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…