Related papers: Long low iterations
Answering a question of Usuba, we show that an extendible cardinal can be preserved by a set forcing that is not a small forcing.
The control of bilinear systems has attracted considerable attention in the field of systems and control for decades, owing to their prevalence in diverse applications across science and engineering disciplines. Although much work has been…
We propose to identify directions invariant to a given classifier so that these directions can be controlled in tasks such as style transfer. While orthogonal decomposition is directly identifiable when the given classifier is linear, we…
In this paper, we discuss the controllability of a family of linear time-invariant (LTI) networks defined on a signed graph. In this direction, we introduce the notion of positive and negative signed zero forcing sets for the…
We define and investigate versions of Silver and Mathias forcing with respect to lower and upper density. We focus on properness, Axiom A, chain conditions, preservation of cardinals and adding Cohen reals. We find rough forcings that…
Let $\mathfrak{i}$ denote the minimal cardinality of a maximal independent family and let $\mathfrak{a}_T$ denote the minimal cardinality of a maximal family of pairwise almost disjoint subtrees of $2^{<\omega}$. Using a countable support…
The notion of strong structural controllability (s-controllability) allows for determining controllability properties of large linear time-invariant systems even when numerical values of the system parameters are not known a priori. The…
For any regular cardinal $\kappa$ and ordinal $\eta<\kappa^{++}$ it is consistent that $2^{\kappa}$ is as large as you wish, and every function $f:\eta \to [\kappa,2^{\kappa}]\cap Card$ with $f(\alpha)=\kappa$ for $cf(\alpha)<\kappa$ is the…
The paper analyzes a Lagrangian system which is controlled by directly assigning some of the coordinates as functions of time, by means of frictionless constraints. In a natural system of coordinates, the equations of motions contain terms…
We develop a unified framework for the study of properties involving diagonalizations of dense families in topological spaces. We provide complete classification of these properties. Our classification draws upon a large number of methods…
It is well known to generalize the meagre ideal replacing aleph_0 by a (regular) cardinal lambda > aleph_0 and requiring the ideal to be lambda^+-complete. But can we generalize the null ideal? In terms of forcing, this means finding a…
Let L^1(G) and M(G) be group algebra and measure algebra of a locally compact group G, respectively and D:L^1(G)-->M(G) be a continuous linear map. We consider D behaving like derivation or anti-derivation at orthogonal elements for several…
Over the past two decades the notion of a strong monad has found wide applicability in computing. Arising out of a need to interpret products in computational and semantic settings, different approaches to this concept have arisen. In this…
This paper presents the main results in my Ph.D. thesis. In what follows several proofs of SCH are presented introducing a family of covering properties which implies both SCH and the failure of various forms of square. These covering…
The contour of a family of filters along a filter is a set-theoretic lower limit. Topologicity and regularity of convergences can be characterized with the aid of the contour operation. Contour inversion is studied, in particular, for…
The naive application of Reinforcement Learning algorithms to continuous control problems -- such as locomotion and manipulation -- often results in policies which rely on high-amplitude, high-frequency control signals, known colloquially…
Juggling patterns can be described by a sequence of cards which keep track of the relative order of the balls at each step. This interpretation has many algebraic and combinatorial properties, with connections to Stirling numbers, Dyck…
Under large cardinal hypotheses beyond the Kunen inconsistency -- hypotheses so strong as to contradict the Axiom of Choice -- we solve several variants of the generalized continuum problem and identify structural features of the levels…
We list some open problems, concerning the polarized partition relation. We solve a couple of them by showing that for every singular cardinal $\mu$ one can force the strong polarized relation with respect to the pair $\mu^+,\mu$.
We force $2^\lambda$ to be large and for many pairs in the interval $(\lambda,2^\lambda)$ a stronger version of the polarized partition relations hold. We apply this toproblem in general topology