English
Related papers

Related papers: On uniform Higmanian association schemes

200 papers

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…

Combinatorics · Mathematics 2026-01-27 Grigory Ryabov

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…

Combinatorics · Mathematics 2022-11-07 Allen Herman , Roghayeh Maleki

In this paper, we construct a stable parabolic Higgs bundle of rank two, which corresponds to the uniformization associated with a conformal hyperbolic metric on a compact Riemann surface $\overline{X}$ with prescribed singularities. This…

Differential Geometry · Mathematics 2025-02-28 Yu Feng , Bin Xu

For any finite group $G$, and any positive integer $n$, we construct an association scheme which admits the diagonal group $D_n(G)$ as a group of automorphisms. The rank of the association scheme is the number of partitions of $n$ into at…

Group Theory · Mathematics 2020-09-25 Peter J. Cameron , Sean Eberhard

An (association) scheme is said to be Frobenius if it is the scheme of a Frobenius group. A scheme which has the same tensor of intersection numbers as some Frobenius scheme is said to be pseudofrobenius. We establish a necessary and…

Combinatorics · Mathematics 2021-12-14 Ilia Ponomarenko , Grigory Ryabov

We introduce a notion of compatibility for multiplicity matrices. This gives rise to a necessary condition for the join of two (possibly disconnected) graphs $G$ and $H$ to be the pattern of an orthogonal symmetric matrix, or equivalently,…

Combinatorics · Mathematics 2020-12-24 Rupert H. Levene , Polona Oblak , Helena Šmigoc

A new approach to the solution of quasilinear nonelliptic first-order systems of inhomogeneous PDEs in many dimensions is presented. It is based on a version of the conditional symmetry and Riemann invariant methods. We discuss in detail…

Mathematical Physics · Physics 2015-05-19 A. Michel Grundland , Benoit Huard

We can obtain a non-symmetric class $2$ association scheme by a skew-Hadamard matrix. We begin with a skew-Hadamard matrix of order $n$, construct a skew-Hadamard matrix of order $2n$ by doubling construction, and a non-symmetric class $2$…

Combinatorics · Mathematics 2020-12-08 Akihide Hanaki

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…

Combinatorics · Mathematics 2017-07-18 Da-Wei Yang , Yan-Quan Feng , Jin Ho Kwak , Jaeun Lee

For a graph $G$ the random $n$-lift of $G$ is obtained by replacing each of its vertices by a set of $n$ vertices, and joining a pair of sets by a random matching whenever the corresponding vertices of $G$ are adjacent. We show that…

Combinatorics · Mathematics 2014-01-07 Tomasz Łuczak , Łukasz Witkowski , Marcin Witkowski

Let ${\cal B}$ be a nontrivial biplane of order $k-2$ represented by symmetric canonical incidence matrix with trace $1+ \binom{k}{2}$. We proved that ${\cal B}$ includes a partially balanced incomplete design with association scheme of…

Combinatorics · Mathematics 2014-01-22 Ivica Martinjak

We give a sufficient condition for a non-commutative association scheme to have a fusion association scheme, and construct non-commutative association schemes from symmetric balanced generalized weighing matrices and generalized Hadamard…

Combinatorics · Mathematics 2018-04-10 Hadi Kharaghani , Sho Suda

We prove two sharp sufficient conditions for hamiltonian cycles in balanced bipartite directed graph. Let $D$ be a strongly connected balanced bipartite directed graph of order $2a$. Let $x,y$ be distinct vertices in $D$. $\{x,y\}$…

Combinatorics · Mathematics 2016-05-02 Samvel Kh. Darbinyan

In this paper, first, we establish a sufficient condition for a bipartite graph to be Hamilton-connected. Furthermore, we also give two sufficient conditions on distance signless Laplacian spectral radius for a graph to be…

Combinatorics · Mathematics 2016-10-25 Qiannan Zhou , Ligong Wang

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…

Combinatorics · Mathematics 2016-04-01 Yan-Quan Feng , Jin-Xin Zhou , Yan-Tao Li

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…

Combinatorics · Mathematics 2010-12-06 Jianmin Ma

We prove that polyharmonic maps of arbitrary order from complete nonparabolic Riemannian manifolds to arbitrary Riemannian manifolds must be harmonic if certain smallness and integrability conditions hold.

Differential Geometry · Mathematics 2020-12-23 Volker Branding

We consider imprimitive association schemes of class four which are two-fold covers of strongly regular graphs with spreads. It will be shown that a two-fold cover of a strongly regular graph with a spread provides a five class fission…

Combinatorics · Mathematics 2014-05-13 Sho Suda

The Terwilliger algebras of asymmetric association schemes of rank $3$, whose nonidentity relations correspond to doubly regular tournaments, are shown to have thin irreducible modules, and to always be of dimension $4k+9$ for some positive…

Combinatorics · Mathematics 2024-04-18 Allen Herman

Let $p$ be an odd prime. In this paper we provide a construction which gives four non-Schurian association schemes for every $p\geq 5$ and two for $p=3$. This construction is explained using incidences between points and lines of a biaffine…

Combinatorics · Mathematics 2015-07-15 Štefan Gyürki , Mikhail Klin
‹ Prev 1 2 3 10 Next ›