scholarly journals UPPER BOUNDS IN THE OHTSUKI–RILEY–SAKUMA PARTIAL ORDER ON 2-BRIDGE KNOTS

2012 ◽  
Vol 21 (09) ◽  
pp. 1250084 ◽  
Author(s):  
SCOTT M. GARRABRANT ◽  
JIM HOSTE ◽  
PATRICK D. SHANAHAN
Keyword(s):  
Partial Order ◽  
Upper Bound ◽  
Continued Fractions ◽  
Sufficient Conditions ◽  
Upper Bounds ◽  
Necessary And Sufficient Conditions ◽  
Necessary And Sufficient

In this paper we use continued fractions to study a partial order on the set of 2-bridge knots derived from the work of Ohtsuki, Riley, and Sakuma. We establish necessary and sufficient conditions for any set of 2-bridge knots to have an upper bound with respect to the partial order. Moreover, given any 2-bridge knot K1 we characterize all other 2-bridge knots K2 such that {K1, K2} has an upper bound. As an application we answer a question of Suzuki, showing that there is no upper bound for the set consisting of the trefoil and figure-eight knots.

scholarly journals A strict upper bound for size multipartite Ramsey numbers of paths versus stars

2017 ◽  
Vol 1 (2) ◽  
pp. 9
Author(s):  
Chula Jayawardene
Keyword(s):  
Natural Number ◽  
Complete Graph ◽  
Upper Bound ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Infinite Class ◽  
Ramsey Numbers ◽  
Necessary And Sufficient

<p>Let $P_n$ represent the path of size $n$. Let $K_{1,m-1}$ represent a star of size $m$ and be denoted by $S_{m}$. Given a two coloring of the edges of a complete graph $K_{j \times s}$ we say that $K_{j \times s}\rightarrow (P_n,S_{m+1})$ if there is a copy of $P_n$ in the first color or a copy of $S_{m+1}$ in the second color. The size Ramsey multipartite number $m_j(P_n, S_{m+1})$ is the smallest natural number $s$ such that $K_{j \times s}\rightarrow (P_n,S_{m+1})$. Given $j,n,m$ if $s=\left\lceil \dfrac{n+m-1-k}{j-1} \right\rceil$, in this paper, we show that the size Ramsey numbers $m_j(P_n,S_{m+1})$ is bounded above by $s$ for $k=\left\lceil \dfrac{n-1}{j} \right\rceil$. Given $j\ge 3$ and $s$, we will obtain an infinite class $(n,m)$ that achieves this upper bound $s$. In the later part of the paper, will also investigate necessary and sufficient conditions needed for the upper bound to hold.</p>

scholarly journals Extensions of strict partial orders in N-Groups

1978 ◽  
Vol 25 (2) ◽  
pp. 241-249 ◽  
Author(s):  
K. B. Prabhakara Rao
Keyword(s):  
Partial Order ◽  
Sufficient Conditions ◽  
Partial Orders ◽  
Necessary And Sufficient Conditions ◽  
Full Extension ◽  
Partially Ordered ◽  
Strict Partial Order ◽  
Positive Elements ◽  
Necessary And Sufficient

AbstractAn attempt is made to extend the theory of extensions of partial orders in groups to strict partially ordered N-groups. Necessary and sufficient conditions, for a strict partial order of an N-group to have a strict full extension, and for a strict partial order of an N-group to be an intersection of strict full orders, are obtained when the partially ordered near-ring N and the N-group G satisfy the condition (− x) n = − xn for all elements x in G and positive elements n in N.

A Network-Flow Feasibility Theorem and Combinatorial Applications

1959 ◽  
Vol 11 ◽  
pp. 440-451 ◽  
Author(s):  
D. R. Fulkerson
Keyword(s):  
Lower Bound ◽  
Upper Bound ◽  
Network Flow ◽  
Present Author ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Private Communication ◽  
Circulatory Flow ◽  
Necessary And Sufficient ◽  
Circulation Theorem

There are a number of interesting theorems, relative to capacitated networks, that give necessary and sufficient conditions for the existence of flows satisfying constraints of various kinds. Typical of these are the supply-demand theorem due to Gale (4), which states a condition for the existence of a flow satisfying demands at certain nodes from supplies at other nodes, and the Hoffman circulation theorem (received by the present author in private communication), which states a condition for the existence of a circulatory flow in a network in which each arc has associated with it not only an upper bound for the arc flow, but a lower bound as well. If the constraints on flows are integral (for example, if the bounds on arc flows for the circulation theorem are integers), it is also true that integral flows meeting the requirements exist provided any flow does so.

scholarly journals A metrizable semitopological semilattice with non-closed partial order

2020 ◽  
Vol 8 (1) ◽  
pp. 67-75
Author(s):  
Taras Banakh ◽  
Serhii Bardyla ◽  
Alex Ravsky
Keyword(s):  
Partial Order ◽  
Dense Subset ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Countable Family ◽  
Hausdorff Topology ◽  
Necessary And Sufficient ◽  
Convergent Sequences

AbstractWe construct a metrizable semitopological semilattice X whose partial order P = {(x, y) ∈ X × X : xy = x} is a non-closed dense subset of X × X. As a by-product we find necessary and sufficient conditions for the existence of a (metrizable) Hausdorff topology on a set, act, semigroup or semilattice, having a prescribed countable family of convergent sequences.

scholarly journals Minimum Number of Colours to Avoid k-Term Monochromatic Arithmetic Progressions

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 247
Author(s):  
Kai An Sim ◽  
Kok Bin Wong
Keyword(s):  
Positive Integer ◽  
Arithmetic Progression ◽  
Upper Bound ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Arithmetic Progressions ◽  
Minimum Number ◽  
Necessary And Sufficient

By recalling van der Waerden theorem, there exists a least a positive integer w=w(k;r) such that for any n≥w, every r-colouring of [1,n] admits a monochromatic k-term arithmetic progression. Let k≥2 and rk(n) denote the minimum number of colour required so that there exists a rk(n)-colouring of [1,n] that avoids any monochromatic k-term arithmetic progression. In this paper, we give necessary and sufficient conditions for rk(n+1)=rk(n). We also show that rk(n)=2 for all k≤n≤2(k−1)2 and give an upper bound for rp(pm) for any prime p≥3 and integer m≥2.

scholarly journals On γ-Sets in Rings

2021 ◽  
Vol 14 (1) ◽  
pp. 314-326
Author(s):  
Eva Jenny C. Sigasig ◽  
Cristoper John S. Rosero ◽  
Michael Jr. Patula Baldado
Keyword(s):  
Lower Bound ◽  
Division Ring ◽  
Upper Bound ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Minimum Cardinality ◽  
Division Rings ◽  
Necessary And Sufficient

Let R be a ring with identity 1R. A subset J of R is called a γ-set if for every a ∈ R\J,there exist b, c ∈ J such that a+b = 0 and ac = 1R = ca. A γ-set of minimum cardinality is called a minimum γ-set. In this study, we identified some elements of R that are necessarily in a γ-sets, and we presented a method of constructing a new γ-set. Moreover, we gave: necessary and sufficient conditions for rings to have a unique γ-set; an upper bound for the total number of minimum γ-sets in a division ring; a lower bound for the total number of minimum γ-sets in a division ring; necessary and sufficient conditions for T(x) and T to be equal; necessary and sufficient conditions for a ring to have a trivial γ-set; necessary and sufficient conditions for an image of a γ-set to be a γ-set also; necessary and sufficient conditions for a ring to have a trivial γ-set; and, necessary and sufficient conditions for the families of γ-sets of two division rings to be isomorphic.

scholarly journals On a Separation Theorem for Delta-Convex Functions

2020 ◽  
Vol 34 (1) ◽  
pp. 133-141
Author(s):  
Andrzej Olbryś
Keyword(s):  
Convex Function ◽  
Partial Order ◽  
Convex Functions ◽  
Stability Problem ◽  
Sufficient Conditions ◽  
Separation Theorem ◽  
Necessary And Sufficient Conditions ◽  
Lorentz Cone ◽  
Necessary And Sufficient

AbstractIn the present paper we establish necessary and sufficient conditions under which two functions can be separated by a delta-convex function. This separation will be understood as a separation with respect to the partial order generated by the Lorentz cone. An application to a stability problem for delta-convexity is also given.

The extinction time of a general birth and death process with catastrophes

1986 ◽  
Vol 23 (04) ◽  
pp. 851-858 ◽  
Author(s):  
P. J. Brockwell
Keyword(s):  
Laplace Transform ◽  
Size Distribution ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Death Process ◽  
Extinction Time ◽  
Birth And Death Process ◽  
Different Types ◽  
The Laplace Transform ◽  
Necessary And Sufficient

The Laplace transform of the extinction time is determined for a general birth and death process with arbitrary catastrophe rate and catastrophe size distribution. It is assumed only that the birth rates satisfyλ0= 0,λj&gt; 0 for eachj&gt; 0, and. Necessary and sufficient conditions for certain extinction of the population are derived. The results are applied to the linear birth and death process (λj=jλ, µj=jμ) with catastrophes of several different types.

Sign in / Sign up

Export Citation Format

Share Document