Related papers: Basis Criteria for Generalized Spline Modules via …
A generalized criterion for signature related algorithms to compute Gr\"obner basis is proposed in this paper. Signature related algorithms are a popular kind of algorithms for computing Gr\"obner basis, including the famous F5 algorithm,…
In this article, we introduce a generalization of the concept of graded $r$-ideals in graded commutative rings with nonzero unity. Let $G$ be a group, $R$ be a $G$-graded commutative ring with nonzero unity and $GI(R)$ be the set of all…
A graph $G$ is said to be determined by its generalized spectrum (DGS for short) if for any graph $H$, $H$ and $G$ are cospectral with cospectral complements implies that $H$ is isomorphic to $G$. It turns out that whether a graph $G$ is…
Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…
We introduce the notion of a generalized intersection pairing for an Artin stack with a proper good moduli space and nonempty stable part. For the moduli stack of semistable bundles over a smooth projective curve, there are four known…
This paper considers generalized linear models using rule-based features, also referred to as rule ensembles, for regression and probabilistic classification. Rules facilitate model interpretation while also capturing nonlinear dependences…
A cyclic base ordering of a connected graph $G$, is a cyclic ordering of $E(G)$ such that every cyclically consecutive $|V(G)|-1$ edges form a spanning tree. In this project, we study cyclic base ordering of various families of graphs,…
Generalized geometry finds many applications in the mathematical description of some aspects of string theory. In a nutshell, it explores various structures on a generalized tangent bundle associated to a given manifold. In particular,…
Methods of constructing trigonometric fundamental splines with constant sign and sign-changing convergence factors are given. An example and graphics illustrating the concepts of convergence and interpolation grids are given. Some methods…
Gr\"obner bases are a fundamental tool when studying ideals in multivariate polynomial rings. More recently there has been a growing interest in transferring techniques from the field case to other coefficient rings, most notably Euclidean…
Spline functions have long been used in numerical solution of differential equations. Recently it revives as isogeometric analysis, which offers integration of finite element analysis and NURBS based CAD into a single unified process.…
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…
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…
In this paper we obtain closed formulae for several parameters of generalized Sierpi\'{n}ski graphs $S(G,t)$ in terms of parameters of the base graph $G$. In particular, we focus on the chromatic, vertex cover, clique and domination…
Periodic splines are a special kind of splines that are defined over a set of knots over a circle and are adequate for solving interpolation problems related to closed curves. This paper presents a method of implementing the objects…
We compute the depth and (give bounds for) the regularity of generalized binomial edge ideals associated with generalized block graphs.
In this paper we present a method for direct evaluation of generalized B-splines (GB-splines) via the local representation of these curves as piecewise functions. To accomplish this we introduce a local structure that makes GB-spline curves…
Let G be a simple graph of order n. The domination polynomial of a graph is the generating function of its dominating sets. We study the domination polynomials of generalized friendship graphs. We also consider book graphs formed by joining…
Compositional generalization is one of the main properties which differentiates lexical learning in humans from state-of-art neural networks. We propose a general framework for building models that can generalize compositionally using the…
We provide necessary and sufficient conditions for simplicial complexes whose determinantal facet ideals admit reduced Grobner bases under diagonal term orders. Building on and extending foundational results for binomial edge ideals and…