Related papers: Finite Undecidability in Fields II: PAC, PRC and P…
The paper contains an exposition of recent as well as old enough results on determinantal random point fields. We start with some general theorems including the proofs of the necessary and sufficient condition for the existence of the…
We consider random fields that can be represented as integrals of deterministic functions with respect to infinitely divisible random measures and show that these random fields are infinitely divisible.
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
We recall the notion of nearest integer continued fractions over the Euclidean imaginary quadratic fields $K$ and characterize the "badly approximable" numbers, ($z$ such that there is a $C(z)>0$ with $|z-p/q|\geq C/|q|^2$ for all $p/q\in…
Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…
In our paper [G{\l}uch, Marcinkowski, Ostropolski-Nalewaja, LICS ACM, 2018] we have solved an old problem stated in [Calvanese, De Giacomo, Lenzerini, Vardi, SPDS ACM, 2000] showing that query determinacy is undecidable for Regular Path…
We show that the emptiness (unsatisfiability) problem is undecidable and $\mathrm{\Pi}^{0}_{1}$-complete for deterministic propositional while programs with (graph) loop. To this end, we introduce a hypothesis elimination using loops. Using…
Several properly countable unions of algebraic sets in $\mathbb{C}^n$ are definable in $\mathbb{C}(t)$ including the set CM of $j$-invariants of complex elliptic curves with complex multiplication. It has been suggested that one could prove…
We investigate $k$-superirreducible polynomials, by which we mean irreducible polynomials that remain irreducible under any polynomial substitution of positive degree at most $k$. Let $\mathbb F$ be a finite field of characteristic $p$. We…
Altenbernd, Thomas and W\"ohrle have considered in [ATW02] acceptance of languages of infinite two-dimensional words (infinite pictures) by finite tiling systems, with the usual acceptance conditions, such as the B\"uchi and Muller ones,…
Let $\FF$ be a finite field of characteristics different from two. We show that no bijective map transforms permanent into determinant when the cardinality of $\FF$ is sufficiently large. We also give an example of non-bijective map when…
Recent work by Atserias and Dawar (J. Log. Comp 2019) and Tucker-Foltz (LMCS 2024) has established undefinability results in fixed-point logic with counting (FPC) corresponding to many classical complexity results from the hardness of…
All known structural extensions of the substructural logic $\mathsf{FL_e}$, Full Lambek calculus with exchange/commutativity, (corresponding to subvarieties of commutative residuated lattices axiomatized by $\{\vee, \cdot, 1\}$-equations)…
The first part is expository: it explains how finite fields may be used to prove theorems on infinite fields by a reduction mod p process. The second part gives a variant of P.Smith's fixed point theorem which applies in any characteristic.
The notion of `Pseudo Algebraically Closed (PAC) extensions' is a generalization of the classical notion of PAC fields. It was originally motivated by Hilbert's tenth problem, and recently had new applications. In this work we develop a…
In this paper we prove that the nonzero elements of a finite field with odd characteristic can be partitioned into pairs with prescribed difference (maybe, with some alternatives) in each pair. The algebraic and topological approaches to…
We study the determinisation and unambiguisation problems of weighted automata over the rational field: Given a weighted automaton, can we determine whether there exists an equivalent deterministic, respectively unambiguous, weighted…
Working with uncountable structures of fixed cardinality, we investigate the complexity of certain equivalence relations and show that if V = L, then many of them are \Sigma^1_1-complete, in particular the isomorphism relation of dense…
We show that all--instances termination of chase is undecidable. More precisely, there is no algorithm deciding, for a given set $\cal T$ consisting of Tuple Generating Dependencies (a.k.a. Datalog$^\exists$ program), whether the $\cal…
The class of self-conjugate-reciprocal irreducible monic (SCRIM) polynomials over finite fields are studied. Necessary and sufficient conditions for monic irreducible polynomials to be SCRIM are given. The number of SCRIM polynomials of a…