Related papers: Basis Criteria for Generalized Spline Modules via …
Let $G$ be a simple and simply connected algebraic group over an algebraically closed field $\Bbbk$ of characteristic $p>0$. Assume that $p$ is good for the root system of $G$ and that the covering map $G_{sc} \rightarrow G$ is separable.…
Graph learning from data represents a canonical problem that has received substantial attention in the literature. However, insufficient work has been done in incorporating prior structural knowledge onto the learning of underlying…
We construct, for any finite commutative ring $R$, a family of representations of the general linear group $\mathrm{GL}_n(R)$ whose intertwining properties mirror those of the principal series for $\mathrm{GL}_n$ over a finite field.
In graph neural networks (GNNs), both node features and labels are examples of graph signals, a key notion in graph signal processing (GSP). While it is common in GSP to impose signal smoothness constraints in learning and estimation tasks,…
Let $G$ be a simple graph of order $n$. A dominating set of $G$ is a set $S$ of vertices of $G$ so that every vertex of $G$ is either in $S$ or adjacent to a vertex in $S$. The domination polynomial of $G$ is the polynomial…
The aim of this paper is to introduce and study graded and filtered gamma rings and gamma modules. We prove that the filtered $\Gamma$-ring (module) is a generalization of the notion of graded ring (module). Also, we construct a graded…
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…
Given a causal graph representing the data-generating process shared across different domains/distributions, enforcing sufficient graph-implied conditional independencies can identify domain-general (non-spurious) feature representations.…
Many generalized set models have the same basic form: they assign a value to each object, and the main difference lies in the kind of values that are allowed. This paper studies that common form through scale-valued sets (SV-sets), defined…
A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…
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…
The generalized distance matrix of a graph is the matrix whose entries depend only on the pairwise distances between vertices, and the generalized distance spectrum is the set of eigenvalues of this matrix. This framework generalizes many…
Here we study the problem of generalizing one of the main tools of Groebner basis theory, namely the flat deformation to the leading term ideal, to the border basis setting. After showing that the straightforward approach based on the…
We proposed a new penalized B-splines estimator, the general P-spline, to accommodate non-uniform B-splines on unevenly spaced knots. It is a complement to Eilers and Marx's standard P-spline tailored for uniform B-splines on equidistant…
We introduce a new class of graded rings extending the class of generalized Weyl algebras. These rings are orders in crossed products of the most general type, and we introduce their basic structure theory. We provide an extensive list of…
We consider ideals involving the maximal minors of a polynomial matrix. For example, those arising in the computation of the critical values of a polynomial restricted to a variety for polynomial optimisation. Gr\"obner bases are a…
The generalized recurrence plot is a modern tool for quantification of complex spatial patterns. Its application spans the analysis of trabecular bone structures, Turing patterns, turbulent spatial plankton patterns, and fractals.…
In this paper we study two classes of $\ell$-modular standard modules of the general linear group. The first class is obtained by reducing existing standard modules over $\overline{\mathbb{Q}}_\ell$ to $\overline{\mathbb{F}}_\ell$ with…
Let $G$ be a finite group. For some fixed prime $p$, let $\Gamma_p(G)$ be the common divisor graph built on the set of sizes of $p$-regular conjugacy classes of $G$: this is the simple undirected graph whose vertices are the class sizes of…
Chip firing provides a way to study the sandpile group (also known as the Jacobian) of a graph. We use a generalized version of chip firing to bound the number of invariant factors of the critical group of an arithmetical structure on a…