This work aims to determine the general solution f : (u, v) for suitable conditions on the function Ο : where F will denote either R or C, and K is an abelian group. Using this result, we determine the solution f : (u, v) for all x, y, u, v β C without assuming any regularity condition. Here (C β ,
On functional equations arising from map enumerations
β Scribed by Yanpei Liu
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 911 KB
- Volume
- 123
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
This paper summarizes with a number of new results, a variety of functional equations which arise from the enumerations of planar maps. A few applications are also discussed.
We usually write X=X,, s(X) when it is not necessary to notify X, a and p.
Condition 2. The permutation f on X has to obey the following two axioms.
Axiom 1. ccf=b-lx.
Axiom 2. The group YJ generated by J = { c(, /3,2} is transitive on X.
Thus, we may write the map M = (X,,,(X), f). From Axiom 1, CI, /3 are asymmetric, i.e. (Xm,,(X),y)#(X,,.(X),y). Generally, for a map M=(X&X),y), it is not necessary that (X,,,(X),,$) is also a map because for fi, it is not guaranteed to have
π SIMILAR VOLUMES
Utility of gains losses can be measured in four distinct ways: riskless vs risky Ε½ . choices and gains losses alone vs the gain-loss trade-off. Conditions forcing these measures all to be the same lead to functional equations, three of which are y1 w x y 1 w x
We consider in this paper the following functional equation which occurs in the theory of queues : + (1a)(l -F ( 4 ) 1 dG(t).