Related papers: On closed unbounded sets consisting of former regu…
For any irrational cut-and-project setup, we demonstrate a natural infinite family of windows which gives rise to separated nets that are each bounded distance to a lattice. Our proof provides a new construction, using a sufficient…
Various models have been recently proposed to reflect and predict different properties of complex networks. However, the community structure, which is one of the most important properties, is not well studied and modeled. In this paper, we…
We compute the regularity of the Hibi ring of any finite distributive lattice in terms of its poset of join irreducible elements.
This paper introduces almost partitionable sets to generalize the known concept of partitionable sets. These notions provide a unified frame to construct $\mathbb{Z}$-cyclic patterned starter whist tournaments and cyclic balanced sampling…
We consider Markov chains on partially ordered sets that generalize the success-runs and remaining life chains in reliability theory. We find conditions for recurrence and transience and give simple expressions for the invariant…
We establish a necessary and sufficient condition for a Poisson suspension to be prime. The proof is based on the Fock space structure of the $L^{2}$-space of the Poisson suspension. We give examples of explicit infinite measure preserving…
We give a new proof of the following theorem due to W. Weiss and P. Komjath: if $X$ is a regular topological space, with character $ < \mathfrak{b}$ and $X \rightarrow (top \omega + 1)^{1}_{\omega}$, then, for all $\alpha < \omega_1$, $X…
We introduce combinatorial principles that characterize strong compactness and supercompactness for inaccessible cardinals but also make sense for successor cardinals. Their consistency is established from what is supposedly optimal.…
We present preservation theorems for countable support iteration of nep forcing notions satisfying ``old reals are not Lebesgue null'' and ``old reals are not meager''. (Nep is a generalization of Suslin proper.) We also give some results…
The combinatorial properties of partitions with various restrictions on their hooksets are explored. A connection with numerical semigroups extends current results on simultaneous s/t-cores. Conditions that suffice for a partition to…
Suppose L and M are full-rank lattices in Euclidean space, such that vol(L) < vol(M). Answering a question of Han and Wang from 2001, we show how to construct a bounded measurable set F (we can even take F to be a finite union of polytopes)…
We develop a theory of limits of finite posets in close analogy to the recent theory of graph limits. In particular, we study representations of the limits by functions of two variables on a probability space, and connections to…
We systematically study the construction of mutually unbiased bases in $\mathbb{C}^{2}\bigotimes\mathbb{C}^{3}$, such that all the bases are unextendible maximally entangled ones. Necessary conditions of constructing a pair of mutually…
We define the notion of accessibility for a pro-$p$ group. We prove that finitely generated pro-$p$ groups are accessible given a bound on the size of their finite subgroups. We then construct a finitely generated inaccessible pro-$p$…
In contexts in which the principle of dependent choice may not be available, as toposes or Constructive Set Theory, standard locale theoretic results related to complete regularity may fail to hold. To resolve this difficulty, B.…
We prove the existence of infinite dense free sets (in the usual topology) for set mappings on the reals, under reasonable assumptions.
We show that it is consistent relative to ZF, that there is no well-ordering of $\mathbb{R}$ while a wide class of special sets of reals such as Hamel bases, transcendence bases, Vitali sets or Bernstein sets exists. To be more precise, we…
We survey the logical structure of constructive set theories and point towards directions for future research. Moreover, we analyse the consequences of being extensible for the logical structure of a given constructive set theory. We…
One of the most frustrating problems faced by set theorists working with iterated proper forcing is the lack of techniques for producing models in which the continuum has size greater than the second uncountable cardinal. In this paper we…
The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a…