Related papers: Extending Generalized Splines Over The Integers
Let $G$ be a group with identity $e$. Let $R$ be a $G$-graded commutative ring and $M$ a graded $R$-module. In this paper, we introduce the concept of graded primary-like submodules as a new generalization of graded primary ideals and give…
E-graphs are a data structure for equational reasoning and optimization over ground terms. One of the benefits of e-graph rewriting is that it can declaratively handle useful but difficult to orient identities like associativity and…
This work introduces ``generalized meshes", a type of meshes suited for the discretization of partial differential equations in non-regular geometries. Generalized meshes extend regular simplicial meshes by allowing for overlapping elements…
The van Est map is a map from Lie groupoid cohomology (with respect to a sheaf taking values in a representation) to Lie algebroid cohomology. We generalize the van Est map to allow for more general sheaves, namely to sheaves of sections…
The generalized Verlinde formulae expressing traces of mapping classes corresponding to automorphisms of certain Riemann surfaces, and the congruence relations on allowed modular representations following from them are presented. The…
Graph Neural Networks (GNNs) extend convolutional neural networks to operate on graphs. Despite their impressive performances in various graph learning tasks, the theoretical understanding of their generalization capability is still…
In this paper, we extend the classical arithmetic defined over the set of natural numbers N, to the set of all finite directed connected multigraphs having a pair of distinct distinguished vertices. Specifically, we introduce a model F on…
It is known that a number of natural graph problems which are FPT parameterized by treewidth become W-hard when parameterized by clique-width. It is therefore desirable to find a different structural graph parameter which is as general as…
Let $\mathcal{X}$ be a class of $R$-modules. In this paper, we investigate \;$\mathcal{X}$-(f.g.)injective ((f.g.)projective) and DG-$\mathcal{X}$-injective (projective) complexes which are generalizations of injective (projective) and…
We give a general, direct and explicit construction of lower-bounded generalized twisted modules satisfying a universal property for a grading-restricted vertex (super)algebra $V$ associated to an automorphism $g$ of $V$. In particular,…
We consider overlap splines that are defined by connecting the patches of piecewise functions via common values at given finite sets of nodes, without using any partitions of the computational domain. It is shown that some classical finite…
In recent years, hypergraph generalizations of many graph cut problems have been introduced and analyzed as a way to better explore and understand complex systems and datasets characterized by multiway relationships. Recent work has made…
Splines come in a variety of flavors that can be characterized in terms of some differential operator L. The simplest piecewise-constant model corresponds to the derivative operator. Likewise, one can extend the traditional notion of total…
Previous research has sought to enhance the graph reasoning capabilities of LLMs by supervised fine-tuning on synthetic graph data. While these led to specialized LLMs better at solving graph algorithm problems, we don't need LLMs for…
Let R be a commutative ring and M be an R-module. We define the large sum graph, denoted by \acute{G}(M), as a graph with the vertex set of non-large submodules of M and two distinct vertices are adjacent if and only if N + K is a non-large…
In this paper, we introduce and study the multilevel-planarity testing problem, which is a generalization of upward planarity and level planarity. Let $G = (V, E)$ be a directed graph and let $\ell: V \to \mathcal P(\mathbb Z)$ be a…
Graph Neural Networks (GNNs), despite achieving remarkable performance across different tasks, are theoretically bounded by the 1-Weisfeiler-Lehman test, resulting in limitations in terms of graph expressivity. Even though prior works on…
$M$-Lipschitz mappings of graphs (or equivalently graph-indexed random walks) are a generalization of standard random walk on $\mathbb{Z}$. For $M \in \N$, an \emph{$M$-Lipschitz mapping} of a connected rooted graph $G = (V,E)$ is a mapping…
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|,…
Graph neural networks (GNNs) are the most widely adopted model in graph-structured data oriented learning and representation. Despite their extraordinary success in real-world applications, understanding their working mechanism by theory is…