Related papers: BMM is stronger than BSPFA
The backup control barrier function (CBF) was recently proposed as a tractable formulation that guarantees the feasibility of the CBF quadratic programming (QP) via an implicitly defined control invariant set. The control invariant set is…
A badly approximable system of affine forms is determined by a matrix and a vector. We show Kleinbock's conjecture for badly approximable systems of affine forms: for any fixed vector, the set of badly approximable systems of affine forms…
Non-supersymmetric multi-wall configurations are generically unstable. It is proposed that the stabilization in compact space can be achieved by introducing a winding number into the model. A BPS-like bound is studied for the energy of…
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…
Bagging is an important technique for stabilizing machine learning models. In this paper, we derive a finite-sample guarantee on the stability of bagging for any model. Our result places no assumptions on the distribution of the data, on…
The development of consistent and stable quasicontinuum models for multi-dimensional crystalline solids remains a challenge. For example, proving stability of the force-based quasicontinuum (QCF) model remains an open problem. In 1D and 2D,…
We consider the question of the additivity of strong homology. This entails isolating the set-theoretic content of the higher derived limits of an inverse system indexed by the functions from $\mathbb{N}$ to $\mathbb{N}$. We show that this…
We generalise Jensen's result on the incompatibility of subcompactness with square. We show that alpha^+-subcompactness of some cardinal less than or equal to alpha precludes square_alpha, but also that square may be forced to hold…
We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.
Byzantine fault-tolerant (BFT) state machine replication (SMR) has been studied for over 30 years. Recently it has received more attention due to its application in permissioned blockchain systems. A sequence of research efforts focuses on…
Bounded proofs are convenient to use due to the high degree of automation that exhaustive checking affords. However, they fall short of providing the robust assurances offered by unbounded proofs. We sketch how completeness thresholds serve…
This paper considers the problem of robust stability for a class of uncertain quantum systems subject to unknown perturbations in the system Hamiltonian. Some general stability results are given for different classes of perturbations to the…
A usual dichotomy is that in many cases, reasonably definable sets, satisfy the CH, i.e. if they are uncountable they have cardinality continuum. A strong dichotomy is when: if the cardinality is infinite it is continuum as in [Sh:273]. We…
The aim of this article is to simplify Pfanzagl's proof of consistency for asymptotic maximum likelihood estimators, and to extend it to more general asymptotic M-estimators. The method relies on the existence of a sort of contraction of…
In robust combinatorial optimization, we would like to find a solution that performs well under all realizations of an uncertainty set of possible parameter values. How we model this uncertainty set has a decisive influence on the…
Given a max-plus linear system and a semimodule, the problem of computing the maximal controlled invariant subsemimodule is still open to this day. In this paper, we consider this problem for the specific class of fully actuated systems and…
We have constructed a modified BFT method that preserves the chain structure of constraints. This method has two advantages: first, it leads to less number of primary constraints such that the remaining constraints emerge automatically; and…
The lack of experimental evidence at the LHC for physics beyond the Standard model (BSM) of elementary particles together with necessity of its existence to provide solutions of internal problems of the Standard model (SM) as well as of…
Two-component second and third-order Burgers type systems with nondiagonal constant matrix of leading order terms are classified for higher symmetries. New symmetry integrable systems with their master symmetries are obtained. Some third…
We prove that for any superatomic Boolean Algebra of cardinality >beth_omega there is an automorphism moving uncountably many atoms. Similarly for larger cardinals. Any of those results are essentially best possible.