Related papers: Distance k-graphs of hypercube and q-Hermite polyn…

Two $q$-analogs of the hypercube graph are introduced and shown to be related through a graph quotient. The roles of the subspace lattice graph, of a twisted primitive elements of $U_q(\mathfrak{su}(2))$ and of the dual $q$-Krawtchouk…

Consider the Grassmann graph formed by $k$-dimensional subspaces of an $n$-dimensional vector space over the field of $q$ elements ($1<k<n-1$) and denote by $\Pi(n,k)_q$ the restriction of this graph to the set of projective $[n,k]_q$…

We study a relationship between $Q$-polynomial distance-regular graphs and the double affine Hecke algebra of type $(C^{\vee}_1,C_1)$. Let $\Gamma$ denote a $Q$-polynomial distance-regular graph with vertex set $X$. We assume that $\Gamma$…

The Hermite polynomials are ubiquitous but can be difficult to work with due to their unwieldy definition in terms of derivatives. To remedy this, we showcase an underappreciated Gaussian integral formula for the Hermite polynomials, which…

The distance matrix of a graph $G$ is the matrix containing the pairwise distances between vertices. The distance eigenvalues of $G$ are the eigenvalues of its distance matrix and they form the distance spectrum of $G$. We determine the…

Consider a finite directed graph without cycles in which the arrows are weighted. We present an algorithm for the computation of a new distance, called path-length-weighted distance, which has proven useful for graph analysis in the context…

Finding the point in an algebraic variety that is closest to a given point is an optimization problem with many applications. We study the case when the variety is a Fermat hypersurface. Our formula for its Euclidean distance degree is a…

We provide an algebraic interpretation for two classes of continuous $q$-polynomials. Rogers' continuous $q$-Hermite polynomials and continuous $q$-ultraspherical polynomials are shown to realize, respectively, bases for representation…

We say that a metric graph is uniformly bounded if the degrees of all vertices are uniformly bounded and the lengths of edges are pinched between two positive constants; a metric space is approximable by a uniform graph if there is one…

Let $\Gamma$ denote a distance-regular graph with diameter $D \geq 2$. Let $E$ denote a primitive idempotent of $\Gamma$ with respect to which $\Gamma$ is $Q$-polynomial. Assume that there exists a $3$-clique $\{x,y,z\}$ such that…

In this paper, we present a polynomial-time algorithm that approximates sufficiently high-value Max 2-CSPs on sufficiently dense graphs to within $O(N^{\varepsilon})$ approximation ratio for any constant $\varepsilon > 0$. Using this…

For positive integers $n$ and $r$, we let $Q_n^r$ denote the $r$th power of the $n$-dimensional discrete hypercube graph, i.e., the graph with vertex-set $\{0,1\}^n$, where two 0-1 vectors are joined if they are Hamming distance at most $r$…

Linear combinations of translations of a single Gaussian, e^{-x^2}, are shown to be dense in L^2(R). Two algorithms for determining the coefficients for the approximations are given, using orthogonal Hermite functions and least squares.…

We present a method to obtain weight functions associated with linear and quadratic lattices that yield discrete orthogonality with respect to a quasi-definite moment functional of the orthogonal polynomial sequences in the Askey scheme,…

The scissors congruence conjecture for the unimodular group is an analogue of Hilbert's third problem, for the equidecomposability of polytopes. Liu and Osserman studied the Ehrhart quasi-polynomials of polytopes naturally associated to…

In the paper we develop new methods for calculating the two well-known topological indices, the degree-distance and the Gutman index. Firstly, we prove that the Wiener index of a double vertex-weighted graph can be computed from the Wiener…

Geometric graphs appear in many real-world data sets, such as road networks, sensor networks, and molecules. We investigate the notion of distance between embedded graphs and present a metric to measure the distance between two geometric…

Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…

For every pair of vertices u and v with d(u; v) = n, Wun G v denotes the set of all vertices of G that are closer to u than to v. In this paper, we introduce quasi-({\lambda}; n)-distance-balanced graphs and then study some properties of…

We generalize the family of $(\sigma, \rho)$-problems and locally checkable vertex partition problems to their distance versions, which naturally captures well-known problems such as distance-$r$ dominating set and distance-$r$ independent…