Related papers: Notion of a virtual derivative
Given a group endowed with a Z/2-valued morphism we associate a Gauss diagram theory, and show that for a particular choice of the group these diagrams encode faithfully virtual knots on a given arbitrary surface. This theory contains all…
In this work, we characterize the class of word-representable graphs with respect to the modular decomposition. Consequently, we determine the representation number of a word-representable graph in terms of the permutation-representation…
This paper presents a graded hierarchy or chain of binary operations on the reals and the complex numbers. The operations are related distributively in the sense that any one of them distributes over the next lower operation in the chain.…
We introduce a notion of fractional (noninteger order) derivative on an arbitrary nonempty closed subset of the real numbers (on a time scale). Main properties of the new operator are proved and several illustrative examples given.
Many real-world domains can be expressed as graphs and, more generally, as multi-relational knowledge graphs. Though reasoning and learning with knowledge graphs has traditionally been addressed by symbolic approaches, recent methods in…
The modular decomposition of a graph is a canonical representation of its modules. Algorithms for computing the modular decomposition of directed and undirected graphs differ significantly, with the undirected case being simpler, and…
Pseudodiagrams are knot or link diagrams where some of the crossing information is missing. Pseudoknots are equivalence classes of pseudodiagrams, where equivalence is generated by a natural set of Reidemeister moves. In this paper, we…
Universal geometric calculus simplifies and unifies the structure and notation of mathematics for all of science and engineering, and for technological applications. This paper treats the fundamentals of the multivector differential…
Connected components of real algebraic sets are semi-algebraic, i.e. they are described by a boolean formula whose atoms are polynomial constraints with real coefficients. Computing such descriptions finds topical applications in optical…
Differentiation is a cornerstone of computing and data analysis in every discipline of science and engineering. Indeed, most fundamental physics laws are expressed as relationships between derivatives in space and time. However, derivatives…
This paper focuses on certain finite dimensional point derivations for the non-selfadjoint operator algebras corresponding to directed graphs. We begin by analyzing the derivations corresponding to full matrix representations of the tensor…
In this article we describe the construction of logarithmic models in both real and complex cases. A logarithmic model is a germ of closed meromorphic 1-form with simple poles - and the analytic foliation defined by it - produced upon some…
Vector calculus in three-dimensional space is ubiquitous in applications of mathematics in physics and engineering. Its two-dimensional version is, however, quite rare. Here we try to provide a pedagogical account of the subject. It is…
In this paper, we discuss some problems of elementary plane differential geometry and kinematics. Although the results are not new, the consistent use of complex-valued functions (plane curves) of a real variable (parameter) allows to…
In this article we discuss an important students' misconception about derivatives, that the expression of the derivative of the function contains the information as to whether the function is differentiable or not where the expression is…
Kuperberg [Algebr. Geom. Topol. 3 (2003) 587-591] has shown that a virtual knot corresponds (up to generalized Reidemeister moves) to a unique embedding in a thichened surface of minimal genus. If a virtual knot diagram is equivalent to a…
This chapter provides an introduction to the use of diagrammatic language, or perhaps more accurately, diagrammatic calculus, in quantum information and quantum foundations. We illustrate the use of diagrammatic calculus in one particular…
In this paper, we will show dichotomy theorems for the computation of polynomials corresponding to evaluation of graph homomorphisms in Valiant's model. We are given a fixed graph $H$ and want to find all graphs, from some graph class,…
A procedure to obtain differentiation matrices is extended straightforwardly to yield new differentiation matrices useful to obtain derivatives of complex rational functions. Such matrices can be used to obtain numerical solutions of some…
Graphs arise naturally in many real-world applications including social networks, recommender systems, ontologies, biology, and computational finance. Traditionally, machine learning models for graphs have been mostly designed for static…