Related papers: Splines mod m
We classify modules and rings with some specific properties of their intersection graphs. In particular, we describe rings with infinite intersection graphs containing maximal left ideals of finite degree. This answers a question raised in…
We consider spaces of multivariate splines defined on a particular type of simplicial partitions that we call (generalized) oranges. Such partitions are composed of a finite number of maximal faces with exactly one shared medial face. We…
Let $G$ be a simple graph on $n$ vertices and $\mathcal{I}_G$ denotes parity binomial edge ideal of $G$ in the polynomial ring $S = \mathbb{K}[x_1,\ldots, x_n, y_1, \ldots, y_n].$ We obtain a lower bound for the regularity of parity…
Crystalline graded rings are generalizations of certain classes of rings like generalized twisted group rings, generalized Weyl algebras, and generalized skew crossed products. When the base ring is a commutative Dedekind domain, two…
We establish the existence of Springer isomorphisms for reductive group schemes over general base schemes. For this, we first study centralizers of fiberwise regular sections of reductive group schemes, and we establish their flatness in…
Spline functions have long been used in numerically solving differential equations. Recently it revives as isogeometric analysis, which uses NURBS for both parametrization and element functions. In this paper, we introduce some multivariate…
Let $R$ be a commutative ring and $M$ be an $R$-module, and let $I(R)^*$ be the set of all non-trivial ideals of $R$. The $M$-intersection graph of ideals of $R$, denoted by $G_M(R)$, is a graph with the vertex set $I(R)^*$, and two…
The sum-essential graph $ \mathcal{S}_R(M) $ of a left $R$-module $M$ is a graph whose vertices are all nontrivial submodules of $M$ and two distinct submodules are adjacent iff their sum is an essential submodule of $M$. Properties of the…
Spline functions have long been used in numerical solution of differential equations. Recently it revives as isogeometric analysis, which offers integration of finite element analysis and NURBS based CAD into a single unified process.…
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 define a chain complex for generalized splines on graphs, analogous to that introduced by Billera and refined by Schenck-Stillman for splines on polyhedral complexes. The hyperhomology of this chain complex yields bounds on the…
We investigate, using the notion of linear quotients, significative classes of connected graphs whose monomial edge ideals, not necessarily squarefree, have linear resolution, in order to compute standard algebraic invariants of the…
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…
Given a local ring containing a field, we define and investigate a family of invariants that includes the Lyubeznik numbers, but that captures finer information. These "generalized Lyubeznik numbers" are defined as lengths of certain…
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…
One of the possible variants of the classification of trigonometric interpolation splines is considered, depending on the chosen convergence factors, the distribution of signs of the basis functions and the interpolation factors. The…
A simple and connected $n$-vertex graph has a prime vertex labeling if the vertices can be injectively labeled with the integers $1, 2, 3,\ldots, n$, such that adjacent vertices have relatively prime labels. We will present previously…
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…
Series-parallel (SP) graphs are binary edge-labeled graphs with a designated source and target vertex, built using serial and parallel composition. A set of graphs is recognizable if membership depends only on its image under a homomorphism…
A magic labelling of a graph $G$ with magic sum $s$ is a labelling of the edges of $G$ by nonnegative integers such that for each vertex $v\in V$, the sum of labels of all edges incident to $v$ is equal to the same number $s$. Stanley gave…