SearcharxivSearch

arXiv subjects

Daniel Palacin

Publications and source records attributed to Daniel Palacin.

13 recordsLinked to original sources

Stability, corners, and other 2-dimensional shapes

We introduce a relaxation of stability, called almost sure stability, which is insensitive to perturbations by subsets of Loeb measure $0$ in a non-standard finite group. We show that almost sure stability satisfies a stationarity principle in the sense of geometric stability theory for measure independent elements. We apply this principle to deduce the existence of squares in dense almost surely stable subsets of Cartesian products of non-standard finite groups, possibly non-abelian. Our results imply qualitative asymptotic versions for Cartesian products of finite groups. In the final section, we establish the existence of $3\times 2$-grids (and thus of $L$-shapes) in dense almost surely stable $2$-dimensional subsets of finite abelian groups of odd order.

math.LO

Centralizers in pseudo-finite groups

The role of finite centralizers of involutions in pseudo-finite groups is analyzed. It is shown that a pseudo-finite group admitting a definable involutory automorphism fixing only finitely many elements is finite-by-abelian-by-finite. As a consequence, we give a model-theoretic proof of a result for periodic groups due to Hartley and Meixner. Furthermore, it is shown that any pseudo-finite group has an infinite abelian subgroup.

math.GR

Ample Pairs

We show that the ample degree of a stable theory with trivial forking is preserved when we consider the corresponding theory of belles paires, if it exists. This result also applies to the theory of $H$-structures of a trivial theory of rank $1$.

math.LO

A note on FC-nilpotency

The notion of bounded FC-nilpotent group is introduced and it is shown that any such group is nilpotent-by-finite, generalizing a result of Neumann on bounded FC-groups.

math.GR

On Superstable Expansions of Free Abelian Groups

We prove that $(\Z,+,0)$ has no proper superstable expansions of finite Lascar rank. Nevertheless, this structure equipped with a predicate defining powers of a given natural number is superstable of Lascar rank $ω$. Additionally, our methods yield other superstable expansions such as $(\Z,+,0)$ equipped with the set of factorial elements.

math.LO

A Fitting Theorem for Simple Theories

The Fitting subgroup of a type-definable group in a simple theory is relatively definable and nilpotent. Moreover, the Fitting subgroup of a supersimple hyperdefinable group has a normal hyperdefinable nilpotent subgroup of bounded index, and is itself of bounded index in a hyperdefinable subgroup.

math.LO

On n-dependence

In this note we develop and clarify some of the basic combinatorial properties of the new notion of $n$-dependence (for $1\leq n < \omega$) recently introduced by Shelah. In the same way as dependence of a theory means its inability to encode a bipartite random graph with a definable edge relation, $n$-dependence corresponds to the inability to encode a random $(n+1)$-partite $(n+1)$-hypergraph with a definable edge relation. Most importantly, we characterize $n$-dependence by counting $\varphi$-types over finite sets (generalizing Sauer-Shelah lemma and answering a question of Shelah) and in terms of the collapse of random ordered $(n+1)$-hypergraph indiscernibles down to order-indiscernibles (which implies that the failure of $n$-dependence is always witnessed by a formula in a single free variable).

math.LO

Ample thoughts

Non-n-ampleness as defined by Pillay and Evans is preserved under analysability. Generalizing this to a more general notion of Sigma-ampleness, we obtain an immediate proof for all simple theories of CHatzidakis weak Canonical Base Property (CBP) for types of finite SU-rank. This is then applied to the special case of groups.

math.LO

On the canonical base property

We give an example of a finite rank, in fact aleph-1 categorical theory where the CBP (canonical base property) does not hold. We include a "group-like" example. We also prove, in a finite Morley rank context, if all definable Galois groups are "rigid" then the theory has the CBP (in a strong sense).

math.LO

On ω-categorical simple theories

In the present paper we shall prove that countable ω-categorical simple CM-trivial theories and countable ω-categorical simple theories with strong stable forking are low. In addition, we observe that simple theories of bounded finite weight are low.

math.LO