Related papers: Splines over integer quotient rings
As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…
This paper introduces a method for studying the correlation structure of a range of responses modelled by a multivariate generalised linear mixed model (MGLMM). The methodology requires the existence of clusters of observations and that…
We set up some basic module theory over semirings, with particular attention to what is needed in scheme theory over semirings. We show that while not all the usual definitions of vector bundle agree over semirings, all the usual…
Geometrically continuous splines are piecewise polynomial functions defined on a collection of patches which are stitched together through transition maps. They are called $G^{r}$-splines if, after composition with the transition maps, they…
Computing a graph prototype may constitute a core element for clustering or classification tasks. However, its computation is an NP-Hard problem, even for simple classes of graphs. In this paper, we propose an efficient approach based on…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
The ({\em classical}, {\em small quantum}, {\em equivariant}) cohomology ring of the grassmannian $G(k,n)$ is generated by certain derivations operating on an exterior algebra of a free module of rank $n$ ({\em Schubert Calculus on a…
Let $k$ be a field of characteristic $0$. We consider principal bundles over a $k$-scheme with reductive structure group (not necessarily of finite type). It is showm in particular that for $k$ algebraically closed there exists on any…
In this note we study some of the properties of the generating polynomial for homomorphisms from a graph to at complete weighted graph on $q$ vertices. We discuss how this polynomial relates to a long list of other well known graph…
On the basis of recent results on hamiltonicity and hamiltonian connectedness in the square of a 2-block, we determine the most general block-cutvertex structure a graph $G$ may have in order to guarantee that $G^2$ is hamiltonian,…
A labelled, undirected graph is a graph whose edges have assigned labels, from a specific set. Given a labelled, undirected graph, the well-known minimum labelling spanning tree problem is aimed at finding the spanning tree of the graph…
In this paper, we study the problem of partitioning a graph into connected and colored components called blocks. Using bivariate generating functions and combinatorial techniques, we determine the expected number of blocks when the vertices…
We examine how generalised geometries can be associated with a labelled Dynkin diagram built around a gravity line. We present a series of new generalised geometries based on the groups $\mathit{Spin}(d,d)\times\mathbb{R}^+$ for which the…
We introduce the notion of a generalized intersection pairing for an Artin stack with a proper good moduli space and nonempty stable part. For the moduli stack of semistable bundles over a smooth projective curve, there are four known…
The commuting graph of a group G, denoted by Gamma(G), is the simple undirected graph whose vertices are the non-central elements of G and two distinct vertices are adjacent if and only if they commute. Let Z_m be the commutative ring of…
Calculi of string diagrams are increasingly used to present the syntax and algebraic structure of various families of circuits, including signal flow graphs, electrical circuits and quantum processes. In many such approaches, the semantic…
Splines are central objects for the interpolation of discrete data via piecewise smooth paths. Their iterated-integral signature is an infinite collection of tensors which characterizes paths almost uniquely. We study truncations of this…
In this paper, we investigate generalizations of the Mahler-Popkens complexity of integers. Specifically, we generalize to $k$-th roots of unity, polynomials over the naturals, and the integers mod $m$. In cyclotomic rings, we establish…
The bandwidth of a graph G is the minimum of the maximum difference between adjacent labels when the vertices have distinct integer labels. We provide a polynomial algorithm to produce an optimal bandwidth labeling for graphs in a special…
Current graph neural networks (GNNs) lack generalizability with respect to scales (graph sizes, graph diameters, edge weights, etc..) when solving many graph analysis problems. Taking the perspective of synthesizing graph theory programs,…