Related papers: Pseudo-Prikry sequences
In this paper, we develop a structure theory for generalized spectral sequences, which are derived from chain complexes that are filtered over arbitrary partially ordered sets. Also, a more general construction method reminiscent of exact…
A review of the pseudo-complex General Relativity (pc-GR) is presented, with the emphasis on observational consequences. First it is argued why to use an algebraic extension and why the pseudo-complex is a viable one. Afterward, the pc-GR…
We define a class of discrete operators acting on infinite, finite or periodic sequences mimicking the standard properties of pseudo-differential operators. In particular we can define the notion of order and regularity, and we recover the…
We study several ideal-based constructions in the context of singular stationarity. By combining methods of strong ideals, supercompact embeddings, and Prikry-type posets, we obtain three consistency results concerning mutually stationary…
Exceptional sequences are important sequences of quiver representations in the study of representation theory of algebras. They are also closely related to the theory of cluster algebras and the combinatorics of Coxeter groups. We…
In this paper, we study the class of parabolically geometrically finite (PGF) subgroups of mapping class groups, introduced by Dowdall-Durham-Leininger-Sisto. We prove a combination theorem for graphs of PGF groups (and other…
It is known that Kolmogorov-Arnold-Moser boundaries appear in sufficiently smooth 2-dimensional area-preserving maps. When such boundaries are destroyed, they become pseudo-boundaries. We show that pseudo-boundaries can also be found in…
This paper presents an innovative approach to the study of recurrent sequences by introducing the concept of arithmetic pseudo-operators. Unlike conventional operators, these pseudo-operators are pure complex numbers with specific…
We consider here Easton support iterations of Prikry type forcing notions. New ways of constructing normal ultrafilters in extensions are presented. It turns out that, in contrast with other supports, seemingly unrelated measures or…
We provide new characterizations of pseudo-Frobenius and quasi-Frobenius rings in terms of tight modules. In the process, we also provide fresh perspectives on FGF and CF conjectures. In particular, we propose new natural extensions of…
A new formulation of field theory is presented, based on a pseudo-complex description. An extended group structure is introduced, implying a minimal scalar length, rendering the theory regularized a la Pauli-Villars. Cross sections are…
Many automatic sequences, such as the Thue-Morse sequence or the Rudin-Shapiro sequence, have some desirable features of pseudorandomness such as a large linear complexity and a small well-distribution measure. However, they also have some…
Pseudo-variograms appear naturally in the context of multivariate Brown-Resnick processes, and are a useful tool for analysis and prediction of multivariate random fields. We give a necessary and sufficient criterion for a matrix-valued…
We present a modification to the Prikry on Extenders forcing notion allowing the blow up of the power set of a large cardinal, change its cofinality to omega without adding bounded subsets, working directly from arbitrary extender (e.g.,…
We present a theory and applications of discrete exterior calculus on simplicial complexes of arbitrary finite dimension. This can be thought of as calculus on a discrete space. Our theory includes not only discrete differential forms but…
We give a combinatorial characterization of generic frameworks that are minimally rigid under the additional constraint of maintaining symmetry with respect to a finite order rotation or a reflection. To establish these results we develop a…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…
In this paper we continue the study of equivalence of generics filters started by Smythe in [Smy22]. We fully characterize those forcing posets for which the corresponding equivalence of generics is smooth using the purely topological…
We develop a pseudo-metric analogue of bisimulation for generalized semi-Markov processes. The kernel of this pseudo-metric corresponds to bisimulation; thus we have extended bisimulation for continuous-time probabilistic processes to a…
In this paper, we provide a general framework for counting geometric structures in pseudo-random graphs. As applications, our theorems recover and improve several results on the finite field analog of questions originally raised in the…