Related papers: Implicitisation and Parameterisation in Polynomial…

We show that the variation of the topology at infinity of a two-variable polynomial function is localisable at a finite number of "atypical points" at infinity. We construct an effective algorithm with low complexity in order to detect…

We study several variants of decomposing a symmetric matrix into a sum of a low-rank positive semidefinite matrix and a diagonal matrix. Such decompositions have applications in factor analysis and they have been studied for many decades.…

The main result concerns a bicategorical factorization system on the bicategory $\mathrm{Cat}$ of categories and functors. Each functor $A\xra{f} B$ factors up to isomorphism as $A\xra{j}E\xra{p}B$ where $j$ is what we call an ultimate…

Fix an infinite field $k$ of characteristic $p$, and let $\g$ be the Kac-Moody algebra $\mathfrak{sl}_{\infty}$ if $p=0$ and $\hat{\mathfrak{sl}}_p$ otherwise. Let $\PP$ denote the category of strict polynomial functors defined over $k$. We…

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

We investigate the representation of symmetric polynomials as a sum of squares. Since this task is solved using semidefinite programming tools we explore the geometric, algebraic, and computational implications of the presence of discrete…

In this paper we will obtain some further properties for specializations in a scheme. Using these results, we will take a picture for a scheme and a picture for a morphism of schemes. In particular, we will prove that every morphism of…

Consider a semi-algebraic set A in R^d constructed from the sets which are determined by inequalities p_i(x)>0, p_i(x)\ge 0, or p_i(x)=0 for a given list of polynomials p_1,...,p_m. We prove several statements that fit into the following…

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…

Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…

We prove that the word problem of a finitely generated group $G$ is in NP (solvable in polynomial time by a non-deterministic Turing machine) if and only if this group is a subgroup of a finitely presented group $H$ with polynomial…

The concept of generalized functions taking values in a differentiable manifold is extended to a functorial theory. We establish several characterization results which allow a global intrinsic formulation both of the theory of…

We present a closed-form finite-dimensional projection method for regularizing a function defined by a discrete set of measurement data, which have been contaminated by random, zero mean errors, and for estimating the derivative and…

A characterization of the general linear equation in standard form admitting a maximal symmetry algebra is obtained in terms of a simple set of conditions relating the coefficients of the equation. As a consequence, it is shown that in its…

An algorithm for computing an analytic function of a matrix $A$ is described. The algorithm is intended for the case where $A$ has some close eigenvalues, and clusters (subsets) of close eigenvalues are separated from each other. This…

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Let $K$ be a number field. We show that, up to allowing a finite set of denominators in the partial quotients, it is possible to define algorithms for $\mathfrak P$-adic continued fractions satisfying the finiteness property on $K$ for…

This paper focuses on the equidimensional decomposition of affine varieties defined by sparse polynomial systems. For generic systems with fixed supports, we give combinatorial conditions for the existence of positive dimensional components…

We characterize group representations that factor through monomial representations, respectively, block-triangular representations with monomial diagonal blocks, by arithmetic properties. Similar results are obtained for semigroup…

The additive closedness in the subset of an additive group is termed as r-value. The nature of closedness in different subsets of fixed size is observed as a spectrum of r-values. We enumerate r-values of subsets in finite fields of…