Related papers: Generalized Designs on Graphs: Sampling, Spectra, …
Polynomials are common algebraic structures, which are often used to approximate functions including probability distributions. This paper proposes to directly define polynomial distributions in order to describe stochastic properties of…
We characterise the form of all simple, finite graphs for which the girth of the graph is equal to the circumference of the graph. We apply this to prove a bound on the number of edges in such a graph.
The study of the graph diameter of polytopes is a classical open problem in polyhedral geometry and the theory of linear optimization. In this paper we continue the investigation initiated in [4] by introducing a vast hierarchy of…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
Let $k\ge 3$ be an integer, $q$ be a prime power, and $\mathbb{F}_q$ denote the field of $q$ elements. Let $f_i, g_i\in\mathbb{F}_q[X]$, $3\le i\le k$, such that $g_i(-X) = -\, g_i(X)$. We define a graph $S(k,q) =…
A $\textit{spherical $t$-design curve}$ was defined by Ehler and Gr\"{o}chenig to be a continuous, piecewise smooth, closed curve on the sphere with finitely many self-intersections whose associated line integral applied to any polynomial…
We generalize the notion of quasirandom which concerns a class of equivalent properties that random graphs satisfy. We show that the convergence of a graph sequence under the spectral distance is equivalent to the convergence using the…
We give some new explicit examples of putatively optimal projective spherical designs. i.e., ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in…
This paper is concerned with the use of the stereographic projection to map the points of a design on the sphere in three dimensions onto a two-dimensional stereogram. Details of the projection and its attendant stereogram are given and the…
In this paper, we prove the existence of a spherical $t$-design formed by adding extra points to an arbitrarily given point set on the sphere and, subsequently, deduce the existence of nested spherical designs. Estimates on the number of…
A set of unit vectors in $\mathbb{R}^d$ is a called a spherical two-distance set if the inner products of distinct vectors only take two values. In this paper, we give explicit correspondence between spherical two-distance sets and graphs…
Graphs are used in many disciplines to model the relationships that exist between objects in a complex discrete system. Researchers may wish to compare a network of interest to a "typical" graph from a family (or ensemble) of graphs which…
Inspired by the "generalized t-designs" defined by Cameron [P. J. Cameron, A generalisation of t-designs, Discrete Math. 309 (2009), 4835--4842], we define a new class of combinatorial designs which simultaneously provide a generalization…
We derive upper and lower bounds on the sum of distances of a spherical code of size $N$ in $n$ dimensions when $N\sim n^\alpha, 0<\alpha\le 2.$ The bounds are derived by specializing recent general, universal bounds on energy of spherical…
For polynomials and rational maps of fixed degree over a finite field, we bound both the average number of connected components of their functional graphs as well as the average number of periodic points of their associated dynamical…
In this paper we define spherical complexes as simplicial complexes with the property that every subcomplex obtained by a sequence of links and deletions either has trivial homology, or has the homology of a sphere. Examples of such…
Series representations consisting of spherical harmonics are obtained for characteristic exponents and probability density functions of multivariate stable distributions under various conditions. A esult potentially applicable in a…
A set of points $S$ in $d$-dimensional Euclidean space $\mathbb{R}^d$ is called a 2-distance set if the set of pairwise distances between the points has cardinality two. The 2-distance set is called spherical if its points lie on the unit…
Graphings are special bounded-degree graphs on probability spaces, representing limits of graph sequences that are convergent in a local or local-global sense. We describe a procedure for turning the underlying space into a compact metric…
An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…