相关论文: The Peirce axiom scheme and suprema

We provide an alternative proof of the recent result by Park and Pham (2022) on the expected suprema of positive selector and empirical processes. We extend it to positive infinitely divisible processes.

The article introduces the concept of uniformity, which is formulated as a scheme of axioms. The connection of this concept with ordered sets is studied. The effectiveness of using axiom schemes as a convenient and short way of replacing…

We present pairwise fairness metrics for ranking models and regression models that form analogues of statistical fairness notions such as equal opportunity, equal accuracy, and statistical parity. Our pairwise formulation supports both…

Making use of the total variation of particular functions, we give an explicit formula for the pointwise supremum of the set of all copulas with a given curvilinear section. When the pointwise supremum is a copula is characterized. We also…

We apply a framework developed by C. S. Peirce to analyze the concept of clarity, so as to examine a pair of rival mathematical approaches to a typical result in analysis. Namely, we compare an intuitionist and an infinitesimal approaches…

Pairwise comparisons are an important tool of modern (multiple criteria) decision making. Since human judgments are often inconsistent, many studies focused on the ways how to express and measure this inconsistency, and several…

We present new proofs to four versions of Peano's Existence Theorem for ordinary differential equations and systems. We hope to have gained readability with respect to other usual proofs. We also intend to highlight some ideas due to Peano…

We prove some theorems which give sufficient conditions for the existence of prime numbers among the terms of a sequence which has pairwise relatively prime terms.

We give a short, elementary and explicit proof of the existence of Hilbert schemes of points on affine schemes. As a direct consequence we obtain the existence of the Hilbert scheme of points on any projective scheme, not necessarily of…

In this paper, we present a new necessary and sufficient condition for which the supremum exists with respect to the logic order. Moreover, we give out a new and much simpler representation of the supremum with respect to the order, our…

Results about existence and uniqueness of solutions of initial value problem for certain types of partial differential equations are recalled as well as iterative scheme and an error estimate for approximate solutions obtained using this…

We prove that one may approximate parametric suprema of constructible and power-constructible functions using functions within the same class. This resolves a conjecture by Adiceam and Cluckers, which was posited after studying a question…

The pairwise winning indices, computed in the Stochastic Multicriteria Acceptability Analysis, give the probability with which an alternative is preferred to another taking into account all the instances of the assumed preference model…

In this paper we generalize an explicit numerical scheme for the CIR process that we have proposed before. The advantage of the new proposed scheme is that preserves positivity and is well posed for a (little bit) broader set of parameters…

We give an equivalent condition of the $P$-polynomial property of symmetric association schemes.

We give a polynomial time approximation scheme (PTAS) for computing the supremum of a Gaussian process. That is, given a finite set of vectors $V\subseteq\mathbb{R}^d$, we compute a $(1+\varepsilon)$-factor approximation to $\mathop…

In the paper the notion of {\em Rauzy scheme} is introduced. From Rauzy graph Rauzy Scheme can be obtaining by uniting sequence of vertices of ingoing and outgoing degree 1 by arches. This notion is a tool to describe Rauzy graph behavior.…

Symmetry preserving difference schemes approximating second and third order ordinary differential equations are presented. They have the same three or four-dimensional symmetry groups as the original differential equations. The new…

In this paper we characterize the approximation schemes that satisfy Shapiro's theorem and we use this result for several classical approximation processes. In particular, we study approximation of operators by finite rank operators and…

A new $\theta$ function primitive is proposed that almost achieves the combined efficiency of the addition, multiplication and successor growth operations. This $\theta$ function symbol enables the constructing of an "IQFS(PA+)" axiom…