Related papers: Forcing in Ramsey theory
The forcing of particles in turbulent environments influences dynamical properties pertinent to many fundamental applications involving particle-flow interactions. Current study explores the determination of forcing for one-way coupled…
We present a novel end-to-end reinforcement learning approach to automatic taxonomy induction from a set of terms. While prior methods treat the problem as a two-phase task (i.e., detecting hypernymy pairs followed by organizing these pairs…
We prove that the universal homogeneous 3-uniform hypergraph has finite big Ramsey degrees. This is the first case where big Ramsey degrees are known to be finite for structures in a non-binary language. Our proof is based on the vector (or…
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…
We consider Fra\"iss\'e structures whose objects have finite big Ramsey degree and ask what consequences this has for the dynamics of the automorphism group. Motivated by a theorem of D. Devlin about the partition properties of the…
This paper describes grope and Whitney tower filtrations on the set of concordance classes of classical links in terms of class and order respectively. Using the tree-valued intersection theory of Whitney towers, the associated graded…
In this paper we investigate algebraic properties of big Ramsey degrees in categories satisfying some mild conditions. As the first nontrivial consequence of the generalization we advocate in this paper we prove that small Ramsey degrees…
We use nonstandard methods, based on iterated hyperextensions, to develop applications to Ramsey theory of the theory of monads of ultrafilters. This is performed by studying in detail arbitrary tensor products of ultrafilters, as well as…
This paper discusses a system that accelerates reinforcement learning by using transfer from related tasks. Without such transfer, even if two tasks are very similar at some abstract level, an extensive re-learning effort is required. The…
Understanding and quantifying causal relationships between variables is essential for reasoning about the physical world. In this work, we develop a resource-theoretic framework to do so. Here, we focus on the simplest nontrivial setting --…
We extend some of our earlier results on the interconnection between ultrafilter extensions, and ultrapowers. Throughout we restrict ourselves to relational structures with one binary relation. Recently it was shown that for bounded…
The tree forcing method given by (Liu 2015) enables the cone avoiding of strong enumeration of a given tree, within a subset or co-subset of an arbitrary given set, provided the given tree does not admit computable strong enumeration. Using…
Semiflexible polymers in poor solvents exhibit a rich variety of collapsed morphologies, including globules, toroids, and rodlike bundles, arising from the competition between attractive interactions and chain stiffness. Computer…
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
A key limitation in using various modern methods of machine learning in developing feedback control policies is the lack of appropriate methodologies to analyze their long-term dynamics, in terms of making any sort of guarantees (even…
The finite strain theory is reformulated in the frame of the Tangential Differential Calculus (TDC) resulting in a unification in a threefold sense. Firstly, ropes, membranes and three-dimensional continua are treated with one set of…
We prove a theorem ensuring that the compositions of certain Ramsey families are still Ramsey. As an application, we show that in any finite coloring of $\mathbb{N}$ there is an infinite set $A$ and an as large as desired finite set $B$…
A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…
We study two limiting cases of turbulence forcing in numerical experiments: solenoidal (divergence-free) forcing, and compressive (curl-free) forcing, and compare our results to observations reported in the literature. We solve the…
A diagonal version of the strong reflection principle is introduced, along with fragments of this principle associated to arbitrary forcing classes. The relationships between the resulting principles and related principles, such as the…