Related papers: Nonstandard polynomials: algebraic properties and …

This work is motivated by the problem of finding the limit of the applicability of the first incompleteness theorem ($\sf G1$). A natural question is: can we find a minimal theory for which $\sf G1$ holds? We examine the Turing degree…

Let $D$ be division algebra over its center $C$, let $\sigma$ be an endormorphism of $D$, let $\delta$ be a left $\sigma$-derivation of $D$, and let $R=D[t;\sigma,\delta]$ be a skew polynomial ring. We study the structure of a class of…

A family of subsets $\mathcal{F} \subseteq \mathcal{P}(\{1, 2, \ldots, n\})$ has the disparate union property if any two disjoint subfamilies $\mathcal{F}_1, \mathcal{F}_2 \subseteq \mathcal{F}$ have distinct unions $\bigcup \mathcal{F}_1…

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

Let $R$ be a finite non-commutative ring with $1\ne 0$. By a polynomial function on $R$, we mean a function $F\colon R\longrightarrow R$ induced by a polynomial $f=\sum\limits_{i=0}^{n}a_ix^i\in R[x]$ via right substitution of the variable…

We develop a diagrammatic categorification of the polynomial ring Z[x], based on a geometrically defined graded algebra. This construction generalizes to categorification of some special functions, such as Chebyshev polynomials.…

The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…

We consider first-order logic with monoidal quantifiers over words. We show that all languages with a neutral letter, definable using the addition numerical predicate are also definable with the order predicate as the only numerical…

We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…

The aim of this note is to discuss the following quite queer Problem: \noindent GIVEN \noindent i) the free non-commutative polynomial ring, ${\Cal P} := {\Bbb F}\langle X_1,\ldots,X_n\rangle$ {\em (public)}, \noindent ii) a bilateral ideal…

Let S and R be the rings of regular functions on affine algebraic varieties over a field of characteristic 0, R be embedded as a subring in S, and F : S --> S be an endomorphism such that F(R) subset R. Suppose that every ideal of height 1…

Let $n$ be a positive integer. The main result of this manuscript is a construction of a filtration on the cohomology ring of a regular nilpotent Hessenberg variety in $GL(n,{\mathbb{C}})/B$ such that its associated graded ring has graded…

Interpretation of a structure $\mathbb A$ in $\mathbb B$ allows to produce structures elementarily equivalent to $\mathbb A$ given those elementarily equivalent to $\mathbb B$. In particular, interpretation of the free group in $\mathbb N$…

Let $\mathbb{F}_q$ be the finite field with $q$ elements, where $q$ is a prime power and $n$ be a positive integer. In this paper, we explore the factorization of $f(x^{n})$ over $\mathbb{F}_q$, where $f(x)$ is an irreducible polynomial…

We introduce a restricted second-order logic $\mathrm{SO}^{\mathit{plog}}$ for finite structures where second-order quantification ranges over relations of size at most poly-logarithmic in the size of the structure. We demonstrate the…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

Let S be a basic closed semi-algebraic set in R^n and P the corresponding preordering in R[X_1,...,X_n]. We examine for which polynomials f there exist identities f+\ep q \in P for all \ep>0. These are precisely the elements of the…

Semi-algebraic proof systems such as sum-of-squares (SoS) have attracted a lot of attention recently due to their relation to approximation algorithms: constant degree semi-algebraic proofs lead to conjecturally optimal polynomial-time…

We define a natural notion of higher order stability and show that subsets of $\mathbb{F}_p^n$ that are tame in this sense can be approximately described by a union of low-complexity quadratic varieties, up to linear error. This generalizes…

The problem of finding a nontrivial factor of a polynomial f(x) over a finite field F_q has many known efficient, but randomized, algorithms. The deterministic complexity of this problem is a famous open question even assuming the…