Related papers: Splines over integer quotient rings
Spin networks, essentially labeled graphs, are ``good quantum numbers'' for the quantum theory of geometry. These structures encompass a diverse range of techniques which may be used in the quantum mechanics of finite dimensional systems,…
A graph $G$ is called a sum graph if there is a so-called sum labeling of $G$, i.e. an injective function $\ell: V(G) \rightarrow \mathbb{N}$ such that for every $u,v\in V(G)$ it holds that $uv\in E(G)$ if and only if there exists a vertex…
Methods of constructing trigonometric fundamental splines with constant sign and sign-changing convergence factors are given. An example and graphics illustrating the concepts of convergence and interpolation grids are given. Some methods…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
In this paper we give a new generalization of token graphs. Given two integers $1\leq m \leq k$ and a graph $G$ we define the generalized token graph of the graph $G$, to be the graph $F_k^m(G)$ whose vertices correspond to configurations…
A vertex k-ranking is a labeling of the vertices of a graph with integers from 1 to k so any path connecting two vertices with the same label will pass through a vertex with a greater label. The rank number of a graph is defined to be the…
We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification…
We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…
Correlation clustering provides a method for separating the vertices of a signed graph into the optimum number of clusters without specifying that number in advance. The main goal in this type of clustering is to minimize the number of…
We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…
In this paper, a method is proposed to solve the problem of monotone smoothing splines using general linear systems. This problem, also called monotone control theoretic splines, has been solved only when the curve generator is modeled by…
Generalized Cunningham chains are sets of the form $\{f^n(z)\}_{n\ge0}$ where all its elements are prime numbers and $f$ is a linear polynomial with integer coefficients. We generalize this definition further to include starting terms that…
Given an edge-coloring of a graph $G$, we associate to every vertex $v$ of $G$ the set of colors appearing on the edges incident with $v$. The palette index of $G$ is defined as the minimum number of such distinct sets, taken over all…
We compute the cohomology ring of a generalised type of configuration space of points in $\mathbb{R}^r$. This configuration space is indexed by a graph. In the case the graph is complete the result is known and it is due to Arnold and…
Subdivision schemes are iterative methods for the design of smooth curves and surfaces. Any linear subdivision scheme can be identified by a sequence of Laurent polynomials, also called subdivision symbols, which describe the linear rules…
A spline is an assignment of polynomials to the vertices of a graph, where the difference of two polynomials along an edge must belong to the ideal labeling that edge. We consider a ring of splines $\mathcal{M}_{H}$ constructed on a graph…
Let $S, K$ be two subrings of a finite ring $R$. Then the generalized non-commuting graph of subrings $S, K$ of $R$, denoted by $\Gamma_{S, K}$, is a simple graph whose vertex set is $(S \cup K) \setminus (C_K(S) \cup C_S(K))$ and two…
We obtain a new important basic result on splice-quotient singularities in an elegant combinatorial-geometric way: every level of the divisorial filtration of the ring of functions is generated by monomials of the defining coordinate…
A graph composition is a partition of the vertex set such that each member of the partition induces a connected sub- graph, and the composition number of a graph is the number of possible graph compositions. A partition of a set S of…
We provide several results on splice-quotient singularities: a combinatorial expression of the dimension of the first cohomology of all `natural' line bundles, an equivariant Campillo-Delgado-Gusein-Zade type formula about the dimension of…