Related papers: A characterization of combinatorial demand
In this note, we present two new identities for derangements. As a corollary, we have a combinatorial proof of the irreducibility of the standard representation of symmetric groups.
There are given characterizations of the exponential distribution by the properties of the independence of linear forms with random coefficients. Related results based on the constancy of regression of one statistic on a linear form are…
We study existence, uniqueness and computability of solutions for a class of discrete time recursive utilities models. By combining two streams of the recent literature on recursive preferences---one that analyzes principal eigenvalues of…
In this paper we study the existence of continuous solutions and their constructions for a second order iterative functional equation, which involves iterate of the unknown function and a nonlinear term. Imposing Lipschitz conditions to…
We consider the challenge of preference elicitation in systems that help users discover the most desirable item(s) within a given database. Past work on preference elicitation focused on structured models that provide a factored…
This note presents a simple proof of the characteristic function of Student's $t$-distribution. The method of proof, which involves finding a differential equation satisfied by the characteristic function, is applicable to many other…
A principal contracts with an agent who sequentially searches over projects to generate a prize. The principal initially knows only one of the agent's available projects and evaluates a contract by its worst-case performance. We…
We characterize the regularity of an FI-module using the derivative functors.
In this paper we show that bisymmetry, which is an algebraic property, has a regularity improving feature. More precisely, we prove that every bisymmetric, partially strictly monotonic, reflexive and symmetric function $F:I^2\to I$ is…
We lay the combinatorial foundations for [ShSt:340] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.
We prove some new properties of fidelity (transition probability) and concurrence, the latter defined by straightforward extension of Wootters notation. Choose a conjugation and consider the dependence of fidelity or of concurrence on…
In this paper we prove a number of results concerning uniqueness of a meromorphic function as well as its derivative sharing one or two sets. In particular, we deal with the specific question raised in [18], [19], [20] and ultimately…
This paper studies two-sided many-to-one matching in which firms have complementary preferences. We show that stable matchings exist under a balancedness condition that rules out a specific type of odd-length cycles formed by firms'…
Motivated by the need to relate the biparameter persistence module induced by a pair of scalar functions with the monoparameter persistence modules induced by each function separately, we introduce a construction that defines a kind of…
We extend the hyperplane arrangement framework for neural network expressivity from the braid to discriminantal arrangements. Compatible piecewise linear functions are characterized by circuit relations and admit a matroidal description via…
We prove that multiple-recurrence and polynomial-recurrence of invertible infinite measure preserving transformations are both properties which pass to extensions.
We study a method for calculating the utility function from a candidate of a demand function that is not differentiable, but is locally Lipschitz. Using this method, we obtain two new necessary and sufficient conditions for a candidate of a…
The paper is devoted to the study of the twice epi-differentiablity of extended-real-valued functions, with an emphasis on functions satisfying a certain composite representation. This will be conducted under the parabolic regularity, a…
In this paper some classes of local polynomial functions on abelian groups are characterized by the properties of their variety. For this characterization we introduce a numerical quantity depending on the variety of the local polynomial…
In classical works, Hurewicz and Menger introduced two diagonalization properties for sequences of open covers. Hurewicz found a combinatorial characterization of these notions in terms of continuous images. Recently, Scheepers has shown…