Orthogonal Fractional Factorial Plans

1980 ◽  
Vol 29 (3-4) ◽  
pp. 143-160 ◽  
Author(s):  
Rahul Mukerjee

This paper shows that the criterion of proportional frequency for (unblocked) orthogonal fractional factorial plans, as suggested by some previous authors, is not generally true. On the other hand, the criterion of equal frequency has been established as a necessary and sufficient condition in the general case. Some other properties of orthogonal fractional factorial plans have been investigated. A necessary and sufficient condition for designs involving two or more blocks has also been presented. A broad class of non-existence results follow.

2015 ◽  
Vol 100 (1) ◽  
pp. 65-77 ◽  
Author(s):  
JERZY DYDAK

This paper is devoted to dualization of paracompactness to the coarse category via the concept of $R$-disjointness. Property A of Yu can be seen as a coarse variant of amenability via partitions of unity and leads to a dualization of paracompactness via partitions of unity. On the other hand, finite decomposition complexity of Guentner, Tessera, and Yu and straight finite decomposition complexity of Dranishnikov and Zarichnyi employ $R$-disjointness as the main concept. We generalize both concepts to that of countable asymptotic dimension and our main result shows that it is a subclass of spaces with Property A. In addition, it gives a necessary and sufficient condition for spaces of countable asymptotic dimension to be of finite asymptotic dimension.


2016 ◽  
Vol 27 (03) ◽  
pp. 327-342
Author(s):  
Yoshiyuki Kunimochi

This paper deals with insertability and mainly extractablity of codes. A code C is called insertable (or extractable) if the free submonoid C* generated by C satisfies if z, [Formula: see text] implies [Formula: see text] (or z, [Formula: see text] implies [Formula: see text]). We show that a finite insertable code is a full uniform code. On the other hand there are many finite extractable codes which are not full uniform codes. We cannot still characterize the structures of infinite extractable codes. Here we give some results on the class of infix extractable codes. First, we consider a necessary and sufficient condition whether a given infix code C is extractable or not by using the syntactic graph of the code. Secondly, we investigate the extractability for the families of other related bifix codes. We newly define the bifix codes, called e(m)-codes and [Formula: see text]-codes, and refer to the extractability of them.


2014 ◽  
Vol 97 (3) ◽  
pp. 383-390 ◽  
Author(s):  
YAXIANG LI ◽  
SAMINATHAN PONNUSAMY ◽  
MATTI VUORINEN

AbstractSuppose that $\def \xmlpi #1{}\def \mathsfbi #1{\boldsymbol {\mathsf {#1}}}\let \le =\leqslant \let \leq =\leqslant \let \ge =\geqslant \let \geq =\geqslant \def \Pr {\mathit {Pr}}\def \Fr {\mathit {Fr}}\def \Rey {\mathit {Re}}E$ and $E'$ denote real Banach spaces with dimension at least 2 and that $D\subset E$ and $D'\subset E'$ are domains. Let $\varphi :[0,\infty )\to [0,\infty )$ be a homeomorphism with $\varphi (t)\geq t$. We say that a homeomorphism $f: D\to D'$ is $\varphi $-FQC if for every subdomain $D_1 \subset D$, we have $\varphi ^{-1} (k_D(x,y))\leq k_{D'} (f(x),f(y))\leq \varphi (k_D(x,y))$ holds for all $x,y\in D_1$. In this paper, we establish, in terms of the $j_D$ metric, a necessary and sufficient condition for a homeomorphism $f: E \to E'$ to be FQC. Moreover, we give, in terms of the $j_D$ metric, a sufficient condition for a homeomorphism $f: D\to D'$ to be FQC. On the other hand, we show that this condition is not necessary.


Pythagoras ◽  
2010 ◽  
Vol 0 (71) ◽  
Author(s):  
Shunmugam Pillay ◽  
Poobhalan Pillay

The centre of mass G of a triangle has the property that the rays to the vertices from G sweep out triangles having equal areas. We show that such points, termed equipartitioning points in this paper, need not exist in other polygons. A necessary and sufficient condition for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the other. The general theorem, namely, necessary and sufficient conditions for equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this happens, they are in general, distinct from the centre of mass. In parallelograms, and only in them, do the two points coincide.


2016 ◽  
Vol 7 (2) ◽  
Author(s):  
Satish K. Jain

AbstractThere are two ways that the negligence rule is interpreted. Under one interpretation a negligent injurer is liable for the entire harm to the victim; and under the other interpretation a negligent injurer is liable only for that part of the harm which can be ascribed to his negligence. Both these versions are efficient. However, if there is uncertainty regarding whether the court will be employing the full liability version or the incremental liability version for determining the liability of a negligent injurer, notwithstanding the fact that both the versions are efficient, inefficiency is possible. It is shown in the paper that a necessary and sufficient condition for efficiency in all cases is that the subjective probability with which the injurer expects the standard version to be employed must be greater than or equal to the subjective probability with which the victim expects the standard version to be employed. For the subset of applications without complementarities in the cares of the two parties and which are such that the total social costs are minimized at a unique care-configuration, it is shown that efficiency obtains regardless of the subjective probabilities with which the parties expect the two versions. One very important conclusion that emerges from the analysis of this paper is that when courts employ more than one liability rule, even if all the employed rules are efficient, the efficiency of all outcomes cannot be taken for granted merely on the ground of the efficiency of the employed rules.


2017 ◽  
Vol 101 (551) ◽  
pp. 214-226 ◽  
Author(s):  
Martin Josefsson

The general class of quadrilaterals where one diagonal is bisected by the other diagonal has appeared very rarely in the geometrical literature, but they have been named several times in connection with quadrilateral classifications. Günter Graumann strangely gave these objects two different names in [1, pp. 192, 194]: sloping-kite and sliding-kite. A. Ramachandran called them slant kites in [2, p. 54] and Michael de Villiers called them bisecting quadrilaterals in [3, pp. 19, 206]. The latter is a pretty good name, although a bit confusing: what exactly is bisected?We have found no papers and only two books where any theorems on such quadrilaterals are studied. In each of the books, one necessary and sufficient condition for such quadrilaterals is proved (see Theorem 1 and 2 in the next section). The purpose of this paper is to investigate basic properties ofconvexbisecting quadrilaterals, but we have chosen to give them a slightly different name. Let us first remind the reader that a quadrilateral whose diagonals have equal lengths is called an equidiagonal quadrilateral and one whose diagonals are perpendicular is called an orthodiagonal quadrilateral.


1. Series which converge expect at a set of content zero, or, using the expression very commonly adopted, series which converge usually, posses many of the properties which appertain to series which converge every-where. It becomes, therefore, of importance to device circumstances under which we can assert the consequence that a series converge in this manner. The subject has recently received considerable attention. so far as Fourier Series are concerned no result of even an approximately final character has been obtained. It may be supposed, indeed, that the result* of Jerosch and Weyl were at first so regarded, but, if we examine them closely in the light of the Riesz-Fischer theorems, which was known previously to the result of these authors, it becomes evident that they are merely equivalent to the statement that the Fourier Series of a function, whose square is summable, is changed into one which converges usually, if the typical coefficient a n and b n are divided by the sixth root of the integer n denoting their place in the series. Now it is difficult to believe that the question of the usual convergences of a Fourier Series can depended on the degree of the summability of the function with which it is associated and it is still more difficult to see how precisely the sixth root of n can have anything to do it. On the other hand Weyl's method, which itself marks an advance on that of Jerosch, does not obviously lend itself to any suitable modification which would secure a greater degree of generality in the result. The mistake is frequently made of confusing theoretical interest with pracitcal importance in the matter of a necessary and sufficient test. Tests which are only sufficient, but not necessary, are often much more convenient. Still more frequent it is convenient to work from first principles, and not to use any test at all. Instead of employing Weyl's necessary and sufficient condition that a series should converge usually, I have attacked the problem directly. The principles I have employed do not differ essentially from those already exposed in previous communication to this Society, but the generality and interest of the result obtained in the matter in hand seem to justify a further communication.


2021 ◽  
Author(s):  
Zhaoyang Cheng ◽  
Guanpu Chen ◽  
Yiguang Hong

Abstract Zero-determinant (ZD) strategies have attracted wide attention in Iterated Prisoner’s Dilemma (IPD) games, since the player equipped with ZD strategies can unilaterally enforce the two players’ expected utilities subjected to a linear relation. On the other hand, uncertainties, which may be caused by misperception, occur in IPD inevitably in practical circumstances. To better understand the situation, we consider the influence of misperception on ZD strategies in IPD, where the two players, player X and player Y , have different cognitions, but player X detects the misperception and it is believed to make ZD strategies by player Y. We provide a necessary and sufficient condition for the ZD strategies in IPD with misperception, where there is also a linear relationship between players’ utilities in player X’s cognition. Then we explore bounds of players’ expected utility deviation from a linear relationship in player X’s cognition with also improving its own utility.


1995 ◽  
Vol 2 (20) ◽  
Author(s):  
Anders Kock

The lift monad is the construction which to a poset freely adjoins a bottom<br />element to it, or equivalently (from the classical viewpoint), the construction which freely adjoins suprema for subsets with at most one element. In constructive mathematics (i.e. inside a topos), these two constructions are no longer equivalent, since the equivalence is based on the boolean reasoning that a set with at most one element either is a singleton {x}, or is empty.<br />Likewise based on boolean reasoning is the proof of two important properties of the lift monad T :<br />1) If a poset C has filtered suprema, then so does TC.<br />2) Every poset with a bottom element ? is "free", i.e. comes about by<br />applying T to some poset (namely the original poset less the bottom).<br />Both these properties fail to hold constructively, if the lift monad is interpreted<br />as "adding a bottom"; see Remark below. If, on the other hand,<br />we interpret the lift monad as the one which freely provides supremum for<br />each subset with at most one element (which is what we shall do), then the first property holds; and we give a necessary and sufficient condition that the second does. Finally, we shall investigate the lift monad in the context of (constructive) locale theory. I would like to thank Bart Jacobs for guiding me to the literature on Z-systems; to Gonzalo Reyes for calling my attention to Barr's work on totally connected spaces; to Steve Vickers for some pertinent correspondence.<br />I would like to thank the Netherlands Science Organization (NWO) for supporting my visit to Utrecht, where a part of the present research was carried out, and for various travel support from BRICS.


2002 ◽  
Vol 31 (5) ◽  
pp. 271-282
Author(s):  
N. E. Livingston

The concept of a tracially AF (TAF)C*-algebra was introduced recently to aid in the classification of nuclearC*-algebrasHere, we construct and study a broad class of inductive-limitC*-algebras. We give a numerical condition which, when satisfied, ensures that the corresponding algebra in our construction has the TAF property. We further give a necessary and sufficient condition under which certain of theseC*-algebras are TAF.


Sign in / Sign up

Export Citation Format

Share Document