Related papers: More nonamalgamable forcing extensions
In this paper, we completely solve the matrix extension problem with symmetry and provide a step-by-step algorithm to construct such a desired matrix $\mathsf{P}_e$ from a given matrix $\mathsf{P}$. Furthermore, using a cascade structure,…
We discuss a possible characterization, by means of forbidden configurations, of posets which are embeddable in a product of finitely many scattered chains.
We attempt to formalise the relationship between the poroelasticity theory and the effective medium theory of micromechanics. The assumptions of these two approaches vary, but both can be linked by considering the undrained response of a…
We propose a method for the construction of sets of variable dimension strong non-overlapping matrices basing on any strong non-overlapping set of strings.
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
We make use of a forcing technique for extending Boolean algebras. The same type of forcing was employed in [BK81], [Kos99], and elsewhere. Using and modifying a lemma of Koszmider, and using CH, we obtain an atomless BA, A such that f(A) =…
In this article, we introduce a method to extend involutive nondegenerate set-theoretic solutions to the Yang--Baxter equation by means of equivariant mappings to graded modules, thus leading to the notion of a twisted extension.…
Image extension models have broad applications in image editing, computational photography and computer graphics. While image inpainting has been extensively studied in the literature, it is challenging to directly apply the…
Nonnegative Matrix Factorization (NMF) is a widely used technique for data representation. Inspired by the expressive power of deep learning, several NMF variants equipped with deep architectures have been proposed. However, these methods…
We study relationships between various set theoretic compactness principles, focusing on the interplay between the three families of combinatorial objects or principles mentioned in the title. Specifically, we show the following. (1) Strong…
We introduce a forcing technique to construct three-dimensional arrays of generic extensions through FS (finite support) iterations of ccc posets, which we refer to as 3D-coherent systems. We use them to produce models of new constellations…
In this paper, we introduce the concept of a nested family of torsion pairs and will prove that this concept is strongly related to the existence of stratifying systems. Specifically, every stratifying system induces a nested family of…
In this paper, we propose a constraint-based modeling approach for the problem of discovering frequent gradual patterns in a numerical dataset. This SAT-based declarative approach offers an additional possibility to benefit from the recent…
We apply a modern axiomatic system of nonstandard analysis in metric fixed point theory. In particular, we formulate a nonstandard iteration scheme for nonexpansive mappings and present a nonstandard approach to fixed-point problems in…
This note introduces a new family of wavelets and a multiresolution analysis, which exploits the relationship between analysing filters and Floquet's solution of Mathieu differential equations. The transfer function of both the detail and…
We prove some conditions for the existence of higher dimensional algebraic fibering of group extensions. This leads to various corollaries on incoherence of groups and some geometric examples of algebraic fibers of type $F_n$ but not…
We present the M\"{o}bius functions of several posets of annular noncrossing objects, namely a self-dual extension of the annular noncrossing permutations, minimal length annular partitioned permutations, and annular noncrossing partitons.
We introduce a weak form of the realignment separability criterion which is particularly suited to detect continuous-variable entanglement and is physically implementable (it requires linear optics transformations and homodyne detection).…
It is known when we call a poset P, a $\mathcal{P}$-chain permutational poset, given a subset of permutations $\mathcal{P}$ of the symmetric group $S_{n}$. In this work, we use the same idea to study subsets of words of length $n$, that are…
We derive results about geometric means of the Fourier modulus of filters and functions related to refinable distributions with arbitrary dilations and translations. Then we develop multi-scale constructions for dilations by…