Related papers: A $Q$-polynomial structure associated with the pro…
Let \Delta be a finite building (or, more generally, a thick spherical and locally finite building). The chamber graph G(\Delta), whose edges are the pairs of adjacent chambers in \Delta, is known to be q-regular for a certain number…
The quantum deformation $CP_q(N)$ of complex projective space is discussed. Many of the features present in the case of the quantum sphere can be extended. The differential and integral calculus is studied and $CP_q(N)$ appears as a quantum…
Highly-regular graphs can be regarded as a combinatorial generalization of distance-regular graphs. From this standpoint, we study combinatorial aspects of highly-regular graphs. As a result, we give the following three main results in this…
We study pseudo-geometric strongly regular graphs whose second subconstituent with respect to a vertex is a cover of a strongly regular graph or a complete graph. By studying the structure of such graphs, we characterize all graphs…
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…
A recently proposed definition of a linear connection in non-commutative geometry, based on a generalized permutation, is used to construct linear connections on GL_q(n). Restrictions on the generalized permutation arising from the…
Distance-regular graphs are a key concept in Algebraic Combinatorics and have given rise to several generalizations, such as association schemes. Motivated by spectral and other algebraic characterizations of distance-regular graphs, we…
We give an excess theorem for spherical 2-designs. This theorem is a dual version of the spectral excess theorem for graphs, which gives a characterization of distance-regular graphs, among regular graphs in terms of the eigenvalues and the…
Graph operations or products play an important role in complex networks. In this paper, we study the properties of $q$-subdivision graphs, which have been applied to model complex networks. For a simple connected graph $G$, its…
Orthogonal q-polynomials associated with q-Laguerre-Hahn form will be studied as a generalization of the q-semiclassical forms via a suitable q-difference equation. The concept of class and a criterion to determinate it will be given. The…
We discuss the projective line $\mathbb{P}(R)$ over a finite associative ring with unity. $\mathbb{P}(R)$ is naturally endowed with the symmetric and anti-reflexive relation "distant". We study the graph of this relation on $\mathbb{P}(R)$…
Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…
We consider the number \bar N(q) of points in the projective complement of graph hypersurfaces over \F_q and show that the smallest graphs with non-polynomial \bar N(q) have 14 edges. We give six examples which fall into two classes. One…
A sequence of rational functions in a variable $q$ is $q$-holonomic if it satisfies a linear recursion with coefficients polynomials in $q$ and $q^n$. We prove that the degree of a $q$-holonomic sequence is eventually a quadratic…
One of the main questions that arise when studying random and quasi-random structures is which properties P are such that any object that satisfies P "behaves" like a truly random one. In the context of graphs, Chung, Graham, and Wilson…
By using a generalization of Sturm-Liouville problems in $q$-difference spaces, a class of symmetric $q$-orthogonal polynomials with four free parameters is introduced. The standard properties of these polynomials, such as a second order…
In this paper, we describe a congruence property of solvable polynomials with coefficients in the Gaussian field Q(i).
In this paper, we investigate the relation between a $q$-matroid and its associated matroid called the projectivization matroid. The latter arises by projectivizing the groundspace of the $q$-matroid and considering the projective space as…
In this paper we collect some results about arithmetic progressions of higher order, also called polynomial sequences. Those results are applied to $(m,q)$-isometric maps.
We will prove that some weighted graphs on the distance $k$-graph of hypercubes approximate the $q$-Hermite polynomial of a $q$-gaussian variable by providing an appropriate matrix model.