Related papers: A Note on Superamorphous Sets and Dual Dedekind-In…
Let f(t,X) be an irreducible polynomial over the field of rational functions k(t), where k is a number field. Let O be the ring of integers of k. Hilbert's irreducibility theorem gives infinitely many integral specializations of t to values…
A first-order theory has the Schroder-Bernstein property if any two of its models that are elementarily bi-embeddable are isomorphic. We prove that if a countable theory T has the Schroder-Bernstein property then it is classifiable (it is…
Relational semigroups with domain and range are a useful tool for modelling nondeterministic programs. We prove that the representation class of domain-range semigroups with demonic composition is not finitely axiomatisable. We extend the…
The title theorem is proved by example: an algebra of binary relations, closed under intersection and composition, that is not isomorphic to any such algebra on a finite set.
A Ramsey-like theorem is a statement of the form ``For every 2-coloring of $[\mathbb{N}]^2$, there exists an infinite set~$H \subseteq \mathbb{N}$ such that $[H]^2$ avoids some pattern''. We prove that none of these statements are…
We consider the problem of constructing a weakly-continuous mapping extending continuous mapping defined on a dense set of a topological space to the entire space. Theorem on necessary and sufficient conditions for the existence of such an…
For a class of irrational numbers, depending on their Diophantine properties, we construct explicit rank-one transformations that are totally ergodic and not weakly mixing. We classify when the measure is finite or infinite. In the finite…
Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…
In this paper we consider a simple algebraic structure --- sets with a single endofunction. We shall see that from the point of view of limits, even this simplest case is both interesting and difficult. Nevertheless we obtain the shape of…
It is known that, unlike the Hausdorff dimension, the Assouad dimension of a self-similar set can exceed the similarity dimension if there are overlaps in the construction. Our main result is the following precise dichotomy for self-similar…
The (A,D) duality pairs play crucial role in the theory of general relational structures and in the Constraint Satisfaction Problem. The case where both classes are finite is fully characterized. The case when both side are infinite seems…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…
In this paper, without the axiom of choice, we show that if a certain downward L\"owenheim-Skolem property holds then all grounds are uniformly definable. We also prove that the axiom of choice is forceable if and only if the universe is a…
We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define…
In order to introduce the notion of causality in noncommutative geometry it is necessary to extend Gelfand theory to the context of ordered spaces. In a previous work we have already given an algebraic caracterization of the set of…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We prove that for any holomorphic map, and any bounded orbit which does not accumulate to a singular set or to an attracting cycle, its lower Lyapunov exponent is non-negative. The same result holds for unbounded orbits, for maps with a…
We introduce the forcing property of descending distributivity. A forcing $\mathbb{P}$ is $\kappa$-descending distributive if for all decreasing sequences $(D_\alpha)_{\alpha<\kappa}$ of open dense sets, $\bigcap_\alpha D_\alpha$ is open…
We establish a super duality as an equivalence between Whittaker module categories over a pair of classical Lie algebra and Lie superalgebra in the infinite-rank limit. Building on this result and utilizing the Losev-Shu-Xiao decomposition,…
A bipartite quantum state (for two systems in any dimensions) can be decomposed as a superposition of many components. For a superposition of more than two components we prove that there is a bound of the entanglement of the superposition…