We present a unified approach to Doob’s Lp maximal inequalities for 1 ≤ p < ∞. The novelty of our method is that these martingale inequalities are obtained as consequences of elementary deterministic counterparts. The latter have a natural interpretation in terms of robust hedging. Moreover our deterministic inequalities lead to new versions of Doob’s maximal inequalities. These are best possib...

Some properties of minimal open sets and maximal open sets are studied in [1, 2]. In this paper, we define dual concepts of them, namely, maximal closed set and minimal closed set. These four types of subsets appear in finite spaces, for example. More generally, minimal open sets and maximal closed sets appear in locally finite spaces such as the digital line. Minimal closed sets and maximal op...

‎Let $G$ be a finite group‎. ‎By $MT(G)=(m_1,cdots,m_k)$ we denote the type of‎ ‎conjugacy classes of maximal subgroups of $G$‎, ‎which implies that $G$ has exactly $k$ conjugacy classes of‎ ‎maximal subgroups and $m_1,ldots,m_k$ are the numbers of conjugates‎ ‎of maximal subgroups of $G$‎, ‎where $m_1leqcdotsleq m_k$‎. ‎In this paper‎, ‎we‎ ‎give some new characterizations of finite groups by ...

A theorem of O’Nan and Scott [6]; [2, Chapter 4] restricts the possibilities for maximal subgroups of finite symmetric groups: they are of six types of which the first four are explicitly known, the fifth involves a finite simple group, and the sixth an action of a simple group. This result, in conjunction with the Classification of Finite Simple Groups, has a number of consequences. In particu...

In a graph G = (V,E), a non-empty set S ⊆ V is said to be an open packing set if no two vertices of S have a common neighbour in G. An open packing set which is not a proper subset of any open packing set is called a maximal open packing set. The minimum and maximum cardinalities of a maximal open packing set are respectively called the lower open packing number and the open packing number and ...

Let $S= \{e_1,\,e_2‎, ‎\ldots,\,e_m\}$ be an ordered subset of edges of a connected graph $G$‎. ‎The edge $S$-representation of an edge set $M\subseteq E(G)$ with respect to $S$ is the‎ ‎vector $r_e(M|S) = (d_1,\,d_2,\ldots,\,d_m)$‎, ‎where $d_i=1$ if $e_i\in M$ and $d_i=0$‎ ‎otherwise‎, ‎for each $i\in\{1,\ldots‎ , ‎k\}$‎. ‎We say $S$ is a global forcing set for maximal matchings of $G$‎ ‎if $...

The backing of the fuzzy ideal is normal ideal in some ring and in same time there fuzzy set whose is not fuzzy ideal and it backing set is ideal, i.e., it crisp is normal ideal. Consequently, in this paper we constructing a fuzziness function which defined on fuzzy sets and assigns membership grade for every fuzzy set whose it backing set are crisp ideal. Now, Let  be collection of all fuzzy s...

in this paper, we introduce fuzzy banach algebra and study the properties of invertible elements and its relation with opensets. we obtain some interesting results.

In every dense poset P every maximal antichain S may be partitioned into disjoint subsets S1 and S2 , such that the union of the upset of S1 with the downset of S2 yields the entire poset: U(S1) [ D(S2) = P . To nd a similar splitting of maximal antichains in posets is NP{hard in general.