Related papers: Basis Criteria for Generalized Spline Modules via …
This research focuses on analyzing the depth of generalized binomial edge ideals. We extend the notion of $d$-compatible map for the pairs of a complete graph and an arbitrary graph, and using it, we give a combinatorial lower bound for the…
With the renewed and growing interest in geometric continuity in mind, this article gives a general definition of geometrically continuous polygonal surfaces and geometrically continuous spline functions on them. Polynomial splines defined…
The majority of graphs whose sandpile groups are known are either regular or simple. We give an explicit formula for a family of non-regular multi-graphs called thick cycles. A thick cycle graph is a cycle where multi-edges are permitted.…
Generalized diagonal matrices are matrices that have two ladders of entries that are zero in the upper right and bottom left corners. The minors of generic generalized diagonal matrices have square-free initial ideals. We give a description…
A sum graph is a finite simple graph whose vertex set is labeled with distinct positive integers such that two vertices are adjacent if and only if the sum of their labels is itself another label. The spum of a graph $G$ is the minimum…
Let R be a commutative ring with unity, M be an unitary R-module and {\Gamma} be a simple graph. This research article is an interplay of combinatorial and algebraic properties of M . We show a combinatorial object completely determines an…
This paper provides some new guidance in the construction of region graphs for Generalized Belief Propagation (GBP). We connect the problem of choosing the outer regions of a LoopStructured Region Graph (SRG) to that of finding a…
This paper presents a spline-based parameterisation framework for plane graphs. The plane graph is characterised by a collection of curves forming closed loops that fence-off planar faces which have to be parameterised individually. Hereby,…
A new global basis of B-splines is defined in the space of generalized quadratic splines (GQS) generated by Merrien subdivision algorithm. Then, refinement equations for these B-splines and the associated corner-cutting algorithm are given.…
Border bases are a generalization of Gr\"obner bases for zero-dimensional ideals in polynomial rings. In this article, we introduce border bases for a non-commutative ring of linear differential operators, namely the rational Weyl algebra.…
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…
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…
We investigate some general machinery for describing semidualizing modules over generic constructions like ladder determinantal rings with coefficients in a normal domain. We also pose and investigate natural localization questions that…
The classical coinvariant ring $R_n$ is defined as the quotient of a polynomial ring in $n$ variables by the positive-degree $S_n$-invariants. It has a known basis that respects the decomposition of $R_n$ into irreducible $S_n$-modules,…
A generalized criterion for signature-based algorithms to compute Gr\"obner bases is proposed in this paper. This criterion is named by "generalized criterion", because it can be specialized to almost all existing criteria for…
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…
Spherical Designs are finite sets of points on the sphere $\mathbb{S}^{d}$ with the property that the average of certain (low-degree) polynomials in these points coincides with the global average of the polynomial on $\mathbb{S}^{d}$. They…
There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecular structures are mined to discover fragments useful as…
We study scalar $d$-variate subdivision schemes, with dilation matrix 2I, satisfying the sum rules of order $k$. Using the results of M\"oller and Sauer, stated for general expanding dilation matrices, we characterize the structure of the…
We establish relations between the bandwidth and the treewidth of bounded degree graphs G, and relate these parameters to the size of a separator of G as well as the size of an expanding subgraph of G. Our results imply that if one of these…