Related papers: Soft-linkedness
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
Logic-based abduction finds important applications in artificial intelligence and related areas. One application example is in finding explanations for observed phenomena. Propositional abduction is a restriction of abduction to the…
We use a method involving elementary submodels and a partial converse of Foran lemma to prove separable reduction theorems concerning Suslin sigma-P-porous sets where "P" can be from a rather wide class of porosity-like relations in…
Theoretical models applied to option pricing should take into account the empirical characteristics of the underlying financial time series. In this paper, we show how to price basket options when assets follow a shifted log-normal process…
While any infimum in a poset can also be computed as a supremum, and vice versa, categorical limits and colimits do not always approximate each other. If I approach a point from below, and you approach it from above, then we will surely…
We consider prediction with expert advice under the log-loss with the goal of deriving efficient and robust algorithms. We argue that existing algorithms such as exponentiated gradient, online gradient descent and online Newton step do not…
We show that the introduction of an additional, hard, singularity in soft forward amplitudes enables one to improve considerably the fits using a simple-pole structure for the soft pomeron.
Iteration semirings are Conway semirings satisfying Conway's group identities. We show that the semirings $\N^{\rat}\llangle \Sigma^* \rrangle$ of rational power series with coefficients in the semiring $\N$ of natural numbers are the free…
We show that hypernetworks can be regarded as posets which, in their turn, have a natural interpretation as simplicial complexes and, as such, are endowed with an intrinsic notion of curvature, namely the Forman Ricci curvature, that…
In this paper, we extend the method proposed in \cite{Arkani-Hamed:2024fyd} for deriving soft theorems of amplitudes, which relies exclusively on factorization properties including conventional factorizations on physical poles, as well as…
Recently it has been shown that all non-trivial closed permutation groups containing the automorphism group of the random poset are generated by two types of permutations: the first type are permutations turning the order upside down, and…
The concept of a Kleene algebra (sometimes also called Kleene lattice) was already generalized by the first author for non-distributive lattices under the name pseudo-Kleene algebra. We extend these concepts to posets and show how…
We revisit the solvable lattice models described by Andrews Baxter and Forrester and their generalizations. The expressions for the local state probabilities were shown to be related to characters of the minimal models. We recompute these…
We introduce a flexible approach for the enumeration of the down-sets of a finite poset and test it with the calculation of the Dedekind numbers $b(5) = 7581$ and $b(6) = 7828354$. For the calculation of $b(5)$, we develop two methods of…
We prove a general quantitative theorem on the asymptotic behavior of stochastic quasi-Fej\'er monotone sequences in a broad metric context. Concretely, our result explicitly constructs a rate of convergence for such process, both in mean…
This work establishes the exact exponents for the soft-covering phenomenon of a memoryless channel under the total variation metric when random (i.i.d. and constant-composition) channel codes are used. The exponents, established herein, are…
Bayes's rule deals with hard evidence, that is, we can calculate the probability of event $A$ occuring given that event $B$ has occurred. Soft evidence, on the other hand, involves a degree of uncertainty about whether event $B$ has…
We provide a theoretical and computational investigation of the Gamma-Maximin method with soft revision, which was recently proposed as a robust criterion for pseudo-label selection (PLS) in semi-supervised learning. Opposed to traditional…
State reduction of finite automata plays a significant role in improving efficiency in formal verification, pattern recognition, and machine learning, where automata-based models are widely used. While deterministic automata have…
At the end of the twentieth century, J.-B. Bost developped a slope theory of hermitian vector bundles over number fields. A new method of diophantine approximation, the so-called slope method, has emerged from his research. Our article…