相关论文: On closed unbounded sets consisting of former regu…
Using countable support iteration of $S$-proper posets, for some appropriate stationary set $S$, we obtain a generic extension of the constructible universe, in which $\mathfrak{b}=\mathfrak{c}=\aleph_2$ and there is a maximal cofinitary…
We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are provided. Two…
We study existence of random elements with partially specified distributions. The technique relies on the existence of a positive extension for linear functionals accompanied by additional conditions that ensure the regularity of the…
For a class of random partitions of an infinite set a de Finetti-type representation is derived, and in one special case a central limit theorem for the number of blocks is shown.
In this article we aim to develop from first principles a theory of sum sets and partial sum sets, which are defined analogously to difference sets and partial difference sets. We obtain non-existence results and characterisations. In…
A finitely generated solvable group with unbounded iterated identity is constructed.
We study covers of the multiplicative group of an algebraically closed field as quasiminimal pregeometry structures and prove that they satisfy the axioms for Zariski-like structures presented in \cite{lisuriart}, section 4. These axioms…
Using methods developed by Robinson, we find a complete theory suitable for a first order description of infintesimal neighborhoods. We use this to construct a specialisation having universal properties and to find a recursively enumerable…
We show if we use countable support iteration of forcing notions not adding reals that satisfy additional conditions, then the limit forcing does not add reals. As a result we prove that we can amalgamate two earlier methods and prove the…
It is shown the construction of a module structure [2] with universe over a set of a particular kind of mathematical proofs, the base ring of this module will be built on a maximal consistent extension of a set of propositions, this…
We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…
We synthesize and unify notions of regularity, both of individual sets and of collections of sets, as they appear in the convergence theory of projection methods for consistent feasibility problems. Several new characterizations of…
We consider the question of when an expansion of a topological structure has the property that every open set definable in the expansion is definable in the original structure. This question is related to and inspired by recent work of…
Directed graphs occur throughout statistical modeling of networks, and exchangeability is a natural assumption when the ordering of vertices does not matter. There is a deep structural theory for exchangeable undirected graphs, which…
For every uncountable regular $\kappa$, we give two examples of proper posets which turn improper in some $\kappa$-closed forcing extension.
We develop a methodology for proving well-posedness in optimal regularity spaces for a wide class of nonlinear parabolic initial-boundary value systems, where the standard monotone operator theory fails. A motivational example of a problem…
Poset-theoretic generalizations of set-theoretic committee constructions are presented. The structure of the corresponding subposets is described. Sequences of irreducible fractions associated to the principal order ideals of finite bounded…
In this paper, we will prove some sufficient conditions for the solvability of groups.
We present the classical theory of preservation of $\sqsubset$-unbounded families in generic extensions by ccc posets, where $\sqsubset$ is a definable relation of certain type on spaces of real numbers, typically associated with some…
We give an efficient construction of a reasonably small dominating set in a circulant graph on $n$ notes and $k$ distinct chord lengths. This result is based on bounds on some double exponential sums. .