Related papers: First-order sentences in random groups III

We prove that the common theory of nonabelian free groups has the dimensional order property, or DOP, implying, for example, that there is no reasonable structure theorem for $\aleph_1$-saturated models of this theory.

Exactly solving first-order constraints (i.e., first-order formulas over a certain predefined structure) can be a very hard, or even undecidable problem. In continuous structures like the real numbers it is promising to compute approximate…

We show that the class of representable substitution algebras is characterized by a set of universal first order sentences. In addition, it is shown that a necessary and sufficient condition for a substitution algebra to be representable is…

We consider first order expressible properties of random perfect graphs. That is, we pick a graph $G_n$ uniformly at random from all (labelled) perfect graphs on $n$ vertices and consider the probability that it satisfies some graph…

In the paper "Randomizations of Scattered Sentences", Keisler showed that if Martin's axiom for aleph one holds, then every scattered sentence has few separable randomizations, and asked whether the conclusion could be proved in ZFC alone.…

The finite spectrum of a first-order sentence is the set of positive integers that are the sizes of its models. The class of finite spectra is known to be the same as the complexity class NE. We consider the spectra obtained by limiting…

The first-order theory of the automorphism group of an infinite resplendent model in a finite language is undecidable.

We provide a full and rigorous proof of a theorem attributed to \.Zuk, stating that random groups in the Gromov density model for d > 1/3 have property (T) with high probability. The original paper had numerous gaps, in particular, crucial…

Recently Ould Houcine-Tent (see arXiv:1205.0929v2 [math.GR]) proved that the theory of non abelian free groups is $n$-ample for any $n<\omega$. We give a sequence of single elements in $F_{\omega}$ witnessing the above mentioned result. Our…

We show that finite quasisimple groups of Lie type in characteristic $p$ with an irreducible representation of prime degree $r$ over a finite field of characteristic $p$ have orders bounded above by a function of $r$, independent of $p$. We…

For some fixed alphabet A, a language L of A* is in the class L(1/2) of the Straubing-Therien hierarchy if and only if it can be expressed as a finite union of languages A*aA*bA*...A*cA*, where a,b,...,c are letters. The class L(1) is…

We give a solution stated in the title to problem 3 of part 1 of the problems listed in the book of Eklof and Mekler [EM],(p.453). There, in pp. 241-242, this is discussed and proved in some cases. The existence of strongly lambda-free ones…

Let $A$ be a finite, abelian group. We show that the density of $A$-extensions satisfying the Hasse norm principle exists, when the extensions are ordered by discriminant. This strengthens earlier work of Frei--Loughran--Newton \cite{FLN},…

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

We prove that there is an absolute constant $c>0$ with the following property: if $Z/pZ$ denotes the group of prime order $p$, and a subset $A\subset Z/pZ$ satisfies $1<|A|<p/2$, then for any positive integer…

We show that there is a class of finite groups, the so-called perfect groups, which cannot exhibit anomalies. This implies that all non-Abelian finite simple groups are anomaly-free. On the other hand, non-perfect groups generically suffer…

In this paper we prove that if there is a regular Paley type partial difference set in an Abelian group $G$ of order $v$, where $v=p_1^{2k_1}p_2^{2k_2}\cdots p_n^{2k_n}$, $n\ge 2$, $p_1$, $p_2$, $\cdots$, $p_n$ are distinct odd prime…

We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…

We study properties of a sequence $\Lambda$ obtained by a randomselection of integers $n$, where $n\in\Lambda$ with probability $\varpi_{n}$, independently of the other choices. We distinguish two cases : if…

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding -- to the…