A characterization of plurality-like rules based on non-manipulability, restricted efficiency, and anonymity

A society needs to decide which issues (laws, public projects, public facilities, etc.) in an agenda to accept. The decision can be any subset of the agenda but must reflect the preferences of its members, which are assumed to be “separable weak orderings”. We characterize a family of plurality-like rules based on strategy-proofness, restricted efficiency, anonymity, and two weak axioms pertaining to the variable agenda feature of our model, called dummy independence and division indifference. We also characterize a wide spectrum of rules dropping anonymity or restricted efficiency.I am indebted to Dolors Berga, William Thomson, an associate editor, and two anonymous referees for their detailed comments and helpful suggestions. All remaining errors are mine.     

On an identity of Ramanujan over finitely generated domains

Summary We show that a well-known identity of Ramanujan admits only a bounded number of solutions over general finitely generated domains. The bound is explicit and uniform in the sense that it depends only on the dimensions of the domains involved. Our method is constructive, and opens up a possibility to determine the solutions in concrete instances. In some special cases all solutions are determined. Our results can also be considered as a continuation of some theorems of Z. Daróczy and G. Hajdu, obtained over Z. We note that in case of Hosszú's equation, similar results were obtained by several authors.     

The distribution of prime divisors in finitely generated domains

In this paper we show that each divisor class of a finitely generated k-algebra R (k a field) contains a prime divisor if k is Hilbertian or if dim R≥ 2. On the way we also obtain partial results for domains finitely generated over an one-dimensional noetherian domain. Received: 27 June 1998     

On the Ulam stability of mixed type mappings on restricted domains

In 1941 D.H. Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 D.G. Bourgin was the second author to treat the Ulam problem for additive mappings. In 1982-1998 we established the Hyers-Ulam stability for the Ulam problem of linear and nonlinear mappings. In 1983 F. Skof was the first author to solve the Ulam problem for additive mappings on a restricted domain. In 1998 S.M. Jung investigated the Hyers-Ulam stability of additive and quadratic mappings on restricted domains. In this paper we improve the bounds and thus the results obtained by S.M. Jung, in 1998. Besides we establish the Ulam stability of mixed type mappings on restricted domains. Finally, we apply our recent results to the asymptotic behavior of functional equations of different types.     

Estimation of the L p -norms of stress functions for finitely connected plane domains

Let u(x, G) be the classical stress function of a finitely connected plane domain G. The isoperimetric properties of the L ^p -norms of u(x, G) are studied. Payne’s inequality for simply connected domains is generalized to finitely connected domains. It is proved that the L ^p -norms of the functions u(x, G) and u ^?1 (x, G) strictly decrease with respect to the parameter p, and a sharp bound for the rate of decrease of the L ^p -norms of these functions in terms of the corresponding L ^p -norms of the stress function for an annulus is obtained. A new integral inequality for the L ^p -norms of u(x, G), which is an analog of the inequality obtained by F. G. Avkhadiev and the author for the L ^p -norm of conformal radii, is proved.     

On the Ulam stability of Jensen and Jensen type mappings on restricted domains

In 1941 Hyers solved the well-known Ulam stability problem for linear mappings. In 1951 Bourgin was the second author to treat this problem for additive mappings. In 1982-1998 Rassias established the Hyers-Ulam stability of linear and nonlinear mappings. In 1983 Skof was the first author to solve the same problem on a restricted domain. In 1998 Jung investigated the Hyers-Ulam stability of more general mappings on restricted domains. In this paper we introduce additive mappings of two forms: of “Jensen” and “Jensen type,” and achieve the Ulam stability of these mappings on restricted domains. Finally, we apply our results to the asymptotic behavior of the functional equations of these types.     

Some remarks and problems on complex homogeneous domains

We discuss some problems on rigidity of canonical realizations of complex homogeneous domains at ℂⁿ Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

Minimal circumscribed Hermitian ellipsoid of Hartogs domains and an application to an extremal problem

In this paper we construct circumscribed Hermitian ellipsoids of Hartogs domains of least volume and as an application, we obtain the Carath′eodory extremal mappings between the Hartogs domains and the unit ball, and also give an explicit formula for calculating the extremal values.     

A restricted computation model on Scott domains and its partial primitive recursive functionals

The paper builds on both a simply typed term system and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion of partial primitive recursive functional on Scott domains supporting a suitable concept of parallelism. Computability on Scott domains seems to entail that Kleene's schema of higher type simultaneous course-of-values recursion (scvr) is not reducible to partial primitive recursion. So extensions and PTWP are studied that are closed under scvr. The twist are certain type 1 G?del recursors for simultaneous partial primitive recursion. Formally, denotes a function , however, is modelled such that is finite, or in other words, a partial sequence. As for PTWP, the concept of type writable variables is introduced, providing the possibility of creating and manipulating partial sequences. It is shown that the PTWP-computable functionals coincide with those definable in plus a constant for sequential minimisation. In particular, the functionals definable in denoted can be characterised by a subclass of PTWP-computable functionals denoted . Moreover, hierarchies of strictly increasing classes in the style of Heinermann and complexity classes are introduced such that . These results extend those for and PTWP [Nig94]. Finally, scvr is employed to define for each type the enumeration functional of all finite elements of . Received January 30, 1996     

Hyperstability of a logarithmic-type functional equation on restricted domains

Let $X$ be a real normed vector space and $f:(0,\infty )\to X$. In this paper, we prove the hyperstability of the logarithmic functional equation

$f\left(x^y\right)?yf\left(x\right)=0$

on $\Gamma$ of Lebesgue measure zero. More precisely, we prove that if $f:(0,\infty )\to X$ satisfies

$6f\left(x^y\right)?yf\left(x\right)6\le ?(x,y)$

for all $(x,y)\in {\Gamma }^{+}?\{(x,y):y>\alpha \left(x\right)\}[\mathrm{resp.}{\Gamma }^{?}?\{(x,y):0<y<\alpha \left(x\right)\}]$ of Lebesgue measure zero, where $\alpha :(0,\infty )\to (0,\infty )$ is an arbitrary given function and $?:(0,\infty )\times (0,\infty )\to [0,\infty )$ satisfies the condition $?(x,y)∕y\to 0$ as $y\to \infty$ [resp. $y\to 0$], then $f$ satisfies the functional equation $f\left(x^y\right)=yf\left(x\right)$ for all $x>0$ and$y>0$.     

Superstability of the generalized orthogonality equation on restricted domains

Chmielinski has proved in the paper [4] the superstability of the generalized orthogonality equation |〈f(x), f(y)〉| = |〈x,y〉|. In this paper, we will extend the result of Chmielinski by proving a theorem: LetD _n be a suitable subset of ℝⁿ. If a function f:D _n → ℝⁿ satisfies the inequality ∥〈f(x), f(y)〉| |〈x,y〉∥ ≤ φ(x,y) for an appropriate control function φ(x, y) and for allx, y ∈ D _n, thenf satisfies the generalized orthogonality equation for anyx, y ∈ D _n.     

Citizen coproduction and efficient public good provision: Theory and evidence from local public libraries

In both public administration and economics, efficiency is brought forward as an important criterion for evaluating administrative actions. Clearly, its value as an assessment principle depends on our ability to adequately measure efficiency. This article argues that citizen’s coproduction in public services requires a careful reassessment of how we approach the measurement of productive efficiency in public service delivery. Theoretically, we illustrate that using observable outcomes (e.g., library circulation, school results, health outcomes, fires extinguished, and crimes solved) as output indicators is inappropriate and leads to biased estimates of public service providers’ productive efficiency. This bias arises because citizens co-determine final outputs, leaving them at least partly beyond the service providers’ control. Empirically, we find supportive evidence of both the existence and importance of such ‘demand-induced’ bias.     

Integrability of superharmonic functions, uniform domains, and Hölder domains

Let denote the space of all positive superharmonic functions on a domain . Lindqvist showed that is a bounded subset of . Using this, we give a characterization of finitely connected -dimensional uniform domains and remarks on Hölder domains.

     

Explicit formula of holomorphic automorphism group on complex homogeneous bounded domains

We known that the maximal connected holomorphic automorphism group Aut (D)(0) is a semi-direct product of the triangle group T(D) and the maximal connected isotropic subgroup Iso(D)(0) of a fixed point in the complex homogeneous bounded domain D and any complex homogeneous bounded domain is holomorphic isomorphic to a normal Siegel domain D(VN,F). In this paper, we give the explicit formula of any holomorphic automorphism in T(D(VN, F)) and Iso(D(VN,F))(0), where G(0) is the unit connected component of the Lie group G.     

Characterizations of Stable Functions on L—domains

§１．　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｅｐｕｒｐｏｓｅｏｆＤｏｍａｉｎｓｔｈｅｏｒｙ（ｉｎｔｒｏｄｕｃｅｄｂｙＤ．Ｓｃｏｔｔ）ｉｓｔｏｍｏｄｅｌｔｈｅｄｅｎｏｔａｔｉｏｎａｌｓｅ－ｍａｎｔｉｃｓｏｆｃｏｍｐｕｔｅｒｐｒｏｇｒａｍｍｏｎｇｌａｎｇｕａｇｅｓ［１］．Ａｎｉｍｐｏｒｔａｎｔｆｒａｍｅ－ｗｏｒｋｆｏｒｔｈｅｄｅｎｏｔａ－ｔｉｏｎａｌｓｅｍａｎｔｉｃｓｏｆｐｒｏｇｒａｍｍｉｎｇｌａｎｇｕａｇｅｓｉｓｔｈｅｃａｔｅｇｏｒｙｏｆＬ－ｄｏｍａｉｎｓｗｉｔｈｓｔａｂｌｅｆｕｎｃｔｉｏｎｓ．Ｌ－ｄｏｍ…     

Decomposition and removability properties of John domains

In this paper we characterize John domains in terms of John domain decomposition property. In addition, we also show that a domain D in ℔ ⁿ is a John domain if and only if D\P is a John domain, where P is a subset of D containing finitely many points of D. The best possibility and an application of the second result are also discussed.     

Indices of Toeplitz tuples on pseudoregular domains

This paper proves an index theorem of Toeplitz tuples on pseudoregular domains in Cn. Geometrically, the index of Toeplitz tuple TΦn is (-1)n time wrapping number of Φn around the origin. As one of the applications of the index theorem, we completely characterize the automorphism groups of Toeplitz algebras on Poincaré domain. As another application, it is shown that C*(Ω)C*(Bn) for every Poincare domain Ω in Cn(n≠2). It is also noticed that C*(Ω)C*(B2) if and only if the Poincaré conjecture is true for Ω.     

Some remarks and problems on complex homogeneous domains Dedicated to Professor Sheng GONG on the occasion of his 75th birthday

We discuss some problems on rigidity of canonical realizations of complex homogeneous domains at Cn     

A domain decomposition method on nested domains and nonmatching grids

A one directionally coupled problem on two nested domains is analyzed. The global domain and the subdomain are discretized by two triangulations that do not match on the subdomain. The connection between the two grids is established by using a stable projection operator onto the interface. An a priori error analysis is carried out and several numerical examples are given. The method is ideally suited for the case of a moving subdomain. © 2004 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 20: 374–387, 2004.