Related papers: Distance k-graphs of hypercube and q-Hermite polyn…
In a graph $A$, the measure $|M_g^A(f)|=m_g^A(f)$ for each arbitrary edge $f=gh$ counts the edges in $A$ closer to $g$ than $h$. $A$ is termed an edge quasi-$\lambda$-distance-balanced graph in a metric space (abbreviated as $EQDBG$), where…
The problem of the optimal approximation of circular arcs by parametric polynomial curves is considered. The optimality relates to the Hausdorff distance and have not been studied yet in the literature. Parametric polynomial curves of low…
Every graph G can be embedded in a Euclidean space as a two-distance set. The Euclidean representation number of G is the smallest dimension in which G is representable by such an embedding. We consider spherical and J-spherical…
Distance measures between graphs are important primitives for a variety of learning tasks. In this work, we describe an unsupervised, optimal transport based approach to define a distance between graphs. Our idea is to derive…
In this paper, we study Gromov hyperbolicity and related parameters, that represent how close (locally) a metric space is to a tree from a metric point of view. The study of Gromov hyperbolicity for geodesic metric spaces can be reduced to…
Let $f_k$ be the $k$-th Fourier coefficient of a function $f$ in terms of the orthonormal Hermite, Laguerre or Jacobi polynomials. We give necessary and sufficient conditions on $f$ for the inequality $\sum_{k}|f_k|^2\theta^k<\infty$ to…
The purpose of this paper is to introduce a model to study structures which are widely present in public transportation networks. We show that, through hypergraphs, one can describe these structures and investigate the relation between…
Graph polynomials are deemed useful if they give rise to algebraic characterizations of various graph properties, and their evaluations encode many other graph invariants. Algebraic: The complete graphs $K_n$ and the complete bipartite…
We develop a marking system for an analog of Hasse diagrams of intervals $[u,v]$ with $u\leq v$ in a Hermitian symmetric pair $W/W_J$, and use this to create a closed form algorithm for computing relative R-polynomials. The uniform nature…
Two well-known $q$-Hermite polynomials are the continuous and discrete $q$-Hermite polynomials. In this paper we consider a new family of $q$-Hermite polynomials and prove several curious properties about these polynomials. One striking…
In the example of complex grassmannians, we demonstrate various techniques available for computing genus-0 K-theoretic GW-invariants of flag manifolds and more general quiver varieties. In particular, we address explicit reconstruction of…
Quasi-isometries are mappings on graphs, with distance-distortions parameterized by a multiplicative factor and an additive constant. The distance-distortions of quasi-isometries are in a general form that captures a wide range of…
This is a tale describing the large scale geometry of Euclidean plane domains with their hyperbolic or quasihyperbolic distances. We prove that in any hyperbolic plane domain, hyperbolic and quasihyperbolic quasi-geodesics are the same…
Let X $\subseteq$ {0, 1} n. Then the daisy cube Q n (X) is introduced as the sub-graph of Q n induced by the intersection of the intervals I(x, 0 n) over all x $\in$ X. Daisy cubes are partial cubes that include Fibonacci cubes, Lucas…
In this paper we show that graphs of "neighbourly" cubical complexes -- cubical complexes in which every pair of vertices spans a (unique) cube -- have good expansion properties, using a technique based on multicommodity flows. By showing…
This is a chapter in a forthcoming book on completely regular codes in distance regular graphs. The chapter provides an overview, and some original results, on codes in distance regular graphs which admit symmetries via a permutation group…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…
We establish a weighted version of the $H^p$-theory of quasiconformal mappings.
We study graphs coming from quadratic spaces over finite fields via orthogonality which generalize a recent result given by Bishnoi, Ihringer, and Pepe (2019). More precisely, we study the graph $\Gamma^{\square}(n,k,q)$ as follows: the…