Related papers: Constructing elusive functions with help of evalua…
Previous research on exceptional units has primarily focused on the ring of rational integers or abstract finite rings, often restricted to linear or quadratic constraints. In this paper, we extend the concept of polynomial-type exceptional…
We present a new method for the reconstruction of rational functions through finite-fields sampling that can significantly reduce the number of samples required. The method works by exploiting all the independent linear relations among…
This book is an introductory course to basic commutative algebra with a particular emphasis on finitely generated projective modules. We adopt the constructive point of view, with which all existence theorems have an explicit algorithmic…
It is shown that the expansion methods developed in refs. arXiv:hep-th/0212347 and arXiv:hep-th/0401033v2 can be generalized so that they permit to study the expansion of algebras of loops, both when the compact finite-dimensional algebra…
We develop tools for performing effective field theory (EFT) calculations in a manifestly gauge-covariant fashion. We clarify how functional methods account for one-loop diagrams resulting from the exchange of both heavy and light fields,…
We define a modular function which is a generalization of the elliptic modular lambda function. We show this function and the modular invariant function generate the modular function field with respect to the principal congruence subgroup.…
This paper reexamines univariate reduction from a toric geometric point of view. We begin by constructing a binomial variant of the $u$-resultant and then retailor the generalized characteristic polynomial to fully exploit sparsity in the…
Let L be an algebraic set and let g : R^(n+1) \times L --> R^(2n) (n is even) be a polynomial mapping such that for each l in L there is r(l)>0 such that the mapping g_l = g(.,l) restricted to the sphere S^n(r) is an immersion for every…
A very first step to develop non-commutative algebraic geometry is the arithmetic of polynomials in non-commuting variables over a commutative field, that is, the study of elements in free associative algebras. This investigation is…
We have presented a multivariate polynomial function termed as factor elimination function,by which, we can generate prime numbers. This function's mapping behavior can explain the irregularities in the occurrence of prime numbers on the…
Toric (or sparse) elimination theory is a framework developped during the last decades to exploit monomial structures in systems of Laurent polynomials. Roughly speaking, this amounts to computing in a \emph{semigroup algebra}, \emph{i.e.}…
We present a unified framework for developing and analysing immersed finite element (IFE) spaces for solving typical elliptic interface problems with interface independent meshes. This framework allows us to construct a group of new IFE…
Classical planar functions are functions from a finite field to itself and give rise to finite projective planes. They exist however only for fields of odd characteristic. We study their natural counterparts in characteristic two, which we…
The algebraic method provides useful techniques to identify models in designs and to understand aliasing of polynomial models. The present note surveys the topic of Gr\"obner bases in experimental design and then describes the notion of…
We study the structure of an algebraically closed field with extra function resembling the classical exponentiation on complex numbers.
C. F. Gauss discovered a beautiful formula for the number of irreducible polynomials of a given degree over a finite field. Assuming just a few elementary facts in field theory and the exclusion-inclusion formula, we show how one see the…
In the multicentric calculus one takes a polynomial with simple roots as a new global variable and replaces scalar functions {\varphi} by functions f taking values in C^d with d the degree of the polynomial leading to an efficient…
We say that a function is rare-case hard against a given class of algorithms (the adversary) if all algorithms in the class can compute the function only on an $o(1)$-fraction of instances of size $n$ for large enough $n$. Starting from any…
Continuing a series of articles in the past few years on creative telescoping using reductions, we develop a new algorithm to construct minimal telescopers for algebraic functions. This algorithm is based on Trager's Hermite reduction and…
The so-called polynomial equations play an important role both in algebra and in the theory of functional equations. If the unknown functions in the equation are additive, relatively many results are known. However, even in this case, there…