Related papers: Quasi-Leontief utility functions on partially orde…
Subject to suitable boundary conditions being imposed, sharp inequalities are obtained on integrals over a region $\Omega$ of certain special quadratic functions $f(\bf{E})$ where $\bf{E}(\bf{x})$ derives from a potential $\bf{U}(\bf{x})$.…
We consider a family of integer linear programs in which the coefficients of the constraints and objective function are polynomials of an integer parameter $t.$ For $\ell$ in $\mathbb{Z}_+,$ we define $f_\ell(t)$ to be the…
We develop a general approach to estimating the derivative of a function-valued parameter $\theta_o(u)$ that is identified for every value of $u$ as the solution to a moment condition. This setup in particular covers many interesting models…
In this article, we propose a quasi-Newton method for unconstrained set optimization problems to find its weakly minimal solutions with respect to lower set-less ordering. The set-valued objective mapping under consideration is given by a…
The article is devoted to holomorphic and meromorphic functions of quaternion and octonion variables. New classes of quasi-conformal and quasi-meromorphic mappings are defined and investigated. Properties of such functions such as their…
The concept of proximate order is widely used in the theories of entire, meromorphic, subharmonic and plurisubharmonic functions. We give a general interpretation of this concept as a proximate growth function relative to a model growth…
One partially ordered set, $Q$, is a Tukey quotient of another, $P$, denoted $P \geq_T Q$, if there is a map $\phi : P \to Q$ carrying cofinal sets of $P$ to cofinal sets of $Q$. Let $X$ be a space and denote by $\mathcal{K}(X)$ the set of…
We give a new completion for the quasi-uniform spaces. We call the whole procedure {\it $\tau$-completion} and the new space {\it $\tau$-complement of the given}. The basic result is that every $T_{_0}$ quasi-uniform space has a…
In the present article, we define a notion of good height functions on quasi-projective varieties $V$ defined over number fields and prove an equidistribution theorem of small points for such height functions. Those good height functions…
For about twenty five years it was a kind of folk theorem that complex vector-fields defined on $\Omega\times \mathbb R_t$ (with $\Omega$ open set in $\mathbb R^n$) by $$ L_j = \frac{\partial}{\partial t_j} + i \frac {\partial…
This article addresses structure-preserving smooth approximation of semiconcave functions. semiconcave functions are of particular interest because they naturally arise in a variety of variational problems, including {optimal feedback…
A suitable notion of hypercontractivity for a nonlinear semigroup $\{T_t\}$ is shown to imply Gagliardo--Nirenberg inequalities for its generator $H$, provided a subhomogeneity property holds for the energy functional $(u,Hu)$. We use this…
We study the allocation of divisible goods to competing agents via a market mechanism, focusing on agents with Leontief utilities. The majority of the economics and mechanism design literature has focused on \emph{linear} prices, meaning…
In the study of locally convex quasi *-algebras an important role is played by representable linear functionals; i.e., functionals which allow a GNS-construction. This paper is mainly devoted to the study of the continuity of representable…
We lay down the foundations of a theory of parametrised functor calculus, generalising parts of the functor calculus of Goodwillie. We introduce the notion of excisable posets and develop a theory of excisive approximations in this context.…
We define analogues of Boolean operations on not necessarily complete partial orders, they often have as results sets of elements rather than single elements. It proves useful to add to such sets X if they are intended to be sup(X) or…
A new result in convex analysis on the calculation of proximity operators in certain scaled norms is derived. We describe efficient implementations of the proximity calculation for a useful class of functions; the implementations exploit…
In a previous paper, the sup-interpretation method was proposed as a new tool to control memory resources of first order functional programs with pattern matching by static analysis. Basically, a sup-interpretation provides an upper bound…
It is well-known that the winning region of a parity game with $n$ nodes and $k$ priorities can be computed as a $k$-nested fixpoint of a suitable function; straightforward computation of this nested fixpoint requires…
Semidefinite programming is based on optimization of linear functionals over convex sets defined by linear matrix inequalities, namely, inequalities of the form $$L_A(X)=I-A_1X_1-\dots-A_g X_g\succeq0.$$ Here the $X_j$ are real numbers and…