English
Related papers

Related papers: Basis Criteria for Generalized Spline Modules via …

200 papers

Spline functions have long been used in numerically solving differential equations. Recently it revives as isogeometric analysis, which uses NURBS for both parametrization and element functions. In this paper, we introduce some multivariate…

Numerical Analysis · Mathematics 2019-06-27 Guohui Zhao

The gradient scheme framework is based on a small number of properties and encompasses a large number of numerical methods for diffusion models. We recall these properties and develop some new generic tools associated with the gradient…

Numerical Analysis · Mathematics 2015-11-10 Jerome Droniou , Robert Eymard , Raphaele Herbin

Let R be a prime ring of characteristic different from 2, U be the Utumi quotient ring of R and C be the extended centroid of R. Let F be a generalized skew derivation on R, I be a non-zero ideal of R. Then we give the complete structure of…

Commutative Algebra · Mathematics 2023-02-01 Ashutosh Pandey , Balchand Prajapati

Let $R$ be a commutative ring with $\Z(R)$ its set of zero-divisors. In this paper, we study the total graph of $R$, denoted by $\T(\Gamma(R))$. It is the (undirected) graph with all elements of $R$ as vertices, and for distinct $x, y\in…

Commutative Algebra · Mathematics 2010-02-01 Hamid Reza Maimani , Cameron Wickham , Siamak Yassemi

For a graph $G=(V,E)$, a set $S \subseteq V$ is a $[1,2]$-set if it is a dominating set for $G$ and each vertex $v \in V \setminus S$ is dominated by at most two vertices of $S$, i.e. $1 \leq \vert N(v) \cap S \vert \leq 2$. Moreover a set…

Discrete Mathematics · Computer Science 2017-07-21 P. Sharifani , M. R. Hooshmandasl

The aim of this paper is to give a proof of the restriction theorems for principal bundles with a reductive algebraic group as structure group in arbitrary characteristic. Let $G$ be a reductive algebraic group over any field $k=\bar{k}$,…

Algebraic Geometry · Mathematics 2013-03-01 Sudarshan Gurjar

A standard construction in approximation theory is mesh refinement. For a simplicial or polyhedral mesh D in R^k, we study the subdivision D' obtained by subdividing a maximal cell of D. We give sufficient conditions for the module of…

Numerical Analysis · Mathematics 2016-10-18 Hal Schenck , Tatyana Sorokina

We develop and study a generalization of commutative rings called bands, along with the corresponding geometric theory of band schemes. Bands generalize both hyperrings, in the sense of Krasner, and partial fields in the sense of Semple and…

Algebraic Geometry · Mathematics 2025-03-14 Matthew Baker , Tong Jin , Oliver Lorscheid

In this paper, we study generalized line bundles over $C_n$, a primitive multiple curve of arbitrary multiplicity $n$, where $n$ is a positive integer. In particular, we give a structure theorem for them and we characterize their…

Algebraic Geometry · Mathematics 2019-02-26 Michele Savarese

Special generic maps are generalizations of Morse functions with exactly two singular points on spheres and canonical projections of unit spheres. They restrict the manifolds of the domains strongly in considerable cases and are important…

Algebraic Topology · Mathematics 2023-03-01 Naoki Kitazawa

We analyze the space of geometrically continuous piecewise polynomial functions or splines for quadrangular and triangular patches with arbitrary topology and general rational transition maps. To define these spaces of G 1 spline functions,…

Algebraic Geometry · Mathematics 2016-03-24 Bernard Mourrain , Raimundas Vidunas , Nelly Villamizar

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…

Combinatorics · Mathematics 2022-11-18 Cedric Xia , Joseph Zhang , Allan Zhou

A graph $G$ is said to be \textit{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$. In \cite{WX,WX1}, Wang and Xu gave…

Combinatorics · Mathematics 2013-09-25 Wei Wang

Graphings serve as limit objects for bounded-degree graphs. We define the ``cycle matroid'' of a graphing as a submodular setfunction, with values in [0,1], which generalizes (up to normalization) the cycle matroid of finite graphs. We…

Combinatorics · Mathematics 2023-11-08 László Lovász

Network analysis has emerged as a key technique in communication studies, economics, geography, history and sociology, among others. A fundamental issue is how to identify key nodes, for which purpose a number of centrality measures have…

Social and Information Networks · Computer Science 2018-01-08 László Csató

A differential module is a module equipped with a square-zero endomorphism. This structure underpins complexes of modules over rings, as well as differential graded modules over graded rings. We establish lower bounds on the class--a…

Commutative Algebra · Mathematics 2009-11-11 Luchezar L. Avramov , Ragnar-Olaf Buchweitz , Srikanth Iyengar

We establish the existence of Springer isomorphisms for reductive group schemes over general base schemes. For this, we first study centralizers of fiberwise regular sections of reductive group schemes, and we establish their flatness in…

Algebraic Geometry · Mathematics 2022-11-16 Sean Cotner

We study the analytic and topological invariants associated with complex normal surface singularities. Our goal is to provide topological formulae for several discrete analytic invariants whenever the analytic structure is generic (with…

Algebraic Geometry · Mathematics 2019-09-17 János Nagy , András Némethi

Data constraints are fundamental for practical data modelling, and a verifiable conformance of a data instance to a safety-critical constraint (satisfaction relation) is a corner-stone of safety assurance. Diagrammatic constraints are…

Logic in Computer Science · Computer Science 2023-06-29 Zinovy Diskin

For a graph $\mathbb{Q}=(\mathbb{V},\mathbb{E})$, the transformation graphs are defined as graphs with vertex set being $\mathbb{V(Q)} \cup \mathbb{E(Q)}$ and edge set is described following certain conditions. In comparison to the…

Discrete Mathematics · Computer Science 2024-10-15 Parvez Ali , Annmaria Baby , D. Antony Xavier , Theertha Nair A , Haidar Ali , Syed Ajaz K. Kirmani
‹ Prev 1 4 5 6 7 8 10 Next ›