Related papers: Complementability and maximality in different cont…
A combinatorial property of prositive group presentations, called completeness, is introduced, with an effective criterion for recognizing complete presentations, and an iterative method for completing an incomplete presentation. We show…
Berge's maximum theorem gives conditions ensuring the continuity of an optimised function as a parameter changes. In this paper we state and prove the maximum theorem in terms of the theory of monoidal topology and the theory of double…
Generalising the concept of a complete permutation polynomial over a finite field, we define completness to level $k$ for $k\ge1$ in fields of odd characteristic. We construct two families of polynomials that satisfy the condition of high…
Works, briefly surveyed here, are concerned with two basic methods: Maximum Probability and Bayesian Maximum Probability; as well as with their asymptotic instances: Relative Entropy Maximization and Maximum Non-parametric Likelihood.…
We give a new characterization of relative entropy, also known as the Kullback-Leibler divergence. We use a number of interesting categories related to probability theory. In particular, we consider a category FinStat where an object is a…
It is well-known from the work of Kupper and Schachermayer that most law-invariant risk measures do not admit a time-consistent representation. In this work we show that in a Brownian filtration the "Optimized Certainty Equivalent" risk…
The ecologist H. T. Odum introduced a principle of physics, called Maximum Empower, in order to explain self-organization in a system (e.g. physical, biological, social, economical, mathematical, ...). The concept of empower relies on…
We provide a detailed characterization of the optimal consumption stream for the additive habit-forming utility maximization problem, in a framework of general discrete-time incomplete markets and random endowments. This characterization…
Inspired by applications of perfect graphs in combinatorial optimization, Chv\'{a}tal defined t-perfect graphs in 1970s. The long efforts of characterizing t-perfect graphs started immediately, but embarrassingly, even a working conjecture…
Incompleteness theorems of Godel, Turing, Chaitin, and Algorithmic Information Theory have profound epistemological implications. Incompleteness limits our ability to ever understand every observable phenomenon in the universe.…
Grothendieck's theory of blended extensions (extensions panach\'ees) gives a natural framework to study 3-step filtrations in abelian categories. We give a generalization of this theory that is suitable for filtrations with an arbitrary…
The aim of this paper is to discus the relations between various notions of sequential completeness and the corresponding notions of completeness by nets or by filters in the setting of quasi-metric spaces. We propose a new definition of…
The uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two. Quantifiers in this logic are used in…
Using the language of enriched $\infty$-categories, we formalize and generalize the definition of fusion n-category, and an analogue of iterative condensation of $E_i$-algebras. The former was introduced by Johnson-Freyd, and the latter by…
In their work, Dean, Rich, and Recht create a model to research recourse and availability of items in a recommender system. We used the definition of predictive multiplicity by Marx, Pin Calmon, and Ustun to examine different variations of…
An overview of recent advances in the theory of critical phenomena in $d$-dimensional weakly anisotropic systems is given. On the basis of a generalized shear transformation between anisotropic and isotropic systems, exact and approximate…
Following Lawvere's description of metric spaces using enriched category theory, we introduce a change in the base of enrichment that allows description of some aspects of (relativistic) causal spaces. All such spaces are Cauchy complete,…
The property of perfectness plays an important role in the theory of Bayesian networks. First, the existence of perfect distributions for arbitrary sets of variables and directed acyclic graphs implies that various methods for reading…
Two sets $A,B$ of nonnegative integers are called \emph{additive complements}, if all sufficiently large integers can be expressed as the sum of two elements from $A$ and $B$. We further call $A,B$ \emph{perfect additive complements} if…
In 1985, Boshernitzan showed that a minimal (sub)shift satisfying a linear block growth condition must have a bounded number of ergodic probability measures. Recently, this bound was shown to be sharp through examples constructed by Cyr and…