Related papers: The converse envelope theorem
We analyze the main arguments that attempt to explain why there is no point in changing the envelope. Most people confuse estimation and calculation, conditional and unconditional probabilities, random and non-random variables, modelling…
Hindman's Theorem is a prototypical example of a combinatorial theorem with a proof that uses the topology of the ultrafilters. We show how the methods of this proof, including topological arguments about ultrafilters, can be translated…
An elementary proof of Kepler's first law, i.e. that bounded planetary orbits are elliptical, is derived without the use of calculus. The proof is similar in spirit to previous derivations, in that conservation laws are used to obtain an…
We provide a new proof of a important theorem in the Lagrangian formalism about necessary and sufficient conditions for a second-order variational system of equations to follow from a first-order Lagrangian.
We introduce a proper display calculus for first-order logic, of which we prove soundness, completeness, conservativity, subformula property and cut elimination via a Belnap-style metatheorem. All inference rules are closed under uniform…
We use the compression theorem (arxiv:math.GT/9712235) cf section 7, to prove results for equivariant configuration spaces analogous to the well-known non-equivariant results of May, Milgram and Segal.
We take the first step toward a structure theory that includes both operations of a ring $\mathcal{R}$. More precisely, we prove a series of inverse results for the structure of sets $A\subseteq \mathbf{F}_p$ such that, under certain…
Let $S$ be the group of finitely supported permutations of a countably infinite set. Let $K[S]$ be the group algebra of $S$ over a field $K$ of characteristic $0$. According to a theorem of Formanek and Lawrence, $K[S]$ satisfies the…
We introduce the notion of a combinatorial inverse system in non-commutative variables. We present two important examples, some conjectures and results. These conjectures and results were suggested and supported by computer investigations.
The converse of a tournament is obtained by reversing all arcs. If a tournament is isomorphic to its converse, it is called self--converse. Eplett provided a necessary and sufficient condition for a sequence of integers to be realisable as…
We prove that if two additive functions (from a certain class) take large values with roughly the same probability then they must be identical. This is a consequence of a structure theorem making clear the inter-relation between the…
A reciprocal recommendation problem is one where the goal of learning is not just to predict a user's preference towards a passive item (e.g., a book), but to recommend the targeted user on one side another user from the other side such…
Gregory McColm conjectured that positive elementary inductions are bounded in a class K of finite structures if every (FO + LFP) formula is equivalent to a first-order formula in K. Here (FO + LFP) is the extension of first-order logic with…
We prove completeness of preferential conditional logic with respect to convexity over finite sets of points in the Euclidean plane. A conditional is defined to be true in a finite set of points if all extreme points of the set interpreting…
The streams of research on adversarial examples and counterfactual explanations have largely been growing independently. This has led to several recent works trying to elucidate their similarities and differences. Most prominently, it has…
We extend answer set semantics to deal with inconsistent programs (containing classical negation), by finding a ``best'' answer set. Within the context of inconsistent programs, it is natural to have a partial order on rules, representing a…
We show that the well-partial orderedness of the finite downwards closed subsets of $\mathbb{N}^k$ ,ordered by inclusion, is equivalent to the well-foundedness of the ordinal $\omega^{\omega^\omega}$. This was conjectured to be the case by…
Sophisticated machine models are increasingly used for high-stakes decisions in everyday life. There is an urgent need to develop effective explanation techniques for such automated decisions. Rule-Based Explanations have been proposed for…
F. Wehrung has asked: Given a family $\mathcal{C}$ of subsets of a set $\Omega$, under what conditions will there exist a total ordering on $\Omega$ under which every member of $\mathcal{C}$ is convex? <p> Note that if $A$ and $B$ are…
We prove an extension of the well-known combinatorial-topological lemma of E. Sperner to the case of infinite-dimensional cubes. It is obtained as a corollary to an infinitary extension of the Lebesgue Covering Dimension Theorem.