Related papers: A Minimal Substitution Basis for the Kalm\'ar Elem…
Given an $n*n$ sparse symmetric matrix with $m$ nonzero entries, performing Gaussian elimination may turn some zeroes into nonzero values. To maintain the matrix sparse, we would like to minimize the number $k$ of these changes, hence…
The standard way of solving a polynomial eigenvalue problem associated with a matrix polynomial starts by embedding the matrix coefficients of the polynomial into a matrix pencil, known as a strong linearization. This process transforms the…
An algorithm to generate a minimal comprehensive Gr\"obner\, basis of a parametric polynomial system from an arbitrary faithful comprehensive Gr\"obner\, system is presented. A basis of a parametric polynomial ideal is a comprehensive…
Operational semantics have been enormously successful, in large part due to its flexibility and simplicity, but they are not compositional. Denotational semantics, on the other hand, are compositional but the lattice-theoretic models are…
The main aim of this paper is to provide a novel approach to deriving identities for the Bernstein polynomials using functional equations. We derive various functional equations and differential equations using generating functions.…
This is part II of our book on KAM theory. We start by defining functorial analysis and then switch to the particular case of Kolmogorov spaces. We develop functional calculus based on the notion of local operators. This allows to define…
As a typical application, the Lenstra-Lenstra-Lovasz lattice basis reduction algorithm (LLL) is used to compute a reduced basis of the orthogonal lattice for a given integer matrix, via reducing a special kind of lattice bases. With such…
This paper develops an enhanced finite element method for approximating a class of variational problems which exhibit the \textit{Lavrentiev gap phenomenon} in the sense that the minimum values of the energy functional have a nontrivial gap…
The Fundamental Theorem of Integral Calculus links the integrand and its antiderivative via a simple first order differential equation. A numerical solution of this ode yields the antiderivative and hence the required integral. This…
This paper introduces and investigates some properties of algebras constructed from the algebra of polynomials via derivation and integration operators using a process presented by Dzhumadildaev in a previous work. In particular, we…
A practical version of the polynomial canonical formalism is developed for normal mesoscopic systems consisting of N independent electrons. Drastic simplification of calculations is attained by means of proper ordering excited states of the…
The Laguerre functions $l_{n,\tau}^\alpha$, $n=0,1,\dots$, are constructed from generalized Laguerre polynomials. The functions $l_{n,\tau}^\alpha$ depend on two parameters: scale $\tau>0$ and order of generalization $\alpha>-1$, and form…
Through a cascade of generalizations, we develop a theory of motivic integration which works uniformly in all non-archimedean local fields of characteristic zero, overcoming some of the difficulties related to ramification and small residue…
The work is devoted to the construction of a new type of intervals -- functional intervals. These intervals are built on the idea of expanding boundaries from numbers to functions. Functional intervals have shown themselves to be promising…
We investigate the long-term dynamics of HD60532, an extrasolar system hosting two giant planets orbiting in a 3:1 mean motion resonance. We consider an average approximation at order one in the masses which results (after the reduction of…
The Macdonald polynomials can be obtained by acting on the constant 1 with creation operators. Three different expressions for these operators are derived, one from the other, in a rather succint way. When the last of these expressions is…
In 2012 Raghavan, Samuel, and Subrahmanyam showed that the Kazhdan--Lusztig basis for the Iwahori--Hecke algebra in type A provides a ``canonical'' basis for the centraliser algebra of the Schur algebra acting on tensor space. In 2022 the…
Several recent works have demonstrated the powerful algebraic simplifications that can be achieved for scattering amplitudes through a systematic grading of transcendental quantities. We develop these concepts to construct a minimal basis…
Kleene algebra (KA) is an important tool for reasoning about general program equivalences, with a decidable and complete equational theory. However, KA cannot always prove equivalences between specific programs. For this purpose, one adds…
We introduce a new notion of computable function on $\R^N$ and prove some basic properties. We give two applications, first a short proof of Yoshinaga's theorem that periods are \el (they are actually low). We also show that the low complex…