Related papers: Grassmannians of codes
We study the space of "link maps": the space of maps of a disjoint union of compact, closed manifolds P_1, . . ., P_k into a manifold N whose images are pairwise disjoint. We apply the manifold calculus of functors developed by Goodwillie…
A classic theorem of Euclidean geometry asserts that any noncollinear set of $n$ points in the plane determines at least $n$ distinct lines. Chen and Chv\'atal conjectured that this holds for an arbitrary finite metric space, with a certain…
In a geometric network G = (S, E), the graph distance between two vertices u, v in S is the length of the shortest path in G connecting u to v. The dilation of G is the maximum factor by which the graph distance of a pair of vertices…
We introduce the concept of a clique bitrade, which generalizes several known types of bitrades, including latin bitrades, Steiner $T(k-1,k,v)$ bitrades, extended $1$-perfect bitrades. For a distance-regular graph, we show a one-to-one…
A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative…
The $2$-layer drawing model is a well-established paradigm to visualize bipartite graphs. Several beyond-planar graph classes have been studied under this model. Surprisingly, however, the fundamental class of $k$-planar graphs has been…
Equidistant codes over vector spaces are considered. For $k$-dimensional subspaces over a large vector space the largest code is always a sunflower. We present several simple constructions for such codes which might produce the largest…
By considering graphs as discrete analogues of Riemann surfaces, Baker and Norine (Adv. Math. 2007) developed a concept of linear systems of divisors for graphs. Building on this idea, a concept of gonality for graphs has been defined and…
In 1994, Kranakis et al. published a conjecture about the minimum link-length of every rectilinear covering path for the $k$-dimensional grid $P(n,k) := \{0,1, \dots, n-1\} \times \{0,1, \dots, n-1\} \times \cdots \times \{0,1, \dots,…
We present a characterization of Robinsonian $L^p$ graphons for $p > 5$. Each $L^p$ graphon $w$ is the limit object of a sequence of edge density-normalized simple graphs $\{G_n/\|G_n\|_1\}$ under the cut distance $\delta_{\Box}$. A graphon…
The Grassmannian cluster algebra $\mathbb{C}[\text{Gr}(k, n)]$ admits a distinguished basis known as the dual canonical basis, whose elements correspond to rectangular semi-standard Young tableaux with $k$ rows and with entries in $[n]$. We…
Let $G$ be a graph with vertex set $V$, and let $k$ be a positive integer. A set $D \subseteq V$ is a \emph{distance-$k$ dominating set} of $G$ if, for each vertex $u \in V-D$, there exists a vertex $w\in D$ such that $d(u,w) \le k$, where…
Franco, Galloni, Penante, and Wen have proposed a boundary measurement map for a graph on any closed orientable surface with boundary. We consider this boundary measurement map which takes as input an edge weighted directed graph embedded…
Some graphs admit drawings in the Euclidean k-space in such a (natu- ral) way, that edges are represented as line segments of unit length. Such drawings will be called k dimensional unit distance representations. When two non-adjacent…
The Grassmannian $\mathcal{G}_q(n,k)$ is the set of all $k$-dimensional subspaces of the vector space $\mathbb{F}_q^n$. K\"{o}tter and Kschischang showed that codes in Grassmannian space can be used for error-correction in random network…
The goal of this paper is to better understand a family of linear degenerations of the classical Lagrangian Grassmannians $\Lambda(2n)$. It is the special case for $k=n$ of the varieties $X(k,2n)^{sp}$, introduced in previous joint work…
Given a complex structure $J$ on a real (finite or infinite dimensional) Hilbert space $H$, we study the geometry of the Lagrangian Grassmannian $\Lambda(H)$ of $H$, i.e. the set of closed linear subspaces $L\subset H$ such that…
Many applications in pattern recognition represent patterns as a geometric graph. The geometric graph distance (GGD) has recently been studied as a meaningful measure of similarity between two geometric graphs. Since computing the GGD is…
In this paper we show that on a complete Riemannian manifold of negative curvature and dimension $n>1$ every two points which realize a local maximum for the distance function are connected by at least $2n+1$ geometrically distinct geodesic…
In this paper, we study the unit graph $ G(\mathbb{Z}_n) $, where $ n $ is of the form $n = p_1^{n_1} p_2^{n_2} \dots p_r^{n_r}$, with $ p_1, p_2, \dots, p_r $ being distinct prime numbers and $ n_1, n_2, \dots, n_r $ being positive…