Related papers: Basis Criteria for Generalized Spline Modules via …
The goal of this paper is to unify two lines in a particular area of graph limits. First, we generalize and provide unified treatment of various graph limit concepts by means of a combination of model theory and analysis. Then, as an…
In combinatorial commutative algebra and algebraic statistics many toric ideals are constructed from graphs. Keeping the categorical structure of graphs in mind we give previous results a more functorial context and generalize them by…
We look at AG codes associated to the projective line, re-examining the problem of determining their automorphism groups (originally investigated by Duer in 1987 using combinatorial techniques) using recent methods from algebraic geometry.…
In the literature, the notion of discrepancy is used in several contexts, even in the theory of graphs. Here, for a graph $G$, $\{-1, 1\}$ labels are assigned to the edges, and we consider a family $\mathcal{S}_G$ of (spanning) subgraphs of…
In this paper we study scalar multivariate subdivision schemes with general integer expanding dilation matrix. Our main result yields simple algebraic conditions on the symbols of such schemes that characterize their polynomial…
In areas such as kernel smoothing and non-parametric regression there is emphasis on smooth interpolation and smooth statistical models. Splines are known to have optimal smoothness properties in one and higher dimensions. It is shown, with…
Given a graph $G=(V, E)$, its generalized Laplacian matrix is given by \[ L(G,X_G)_{u,v}= \begin{cases} x_u&\text{if }u=v,\\ -m_{uv}&\text{if }u\neq v, \end{cases} \] where $X_G=\{x_u\, | \, u\in V(G)\}$ is a set of indeterminates and…
Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…
Multi-degree splines are piecewise polynomial functions having sections of different degrees. They offer significant advantages over the classical uniform-degree framework, as they allow for modeling complex geometries with fewer degrees of…
The generalized degree polynomial $\mathbf{G}_T(x,y,z)$ of a tree $T$ is an invariant introduced by Crew that enumerates subsets of vertices by size and number of internal and boundary edges. Aliste-Prieto et al. proved that $\mathbf{G}_T$…
We introduce a family of mathematical objects called $\mathcal{P}$-schemes, where $\mathcal{P}$ is a poset of subgroups of a finite group $G$. A $\mathcal{P}$-scheme is a collection of partitions of the right coset spaces $H\backslash G$,…
Given a graph $G$ on $n$ vertices, its adjacency matrix and degree diagonal matrix are represented by $A(G)$ and $D(G)$, respectively. The $Q$-spectrum of $G$ consists of all the eigenvalues of its signless Laplacian matrix $Q(G)=A(G)+D(G)$…
As a consequence of the Riemann-Roch theorem, a closed Riemann surface $S$ can be described by a non-singular complex projective algebraic curve $C$. A field of definition for $S$ is any subfield $D$ of $\mathbb{C}$ so that we may choose…
In this article we mainly consider the positively Z-graded polynomial ring R=F[X,Y] over an arbitrary field F and Hilbert series of finitely generated graded R-modules. The central result is an arithmetic criterion for such a series to be…
We study the task of semi-supervised learning on multilayer graphs by taking into account both labeled and unlabeled observations together with the information encoded by each individual graph layer. We propose a regularizer based on the…
Trace diagrams are structured graphs with edges labeled by matrices. Each diagram has an interpretation as a particular multilinear function. We provide a rigorous combinatorial definition of these diagrams using a notion of signed graph…
Identifiability conditions for single or multiple modules in a dynamic network specify under which conditions the considered modules can be uniquely recovered from the second-order statistical properties of the measured signals. Conditions…
We explicitly describe the divisor class groups and semidualizing modules for ladder determinantal rings with coefficients in an arbitrary normal domain for arbitrary ladders, not necessarily connected, and all sizes of minors.
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…
Let $G$ be a group. The intersection graph $\Gamma(G)$ of $G$ is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper non-trivial subgroups of $G$, and there is an edge between two…