Related papers: Completeness is determined by any non-algebraic tr…
A key property of an algebraic variety is whether it is absolutely irreducible, meaning that it remains irreducible over the algebraic closure of its defining field, and determining absolute irreducibility is important in algebraic geometry…
We prove that it is NP-complete to decide whether a given string can be factored into palindromes that are each unique in the factorization.
Let $k$ be an uncountable field. We prove that the polynomial ring $R:=k[X_1,\dots,X_n]$ in $n\ge 2$ variables over $k$ is complete in its adic topology. In addition we prove that also the localization $R_{\goth m}$ at a maximal ideal…
Positive and negative quadratic forms are well known and widely used. They are multivariate homogeneous polynomials of degree two taking positive or negative values respectively for any values of their arguments not all zero. In the present…
We prove that a generic homogeneous polynomial of degree $d$ is determined, up to a nonzero constant multiplicative factor, by the vector space spanned by its partial derivatives of order $k$ whenever $k\leq\frac{d}{2}-1$.
We solve the problem of characterizing the existence of a polynomial matrix of fixed degree when its eigenstructure (or part of it) and some of its rows (columns) are prescribed. More specifically, we present a solution to the row (column)…
It is shown that, given a representation of a quiver over a finite field, one can check in polynomial time whether it is absolutely indecomposable.
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. An algebra is said to be affine complete if every congruence preserving function is a polynomial…
Complete non-ambiguous trees have been studied in various contexts. Recently, a conjecture was made about their determinants, and subsequently proved by Aval. An alternative proof is given here.
A function on an algebra is congruence preserving if, for any congruence, it maps pairs of congruent elements onto pairs of congruent elements. We show that on the algebra of complete binary trees whose leaves are labeled by letters of an…
It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a…
For a vector field $X$ on a smooth manifold $M$ there exists a smooth but not necessarily Hausdorff manifold $M_\Bbb R$ and a complete vector field $X_\Bbb R$ on it which is the universal completion of $(M,X)$.
For polynomials of degree two which have no zeros, the method of accompanying variables is developed and zeros of associated vector polynomials are determined. Our flexible method uses a wide variety of possible vector-valued vector…
We give a general notion of combinatory completeness with respect to a faithful cartesian club and use it systematically to obtain characterisations of a number of different kinds of applicative system. Each faithful cartesian club…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
We demonstrate counterexamples to Wilmshurst's conjecture on the valence of harmonic polynomials in the plane, and we conjecture a bound that is linear in the analytic degree for each fixed anti-analytic degree. Then we initiate a…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
In this work we revisit and extend the method introduced by Lins Neto, Sad and Sc\'{a}rdua for detecting the non-existence of invariant algebraic curves other than some prescribed invariant nodal curve. We prove that, under the existence of…
Let $\mathcal S$ be a set of monic degree $2$ polynomials over a finite field and let $C$ be the compositional semigroup generated by $\mathcal S$. In this paper we establish a necessary and sufficient condition for $C$ to be consisting…
We prove necessary and sufficient conditions for completeness of a rational vector field on C^n minus n hyperplanes in general position (n>1).