Related papers: Splines mod m
Simple drawings are drawings of graphs in which the edges are Jordan arcs and each pair of edges share at most one point (a proper crossing or a common endpoint). We introduce a special kind of simple drawings that we call generalized…
Let R be a commutative ring with unity, M a module over R and let S be a G-set for a finite group G. We define a set MS to be the set of elements expressed as the formal finite sum of the form similar to the elements of group ring RG. The…
We consider the problem of classifying graphs using graph kernels. We define a new graph kernel, called the generalized shortest path kernel, based on the number and length of shortest paths between nodes. For our example classification…
Let $G$ be a finite group. The solubility graph associated with the finite group $G$, denoted by $\Gamma_{\cal S}(G)$, is a simple graph whose vertices are the non-trivial elements of $G$, and there is an edge between two distinct elements…
The book is devoted to investigation of arithmetic of the matrix rings over certain classes of commutative finitely generated principal ideals domains. We mainly concentrate on constructing of the matrix factorization theory. We reveal a…
Given a diagram of rings, one may consider the category of modules over them. We are interested in the homotopy theory of categories of this type: given a suitable diagram of model categories M(s) (as s runs through the diagram), we…
Skolem sequences and Skolem labeled graphs have been described and examined for several decades. This note explores weak Skolem labelling of cycle graphs, which we call Skolem circles. The relationship between Skolem sequences and Skolem…
We show that by working over the absolute base $\mathbb S$ (the categorical version of the sphere spectrum) instead of $\mathbb S[\pm 1]$ improves our previous Riemann-Roch formula for $\overline{{\rm Spec\,}\mathbb Z}$. The formula equates…
The operation of zig-zag products of graphs is the analogue of the semidirect product of groups. Using this observation, we present a categorical description of zig-zag products in order to generalize the construction for the category of…
For a flexible labeling of a graph, it is possible to construct infinitely many non-equivalent realizations keeping the distances of connected points constant. We give a combinatorial characterization of graphs that have flexible labelings.…
We describe the generic modules in each component of the spaces of representations of certain string algebras. In so doing, we calculate the dimensions of higher self-extension groups for generic modules. This algorithm lends itself for use…
The upper ideal relation graph $\Gamma_{U}(R)$ of a commutative ring $R$ with unity is a simple undirected graph with the set of all non-unit elements of $R$ as a vertex set and two vertices $x$, $y$ are adjacent if and only if the…
Let $G$ be an $n$-vertex connected graph. A cyclic base ordering of $G$ is a cyclic ordering of all edges such that every cyclically consecutive $n-1$ edges induce a spanning tree of $G$. In this project, we study cyclic base ordering of…
We give a complete characterization of graphs whose binomial edge ideal is licci. An important tool is a new general upper bound for the regularity of binomial edge ideals.
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…
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…
We give a survey on projective ring lines and some of their substructures which in turn are more general than a projective line over a ring.
In this paper, we give formulas for $v$-number of edge ideals of some graphs like path, cycle, 1-clique sum of a path and a cycle, 1-clique sum of two cycles and join of two graphs. For an $\mathfrak{m}$-primary monomial ideal $I\subset…
Given a trivially graded polynomial ring $A=K[a_1,\dots,a_m]$ over a field $K$ and a positively graded polynomial ring $P=A[x_1,\dots,x_k]$, we study graded rings $R=P/I$, where $I$ is a homogeneous ideal in $P$ such that $I\cap A = \{0\}$.…
The set of minimal primes of a ring is a very important set as far the spectrum of a ring is concerned as every prime contains a minimal prime. So, knowing the minimal primes is the first (important and difficult) step in describing the…