Related papers: Nonstandard polynomials: algebraic properties and …

We propose an interpretation of the first-order answer set programming (FOASP) in terms of intuitionistic proof theory. It is obtained by two polynomial translations between FOASP and the bounded-arity fragment of the Sigma_1 level of the…

Julia Robinson has given a first-order definition of the rational integers $\mathbb Z$ in the rational numbers $\mathbb Q$ by a formula $(\forall \exists \forall \exists)(F=0)$ where the $\forall$-quantifiers run over a total of 8…

We begin by considering faithful matrix representations of elementary abelian groups in prime characteristic. The representations considered are seen to be determined up to change of bases by a single number. Studying this number leads to a…

We introduce the notion of "special superpolynomials" by putting q=1 in the formulas for reduced superpolynomials. In this way we obtain a generalization of special HOMFLY polynomials depending on one extra parameter t. Special HOMFLY are…

It is shown that any finitely generated subring of a global field has a universal first-order definition in its fraction field. This covers Koenigsmann's result for the ring of integers and its subsequent extensions to rings of integers in…

For a suitable irreducible \textit{base} polynomial $f(x)\in \mathbf{Z}[x]$ of degree $k$, a family of polynomials $F_m(x)$ depending on $f(x)$ is constructed with the properties: (i) there is exactly one irreducible factor $\Phi_{d,f}(x)$…

We prove Dirichlet's theorem for polynomial rings: Let F be a pseudo algebraically closed field. Then for all relatively prime polynomials a(X), b(X)\in F[X] and for every sufficiently large positive integer n there exist infinitely many…

In [9], [15] it has been introduced a technique, based on nonstandard analysis, to study some problems in combinatorial number theory. In this paper we present three applications of this technique: the first one is a new proof of a known…

Newton iteration (NI) is an almost 350 years old recursive formula that approximates a simple root of a polynomial quite rapidly. We generalize it to a matrix recurrence (allRootsNI) that approximates all the roots simultaneously. In this…

Recursive algebraic construction of two infinite families of polynomials in $n$ variables is proposed as a uniform method applicable to every semisimple Lie group of rank $n$. Its result recognizes Chebyshev polynomials of the first and…

Second-order superintegrable systems in dimensions two and three are essentially classified. With increasing dimension, however, the non-linear partial differential equations employed in current methods become unmanageable. Here we propose…

Semifields are semirings in which every nonzero element has a multiplicative inverse. A rough classification uses the characteristic of the semifield, that is the isomorphism type of the semifield generated by the two neutral elements. For…

Let $\RR_S$ denote the expansion of the real ordered field by a family of real-valued functions $S$, where each function in $S$ is defined on a compact box and is a member of some quasianalytic class which is closed under the operations of…

We consider the problem of answering queries about formulas of first-order logic based on background knowledge partially represented explicitly as other formulas, and partially represented as examples independently drawn from a fixed…

Let $P$ be a commutative Noetherian ring and $F$ be a self-dual acyclic complex of finitely generated free $P$-modules. Assume that $F$ has length four and $F_0$ has rank one. We prove that $F$ can be given the structure of a Differential…

Let $P: \F \times \F \to \F$ be a polynomial of bounded degree over a finite field $\F$ of large characteristic. In this paper we establish the following dichotomy: either $P$ is a moderate asymmetric expander in the sense that $|P(A,B)|…

We show that for Chevalley groups G(R) of rank at least 2 over a ring R the root subgroups are essentially (nearly always) the double centralizers of corresponding root elements. In very many cases this implies that R and G(R) are…

Ouroboros functions have shown some interesting properties when subjected to conventional operations. The aim of this paper is to continue our investigation and prove some additional properties of these functions. Using algebraic methods,…

Consider an absolutely irreducible polynomial $F(Y,X_1,\ldots,X_n) \in \mathbb{Z}[Y,X_1,\ldots,X_n]$ that is monic in $Y$ and is a polynomial in $Y^m$ for an integer $m \geq 1$. Let $N(F,B)$ count the number of $\mathbf{x} \in [-B,B]^n \cap…

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…