Related papers: On fields and colours

Given a subset of $\mathbb C$ containing $x,y$, one can add $x + y,\,x - y,\,xy$ or (when $y\ne0$) $x/y$ or any $z$ such that $z^2=x$. Let $p$ be a prime Fermat number. We prove that it is possible to obtain from $\{1\}$ a set containing…

We study the class of polynomials that map a local field (i.e., the completion of a number field at a non-Archimedean place) into the subset of its $p$-th powers, where $p$ is the residue characteristic of the field in question. We present…

A rank is a notion in descriptive set theory that describes ranks such as the Cantor-Bendixson rank on the set of closed subsets of a Polish space, differentiability ranks on the set of differentiable functions in $C[0,1]$ such as the…

We show that, for any prime $p$ and integer $k \geq 2$, a simple GF($p$)-representable matroid with sufficiently high rank has a rank-$k$ flat which is either independent in $M$, or is a projective or affine geometry. As a corollary we…

In this paper we consider first-order logic theorem proving and model building via approximation and instantiation. Given a clause set we propose its approximation into a simplified clause set where satisfiability is decidable. The…

We introduce a new concept of rank - relative rank associated to a filtered collection of polynomials. When the filtration is trivial our relative rank coincides with Schmidt rank (also called strength). We also introduce the notion of…

We determine, in a polynomial ring over a field, the arithmetical rank of certain ideals generated by a set of monomials and one binomial.

We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.

The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characterization and polarities of projective geometries is explained.…

In this note is we exhibit an elementary method to construct explicitly curves over finite fields with many points. Despite its elementary character the method is very efficient and can be regarded as a partial substitute for the use of…

In this paper we study various versions of extension complexity for polygons through the study of factorization ranks of their slack matrices. In particular, we develop a new asymptotic lower bound for their nonnegative rank, shortening the…

A fundamental problem in the theory of linearized and projective polynomials over finite fields is to characterize the number of roots in the coefficient field directly from the coefficients. We prove results of this type, of a recursive…

We develop a notion of (principal) differential rank for differential-valued fields, in analog of the exponential rank and of the difference rank. We give several characterizations of this rank. We then give a method to define a derivation…

Given a tract $F$ in the sense of Baker and Bowler and a matrix $A$ with entries in $F$, we define several notions of rank for $A$. In this way, we are able to unify and find conceptually satisfying proofs for various results about ranks of…

The $2M$-boson representations of KP hierarchy are constructed in terms of $M$ mutually independent two-boson KP representations for arbitrary number $M$. Our construction establishes the multi-boson representations of KP hierarchy as…

We introduce a criterion on the presentation of finitely presented pro-$p$ groups which allows us to compute their cohomology groups and infer quotients of mild groups of cohomological dimension strictly larger than two, from (non-free)…

We resolve the strong Elementary Equivalence versus Isomorphism Problem for finitely generated fields. That is, we show that for every field in this class there is a first-order sentence which characterizes this field within the class up to…

Suppose that $\mathbb{F}_p$ is coloured with $r$ colours. Then there is some colour class containing at least $c_r p^2$ quadruples of the form $(x, y , x + y, xy)$.

Let $T_P$ be the theory of beautiful pairs of algebraically closed fields of fixed characteristic. It is known that for real tuples in models of $T_P$, SU-rank coincides with Morley rank and can be computed effectively. Building on Pillay's…

We begin a systematic development of structure theory for a first order theory, which is stable over a monadic predicate. We show that stability over a predicate implies quantifier free definability of types over stable sets, introduce an…