相关论文: Integral Function Bases

In additive number theory, a finite set $A$ of integers is an $h$-basis for $n$ if every integer in $\{0,1,2,\ldots, n\}$ can be represented as the sum of exactly $h$ not necessarily distinct elements of $A$. This paper introduces a new…

We study a generalization of additive bases into a planar setting. A planar additive basis is a set of non-negative integer pairs whose vector sumset covers a given rectangle. Such bases find applications in active sensor arrays used in,…

Border bases are a generalization of Gr\"obner bases for zero-dimensional ideals in polynomial rings. In this article, we introduce border bases for a non-commutative ring of linear differential operators, namely the rational Weyl algebra.…

We present a new algorithm for computing integral bases in algebraic function fields of one variable, or equivalently for constructing the normalization of a plane curve. Our basic strategy makes use of the concepts of localization and…

In this paper, based on techniques of Newton polygons, a result which allows the computation of a p integral basis of every quartic number field is given. For each prime integer p, this result allows to compute a p-integral basis of a…

This paper presents an innovative approach, the Adaptive Orthogonal Basis Method, tailored for computing multiple solutions to differential equations characterized by polynomial nonlinearities. Departing from conventional practices of…

Let $\mathcal{C}$ be a plane curve given by an equation $f(x,y)=0$ with $f\in K[x][y]$ a monic squarefree polynomial. We study the problem of computing an integral basis of the algebraic function field $K(\mathcal{C})$ and give new…

A new method is presented for obtaining indefinite integrals of common special functions. The approach is based on a Lagrangian formulation of the general homogeneous linear ordinary differential equation of second order. A general integral…

We propose a differential analog of the notion of integral closure of algebraic function fields. We present an algorithm for computing the integral closure of the algebra defined by a linear differential operator. Our algorithm is a direct…

This is a survey on the finite basis problem for varieties of algebraic systems. Our exposition is in two directions: (i) We give numerous examples of varieties which are not finitely based. (ii) We give examples of important varieties with…

Let $A$ be a Dedekind domain, $K$ the fraction field of $A$, and $f\in A[x]$ a monic irreducible separable polynomial. For a given non-zero prime ideal $\mathfrak{p}$ of $A$ we present in this paper a new method to compute a…

Integer programming is concerned with solving linear systems of equations over the non-negative integers. The basic question is to find a solution which minimizes a given linear objective function for a fixed right hand side. Here we also…

In this paper are examined general classes of linear and non-linear analytical systems of partial differential equations. Indeed the integrability conditions are found and if they are satisfied, the solutions are given as functional series…

Nice error bases have been introduced by Knill as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with…

The Bessel-Neumann expansion (of integer order) of a function $g:\mathbb{C}\rightarrow\mathbb{C}$ corresponds to representing $g$ as a linear combination of basis functions $\phi_0,\phi_1,\ldots$, i.e., $g(z)=\sum_{\ell = 0}^\infty w_\ell…

A method is obtained to compute the maximum number of functionally independent invariant functions under the action of a linear algebraic group as long as its Lie algebra admits a base of square-zero matrices. Some applications are also…

Part B (of a project involving four Parts) is about "bases of lines", a concept introduced by C. Herrmann and the author in the late 80's. Bases of lines attempt to describe a given modular lattice in a geometric way akin to how projective…

A Generalized Numeration Base is defined in this paper, and then particular cases are presented, such as Prime Base, Square Base, m-Power Base, Factorial Base, and operations in these bases. These bases are important for partitions of…

We obtain new complexity bounds for computing a triangular integral basis of a number field or a function field. We reach for function fields a softly linear cost with respect to the size of the output when the residual characteristic is…

Research efforts of the past fifty years have led to a development of linear integer programming as a mature discipline of mathematical optimization. Such a level of maturity has not been reached when one considers nonlinear systems subject…