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

In this article we determine feasible parameter sets for (what could potentially be) commutative association schemes with noncyclotomic eigenvalues that are of smallest possible rank and order. A feasible parameter set for a commutative…

We discuss the non autonomous nonlinear partial difference equations belonging to Boll classification of quad graph equations consistent around the cube. We show how starting from the compatible equations on a cell we can construct the…

Gy\'{a}rf\'{a}s and S\'{a}rk\"{o}zy conjectured that every $n\times n$ Latin square has a `cycle-free' partial transversal of size $n-2$. We confirm this conjecture in a strong sense for almost all Latin squares, by showing that as $n…

The purpose of this paper is to study the structure and the algebraic varieties of Hom-associative algebras. We give characterize multiplicative simple Hom-associative algebras and show some examples deforming the $2\times 2$-matrix algebra…

Association schemes are combinatorial objects that allow us solve problems in several branches of mathematics. They have been used in the study of permutation groups and graphs and also in the design of experiments, coding theory, partition…

We study harmonic morphisms of graphs as a natural discrete analogue of holomorphic maps between Riemann surfaces. We formulate a graph-theoretic analogue of the classical Riemann-Hurwitz formula, study the functorial maps on Jacobians and…

It is well known that 3--regular graphs with arbitrarily large girth exist. Three constructions are given that use the former to produce non-Hamiltonian 3--regular graphs without reducing the girth, thereby proving that such graphs with…

A paper by Cavenagh and Wanless diagnosed the possible intersection of any two transversals of the back circulant Latin square B_n, and used the result to completely determine the spectrum for 2-way k-homogeneous latin trades. We give a…

Graphs with given k vertices generate an (acyclic) simplicial complex. We describe the homology of its quotient complex, formed by all connected graphs, and demonstrate its applications to the topology of braid groups, knot theory,…

We provide an explicit construction that allows one to easily decompose a graph braid group as a graph of groups. This allows us to compute the braid groups of a wide range of graphs, as well as providing two general criteria for a graph…

We give a physicist oriented survey of Poisson-Lie symmetries of classical systems. We consider finite dimensional geometric actions and the chiral WZNW model as examples for the general construction. An essential point is that quadratic…

We consider infinite connected quasi-transitive locally finite graphs and show that every such graph with more than one end is a tree amalgamation of two other such graphs. This can be seen as a graph-theoretical version of Stallings'…

We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary…

In this article, we introduce equivariant formal deformation theory of associative algebra morphisms. We introduce an equivariant deformation cohomology of associative algebra morphisms and using this we study the equivariant formal…

In this paper, we show that Graph Isomorphism (GI) is not $\textsf{AC}^{0}$-reducible to several problems, including the Latin Square Isotopy problem, isomorphism testing of several families of Steiner designs, and isomorphism testing of…

Using the dilaton scalar and axion pseudoscalar fields we construct a number of scalars and differential forms which are symmetric under the $\mathbf{Z}_2$-subgroup of the group $SL(2, \mathbf{R})$. These invariants enable us to establish…

Let $G$ be a finite, non-abelian group of the form $G = A N$, where $A \leq G$ is abelian, and $N \trianglelefteq G$ is cyclic. We prove that the commuting graph $\Gamma(G)$ of $G$ is either a connected graph of diameter at most four, or…

A new causal discovery method, Structural Agnostic Modeling (SAM), is presented in this paper. Leveraging both conditional independencies and distributional asymmetries, SAM aims to find the underlying causal structure from observational…

We characterize connected tetravalent graphs $\Gamma$ which admit groups $M<H$ of automorphisms such that $\Gamma$ is $M$-half-arc-transitive and $H$-arc-transitive. Examples for each case are constructed, including a counter-example to a…

In this paper, we reveal an intriguing relationship between two seemingly unrelated notions: letter graphs and geometric grid classes of permutations. An important property common for both of them is well-quasi-orderability, implying, in a…