Related papers: A solution to Roitman's problem
We study some strong combinatorial properties of $\textsf{MAD}$ families. An ideal $\mathcal{I}$ is Shelah-Stepr\={a}ns if for every set $X\subseteq{\left[ \omega\right]}^{<\omega}$ there is an element of $\mathcal{I}$ that either…
This note concerns a class of matrix Riccati equations associated with stochastic linear-quadratic optimal control problems with indefinite state and control weighting costs. A novel sufficient condition of solvability of such equations is…
In the absence of the Axiom of Choice, the "small" cardinal $\omega_1$ can exhibit properties more usually associated with large cardinals, such as strong compactness and supercompactness. For a local version of strong compactness, we say…
We calculate the almost sure dimension for a general class of random affine code tree fractals in $\mathbb R^d$. The result is based on a probabilistic version of the Falconer-Sloan condition $C(s)$ introduced in \cite{FS}. We verify that,…
If T is an iteration tree on K and F is a countably certified extender that coheres with the final model of T, then F is on the extender sequence of the final model of T. Several applications of maximality are proved, including: o K…
We construct a family of $(2,n)$-almost Grassmannian structures of regularity $C^1$, each admitting a one-parameter group of strongly essential automorphisms, and each not flat on any neighborhood of the higher-order fixed point. This shows…
We consider a family of optimal control problems where the control variable is given by a boundary condition of Neumann type. This family is governed by parabolic variational inequalities of the second kind. We prove the strong convergence…
In this paper we show that a quasi-exactly solvable (normalizable or periodic) one-dimensional Hamiltonian satisfying very mild conditions defines a family of weakly orthogonal polynomials which obey a three-term recursion relation. In…
We introduce a new class of almost disjoint families which we call fin-intersecting almost disjoint families. They are related to almost disjoint families whose Vietoris Hyperspace of their Isbell-Mr\'owka spaces are pseudocompact. We show…
Stability is a well investigated concept in extremal combinatorics. The main idea is that if some object is close in size to an extremal object, then it retains the structure of the extremal construction. In the present paper we study…
Recently, we have shown that satisfiability for $\mathsf{ECTL}^*$ with constraints over $\mathbb{Z}$ is decidable using a new technique. This approach reduces the satisfiability problem of $\mathsf{ECTL}^*$ with constraints over some…
We study the branch of semi-stable and unstable solutions (i.e., those whose Morse index is at most one) of the Dirichlet boundary value problem $-\Delta u=\frac{\lambda f(x)}{(1-u)^2}$ on a bounded domain $\Omega \subset \R^N$, which…
We introduce a general random model of a combinatorial optimization problem with geometric structure that encapsulates both linear programming and integer linear programming. Let $Q$ be a bounded set called the feasible set, $E$ be an…
We consider Liouville-type and partial regularity results for the nonlinear fourth-order problem $$ \Delta^2 u=|u|^{p-1}u\ \{in} \ \R^n,$$ where $ p>1$ and $n\ge1$. We give a complete classification of stable and finite Morse index…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…
In this paper, we study a class of fractional optimal control problems. A necessary condition for the existence of an optimal control is provided in the literature. It is commonly given as the existence of a solution of a fractional…
The rigidity of a matrix A for target rank r is the minimum number of entries of A that must be changed to ensure that the rank of the altered matrix is at most r. Since its introduction by Valiant (1977), rigidity and similar…
In this paper, we study the following classical question of extremal set theory: what is the maximum size of a family of subsets of $[n]$ such that no $s$ sets from the family are pairwise disjoint? This problem was first posed by Erd\H os…
We study in optimal control the important relation between invariance of the problem under a family of transformations, and the existence of preserved quantities along the Pontryagin extremals. Several extensions of Noether theorem are…