Related papers: Multivariate Bernstein-type Polynomials of Finitel…
The problem of expressing a specific polynomial as the determinant of a square matrix of affine-linear forms arises from algebraic geometry, optimisation, complexity theory, and scientific computing. Motivated by recent developments in this…
We find finite, reasonably small, generator sets of the coordinate rings of G-character varieties of finitely generated groups for all classical groups G. This result together with the method of Grobner basis gives an algorithm for…
The main contribution of this paper is to find a representation of the class $\mathcal{F}_d(p)$ of multivariate Bernoulli distributions with the same mean $p$ that allows us to find its generators analytically in any dimension. We map…
In the context of algebraic statistics an experimental design is described by a set of polynomials called the design ideal. This, in turn, is generated by finite sets of polynomials. Two types of generating sets are mostly used in the…
Discontinuous Galerkin (DG) methods offer an enormous flexibility regarding local grid refinement and variation of polynomial degrees for a variety of different problem classes. With a focus on diffusion problems, we consider DG…
Let $f$ be an analytic polynomial of degree at most $K-1$. A classical inequality of Bernstein compares the supremum norm of $f$ over the unit circle to its supremum norm over the sampling set of the $K$-th roots of unity. Many extensions…
For a given monomial ideal $J \subset k[x_1, \ldots, x_n]$ and a given monomial order $\prec$, the moduli functor of all reduced Gr\"obner bases with respect to $\prec$ whose initial ideal is $J$ is determined. In some cases, such a functor…
In the spectral Petrov-Galerkin methods, the trial and test functions are required to satisfy particular boundary conditions. By a suitable linear combination of orthogonal polynomials, a basis, that is called the modal basis, is obtained.…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Extending an earlier estimate for the degree of approximation of overiterated univariate Bernstein operators towards the same operator of degree one, it is shown that an analogous result holds in the $d$-variate case. The method employed…
Our main result is to show that the existence of a root in. --$\alpha$--Nfor the p-th Bernstein polynomial of the (a,b)-module generated by a holomorphicform in the (convergent) Brieskorn (a,b)-module associated to f, under the hypothesis…
Let $A$ be a coherent algebra and $B$ be a finite-dimensional Gorenstein algebra over a field $k$. We describe finitely presented Gorenstein projective $A\otimes_k B$-modules in terms of their underlying onesided modules. Moreover, if the…
Experiences with the implementation of strong Gr\"obner bases respectively standard bases for polynomial rings over principal ideal rings are explained: different strategies for creating the pair set, methods to avoid coefficient growth and…
The theme of symbolic computation in algebraic categories has become of utmost importance in the last decade since it enables the automatic modeling of modern algebra theories. On this theoretical background, the present paper reveals the…
We consider computational and implementation issues for the completion of monomial sets to involution using different involutive divisions. Every of these divisions produces its own completion procedure. For the polynomial case it yields an…
We summarize researches - in great deal jointly with my host Y. Sarantopoulos and his PhD. students V. Anagnostopoulos and A. Pappas - started by a Marie Curie fellowship in 2001 and is still continuing. The project was to study…
We propose and rigorously analyze two randomized algorithms to factor univariate polynomials over finite fields using rank $2$ Drinfeld modules. The first algorithm estimates the degree of an irreducible factor of a polynomial from…
The purpose of this paper is to relate the variety parameterizing completely decomposable homogeneous polynomials of degree $d$ in $n+1$ variables on an algebraically closed field, called $\Split_{d}(\PP n)$, with the Grassmannian of $n-1$…
We propose a novel encoding scheme for algebraic codes such as codes on algebraic curves, multidimensional cyclic codes, and hyperbolic cascaded Reed-Solomon codes and present numerical examples. We employ the recurrence from the Gr\"obner…
Here we consider the degenerate Bernstein polynomials as a degenerate version of Bernstein polynomials, which are motivated by Simsek's recent work 'Generating functions for unification of the multidimensional Bernstein polynomials and…