Related papers: The Terwilliger algebra of the doubled Odd graph

The Glazman-Povzner-Wienholtz theorem states that the completeness of a manifold, when combined with the semiboundedness of the Schr\"odinger operator $-\Delta + q$ and suitable local regularity assumptions on $q$, guarantees its essential…

In this paper we give a new characterization of the dual polar graphs, extending the work of Brouwer and Wilbrink on regular near polygons. Also as a consequence of our characterization we confirm a conjecture of the authors on…

Given a directed graph E, we construct for each real number l a quiver whose vertex space is the topological realisation of E, and whose edges are directed paths of length l in the vertex space. These quivers are not topological graphs in…

We define the degenerate two boundary affine Hecke-Clifford algebra $\mathcal{H}_d$, and show it admits a well-defined $\mathfrak{q}(n)$-linear action on the tensor space $M\otimes N\otimes V^{\otimes d}$, where $V$ is the natural module…

We show that any connected regular graph with $d+1$ distinct eigenvalues and odd-girth $2d+1$ is distance-regular, and in particular that it is a generalized odd graph.

We establish explicit isomorphisms of two seemingly-different algebras, and their Schur algebras, arising from the centralizers of two different type B Weyl group actions in Schur-like dualities. We provide a presentation of the geometric…

In [F. Levstein, C. Maldonado, The Terwilliger algebra of the Johnson schemes, Discrete Math. 307 (2007) 1621--1635], the Terwilliger algebra of the Johnson scheme $J(n,d)$ was determined when $n\geq 3d$. In this paper, we determine the…

We prove that $K_n+I$, the complete graph of an even order with a $1$-factor duplicated, admits a decomposition into $2$-factors, each a disjoint union of cycles of length $m \geq 5$ if and only if $m \mid n$, except possibly when $m$ is…

By using C*-correspondences and Cuntz-Pimsner algebras, we associate to every subshift (also called a shift space) $X$ a C*-algebra $O_X$, which is a generalization of the Cuntz-Krieger algebras. We show that $O_X$ is the universal…

Let $A$ be a star product on a symplectic manifold $(M,\omega_0)$, $\frac{1}{t}[\omega]$ its Fedosov class, where $\omega$ is a deformation of $\omega_0$. We prove that for a complex polarization of $\omega$ there exists a commutative…

The affine Schur algebra $\widetilde{S}(n,r)$ (of type A) over a field $K$ is defined to be the endomorphism algebra of the tensor space over the extended affine Weyl group of type $A_{r-1}$. By the affine Schur-Weyl duality it is…

For the word $\omega = \underbrace{11\ldots 1}_{x_1}\underbrace{22\ldots2}_{x_2}\ldots\underbrace{nn\ldots n}_{x_n},$ denote by $\mathsf{A}(x_1, x_2, \ldots, x_n)$ the number of its anagrams without fixed letters. While the function…

A bipartite graph $G$ is semi-algebraic in $\mathbb{R}^d$ if its vertices are represented by point sets $P,Q \subset \mathbb{R}^d$ and its edges are defined as pairs of points $(p,q) \in P\times Q$ that satisfy a Boolean combination of a…

This paper investigates the Terwilliger algebra of some group association schemes related to codes. In addition, it also shows the generators of invariant rings appearing by E-polynomials.

We give a complete proof of the twisted duality property M(q)'= Z M(q^\perp) Z* of the (self-dual) CAR-Algebra in any Fock representation. The proof is based on the natural Halmos decomposition of the (reference) Hilbert space when two…

The notion of $\mathcal{O}$-operator is a generalization of the Rota-Baxter operator in the presence of a bimodule over an associative algebra. A compatible $\mathcal{O}$-operator is a pair consisting of two $\mathcal{O}$-operators…

Discrete, unimodular inclusions of factors $(N\subseteq M, E)$ with $N$ of type $\rm{II}_{1}$ have a natural notion of standard invariant, generalizing the finite index case. When the unitary tensor category of $N$-$N$ bimodules generated…

It is confirmed in this work that the graph isomorphism can be tested in polynomial time, which resolves a longstanding problem in the theory of computation. The contributions are in three phases as follows. 1. A description graph…

Let $\Omega$ be a $m$-set, where $m>1$, is an integer. The Hamming graph $H(n,m)$, has $\Omega ^{n}$ as its vertex-set, with two vertices are adjacent if and only if they differ in exactly one coordinate. In this paper, we provide a proof…

Consider the family of graphs without $ k $ node-disjoint odd cycles, where $ k $ is a constant. Determining the complexity of the stable set problem for such graphs $ G $ is a long-standing problem. We give a polynomial-time algorithm for…