Related papers: Higher-dimensional forcing

We call a system super-linearizable if it admits finite-dimensional embedding as a linear system -- known as a finite-dimensional Koopman embedding; said otherwise, if its dynamics can be linearized by adding a finite set of observables. We…

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

Exploiting tools from algebraic geometry, the problem of finiteness of determination of accessibility/strong accessibility is investigated for polynomial systems and also for analytic systems that are immersible into polynomial systems. The…

We construct an explicit filtration of the ring of algebraic power series by finite dimensional constructible sets, measuring the complexity of these series. As an application, we give a bound on the dimension of the set of algebraic power…

Many high dimensional integrals can be reduced to the problem of finding the relative measures of two sets. Often one set will be exponentially larger than the other, making it difficult to compare the sizes. A standard method of dealing…

Inspired by the necessity of morphological adaptation in animals, a growing body of work has attempted to expand robot training to encompass physical aspects of a robot's design. However, reinforcement learning methods capable of optimizing…

In this paper, deterministic construction of measurement matrices in Compressive Sensing (CS) is considered. First, by employing the column replacement concept, a theorem for construction of large minimum distance linear codes containing…

Given a countable model of set theory, we study the structure of its generic multiverse, the collection of its forcing extensions and ground models, ordered by inclusion. Mostowski showed that any finite poset embeds into the generic…

For a degree sequence, we define the set of edges that appear in every labeled realization of that sequence as forced, while the edges that appear in none as forbidden. We examine structure of graphs whose degree sequences contain either…

It is shown that the boldface maximality principle for subcomplete forcing, together with the assumption that the universe has only set-many grounds, implies the existence of a (parameter-free) definable well-ordering of…

We initiate the study of how to extend the correspondence between dimer models and (0+1)-dimensional cluster integrable systems to (1+1) and (2+1)-dimensional continuous integrable field theories, addressing various points that are…

This paper is motivated by the theory of sequential dynamical systems, developed as a basis for a mathematical theory of computer simulation. It contains a classification of finite dynamical systems on binary strings, which are obtained by…

For any conformal iterated function system (CIFS) consisting of finitely or countably many maps, and any closed shift-invariant set of right-infinite sequences of such maps, one can associate a limit set, which we call a shift-generated…

The canonical analysis of Proca's theory in five dimensions with a compact dimension is performed. From the Proca five dimensional action, we perform the compactification process on a S^1/\mathbf{Z_2} orbifold, then, we analyze the four…

We show that a wide class of geometrically defined overdetermined semilinear partial differential equations may be explicitly prolonged to obtain closed systems. As a consequence, in the case of linear equations we extract sharp bounds on…

We study methods to obtain the consistency of forcing axioms, and particularly higher forcing axioms. We first force over a model with a supercompact cardinal $\theta>\kappa$ to get the consistency of the forcing axiom for $\kappa$-strongly…

Motivated by the grid search method and Bayesian optimization, we introduce the concept of contractibility and its applications in model-based optimization. First, a basic framework of contraction methods is established to construct a…

We prove a variation of Easton's lemma for strongly proper forcings, and use it to prove that, unlike the stronger principle $\textsf{IGMP}$, $\textsf{GMP}$ together with $2^\omega \le \omega_2$ is consistent with the existence of an…

We give an example of iteration of length omega of (<kappa)-complete kappa^+-cc forcing notions with the limit collapsing kappa^+. The construction is decoded from the proof of Shelah [Proper and Improper Forcing, Appendix, Theorem 3.6(1)].

The C*-envelope of the limit algebra (or limit space) of a contractive regular system of digraph algebras (or digraph spaces) is shown to be an approximately finite C*-algebra and the direct system for the C*-envelope is determined…