Related papers: A characterization of combinatorial demand
There are given conditions for represention of a function of many arguments as the difference of convex functions.
Combinatorial Game Theory is a branch of mathematics and theoretical computer science that studies sequential 2-player games with perfect information. Normal play is the convention where a player who cannot move loses. Here, we generalize…
A matching queue is described via a graph $G$ together with a matching policy. Specifically, to each node in the graph there is a corresponding arrival process of items which can either be queued, or matched with queued items in neighboring…
A mixture preorder is a preorder on a mixture space (such as a convex set) that is compatible with the mixing operation. In decision theoretic terms, it satisfies the central expected utility axiom of strong independence. We consider when a…
This paper characterizes lexicographic preferences over alternatives that are identified by a finite number of attributes. Our characterization is based on two key concepts: a weaker notion of continuity called 'mild continuity' (strict…
Some recent papers formulated sufficient conditions for the decomposition of matrix variances. A statement was that if we have one or two observables, then the decomposition is possible. In this paper we consider an arbitrary finite set of…
A survey of properties of a sequence of coefficients appearing in the evaluation of a quartic definite integral is presented. These properties are of analytical, combinatorial and number-theoretical nature.
We use fast-growing finite and infinite sequences of natural numbers and more complicated constructs to define models of hypercomputation and interpret non-arithmetic predicates, with the strongest extensions reaching full second order…
In this paper, we extend the recently introduced concept of partially dual ribbon graphs to graphs. We then go on to characterize partial duality of graphs in terms of bijections between edge sets of corresponding graphs. This result…
We consider contests with a large set (continuum) of participants and axiomatize contest success functions that arise when performance is composed of both effort and a random element, and when winners are those whose performance exceeds a…
We extend the classical Lebesgue and Fubini differentiation theorems to functions of several variables, using the notions of joint derivative and joint monotonicity. Our first main result shows that for a function $f$ of bounded variation,…
Many modern numerical methods in computational science and engineering rely on derivatives of mathematical models for the phenomena under investigation. The computation of these derivatives often represents the bottleneck in terms of…
Given two linear relations $A$ and $B$ we characterize the existence of a linear relation (operator) $C$ such that $A\subseteq BC$, respectively $A\subseteq CB.$ These factorizations extend and improve well-known results by R.G. Douglas and…
We characterize all coexistent pairs of qubit effects. This gives an exhaustive description of all pairs of events allowed, in principle, to occur in a single qubit measurement. The characterization consists of three disjoint conditions…
This paper explores a new class of incomplete preferences -- termed ``connected preferences'' -- in which maximal domains of comparability are topologically connected. We provide necessary and sufficient conditions for continuous…
In this short note we establish some properties of all those motivic measures which can be exponentiated. As a first application, we show that the rationality of Kapranov's zeta function is stable under products. As a second application, we…
We determine which properties of 2-layer drawings characterise bipartite graphs of bounded pathwidth.
We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…
The literature on judgment aggregation is moving from studying impossibility results regarding aggregation rules towards studying specific judgment aggregation rules. Here we give a structured list of most rules that have been proposed and…
We isolate two combinatorial properties, each expressible by a $\Pi_2$-sentence over the structure $(H(\omega_3),\in,\omega_1,\omega_2,\text{NS}_{\omega_2})$, such that each property is consistent with CH, and their conjunction together…