Related papers: Basis condition for generalized spline modules
We give a natural sufficient condition for an intersection graph of compact convex sets in R^d to have a balanced separator of sublinear size. This condition generalizes several previous results on sublinear separators in intersection…
In this paper we consider spaces of bivariate splines of bi-degree (m, n) with maximal order of smoothness over domains associated to a two-dimensional grid. We define admissible classes of domains for which suitable combinatorial technique…
Suppose that there is an unknown underlying graph $G$ on a large vertex set, and we can test only a proportion of the possible edges to check whether they are present in $G$. If $G$ has high modularity, is the observed graph $G'$ likely to…
Vertex similarity is a major problem in network science with a wide range of applications. In this work we provide novel perspectives on finding (dis)similar vertices within a network and across two networks with the same number of vertices…
A generalised notion of connection on a fibre bundle E over a manifold M is presented. These connections are characterised by a smooth distribution on E which projects onto a (not necessarily integrable) distribution on M and which, in…
Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…
In this paper we focus on the problem of computing the number of moduli of the so called Severi varieties (denoted by V(|D|, \delta)), which parametrize universal families of irreducible, \delta-nodal curves in a complete linear system |D|,…
We investigate the generalizability of learned binary relations: functions that map pairs of instances to a logical indicator. This problem has application in numerous areas of machine learning, such as ranking, entity resolution and link…
In this paper we approach the study of generalized theta linear series on moduli of vector bundles on curves via vector bundle techniques on abelian varieties. We study what are called the Verlinde bundles in order to obtain information…
A set $S$ of vertices of a graph $G$ is \emph{distinguishing} if the sets of neighbors in $S$ for every pair of vertices not in $S$ are distinct. A \emph{locating-dominating set} of $G$ is a dominating distinguishing set. The…
We study a shift invariant space on an undirected graphs $G$ having $N$ vertices. We obtain a characterization theorem for a system of generalized translates $\{T_{i}g : 1\leq i\leq N\}$, for $g\in C^N$, to form an orthonormal basis.…
We give the first specific conjectures on how frequently graphs satisfy sufficient conditions for being uniquely characterized by spectral information. These conjectures arise from a theoretical framework that we developed based on…
Sufficient conditions for a simple graph to be characterized up to isomorphism given its spectrum and the spectrum of its complement graph are known due to Wang and Xu. This note establishes a related sufficient condition in the presence of…
Perhaps the very first elementary exercise one encounters in graph theory is the result that any graph on at least two vertices must have at least two vertices with the same degree. There are various ways in which this result can be…
A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…
We define the notion of a parahoric group scheme $\mathcal G$ over a smooth projective curve, and formulate four conjectures on the structure of the stack of $\mathcal G$-bundles, which generalize to this case well-known results on…
We present and investigate an extension of the classical random graph to a general class of inhomogeneous random graph models, where vertices come in different types, and the probability of realizing an edge depends on the types of its…
A vertex subset $S$ of a graph $G$ is a general position set of $G$ if no vertex of $S$ lies on a geodesic between two other vertices of $S$. The cardinality of a largest general position set of $G$ is the general position number ${\rm…
The spectral radius {\rho}(G) of a digraph G is the maximum modulus of the eigenvalues of its adjacency matrix. We present bounds on {\rho}(G) that are often tighter and are applicable to a larger class of digraphs than previously reported…
Besides the need for a better understanding of networks, there is a need for prescriptive models and tools to specify requirements concerning networks and their associated graph representations. We propose class-based graphs as a means to…