activity
20102018
most citedOn n-dependence

19 citations · 55 across the 10 of their papers we have counts for

collaborators

16 papers

math.LO2018

On the class of flat stable theories

Daniel Palacín, Saharon Shelah

A new notion of independence relation is given and associated to it, the class of flat theories, a subclass of strong stable theories including the superstable ones is introduced.…

math.LO2017★ 6 cited

The dp-rank of abelian groups

Yatir Halevi, Daniel Palacín

An equation to compute the dp-rank of any abelian group is given. It is also shown that its dp-rank, or more generally that of any one-based group, agrees with its Vapnik-Chervonen…

math.LO2017

Finite rank and pseudofinite groups

Daniel Palacín

It is proven that an infinite finitely generated group cannot be elementarily equivalent to an ultraproduct of finite groups of a given Prüfer rank. Furthermore, it is shown that a…

math.LO2017

Ample Pairs

Enrique Casanovas, Amador Martin-Pizarro, Daniel Palacin

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 applie…

math.GR2017

Centralizers in pseudo-finite groups

Nadja Hempel, Daniel Palacin

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…

math.GR2016

A note on FC-nilpotency

Nadja Hempel, Daniel Palacin

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.LO2016

Generalized amalgamation and homogeneity

Daniel Palacín

In this paper we shall prove that any -transitive finitely homogeneous structure with a supersimple theory satisfying a generalized amalgamation property is a random structure.…

math.LO2016

On definable Galois groups and the strong canonical base property

Daniel Palacín, Anand Pillay

In \cite{HPP}, Hrushovski and the authors proved, in a certain finite rank environment, that rigidity of definable Galois groups implies that has the canonical base property in…

math.LO2014★ 19 cited

On n-dependence

Artem Chernikov, Daniel Palacin, Kota Takeuchi

In this note we develop and clarify some of the basic combinatorial properties of the new notion of -dependence (for ) recently introduced by Shelah. In the same wa…

math.LO2014★ 3 cited

A Fitting Theorem for Simple Theories

Daniel Palacin, Frank Olaf Wagner

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…

math.LO2014★ 13 cited

On Superstable Expansions of Free Abelian Groups

Daniel Palacin, Rizos Sklinos

We prove that has no proper superstable expansions of finite Lascar rank. Nevertheless, this structure equipped with a predicate defining powers of a given natural numbe…

math.LO2012

Rigidity, internality and analysability

Daniel Palacin, Frank Olaf Wagner

We prove a version of Hrushovski's socle lemma for rigid groups in an arbitrary simple theory.

math.LO2012★ 3 cited

On the canonical base property

Ehud Hrushovski, Daniel Palacin, Anand Pillay

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…

math.LO2011★ 8 cited

Ample thoughts

Daniel Palacin, Frank Olaf Wagner

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…

math.LO2011

On ω-categorical simple theories

Daniel Palacin

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 addit…

math.LO2010★ 3 cited

Elimination of Hyperimaginaries and Stable Independence in simple CM-trivial theories

Daniel Palacin, Frank Olaf Wagner

In a simple CM-trivial theory every hyperimaginary is interbounded with a sequence of finitary hyperimaginaries. Moreover, such a theory eliminates hyperimaginaries whenever it eli…