相关论文: Long low iterations

Positive linear systems on arbitrary time scales are studied. The theory developed in the paper unifies and extends concepts and results known for continuous-time and discrete-time systems. A necessary and sufficient condition for a linear…

The well known operator ordering ambiguity could motivate the existence of generations. This possibility is explored by exploiting the relationship between ordering and discretization rules. Context is drawn from lattice theory and non…

We show that factorization systems, both strict and orthogonal, can be equivalently described as double categories satisfying certain properties. This provides conceptual reasons for why the category of sets and partial maps or the category…

In this paper, we establish an analogue of Craig Interpolation Property for a many-sorted variant of first-order hybrid logic. We develop a forcing technique that dynamically adds new constants to the underlying signature in a way that…

Based on works of Saharon Shelah, Jakob Kellner, and Anda T\u{a}nasie for controlling the cardinal characteristics of the continuum in ccc forcing extensions, in the author's master's thesis was introduced a new combinatorial notion: the…

Combining creature forcing approaches from arXiv:1003.3425 and arXiv:1402.0367, we show that, under CH, there is a proper $\omega^\omega$-bounding poset with $\aleph_2$-cc that forces continuum many pairwise different cardinal…

Large cardinals arising from the existence of arbitrarily long end elementary extension chains over models of set theory are studied here. In particular, we show that the large cardinals obtained that way (`Unfoldable cardinals') behave as…

This paper develops a rich theory of cardinality in the paraconsistent and paracomplete set theory $\mathrm{BZFC}$, where sets can be inconsistent ($A$ such that ``$x\in A$'' is both true and false for some $x$) or incomplete ($A$ such that…

We consider controllability for divergence-free systems that have a conserved quantity and satisfy a H\"ormander condition. It is shown that such systems are controllable, provided that the conserved quantity is a proper function. The proof…

We provide comprehensive, level-by-level characterizations of large cardinals, in the range from weakly compact to strongly compact, by closure properties of powerful images of accessible functors. In the process, we show that these…

The goal of this note is to extend the result bounding from bellow the minimal possible growth of frequently oscillating subharmonic functions to a larger class of functions that carry similar properties. We refine and find further…

Notions of the orthogonality and convolution orthogonality are explored with the use of the Kontorovich-Lebedev transform and its convolution. New classes of the corresponding orthogonal polynomials and functions are investigated. Integral…

We characterize the situation of having many normal measures on a measurable cardinal. We show the plausibility of having many normal measures on each compact cardinal.

We show that under the Bounded Proper Forcing Axiom and an anti-large cardinal assumption, there is a $\mathbf{\Pi}^1_2$ MAD family.

We mainly investigate model of set theory with restricted choice, e.g., ZF + DC + "the family of countable subsets of lambda is well ordered for every lambda" (really local version for a given lambda). In this frame much of pcf theory can…

We find the cardinality of the value sets of polynomial maps associated with simple complex Lie algebras $B_2$ and $G_2$ over finite fields. We achieve this by using a characterization of their fixed points in terms of sums of roots of…

We present the observation that the process of stochastic model predictive control can be formulated in the framework of iterated function systems. The latter has a rich ergodic theory that can be applied to study the system's long-run…

Let $A$ and $B$ be sets in a finite vector space. In this paper, we study the magnitude of the set $A\cap f(B)$, where $f$ runs through a set of transformations. More precisely, we will focus on the cases that the set of transformations is…

Counters that hold natural numbers are ubiquitous in modeling and verifying software systems; for example, they model dynamic creation and use of resources in concurrent programs. Unfortunately, such discrete counters often lead to…

For $f,g\in\omega^\omega$ let $c^\forall_{f,g}$ be the minimal number of uniform $g$-splitting trees needed to cover the uniform $f$-splitting tree, i.e., for every branch $\nu$ of the $f$-tree, one of the $g$-trees contains $\nu$. Let…