THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS
|
|
- Leslie Webster
- 5 years ago
- Views:
Transcription
1 SOOCHOW JOURNAL OF MATHEMATICS Volume 28, No. 4, pp , October 2002 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS BY HUA MAO 1,2 AND SANYANG LIU 2 Abstract. This paper first shows how the operations of direct sum, union and intersection may be defined for poset matroids. This paper then discusses the relation between the partition of a poset and a partition of the associated poset matroids. 1. Introduction M. Barnabei etc. develop in [1, 3] a more general theory of matroids by replacing the underlying set of a matroid by a poset. However, not all properties of matroids can be translated in a simple way into this new theory. Some significant examples of this fact are given in [1, 3]. In this paper, our definitions of rank, direct sum, union, intersection and partition in poset matroid theory allow the extension to this new setting of every notion of matroid theory. Our main results are the constructions about direct sum, union and intersection of poset matroids which devoted in Section 3 and Section 4; in addition, all results here are also the extension of the relevant results of matroid theory without losing some of the valuable properties of matroid theory. For the problem considered in this paper, at least to our knowledge, the concepts above and their properties have not been discussed previously. 2. Preliminaries The following definition is taken from [4]. Received February 20, 2001; revised June 27, AMS Subject Classification. 05B35. Key words. direct sum, union, intersection, partition. 347
2 348 HUA MAO AND SANYANG LIU Definition 1. (1) A poset is a set in which a binary relation x y is defined, which satisfies for all x, y, z the following conditions: (p1) For all x, x x; (p2) if x y and y x, then x = y; (p3) if x y and y z, then x z. (2) a and b are incomparable in a poset P, in notation, a//b. (3) Let P = (P, ) be a poset and T P. T := (T, T ) is called a subposet of P, if the binary relation x T y is defined as follows: x T y iff x y, for all x, y T. Lemma 1. Let P j = (P j, j ) (j = 1, 2) be two posets with P 1 P 2 =. Simply say that P 1 and P 2 are disjoint, in notation, P 1 P 2 =. Then P := (P 1 P 2, ) is a poset in which the binary relation is defined as follows: x y iff x 1 y or x 2 y; x//y iff none of x 1 y and x 2 y are true. Proof. We notice that if x y, then x, y P 1 or x, y P 2. Thus P satisfies (p1), (p2) and (p3) trivially. We denote the poset P in Lemma 1 by P 1 P 2. We next summarize the known facts of poset matroid theory that are needed in the present work. The Definition 2 and Lemma 2, 3, 4 and 5 come from [1, 3]. Definition 2. (1) A filter of a poset P is any subset A of P such that for every x, y P, if y x and y A, then x A. (2) A poset matroid on P is a family B of filters of P, called bases, satisfying the following axioms: (b.0) B ; (b.1) for every B 1, B 2 B : B 1 B 2 ; (b.2) for every B 1, B 2 B and for every pair of filters X, Y of P, such that X B 1, B 2 Y, X Y, there exists B B such that X B Y. (3) An independent set of a poset matroid on P is a filter I of P such that there exists a basis B B such that I B. (4) A spanning set of B on P to be a filter S of P, such that there exists a basis B such that B S. (5) Let I be the set of independent sets of B. The elements of the set of Inc(P)-I are called dependent sets. (6) A minimal dependent set of B is called a circuit. Lemma 2. Let B be a poset matroid on P. Then for every B 1, B 2 B, we have B 1 = B 2. Lemma 3. Let A, B Inc(P), where P is a poset and Inc(P) is the collection of all filters of P. Then A B, A B Inc(P).
3 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS 349 Lemma 4. (1) Let B be a poset matroid on the poset P = (P, ). Then the family B := {P B; B B} is a poset matroid on the dual poset P = (P, ). (2) Spanning sets of B are independent sets of B, and conversely. Lemma 5. The family I of all independent sets of a poset matroid B on the poset P satisfies the following properties: (i.0) I ; (i.1) if X, Y are filters of P such that Y I and X Y, then X I; (i.2) for X, Y I with X < Y, there exists y Max(Y X) such that X y I. Conversely, let I be a family of filters of P satisfying properties (i.0), (i.1), (i.2); then the family B := {I I; I is a maximal element of I} is a poset matroid. Before proceeding, we give the concepts of rank associated with a poset matroid and the partition of a poset. Definition 3. Let B be a nonempty, incomparable family of filters of a poset P. The rank ρ associated with B is the nonnegative integer valued function on Inc(P) defined as follows: for every X Inc(P), ρ(x) := max{ Y ; Y Inc(P), Y X and Y B for some B B}. Definition 4. Let {P 1,..., P m } be a collection of disjoint, nonempty subposet of the poset P such that P = P 1 P m. Then {P 1,..., P m } is called a partition of P. The following Lemma concludes the section. Lemma 6. Let P j = (P j, j ) (j = 1, 2) be two disjoint posets. Then X Inc(P 1 P 2 ) iff there exist X j Inc(P j ) (j = 1, 2) such that X = X 1 X 2. Further, X j = X P j (j = 1, 2) for X Inc(P 1 P 2 ). Proof. Since X Inc(P 1 P 2 ), it follows that X P 1 P 2. According to P 1 P 2 =, there exist X j P j (j = 1, 2) satisfying X = X 1 X 2. Certainly, X 1 X 2 =. Suppose x, y P 1 P 2 and x 1 y, x X 1. Because of x 1 y, it follows that x y. Because X Inc(P 1 P 2 ), there is y X. If y X 2, then by Lemma 1, x//y which is a contradiction. Thus y X 1 ; and so X 1 Inc(P 1 ). Analogously, X 2 Inc(P 2 ).
4 350 HUA MAO AND SANYANG LIU Conversely, for every X j Inc(P j ) (j = 1, 2), we have X 1 X 2 P 1 P 2 = and X 1 X 2 P 1 P 2. Let x, y P 1 P 2, with x y and x X 1 X 2. If x X 1, then by Lemma 1, y X 1 X 1 X 2. Likewise, if x X 2, then y X 2. Hence, X 1 X 2 Inc(P 1 P 2 ). Actually, we notice that for X Inc(P 1 P 2 ), X P j = X j, (j = 1, 2). 3. Direct Sum We deal with the constructions and properties of direct sum of poset matroids in this section. Theorem 1. Let B 1, B 2 be two poset matroids on disjoint posets P 1, P 2 respectively and B = {B 1 B 2 ; B j B j (j = 1, 2)}. Then B is a poset matroid on P 1 P 2. Proof. By Lemma 6, we have B 1 B 2 Inc(P 1 P 2 ) for every B j B j (j = 1, 2); and so B Inc(P 1 P 2 ). For B, (b.0) is trivially satisfied. If there are B 1 B 2, B 3 B 4 B for which B 2k 1 B 1, B 2 B 2, (k = 1, 2), such that B 1 B 2 B 3 B 4, then B 1 B 2 < B 3 B 4. Further, by Lemma 2, B 3 + B 4 = B 1 B 2 < B 3 B 4 = B 3 + B 4, i.e. 0 < 0, a contradiction. Namely, (b.1) is true for B. To prove (b.2), let X, Y Inc(P 1 P 2 ), X B 1 B 2, B 3 B 4 Y, X Y, where B 2k 1 B 1, B 2k B 2, (k = 1, 2). X, Y Inc(P 1 P 2 ) with Lemma 6 implies that there exist X k, Y k Inc(P k ) (k = 1, 2) satisfying X = X 1 X 2, Y = Y 1 Y 2. Considering P 1 P 2 =, we get X 1 B 1, B 3 Y 1, X 1 Y 1 ; X 2 B 2, B 4 Y 2, X 2 Y 2. Thus there are B 5 B 1, B 6 B 2 such that X 1 B 5 Y 1 and X 2 B 6 Y 2 ; moreover, X = X 1 X 2 B 5 B 6 Y 1 Y 2 = Y and B 5 B 6 B. Hence (b.2) is true for B. Consequently, B is a poset matroid on the poset P 1 P 2. We call B in Theorem 1 the direct sum of B 1 and B 2, in notation, B 1 + B 2. Some properties of B 1 + B 2 will be discussed next. Property 1. Let ρ 1 and ρ 2 be the ranks associated with B 1, B 2 respectively, where B 1, B 2 are two poset matroids on disjoint posets P 1 and P 2 respectively.
5 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS 351 Let ρ be the rank associated with B 1 + B 2. Then (1) ρ(a) = ρ 1 (A P 1 ) + ρ 2 (A P 2 ) for every A Inc(P 1 P 2 ). (2) I Inc(P 1 P 2 ) is an independent set of B 1 + B 2 iff I P 1 and I P 2 are independent sets of B 1 and B 2 respectively. (3) Let C, C 1, C 2 be the families of all circuits of B 1 + B 2, B 1, B 2 respectively. Then C C iff C C 1 or C C 2. Proof. (1) For every A Inc(P 1 P 2 ), by Definition 3 and Lemma 6, ρ(a) = max{ Y ; Y Inc(P 1 P 2 ), Y A, Y B 1 B 2 for some B 1 B 2 B 1 + B 2 } = max{ Y 1 Y 2 ; Y = Y 1 Y 2 Inc(P 1 P 2 ), Y 1 Y 2 A = A 1 A 2, Y 1 Y 2 B 1 B 2 for some B 1 B 1, B 2 B 2, where A j, Y j Inc(P j ) (j = 1, 2)} = max{ Y 1 + Y 2 ; Y j Inc(P j ), Y j A j, Y j B j for some B j B j, (j = 1, 2)} = 2 j=1 max{ Y j ; Y j Inc(P j ), Y j A j, Y j B j for some B j B j } = ρ 1 (A 1 ) + ρ 2 (A 2 ) = ρ 1 (A P 1 ) + ρ 2 (A P 2 ). (2) I Inc(P 1 P 2 ) is an independent set of B 1 +B 2 iff there exist B 1 B 2 B 1 +B 2 such that I B 1 B 2. On the other hand, I = (I P 1 ) (I P 2 ) B 1 B 2 iff I P j B j (j = 1, 2), i.e. I P j is an independent set of B j (j = 1, 2). (3) By (2), if C is a circuit of B 1 + B 2, then C P 1 and C P 2 are not independent sets of B 1 and B 2 respectively at the same time. There is no harm in supposing C P 1 to be a dependent set of B 1. Then there is a circuit C 1 of B 1 such that C 1 C P 1 ; further, C 1 (C P 2 ) is also a dependent set of B 1 + B 2 and C 1 C 1 (C P 2 ) C. On the other hand, C 1 = C 1 Inc(P 1 P 2 ) in virtue of Lemma 6. Therefore, by (2), C 1 is also a dependent set of B 1 + B 2. Thus C P 2 =. Namely, C = C 1 is a circuit of B 1 and only a circuit of B 1, i.e. C C 1. By Lemma 6 and C 1 C 2 P 1 P 2 = with (2), it is easy to obtain the converse. 4. Union and Intersection In this section, we examine the union and intersection of poset matroids. These lead to some new poset matroids. Another purpose is in the partition of a poset and its relation with union of poset matroids.
6 352 HUA MAO AND SANYANG LIU Theorem 2. Let B 1 and B 2 be two poset matroids on the poset P satisfying B 1 B 2 = for any B 1 B 1, B 2 B 2. Then B := {B 1 B 2 ; B j B j (j = 1, 2)} is a poset matroid on P. Proof. (b.0) is trivially satisfied. By Lemma 2 and Lemma 3, (b.1) is satisfied as well. To show B is a poset matroid, we have only to prove that B satisfies (b.2). For every B 1 B 2, B 3 B 4 B in which B 2k 1 B 1, B 2k B 2, (k = 1, 2) and for every pair of filters X, Y of P, such that X B 1 B 2, B 3 B 4 Y, X Y, from Lemma 3 and B 1 B 2 =, it follows that X B j Inc(P) (j = 1, 2). Since B 3, B 4 B 3 B 4 Y and B j (j = 1, 2) are poset matroids on P, there exist B 5 B 1, B 6 B 2 such that X B 1 B 5 Y, X B 2 B 6 Y ; and so X = (X B 1 ) (X B 2 ) B 5 B 6 Y ; in addition, B 5 B 6 B. Hence, (b.2) is satisfied; further, the theorem is proved. Next we give an example to show that if there exist B 1 B 1, B 2 B 2 such that B 1 B 2, then Theorem 2 will not be true. c a b d e Figure 1. Example. Let P be the poset shown in Figure 1 ([1, Figure 4.1]). Then B 1 := {{a, c}} is a poset matroid on P (This can be obtained with [1, Example 4.1]); B 2 := {{a, c, e}, {b, c, e}, {c, d, e}} is a poset matroid on P (This is proved in [1, Example 4.3]). Let B 1 = {a, c} and B 2 = {a, c, e}. We have B 1 B 2 = {a, c} and B := {{a, c} {a, c, e}, {a, c} {b, c, e}, {a, c} {c, d, e}} = {{a, c, e}, {a, b, c, e}, {a, c, d, e}}. Since {a, c, e} = 3, {a, c, d, e} = 4, by Lemma 2, B is not a poset matroid on P. We call B in Theorem 2 the union of B 1 and B 2, in notation, B 1 B 2. If B 1, B 2,..., B m are poset matroids on P such that B i B j = for every B i
7 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS 353 B i, B j B j, (i j; i, j = 1, 2,..., m), then by induction on m with Theorem 2, B = {B 1 B 2 B m ; B j B j (j = 1, 2,..., m)} is a poset matroid on P. This poset matroid is called the union of B 1, B 2,..., B m, in notation, B 1 B 2 B m. The following property discusses the properties of B 1 B 2. The related result about B 1 B 2 B m can be gotten by induction. Property 2. Let B 1, B 2 be two poset matroids on the poset P, satisfying B 1 B 2 = for every B j B j (j = 1, 2). Then: (1) For every A Inc(P), ρ 12 (A) = max X A (ρ 1 (X)+ρ 2 (F X )), where ρ 1, ρ 2, ρ 12 are the ranks associated with B 1, B 2, B 1 B 2 respectively and F X Inc(P), F X (A\X) such that for every Z Inc(P), if Z (A\X), then Z F X (2) Let I 1, I 2, I 12 be the families of all independent sets of B 1, B 2, B 1 B 2 respectively. Then I 12 = I 1 I 2 in which I 1 I 2 = {X 1 X 2 ; X j I j (j = 1, 2)}. Proof. (1) By Lemma 3, F X exists in Inc(P) for any X Inc(P), X A. Since ρ 1 (X) = max{ X 1 ; X 1 Inc(P), X 1 X B 1 for some B 1 B 1 }, ρ 2 (F X ) = max{ X 2 ; X 2 Inc(P), X 2 F X B 2 for some B 2 B 2 }, ρ 12 (A) = max{ Y ; Y Inc(P), Y A (B 1 B 2 ) for some B 1 B 2 B 1 B 2 } and X 1 X 2 (X B 1 ) (F X B 2 ) A (B 1 B 2 ) for some B 1 B 1, B 2 B 2, we have ρ 1 (X)+ρ 2 (F X ) ρ 12 (A); moreover, max X A (ρ 1 (X)+ρ 2 (F X )) ρ 12 (A). On the other hand, Y A (B 1 B 2 ) means Y 1 = Y B 1 A, Y B 2 A. According to B 1 B 2 =, it follows that Y B 2 F Y1. Thus ρ 12 (A) max X A (ρ 1 (X) + ρ 2 (F X )). Hence, ρ 12 (A) = max X A (ρ 1 (X) + ρ 2 (F X )). (2) It is obvious that I 1 I 2 I 12. Let X I 12. Then, there exists B 1 B 2 B 1 B 2 in which B j B j (j = 1, 2) such that X B 1 B 2. X = (X B 1 ) (X B 2 ) together with B 1 B 2 = and X B 1 B 2 implies X B 1 I 1, X B 2 I 2, i.e. X I 1 I 2. Since a base is a minimal spanning set of a poset matroid, we can define the intersection of two poset matroids as follows. Theorem 3. Let B 1 and B 2 be two poset matroids on the poset P, whose spanning sets are S 1 and S 2 respectively and B 1 B 2 = for every B 1 B 1, B 2
8 354 HUA MAO AND SANYANG LIU B 2. Then S 1 S 2 = {X 1 X 2 ; X j S j (j = 1, 2)} is the family of spanning sets of a poset matroid on P. We call this poset matroid the intersection of B 1 and B 2, in notation, B 1 B 2. Proof. According to Definition 2, Lemma 4 and Lemma 5, we have only to prove that S 1 S 2 is the collection of all independent sets of some poset matroid on P. For any X j S j, by Lemma 4, X j is an independent set of Bj (j = 1, 2); moreover, by Property 2, X j = X j (j = 1, 2) are independent sets of B1 B 2 ; further, X 1 X 2 is an independent set of B 1 B 2. Thus, X 1 X 2 is a spanning set of (B 1 B 2 ). Conversely, for a spanning set S of (B 1 B 2 ), or say, an independent set of B1 B 2, there exist independent sets X 1, X 2 of B 1, B 2 respectively such that S = X1 X 2. On the other hand, by Lemma 4, X 1 and X 2 are spanning sets of B 1 and B 2 respectively; moreover, S is a spanning set of B 1 and B 2 respectively because of X j S (j = 1, 2), i.e. S S j (j = 1, 2), and so S = S S S 1 S 2. Hence, the theorem is proved. Corollary 1. Let B 1 and B 2 be two poset matroids on the poset P such that B 1 B 2 = for every B 1 B 1, B 2 B 2. Then B 1 B 2 = (B 1 B 2 ). We next discuss the partition. Theorem 4. Let B j (j = 1, 2) be poset matroids on P satisfying B 1 B 2 = for any B j B j (j = 1, 2) and ρ j (j = 1, 2) be the ranks associated with B j (j = 1, 2) respectively. Then P has a partition {P 1, P 2 } satisfying P 1 and P 2 are independent sets of B 1 and B 2 respectively iff ρ 1 (A) + ρ 2 (A) A for every A Inc(P). Proof. Suppose P has a partition {P 1, P 2 } and P j (j = 1, 2) are independent sets of B j (j = 1, 2). Since A = A P = (A P 1 ) (A P 2 ) for every A Inc(P), by Lemma 3 and Definition 2, it follows that A P 1 and A P 2 are independent sets of B 1 and B 2 respectively. Thus ρ j (A P j ) = A P j (j = 1, 2), and so A = A P 1 + A P 2 = ρ 1 (A P 1 ) + ρ 2 (A P 2 ). Because of A P j A (j = 1, 2) and Definition 3, there are ρ j (A P j ) ρ j (A) (j = 1, 2). Further, A ρ 1 (A) + ρ 2 (A).
9 THE DIRECT SUM, UNION AND INTERSECTION OF POSET MATROIDS 355 Conversely, since ρ 1 (A) + ρ 2 (A) A for every A Inc(P), especially, ρ 1 (P)+ρ 2 (P) P. From Definition 3, ρ j (P) = B j for every B j B j (j = 1, 2). Thus B 1 + B 2 P for every B j B j (j = 1, 2). It follows from B 1 B 2 P and B 1 B 2 = that there is B 1 + B 2 = B 1 B 2 P. Hence, B 1 B 2 = P ; moreover, P = B 1 B 2. Obviously, B 1 B 2 = and B j (j = 1, 2) are independent sets of B j (j = 1, 2). Namely, {B 1, B 2 } is a partition of P. Corollary 2. Let B j (j = 1, 2,..., k) be poset matroids on the poset P such that B 1 B 2 = (i j; i, j = 1, 2,..., k) and ρ j (j = 1, 2,..., k) be the ranks associated with B j (j = 1, 2,..., k) respectively. Then P has a partition {P 1, P 2,..., P k } satisfying P j is an independent set of B j (j = 1, 2,..., k) iff kj=1 ρ j (A) A for every A Inc(P). Proof. By induction on k and analogous to the proof of Theorem 4, the assertion is easily proved. Corollary 3. Let B j (j = 1, 2,..., k) be poset matroids on P such that B i B j = (i j; i, j = 1, 2,..., k) and ρ be the rank associated with B 1 B 2 B k. Then P has a partition {P 1, P 2,..., P k } satisfying P j (j = 1, 2,..., k) are independent sets of B j (j = 1, 2,..., k) respectively iff ρ(p) = P. Proof. By induction on k with Property 2 and Theorem 4, the assertion is easily proved. References 1 M. Barnabei, G. Nicoletti and L. Pezzoli, Matroids on partially ordered sets, Adv, in Appl. Math., 21(1998), D. J. A. Welsh, Matroid Theory, Academic Press, London, M. Barnabei, G. Nicoletti and L. Pezzoli, The symmetric exchange property for poset matroids, Adv. in Math., 102(1993), G. Grätzer, General Lattice Theory, Birkhäuser, Basel, Department of Mathematics, Zhengzhou University, Zhengzhou, , P.R. China. yushengmao@263.net 2 Department of Applied Mathematics, Xidian University, Xi an , P.R. China.
Sequences of height 1 primes in Z[X]
Sequences of height 1 primes in Z[X] Stephen McAdam Department of Mathematics University of Texas Austin TX 78712 mcadam@math.utexas.edu Abstract: For each partition J K of {1, 2,, n} (n 2) with J 2, let
More informationMatroids on convex geometries (cg-matroids)
Discrete Mathematics 307 (2007) 1936 1950 www.elsevier.com/locate/disc Matroids on convex geometries (cg-matroids) Satoru Fujishige a,, Gleb A. Koshevoy b, Yoshio Sano a a Research Institute for Mathematical
More informationProperties of the Integers
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationa + b = b + a and a b = b a. (a + b) + c = a + (b + c) and (a b) c = a (b c). a (b + c) = a b + a c and (a + b) c = a c + b c.
Properties of the Integers The set of all integers is the set and the subset of Z given by Z = {, 5, 4, 3, 2, 1, 0, 1, 2, 3, 4, 5, }, N = {0, 1, 2, 3, 4, }, is the set of nonnegative integers (also called
More informationRegular matroids without disjoint circuits
Regular matroids without disjoint circuits Suohai Fan, Hong-Jian Lai, Yehong Shao, Hehui Wu and Ju Zhou June 29, 2006 Abstract A cosimple regular matroid M does not have disjoint circuits if and only if
More information1.2 Posets and Zorn s Lemma
1.2 Posets and Zorn s Lemma A set Σ is called partially ordered or a poset with respect to a relation if (i) (reflexivity) ( σ Σ) σ σ ; (ii) (antisymmetry) ( σ,τ Σ) σ τ σ = σ = τ ; 66 (iii) (transitivity)
More informationOn Antichains in Product Posets
On Antichains in Product Posets Sergei L. Bezrukov Department of Math and Computer Science University of Wisconsin - Superior Superior, WI 54880, USA sb@mcs.uwsuper.edu Ian T. Roberts School of Engineering
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationD-bounded Distance-Regular Graphs
D-bounded Distance-Regular Graphs CHIH-WEN WENG 53706 Abstract Let Γ = (X, R) denote a distance-regular graph with diameter D 3 and distance function δ. A (vertex) subgraph X is said to be weak-geodetically
More informationJournal Algebra Discrete Math.
Algebra and Discrete Mathematics Number 2. (2005). pp. 20 35 c Journal Algebra and Discrete Mathematics RESEARCH ARTICLE On posets of width two with positive Tits form Vitalij M. Bondarenko, Marina V.
More informationA General Model for Matroids and the Greedy Algorithm
RIMS Preprint No. 1590 A General Model for Matroids and the Greedy Algorithm Ulrich Faigle Mathematisches Institut/ZAIK Universität zu Köln D-50931 Köln, Germany Satoru Fujishige Research Institute for
More informationThe cocycle lattice of binary matroids
Published in: Europ. J. Comb. 14 (1993), 241 250. The cocycle lattice of binary matroids László Lovász Eötvös University, Budapest, Hungary, H-1088 Princeton University, Princeton, NJ 08544 Ákos Seress*
More informationOn the intersection of infinite matroids
On the intersection of infinite matroids Elad Aigner-Horev Johannes Carmesin Jan-Oliver Fröhlich University of Hamburg 9 July 2012 Abstract We show that the infinite matroid intersection conjecture of
More informationA Kruskal-Katona Type Theorem for the Linear Lattice
A Kruskal-Katona Type Theorem for the Linear Lattice Sergei Bezrukov Department of Mathematics and Computer Science University of Paderborn Fürstenallee 11 D-33102 Paderborn, Germany Aart Blokhuis Department
More informationUnless otherwise specified, V denotes an arbitrary finite-dimensional vector space.
MAT 90 // 0 points Exam Solutions Unless otherwise specified, V denotes an arbitrary finite-dimensional vector space..(0) Prove: a central arrangement A in V is essential if and only if the dual projective
More informationAn Introduction of Tutte Polynomial
An Introduction of Tutte Polynomial Bo Lin December 12, 2013 Abstract Tutte polynomial, defined for matroids and graphs, has the important property that any multiplicative graph invariant with a deletion
More informationSUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS
SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, III. THE CASE OF TOTALLY ORDERED SETS MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P, let Co(P) denote the lattice of all order-convex
More informationEIS property for dependence spaces
for dependence spaces AAA88, Warsaw 19 22 June 2014 for dependence spaces for dependence spaces According to F. Gécseg, H. Jürgensen [3] the result which is usually referred to as the Exchange Lemma states
More informationDefinitions. Notations. Injective, Surjective and Bijective. Divides. Cartesian Product. Relations. Equivalence Relations
Page 1 Definitions Tuesday, May 8, 2018 12:23 AM Notations " " means "equals, by definition" the set of all real numbers the set of integers Denote a function from a set to a set by Denote the image of
More informationHW 4 SOLUTIONS. , x + x x 1 ) 2
HW 4 SOLUTIONS The Way of Analysis p. 98: 1.) Suppose that A is open. Show that A minus a finite set is still open. This follows by induction as long as A minus one point x is still open. To see that A
More informationFuzzy bases and the fuzzy dimension of fuzzy vector spaces
MATHEMATICAL COMMUNICATIONS 303 Math. Commun., Vol. 15, No. 2, pp. 303-310 (2010 Fuzzy bases and the fuzzy dimension of fuzzy vector spaces Fu-Gui Shi 1, and Chun-E Huang 2 1 Department of Mathematics,
More informationTree sets. Reinhard Diestel
1 Tree sets Reinhard Diestel Abstract We study an abstract notion of tree structure which generalizes treedecompositions of graphs and matroids. Unlike tree-decompositions, which are too closely linked
More informationBranchwidth of graphic matroids.
Branchwidth of graphic matroids. Frédéric Mazoit and Stéphan Thomassé Abstract Answering a question of Geelen, Gerards, Robertson and Whittle [2], we prove that the branchwidth of a bridgeless graph is
More informationSome Characterizations of 0-Distributive Semilattices
BULLETIN of the MALAYSIAN MATHEMATICAL SCIENCES SOCIETY http:/math.usm.my/bulletin Bull. Malays. Math. Sci. Soc. (2) 37(4) (2014), 1103 1110 Some Characterizations of 0-Distributive Semilattices 1 H. S.
More informationTORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS
TORIC WEAK FANO VARIETIES ASSOCIATED TO BUILDING SETS YUSUKE SUYAMA Abstract. We give a necessary and sufficient condition for the nonsingular projective toric variety associated to a building set to be
More informationA Structure of KK-Algebras and its Properties
Int. Journal of Math. Analysis, Vol. 6, 2012, no. 21, 1035-1044 A Structure of KK-Algebras and its Properties S. Asawasamrit Department of Mathematics, Faculty of Applied Science, King Mongkut s University
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS IV CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. In our quest to find a splitter theorem for internally 4-connected binary
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Define and differentiate between important sets Use correct notation when describing sets: {...}, intervals
More informationCSE 20 DISCRETE MATH. Fall
CSE 20 DISCRETE MATH Fall 2017 http://cseweb.ucsd.edu/classes/fa17/cse20-ab/ Today's learning goals Determine whether a relation is an equivalence relation by determining whether it is Reflexive Symmetric
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS III CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. This paper proves a preliminary step towards a splitter theorem for internally
More informationTopology Proceedings. COPYRIGHT c by Topology Proceedings. All rights reserved.
Topology Proceedings Web: http://topology.auburn.edu/tp/ Mail: Topology Proceedings Department of Mathematics & Statistics Auburn University, Alabama 36849, USA E-mail: topolog@auburn.edu ISSN: 0146-4124
More informationPlanar and Affine Spaces
Planar and Affine Spaces Pýnar Anapa İbrahim Günaltılı Hendrik Van Maldeghem Abstract In this note, we characterize finite 3-dimensional affine spaces as the only linear spaces endowed with set Ω of proper
More informationSELF-DUAL UNIFORM MATROIDS ON INFINITE SETS
SELF-DUAL UNIFORM MATROIDS ON INFINITE SETS NATHAN BOWLER AND STEFAN GESCHKE Abstract. We extend the notion of a uniform matroid to the infinitary case and construct, using weak fragments of Martin s Axiom,
More informationOn the Impossibility of Certain Ranking Functions
On the Impossibility of Certain Ranking Functions Jin-Yi Cai Abstract Suppose all the individuals in a field are linearly ordered. Groups of individuals form teams. Is there a perfect ranking function
More informationThe Catalan matroid.
The Catalan matroid. arxiv:math.co/0209354v1 25 Sep 2002 Federico Ardila fardila@math.mit.edu September 4, 2002 Abstract We show how the set of Dyck paths of length 2n naturally gives rise to a matroid,
More informationMatroid intersection, base packing and base covering for infinite matroids
Matroid intersection, base packing and base covering for infinite matroids Nathan Bowler Johannes Carmesin June 25, 2014 Abstract As part of the recent developments in infinite matroid theory, there have
More informationClassification of root systems
Classification of root systems September 8, 2017 1 Introduction These notes are an approximate outline of some of the material to be covered on Thursday, April 9; Tuesday, April 14; and Thursday, April
More informationContents. Index... 15
Contents Filter Bases and Nets................................................................................ 5 Filter Bases and Ultrafilters: A Brief Overview.........................................................
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS II CAROLYN CHUN, DILLON MAYHEW, AND JAMES OXLEY Abstract. Let M and N be internally 4-connected binary matroids such that M has a proper
More informationTHE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE
THE STRUCTURE OF 3-CONNECTED MATROIDS OF PATH WIDTH THREE RHIANNON HALL, JAMES OXLEY, AND CHARLES SEMPLE Abstract. A 3-connected matroid M is sequential or has path width 3 if its ground set E(M) has a
More information1 Some loose ends from last time
Cornell University, Fall 2010 CS 6820: Algorithms Lecture notes: Kruskal s and Borůvka s MST algorithms September 20, 2010 1 Some loose ends from last time 1.1 A lemma concerning greedy algorithms and
More informationSTABILITY AND POSETS
STABILITY AND POSETS CARL G. JOCKUSCH, JR., BART KASTERMANS, STEFFEN LEMPP, MANUEL LERMAN, AND REED SOLOMON Abstract. Hirschfeldt and Shore have introduced a notion of stability for infinite posets. We
More informationFinite connectivity in infinite matroids
Finite connectivity in infinite matroids Henning Bruhn Paul Wollan Abstract We introduce a connectivity function for infinite matroids with properties similar to the connectivity function of a finite matroid,
More informationApplied Mathematics Letters
Applied Mathematics Letters 25 (2012) 545 549 Contents lists available at SciVerse ScienceDirect Applied Mathematics Letters journal homepage: www.elsevier.com/locate/aml On the equivalence of four chaotic
More informationLusin sequences under CH and under Martin s Axiom
F U N D A M E N T A MATHEMATICAE 169 (2001) Lusin sequences under CH and under Martin s Axiom by Uri Abraham (Beer-Sheva) and Saharon Shelah (Jerusalem) Abstract. Assuming the continuum hypothesis there
More informationDownloaded 03/01/17 to Redistribution subject to SIAM license or copyright; see
SIAM J. DISCRETE MATH. Vol. 31, No. 1, pp. 335 382 c 2017 Society for Industrial and Applied Mathematics PARTITION CONSTRAINED COVERING OF A SYMMETRIC CROSSING SUPERMODULAR FUNCTION BY A GRAPH ATTILA BERNÁTH,
More informationAN ALGORITHM FOR CONSTRUCTING A k-tree FOR A k-connected MATROID
AN ALGORITHM FOR CONSTRUCTING A k-tree FOR A k-connected MATROID NICK BRETTELL AND CHARLES SEMPLE Dedicated to James Oxley on the occasion of his 60th birthday Abstract. For a k-connected matroid M, Clark
More informationLECTURE 3 Matroids and geometric lattices
LECTURE 3 Matroids and geometric lattices 3.1. Matroids A matroid is an abstraction of a set of vectors in a vector space (for us, the normals to the hyperplanes in an arrangement). Many basic facts about
More informationParity Versions of 2-Connectedness
Parity Versions of 2-Connectedness C. Little Institute of Fundamental Sciences Massey University Palmerston North, New Zealand c.little@massey.ac.nz A. Vince Department of Mathematics University of Florida
More informationcse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska
cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 1 Course Web Page www3.cs.stonybrook.edu/ cse303 The webpage contains: lectures notes slides; very detailed solutions to
More informationWell-Ordering Principle. Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element.
Well-Ordering Principle Axiom: Every nonempty subset of Z + has a least element. That is, if S Z + and S, then S has a smallest element. Well-Ordering Principle Example: Use well-ordering property to prove
More informationList of Theorems. Mat 416, Introduction to Graph Theory. Theorem 1 The numbers R(p, q) exist and for p, q 2,
List of Theorems Mat 416, Introduction to Graph Theory 1. Ramsey s Theorem for graphs 8.3.11. Theorem 1 The numbers R(p, q) exist and for p, q 2, R(p, q) R(p 1, q) + R(p, q 1). If both summands on the
More informationarxiv:math/ v1 [math.gm] 21 Jan 2005
arxiv:math/0501341v1 [math.gm] 21 Jan 2005 SUBLATTICES OF LATTICES OF ORDER-CONVEX SETS, I. THE MAIN REPRESENTATION THEOREM MARINA SEMENOVA AND FRIEDRICH WEHRUNG Abstract. For a partially ordered set P,
More informationarxiv:math/ v1 [math.co] 3 Sep 2000
arxiv:math/0009026v1 [math.co] 3 Sep 2000 Max Min Representation of Piecewise Linear Functions Sergei Ovchinnikov Mathematics Department San Francisco State University San Francisco, CA 94132 sergei@sfsu.edu
More informationCyclic Flats, Sticky Matroids, and Intertwines
Cyclic Flats, Sticky Matroids, and Intertwines Joseph E. Bonin The George Washington University Part I Essential Matroid Background and Cyclic Flats Matroids via Flats There are many equivalent formulations
More informationReport 1 The Axiom of Choice
Report 1 The Axiom of Choice By Li Yu This report is a collection of the material I presented in the first round presentation of the course MATH 2002. The report focuses on the principle of recursive definition,
More informationJoin Reductions and Join Saturation Reductions of Abstract Knowledge Bases 1
International Journal of Contemporary Mathematical Sciences Vol. 12, 2017, no. 3, 109-115 HIKARI Ltd, www.m-hikari.com https://doi.org/10.12988/ijcms.2017.7312 Join Reductions and Join Saturation Reductions
More informationOn the adjacency matrix of a block graph
On the adjacency matrix of a block graph R. B. Bapat Stat-Math Unit Indian Statistical Institute, Delhi 7-SJSS Marg, New Delhi 110 016, India. email: rbb@isid.ac.in Souvik Roy Economics and Planning Unit
More informationA MATROID EXTENSION RESULT
A MATROID EXTENSION RESULT JAMES OXLEY Abstract. Adding elements to matroids can be fraught with difficulty. In the Vámos matroid V 8, there are four independent sets X 1, X 2, X 3, and X 4 such that (X
More informationMA 524 Final Fall 2015 Solutions
MA 54 Final Fall 05 Solutions Name: Question Points Score 0 0 3 5 4 0 5 5 6 5 7 0 8 5 Total: 60 MA 54 Solutions Final, Page of 8. Let L be a finite lattice. (a) (5 points) Show that p ( (p r)) (p ) (p
More informationTRANSITIVE AND ABSORBENT FILTERS OF LATTICE IMPLICATION ALGEBRAS
J. Appl. Math. & Informatics Vol. 32(2014), No. 3-4, pp. 323-330 http://dx.doi.org/10.14317/jami.2014.323 TRANSITIVE AND ABSORBENT FILTERS OF LATTICE IMPLICATION ALGEBRAS M. SAMBASIVA RAO Abstract. The
More informationOn a Conjecture of Thomassen
On a Conjecture of Thomassen Michelle Delcourt Department of Mathematics University of Illinois Urbana, Illinois 61801, U.S.A. delcour2@illinois.edu Asaf Ferber Department of Mathematics Yale University,
More informationResearch Article Frequent Oscillatory Behavior of Delay Partial Difference Equations with Positive and Negative Coefficients
Hindawi Publishing Corporation Advances in Difference Equations Volume 2010, Article ID 606149, 15 pages doi:10.1155/2010/606149 Research Article Frequent Oscillatory Behavior of Delay Partial Difference
More informationDUAL BCK-ALGEBRA AND MV-ALGEBRA. Kyung Ho Kim and Yong Ho Yon. Received March 23, 2007
Scientiae Mathematicae Japonicae Online, e-2007, 393 399 393 DUAL BCK-ALGEBRA AND MV-ALGEBRA Kyung Ho Kim and Yong Ho Yon Received March 23, 2007 Abstract. The aim of this paper is to study the properties
More informationWelsh s problem on the number of bases of matroids
Welsh s problem on the number of bases of matroids Edward S. T. Fan 1 and Tony W. H. Wong 2 1 Department of Mathematics, California Institute of Technology 2 Department of Mathematics, Kutztown University
More informationComplete Induction and the Well- Ordering Principle
Complete Induction and the Well- Ordering Principle Complete Induction as a Rule of Inference In mathematical proofs, complete induction (PCI) is a rule of inference of the form P (a) P (a + 1) P (b) k
More informationMATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT
MATROID PACKING AND COVERING WITH CIRCUITS THROUGH AN ELEMENT MANOEL LEMOS AND JAMES OXLEY Abstract. In 1981, Seymour proved a conjecture of Welsh that, in a connected matroid M, the sum of the maximum
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter 1 The Real Numbers 1.1. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {1, 2, 3, }. In N we can do addition, but in order to do subtraction we need
More informationMath 3012 Applied Combinatorics Lecture 14
October 6, 2015 Math 3012 Applied Combinatorics Lecture 14 William T. Trotter trotter@math.gatech.edu Three Posets with the Same Cover Graph Exercise How many posets altogether have the same cover graph
More informationObstinate filters in residuated lattices
Bull. Math. Soc. Sci. Math. Roumanie Tome 55(103) No. 4, 2012, 413 422 Obstinate filters in residuated lattices by Arsham Borumand Saeid and Manijeh Pourkhatoun Abstract In this paper we introduce the
More informationOn Regularity of Incline Matrices
International Journal of Algebra, Vol. 5, 2011, no. 19, 909-924 On Regularity of Incline Matrices A. R. Meenakshi and P. Shakila Banu Department of Mathematics Karpagam University Coimbatore-641 021, India
More informationIn N we can do addition, but in order to do subtraction we need to extend N to the integers
Chapter The Real Numbers.. Some Preliminaries Discussion: The Irrationality of 2. We begin with the natural numbers N = {, 2, 3, }. In N we can do addition, but in order to do subtraction we need to extend
More informationClass Notes on Poset Theory Johan G. Belinfante Revised 1995 May 21
Class Notes on Poset Theory Johan G Belinfante Revised 1995 May 21 Introduction These notes were originally prepared in July 1972 as a handout for a class in modern algebra taught at the Carnegie-Mellon
More informationUnique Difference Bases of Z
1 3 47 6 3 11 Journal of Integer Sequences, Vol. 14 (011), Article 11.1.8 Unique Difference Bases of Z Chi-Wu Tang, Min Tang, 1 and Lei Wu Department of Mathematics Anhui Normal University Wuhu 41000 P.
More informationMath 242: Principles of Analysis Fall 2016 Homework 1 Part B solutions
Math 4: Principles of Analysis Fall 0 Homework Part B solutions. Let x, y, z R. Use the axioms of the real numbers to prove the following. a) If x + y = x + z then y = z. Solution. By Axiom a), there is
More informationA Characterization of (3+1)-Free Posets
Journal of Combinatorial Theory, Series A 93, 231241 (2001) doi:10.1006jcta.2000.3075, available online at http:www.idealibrary.com on A Characterization of (3+1)-Free Posets Mark Skandera Department of
More informationSelf-dual interval orders and row-fishburn matrices
Self-dual interval orders and row-fishburn matrices Sherry H. F. Yan Department of Mathematics Zhejiang Normal University Jinhua 321004, P.R. China huifangyan@hotmail.com Yuexiao Xu Department of Mathematics
More informationCSC Discrete Math I, Spring Relations
CSC 125 - Discrete Math I, Spring 2017 Relations Binary Relations Definition: A binary relation R from a set A to a set B is a subset of A B Note that a relation is more general than a function Example:
More informationDECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE
Discussiones Mathematicae Graph Theory 30 (2010 ) 335 347 DECOMPOSITIONS OF MULTIGRAPHS INTO PARTS WITH THE SAME SIZE Jaroslav Ivančo Institute of Mathematics P.J. Šafári University, Jesenná 5 SK-041 54
More informationNOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES
NOTES ON PLANAR SEMIMODULAR LATTICES. IV. THE SIZE OF A MINIMAL CONGRUENCE LATTICE REPRESENTATION WITH RECTANGULAR LATTICES G. GRÄTZER AND E. KNAPP Abstract. Let D be a finite distributive lattice with
More informationIMA Preprint Series # 2066
THE CARDINALITY OF SETS OF k-independent VECTORS OVER FINITE FIELDS By S.B. Damelin G. Michalski and G.L. Mullen IMA Preprint Series # 2066 ( October 2005 ) INSTITUTE FOR MATHEMATICS AND ITS APPLICATIONS
More informationBMO Round 2 Problem 3 Generalisation and Bounds
BMO 2007 2008 Round 2 Problem 3 Generalisation and Bounds Joseph Myers February 2008 1 Introduction Problem 3 (by Paul Jefferys) is: 3. Adrian has drawn a circle in the xy-plane whose radius is a positive
More information1.5 The Nil and Jacobson Radicals
1.5 The Nil and Jacobson Radicals The idea of a radical of a ring A is an ideal I comprising some nasty piece of A such that A/I is well-behaved or tractable. Two types considered here are the nil and
More informationA PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS
#A INTEGERS 9 (9), 7-37 A PLANAR INTEGRAL SELF-AFFINE TILE WITH CANTOR SET INTERSECTIONS WITH ITS NEIGHBORS Shu-Juan Duan School of Math. and Computational Sciences, Xiangtan University, Hunan, China jjmmcn@6.com
More informationDisjoint Hamiltonian Cycles in Bipartite Graphs
Disjoint Hamiltonian Cycles in Bipartite Graphs Michael Ferrara 1, Ronald Gould 1, Gerard Tansey 1 Thor Whalen Abstract Let G = (X, Y ) be a bipartite graph and define σ (G) = min{d(x) + d(y) : xy / E(G),
More informationTHE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS
THE NUMBER OF POINTS IN A COMBINATORIAL GEOMETRY WITH NO 8-POINT-LINE MINORS JOSEPH E. BONIN AND JOSEPH P. S. KUNG ABSTRACT. We show that when n is greater than 3, the number of points in a combinatorial
More informationCSE 20 DISCRETE MATH. Winter
CSE 20 DISCRETE MATH Winter 2017 http://cseweb.ucsd.edu/classes/wi17/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationGroups of Prime Power Order with Derived Subgroup of Prime Order
Journal of Algebra 219, 625 657 (1999) Article ID jabr.1998.7909, available online at http://www.idealibrary.com on Groups of Prime Power Order with Derived Subgroup of Prime Order Simon R. Blackburn*
More informationCSE 20 DISCRETE MATH WINTER
CSE 20 DISCRETE MATH WINTER 2016 http://cseweb.ucsd.edu/classes/wi16/cse20-ab/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationThe Baire Category Theorem and choice
Topology and its Applications 108 (2000) 157 167 The Baire Category Theorem and choice Horst Herrlich a,, Kyriakos Keremedis b a Department of Mathematics, University of Bremen, Postfach 330440, 28334
More informationCSE 20 DISCRETE MATH SPRING
CSE 20 DISCRETE MATH SPRING 2016 http://cseweb.ucsd.edu/classes/sp16/cse20-ac/ Today's learning goals Evaluate which proof technique(s) is appropriate for a given proposition Direct proof Proofs by contraposition
More informationCombinatorial Batch Codes and Transversal Matroids
Combinatorial Batch Codes and Transversal Matroids Richard A. Brualdi, Kathleen P. Kiernan, Seth A. Meyer, Michael W. Schroeder Department of Mathematics University of Wisconsin Madison, WI 53706 {brualdi,kiernan,smeyer,schroede}@math.wisc.edu
More informationWalk through Combinatorics: Sumset inequalities.
Walk through Combinatorics: Sumset inequalities (Version 2b: revised 29 May 2018) The aim of additive combinatorics If A and B are two non-empty sets of numbers, their sumset is the set A+B def = {a+b
More informationON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS
Discussiones Mathematicae General Algebra and Applications 35 (2015) 21 31 doi:10.7151/dmgaa.1227 ON A PERIOD OF ELEMENTS OF PSEUDO-BCI-ALGEBRAS Grzegorz Dymek Institute of Mathematics and Computer Science
More informationDISTRIBUTIVE, STANDARD AND NEUTRAL ELEMENTS IN TRELLISES. 1. Introduction
Acta Math. Univ. Comenianae Vol. LXXVII, 2 (2008), pp. 167 174 167 DISTRIBUTIVE, STANDARD AND NEUTRAL ELEMENTS IN TRELLISES SHASHIREKHA B. RAI Abstract. In this paper, the concepts of distributive, standard
More informationTOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII
TOWARDS A SPLITTER THEOREM FOR INTERNALLY 4-CONNECTED BINARY MATROIDS VII CAROLYN CHUN AND JAMES OXLEY Abstract. Let M be a 3-connected binary matroid; M is internally 4- connected if one side of every
More informationSubalgebras and ideals in BCK/BCI-algebras based on Uni-hesitant fuzzy set theory
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS Vol. 11, No. 2, 2018, 417-430 ISSN 1307-5543 www.ejpam.com Published by New York Business Global Subalgebras and ideals in BCK/BCI-algebras based on Uni-hesitant
More informationDetermining a Binary Matroid from its Small Circuits
Determining a Binary Matroid from its Small Circuits James Oxley Department of Mathematics Louisiana State University Louisiana, USA oxley@math.lsu.edu Charles Semple School of Mathematics and Statistics
More informationOrder-theoretical Characterizations of Countably Approximating Posets 1
Int. J. Contemp. Math. Sciences, Vol. 9, 2014, no. 9, 447-454 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ijcms.2014.4658 Order-theoretical Characterizations of Countably Approximating Posets
More informationWe want to show P (n) is true for all integers
Generalized Induction Proof: Let P (n) be the proposition 1 + 2 + 2 2 + + 2 n = 2 n+1 1. We want to show P (n) is true for all integers n 0. Generalized Induction Example: Use generalized induction to
More information