Related papers: Generalized Designs on Graphs: Sampling, Spectra, …

We find t-designs on compact algebraic manifolds with a number of points comparable to the dimension of the space of polynomials of degree t on the manifold. This generalizes results on the sphere by Bondarenko, Radchenko and Viazovska. Of…

This paper develops an explicit and implementable framework for constructing spherical designs by lifting point sets from tight fusion frames. By combining existing ingredients, we obtain, in every dimension, explicit spherical $5$-designs…

Let $\Phi(x,y)\in\mathbb{C}[x,y]$ be a symmetric polynomial of partial degree $d$. The graph $G(\Phi)$ is defined by taking $\mathbb{C}$ as set of vertices and the points of $\mathbb{V}(\Phi(x,y))$ as edges. We study the following problem:…

Let G be a graph whose edges are labeled by positive integers. Label each vertex with an integer and suppose if two vertices are joined by an edge, the vertex labels are congruent to each other modulo the edge label. The set of vertex…

The square of a connected graph $G$ is obtained from $G$ by adding an edge between every pair of vertices at distance $2$. In this paper we give some upper or lower bounds for the spectral radius of the square of connected graphs, trees and…

A spatial surface is a compact surface embedded in the $3$-sphere. We assume that a spatial surface is oriented and that each connected component of a spatial surface is neither a disk nor without a boundary. A diagram of a spatial surface…

We classify all spherical 2-designs that arise as orbits of finite group actions on real inner product spaces. Although it is well known that such designs can occur in representations without trivial components, we give a complete…

We give lower bounds on the size and total size of clique partitions of a graph in terms of its spectral radius and minimum degree, and derive a spectral upper bound for the maximum number of edge-disjoint $t$-cliques. The extremal graphs…

Asymptotic net is an important concept in discrete differential geometry. In this paper, we show that we can associate affine discrete geometric concepts to an arbitrary non-degenerate asymptotic net. These concepts include discrete affine…

We study the \emph{picture space} $X^d(G)$ of all embeddings of a finite graph $G$ as point-and-line arrangements in an arbitrary-dimensional projective space, continuing previous work on the planar case. The picture space admits a natural…

In this paper we prove the conjecture of Korevaar and Meyers: for each $N\ge c_dt^d$ there exists a spherical $t$-design in the sphere $S^d$ consisting of $N$ points, where $c_d$ is a constant depending only on $d$.

Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…

Graph representations are the generalization of geometric graph drawings from the plane to higher dimensions. A method introduced by Tutte to optimize properties of graph drawings is to minimize their energy. We explore this minimization…

Finite metric spaces arise in many different contexts. Enormous bodies of data, scientific, commercial and others can often be viewed as large metric spaces. It turns out that the metric of graphs reveals a lot of interesting information.…

We consider the recently introduced model of \emph{low ply graph drawing}, in which the ply-disks of the vertices do not have many common overlaps, which results in a good distribution of the vertices in the plane. The \emph{ply-disk} of a…

In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…

The present paper is devoted to clustering geometric graphs. While the standard spectral clustering is often not effective for geometric graphs, we present an effective generalization, which we call higher-order spectral clustering. It…

Consider a family of graphs having a fixed girth and a large size. We give an optimal lower asymptotic bound on the number of even cycles of any constant length, as the order of the graphs tends to infinity.

Statistical analysis of a graph often starts with embedding, the process of representing its nodes as points in space. How to choose the embedding dimension is a nuanced decision in practice, but in theory a notion of true dimension is…

This article investigates the properties of order-divisor graphs associated with finite groups. An order-divisor graph of a finite group is an undirected graph in which the set of vertices includes all elements of the group, and two…