English
Related papers

Related papers: Polarizations and differential calculus in affine …

200 papers

We propose a novel foundation for calculus that focuses on the notion of approximations while avoiding the use of limits altogether. Continuity is defined as approximation at a point, while differentiability is defined as approximation with…

History and Overview · Mathematics 2025-10-27 Michael P. Lamoureux , Matt Yedlin

The aim of this paper is to establish various factorization results and then to derive estimates for linear functionals through the use of a generalized Taylor theorem. Additionally, several error bounds are established including…

Classical Analysis and ODEs · Mathematics 2024-12-10 Ali Hasan Ali , Zsolt Páles

Perturbation or error bounds of functions have been of great interest for a long time. If the functions are differentiable, then the mean value theorem and Taylor's theorem come handy for this purpose. While the former is useful in…

Functional Analysis · Mathematics 2017-04-04 Priyanka Grover

The paper aims to provide a full characterization of all operators $T\colon \mathscr{P}(\mathbb{C}) \to \mathscr{P}(\mathbb{C})$ acting on the space of all complex polynomials that satisfy the Leibniz rule \[ T(f\cdot g)= T(f)\cdot g+f\cdot…

Classical Analysis and ODEs · Mathematics 2025-01-23 Włodzimierz Fechner , Eszter Gselmann

To study a Dirichlet polynomial $f(s)=\frac{a_{m}}{m^{s}}+\cdots +\frac{a_{n}}{n^{s}}$ by regarding it as a multivariate polynomial via the canonical map $\phi$ sending $p_i^{-s}$ to an indeterminate $X_i$, with $p_i$ the $i$th prime…

Number Theory · Mathematics 2025-11-10 Nicolae Ciprian Bonciocat

Already for bivariate tropical polynomials, factorization is an NP-Complete problem. In this paper, we give an efficient algorithm for factorization and rational factorization of a rich class of tropical polynomials in $n$ variables.…

Combinatorics · Mathematics 2019-12-10 Bo Lin , Ngoc Mai Tran

Marginalization -- summing a function over all assignments to a subset of its inputs -- is a fundamental computational problem with applications from probabilistic inference to formal verification. Despite its computational hardness in…

Computational Complexity · Computer Science 2025-07-16 Oliver Broadrick , Sanyam Agarwal , Guy Van den Broeck , Markus Bläser

Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…

Rings and Algebras · Mathematics 2012-02-20 Miguel Couceiro , Jean-Luc Marichal

The characteristic functions of multivariate Feller processes with generator of affine type, and with smooth symbol functions have an explicit representation in terms of power series with rational number coefficients and with monmoms…

Functional Analysis · Mathematics 2010-02-17 Joerg Kampen

Given linear spaces $E$ and $F$ over the real numbers or a field of characteristic zero, a simple argument is given to represent a symmetric multilinear map $u(x_1, x_2, \ldots, x_n)$ from $E^n$ to $F$ in terms of its restriction to the…

Functional Analysis · Mathematics 2014-04-08 Erik G. F. Thomas

In this paper we present equivalence results for several types of unbounded operator functions. A generalization of the concept equivalence after extension is introduced and used to prove equivalence and linearization for classes of…

Functional Analysis · Mathematics 2017-09-27 Christian Engström , Axel Torshage

We introduce the notion of characteristic function of a quaternionic matrix, whose roots are the left eigenvalues. We prove that for all $2\times 2$ matrices and for $3\times 3$ matrices having some zero entry outside the diagonal there is…

Rings and Algebras · Mathematics 2010-05-11 E. Macías-Virgós , M. J. Pereira-Sáez

In this paper we consider polynomial representability of functions defined over $Z_{p^n}$, where $p$ is a prime and $n$ is a positive integer. Our aim is to provide an algorithmic characterization that (i) answers the decision problem: to…

Symbolic Computation · Computer Science 2015-02-16 Ashwin Guha , Ambedkar Dukkipati

We give sufficient conditions on planar domains for polynomials to be dense in the algebras A and A-infinity of the product of these domains, endowed with their natural topologies. We also characterize the uniform limits, with respect to…

Complex Variables · Mathematics 2014-03-06 P. M. Gauthier , V. Nestoridis

We associate to each Boolean function a polynomial whose evaluations represents the distances from all possible Boolean affine functions. Both determining the coefficients of this polynomial from the truth table of the Boolean function and…

Information Theory · Computer Science 2014-04-11 Emanuele Bellini

In this paper, approximation by means of algebraic polynomials of classes of functions defined by a generalised modulus of smoothness of operators of differentiation of these functions is considered. We give structural characteristics of…

Functional Analysis · Mathematics 2012-08-28 Nimete Sh. Berisha , Faton M. Berisha

In this review article we present regularity properties of generalized functions which are useful in the analysis of non-linear problems. It is shown that Schwartz distributions embedded into our new spaces of generalized functions, with…

Functional Analysis · Mathematics 2014-07-25 Stevan Pilipovic , Dimitris Scarpalezos , Jasson Vindas

Boolean network models have gained popularity in computational systems biology over the last dozen years. Many of these networks use canalizing Boolean functions, which has led to increased interest in the study of these functions. The…

Discrete Mathematics · Computer Science 2015-04-29 Qijun He , Matthew Macauley

We prove a factorization theorem for reproducing kernel Hilbert spaces whose kernel has a normalized complete Nevanlinna-Pick factor. This result relates the functions in the original space to pointwise multipliers determined by the…

Functional Analysis · Mathematics 2018-07-19 Alexandru Aleman , Michael Hartz , John E. McCarthy , Stefan Richter

The multidimensional chain rule formula for analytic functions and its generalisation to higher derivatives perfectly work in the algebraic setting in characteristic zero. In positive characteristic one runs into problems due to…

Commutative Algebra · Mathematics 2020-08-18 Andreas Maurischat