Related papers: Vop\v{e}nka's Alternative Set Theory as a framewor…
The current definition of a Bayesian credible set cannot, in general, achieve an arbitrarily preassigned credible level. This drawback is particularly acute for classification problems, where there are only a finite number of achievable…
The N=1 Volkov-Akulov model of nonlinear supersymmetry is explicitly related to a vector supermultiplet model with a Fayet-Iliopoulos D term of linear supersymmetry. The physical significance of the results is discussed briefly.
Feasibility pumps are highly effective primal heuristics for mixed-integer linear and nonlinear optimization. However, despite their success in practice there are only few works considering their theoretical properties. We show that…
The Bodirsky-Pinsker conjecture asserts a P vs. NP-complete dichotomy for the computational complexity of Constraint Satisfaction Problems (CSPs) of first-order reducts of finitely bounded homogeneous structures. Prominently, two structures…
Topological models of empirical and formal inquiry are increasingly prevalent. They have emerged in such diverse fields as domain theory [1, 16], formal learning theory [18], epistemology and philosophy of science [10, 15, 8, 9, 2],…
Classical Luzin's theorem states that the measurable function of one variable is "almost" continuous. This is not so anymore for functions of several variables. The search of right analogue of the Luzin theorem leads to a notion of…
Alternative set theory (AST) may be suitable for the ones who try to capture objects or phenomenons with some kind of indefiniteness of a border. While AST provides various notions for advanced mathematical studies, correspondence of them…
This paper focuses on the analysis of conforming virtual element methods for general second-order linear elliptic problems with rough source terms and applies it to a Poisson inverse source problem with rough measurements. For the forward…
We consider adjustable robust linear complementarity problems and extend the results of Biefel et al. (2022) towards convex and compact uncertainty sets. Moreover, for the case of polyhedral uncertainty sets, we prove that computing an…
We assign real numbers to finite sheeted coverings of compact CW complexes designed as finite counterparts to the Novikov-Shubin numbers. We prove an approximation theorem in the case of virtually cyclic fundamental groups employing methods…
A refined a priori error analysis of the lowest order (linear) nonconforming Virtual Element Method (VEM) for approximating a model Poisson problem is developed in both 2D and 3D. A set of new geometric assumptions is proposed on shape…
Abstract convexity generalises classical convexity by considering the suprema of functions taken from an arbitrarily defined set of functions. These are called the abstract linear (abstract affine) functions. The purpose of this paper is to…
We propose an alternative approach to probability theory closely related to the framework of numerosity theory: non-Archimedean probability (NAP). In our approach, unlike in classical probability theory, all subsets of an infinite sample…
In this paper, we study a first order solution method for a particular class of set optimization problems where the solution concept is given by the set approach. We consider the case in which the set-valued objective mapping is identified…
In this work we introduce and analyse a new low-order method for the variable-density incompressible Navier-Stokes equations. The main novelty of the proposed method lies in the support of general meshes, possibly including polygonal or…
We set out the general theory of ``Beck modules'' in a variety of algebras and describe them as modules over suitable ``universal enveloping'' unital associative algebras. We develop a theory of ``noncommutative partial differentiation'' to…
The aim of the paper is to develop a general theory of solvability of linear inhomogeneous boundary-value problems for systems of ordinary differential equations of arbitrary order in Sobolev spaces. Boundary conditions are allowed to be…
We study the uniform computational content of the Vitali Covering Theorem for intervals using the tool of Weihrauch reducibility. We show that a more detailed picture emerges than what a related study by Giusto, Brown, and Simpson has…
Nonmonotonic logics are usually characterized by the presence of some notion of 'conditional' that fails monotonicity. Research on nonmonotonic logics is therefore largely concerned with the defeasibility of argument forms and the…
The emergent field of probabilistic numerics has thus far lacked clear statistical principals. This paper establishes Bayesian probabilistic numerical methods as those which can be cast as solutions to certain inverse problems within the…