English
Related papers

Related papers: Three Mutually Adjacent Leonard Pairs

200 papers

We introduce and discuss an Erd\H{o}s-Ko-Rado basis for the underlying vector space of a Leonard system $\Phi = (A; A^*; \{E_i\}_{i=0}^d ; \{E_i^* \}_{i=0}^d)$ that satisfies a mild condition on the eigenvalues of $A$ and $A^*$. We describe…

Rings and Algebras · Mathematics 2021-11-02 Hajime Tanaka

We obtain the most general type B 3-fold supersymmetry by solving directly the intertwining relation. We then show that it is a necessary and sufficient condition for a second-order linear differential operator to have three linearly…

Mathematical Physics · Physics 2013-11-18 Toshiaki Tanaka

Let $M$ be a T-motive. We introduce the notion of duality for $M$. Main results of the paper (we consider uniformizable $M$ over $F_q[T]$ of rank $r$, dimension $n$, whose nilpotent operator $N$ is 0): 1. Algebraic duality implies analytic…

Number Theory · Mathematics 2019-02-06 A. Grishkov , D. Logachev

For $0 \leq t \leq r$ let $m(t,r)$ be the maximum number $s$ such that every $t$-edge-connected $r$-graph has $s$ pairwise disjoint perfect matchings. There are only a few values of $m(t,r)$ known, for instance $m(3,3)=m(4,r)=1$, and…

Combinatorics · Mathematics 2024-03-08 Yulai Ma , Davide Mattiolo , Eckhard Steffen , Isaak H. Wolf

The main result of D. Archdeacon, M. Conder and J. \v{S}ir\'a\v{n} [Trans. Amer. Math. Soc. 366 (2014) 8, 4491-4512] implies existence of a regular, self-dual and self-Petrie dual map of any given even valency. In this paper we extend this…

Combinatorics · Mathematics 2018-08-01 Jay Fraser , Olivia Jeans , Jozef Širáň

In this paper, we characterize all connected graphs with exactly three distinct normalized Laplacian eigenvalues of which one is equal to $1$, determine all connected bipartite graphs with at least one vertex of degree $1$ having exactly…

Combinatorics · Mathematics 2017-03-28 Xueyi Huang , Qiongxiang Huang

The 3-arc graph of a digraph $D$ is defined to have vertices the arcs of $D$ such that two arcs $uv, xy$ are adjacent if and only if $uv$ and $xy$ are distinct arcs of $D$ with $v\ne x$, $y\ne u$ and $u,x$ adjacent. We prove that Hadwiger's…

Combinatorics · Mathematics 2017-07-18 David R. Wood , Guangjun Xu , Sanming Zhou

Let Gamma be a Q-polynomial distance-regular graph with vertex set X, diameter D geq 3 and adjacency matrix A. Fix x in X and let A*=A*(x) be the corresponding dual adjacency matrix. Recall that the Terwilliger algebra T=T(x) is the…

Combinatorics · Mathematics 2010-03-30 Diana R. Cerzo

A relation on a $k$-net$(n)$ (or, equivalently, a set of $k-2$ mutually orthogonal Latin squares of order $n$) is an $\mathbb{F}_{2}$ linear dependence within the incidence matrix of the net. Dukes and Howard (2014) showed that any…

Combinatorics · Mathematics 2023-06-01 Michael J. Gill , Ian M. Wanless

This paper examines the use of Lie group and Lie Algebra theory to construct the geometry of pairwise comparisons matrices. The Hadamard product (also known as coordinatewise, coordinate-wise, elementwise, or element-wise product) is…

General Mathematics · Mathematics 2021-05-24 W. W. Koczkodaj , V. W. Marek , Y. Yayli

We show that if a link L with non-zero Alexander polynomial admits a locally flat cobordism to a `weakly m-split link', then the cobordism must have genus at least (m-1)/2. This generalises a recent result of J. Pardon.

Geometric Topology · Mathematics 2012-10-10 Stefan Friedl , Mark Powell

Adjacent dyadic systems are pivotal in analysis and related fields to study continuous objects via collections of dyadic ones. In our prior work (joint with Jiang, Olson and Wei) we describe precise necessary and sufficient conditions for…

Classical Analysis and ODEs · Mathematics 2020-05-01 Theresa C. Anderson , Bingyang Hu

We introduce quaternary Legendre pairs of length $\ell$. In contrast to binary Legendre pairs they can exist for even $\ell$ as well. First we show that they are pertinent to the construction of quaternary Hadamard matrices of order…

Combinatorics · Mathematics 2022-12-22 Ilias S. Kotsireas , Arne Winterhof

We prove that for any $K$ and $d$, there exist, for all sufficiently large admissible $v$, a pairwise balanced design PBD$(v,K)$ of dimension $d$ for which all $d$-point-generated flats are bounded by a constant independent of $v$. We also…

Combinatorics · Mathematics 2014-10-29 Nicholas M. A. Benson , Peter J. Dukes

Suppose $G$ is a connected simple graph with the vertex set $V( G ) = \{ v_1,v_2,\cdots ,v_n \} $. Let $d_G( v_i,v_j ) $ be the least distance between $v_i$ and $v_j$ in $G$. Then the distance matrix of $G$ is $D( G ) =( d_{ij} ) _{n\times…

Combinatorics · Mathematics 2023-02-28 Xu Chen , Yinfen Zhu , Guoping Wang

Suppose $\left\{x_1, \dots, x_n\right\} \subset \mathbb{R}^2$ is a set of $n$ points in the plane with diameter $\leq 1$, meaning $\|x_i - x_j\| \leq 1$ for all $1 \leq i,j \leq n$. We show that if there are many `antipodes', these are…

Combinatorics · Mathematics 2025-03-26 Stefan Steinerberger

Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order $n$ with diameter $d\ge 2$ that is not a…

Combinatorics · Mathematics 2023-06-21 Leyou Xu , Bo Zhou

Let $M$ be a 3-connected matroid, and let $N$ be a 3-connected minor of $M$. A pair $\{x_1,x_2\} \subseteq E(M)$ is $N$-detachable if one of the matroids $M/x_1/x_2$ or $M \backslash x_1 \backslash x_2$ is both 3-connected and has an…

Combinatorics · Mathematics 2021-04-26 Nick Brettell , Geoff Whittle , Alan Williams

We introduce the concept of Laurent multiple orthogonality on the unit circle and define Angelesco and AT systems in this setting. Using a generalized Andreief identity, we establish normality of all multi-indices for any such system,…

Classical Analysis and ODEs · Mathematics 2026-01-06 Rostyslav Kozhan , Marcus Vaktnäs

Balancedly splittable Hadamard matrices are introduced and studied. A connection is made to the Hadamard diagonalizable strongly regular graphs, maximal equiangular lines set, and unbiased Hadamard matrices. Several construction methods are…

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