Related papers: Differential operators, grammars and Young tableau…
We have been working in many aspects of the problem of analyzing, understanding and solving ordinary differential equations (first and second order). As we have extensively mentioned, while working in the Darboux type methods, the most…
In a recent paper (M. Barash, A. Okhotin, "Defining contexts in context-free grammars", LATA 2012), the authors introduced an extension of the context-free grammars equipped with an operator for referring to the left context of the…
In this paper, we introduce the notion of a grammatical labeling to describe a recursive process of generating combinatorial objects based on a context-free grammar. For example, by labeling the ascents and descents of a Stirling…
**Context** Context-free grammars are widely used for language prototyping and implementation. They allow formalizing the syntax of domain-specific or general-purpose programming languages concisely and declaratively. However, the natural…
Density operators allow for representing ambiguity about a vector representation, both in quantum theory and in distributional natural language meaning. Formally equivalently, they allow for discarding part of the description of a composite…
For any context-free grammar, we build a transition diagram, that is, a finite directed graph with labeled arcs, which describes the work of the grammar. This approach is new, and it is different from previously known graph models. We…
We introduce a novel integrability-preserving discretization for a broad class of differential equations with variable coefficients, encompassing both linear and nonlinear cases. The construction is achieved via a categorical approach that…
In this paper, we consider systems of algebraic and non-linear partial differential equations and inequations. We decompose these systems into so-called simple subsystems and thereby partition the set of solutions. For algebraic systems,…
In this paper, we establish the Composition-Diamond lemma for $\lambda$-differential associative algebras over a field $K $ with multiple operators. As applications, we obtain Gr\"{o}bner-Shirshov bases of free $\lambda$-differential…
This paper introduces a new derivative parsing algorithm for recognition of parsing expression grammars. Derivative parsing is shown to have a polynomial worst-case time bound, an improvement on the exponential bound of the recursive…
We present a system for the automatic differentiation of a higher-order functional array-processing language. The core functional language underlying this system simultaneously supports both source-to-source automatic differentiation and…
In 2000, Voiculescu proved an algebraic characterization of cyclic gradients of noncommutative polynomials. We extend this remarkable result in two different directions: first, we obtain an analogous characterization of free gradients;…
We develop a new tool, namely polynomial and linear algebraic methods, for studying systems of word equations. We illustrate its usefulness by giving essentially simpler proofs of several hard problems. At the same time we prove extensions…
Ma-Ma-Yeh made a beautiful observation that a transformation of the grammar of Dumont instantly leads to the $\gamma$-positivity of the Eulerian polynomials. We notice that the transformed grammar bears a striking resemblance to the grammar…
Taylor's formula holds significant importance in function representation, such as solving differential difference equations, ordinary differential equations, partial differential equations, and further promotes applications in visual…
There exists a well established differential topological theory of singularities of ordinary differential equations. It has mainly studied scalar equations of low order. We propose an extension of the key concepts to arbitrary systems of…
Kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
Deep learning based methods hold state-of-the-art results in image denoising, but remain difficult to interpret due to their construction from poorly understood building blocks such as batch-normalization, residual learning, and feature…
We use the definition of differential operators on noncommutative rings given by V.Lunts and A.Rosenberg to find the differential operators on Azumaya algebras and the Heisenberg algebras.