scholarly journals TOTAL CURVATURES OF HOLONOMIC LINKS

2000 ◽  
Vol 09 (07) ◽  
pp. 893-906 ◽  
Author(s):  
TOBIAS EKHOLM ◽  
OLA WEISTRAND
Keyword(s):  
Lower Bounds ◽  
Total Curvature ◽  
Geometric Characterization ◽  
Upper And Lower Bounds ◽  
Braid Index

A differential geometric characterization of the braid-index of a link is found. After multiplication by 2π, it equals the infimum of the sum of total curvature and total absolute torsion over holonomic representatives of the link. Upper and lower bounds for the infimum of the total curvature over holonomic representatives of a link are given in terms of its braid- and bridge-index. Examples showing that these bounds are sharp are constructed.

Stochastic inequalities for an overflow model

1987 ◽  
Vol 24 (3) ◽  
pp. 696-708 ◽  
Author(s):  
Arie Hordijk ◽  
Ad Ridder
Keyword(s):  
Failure Rate ◽  
Lower Bounds ◽  
Approximation Method ◽  
Queueing Networks ◽  
Upper And Lower Bounds ◽  
Phase Type ◽  
Phase Type Distributions ◽  
Decreasing Failure Rate ◽  
General Method

A general method to obtain insensitive upper and lower bounds for the stationary distribution of queueing networks is sketched. It is applied to an overflow model. The bounds are shown to be valid for service distributions with decreasing failure rate. A characterization of phase-type distributions with decreasing failure rate is given. An approximation method is proposed. The methods are illustrated with numerical results.

scholarly journals Locating Chromatic Number of Powers of Paths and Cycles

Symmetry ◽  
2019 ◽  
Vol 11 (3) ◽  
pp. 389
Author(s):  
Manal Ghanem ◽  
Hasan Al-Ezeh ◽  
Ala’a Dabbour
Keyword(s):  
Chromatic Number ◽  
Lower Bounds ◽  
Minimum Distance ◽  
Upper And Lower Bounds ◽  
Color Code ◽  
Partition Class ◽  
Distinct Color

Let c be a proper k-coloring of a graph G. Let π = { R 1 , R 2 , … , R k } be the partition of V ( G ) induced by c, where R i is the partition class receiving color i. The color code c π ( v ) of a vertex v of G is the ordered k-tuple ( d ( v , R 1 ) , d ( v , R 2 ) , … , d ( v , R k ) ) , where d ( v , R i ) is the minimum distance from v to each other vertex u ∈ R i for 1 ≤ i ≤ k . If all vertices of G have distinct color codes, then c is called a locating k-coloring of G. The locating-chromatic number of G, denoted by χ L ( G ) , is the smallest k such that G admits a locating coloring with k colors. In this paper, we give a characterization of the locating chromatic number of powers of paths. In addition, we find sharp upper and lower bounds for the locating chromatic number of powers of cycles.

Minimal Reversible Deterministic Finite Automata

2018 ◽  
Vol 29 (02) ◽  
pp. 251-270 ◽  
Author(s):  
Markus Holzer ◽  
Sebastian Jakobi ◽  
Martin Kutrib
Keyword(s):  
Lower Bounds ◽  
Finite Automata ◽  
Transition Function ◽  
Upper And Lower Bounds ◽  
State Graph ◽  
Deterministic Finite Automata ◽  
Injective Mapping ◽  
Pattern Approach ◽  
Almost All

We study reversible deterministic finite automata (REV-DFAs), that are partial deterministic finite automata whose transition function induces an injective mapping on the state set for every letter of the input alphabet. We give a structural characterization of regular languages that can be accepted by REV-DFAs. This characterization is based on the absence of a forbidden pattern in the (minimal) deterministic state graph. Again with a forbidden pattern approach, we also show that the minimality of REV-DFAs among all equivalent REV-DFAs can be decided. Both forbidden pattern characterizations give rise to [Formula: see text]-complete decision algorithms. In fact, our techniques allow us to construct the minimal REV-DFA for a given minimal DFA. These considerations lead to asymptotic upper and lower bounds on the conversion from DFAs to REV-DFAs. Thus, almost all problems that concern uniqueness and the size of minimal REV-DFAs are solved.

scholarly journals ON THE REMAK HEIGHT, THE MAHLER MEASURE AND CONJUGATE SETS OF ALGEBRAIC NUMBERS LYING ON TWO CIRCLES

2001 ◽  
Vol 44 (1) ◽  
pp. 1-17 ◽  
Author(s):  
A. Dubickas ◽  
C. J. Smyth
Keyword(s):  
Lower Bounds ◽  
Height Function ◽  
Complete Characterization ◽  
Mahler Measure ◽  
The Other ◽  
Upper And Lower Bounds ◽  
Algebraic Numbers ◽  
Salem Numbers ◽  
Primary 11R06

AbstractWe define a new height function $\mathcal{R}(\alpha)$, the Remak height of an algebraic number $\alpha$. We give sharp upper and lower bounds for $\mathcal{R}(\alpha)$ in terms of the classical Mahler measure $M(\alpha)$. Study of when one of these bounds is exact leads us to consideration of conjugate sets of algebraic numbers of norm $\pm 1$ lying on two circles centred at 0. We give a complete characterization of such conjugate sets. They turn out to be of two types: one related to certain cubic algebraic numbers, and the other related to a non-integer generalization of Salem numbers which we call extended Salem numbers.AMS 2000 Mathematics subject classification: Primary 11R06

Stochastic inequalities for an overflow model

1987 ◽  
Vol 24 (03) ◽  
pp. 696-708 ◽  
Author(s):  
Arie Hordijk ◽  
Ad Ridder
Keyword(s):  
Failure Rate ◽  
Lower Bounds ◽  
Approximation Method ◽  
Queueing Networks ◽  
Upper And Lower Bounds ◽  
Phase Type ◽  
Phase Type Distributions ◽  
Decreasing Failure Rate ◽  
General Method

A general method to obtain insensitive upper and lower bounds for the stationary distribution of queueing networks is sketched. It is applied to an overflow model. The bounds are shown to be valid for service distributions with decreasing failure rate. A characterization of phase-type distributions with decreasing failure rate is given. An approximation method is proposed. The methods are illustrated with numerical results.

The role of the Rogers–Shephard inequality in the characterization of the difference body

2017 ◽  
Vol 29 (6) ◽  
Author(s):  
Judit Abardia-Evéquoz ◽  
Eugenia Saorín Gómez
Keyword(s):  
Lower Bounds ◽  
The Body ◽  
Upper And Lower Bounds ◽  
Difference Body ◽  
The Difference

AbstractThe Rogers–Shephard and Brunn–Minkowski inequalities provide upper and lower bounds for the volume of the difference body in terms of the volume of the body itself. In this work it is shown that the difference body operator is the only continuous and

scholarly journals On the Generalized Distance Energy of Graphs

Mathematics ◽  
2019 ◽  
Vol 8 (1) ◽  
pp. 17 ◽  
Author(s):  
Abdollah Alhevaz ◽  
Maryam Baghipur ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Connected Graph ◽  
Distance Matrix ◽  
Wiener Index ◽  
Diagonal Matrix ◽  
Upper And Lower Bounds ◽  
Star Graph ◽  
Extremal Graphs ◽  
Generalized Distance

The generalized distance matrix D α ( G ) of a connected graph G is defined as D α ( G ) = α T r ( G ) + ( 1 − α ) D ( G ) , where 0 ≤ α ≤ 1 , D ( G ) is the distance matrix and T r ( G ) is the diagonal matrix of the node transmissions. In this paper, we extend the concept of energy to the generalized distance matrix and define the generalized distance energy E D α ( G ) . Some new upper and lower bounds for the generalized distance energy E D α ( G ) of G are established based on parameters including the Wiener index W ( G ) and the transmission degrees. Extremal graphs attaining these bounds are identified. It is found that the complete graph has the minimum generalized distance energy among all connected graphs, while the minimum is attained by the star graph among trees of order n.

scholarly journals Hadamard k-fractional inequalities of Fejér type for GA-s-convex mappings and applications

2019 ◽  
Vol 2019 (1) ◽  
Author(s):  
Hui Lei ◽  
Gou Hu ◽  
Zhi-Jie Cao ◽  
Ting-Song Du
Keyword(s):  
Lower Bounds ◽  
Hypergeometric Functions ◽  
Upper And Lower Bounds ◽  
Weighted Inequalities ◽  
Convex Mappings ◽  
Special Means

Abstract The main aim of this paper is to establish some Fejér-type inequalities involving hypergeometric functions in terms of GA-s-convexity. For this purpose, we construct a Hadamard k-fractional identity related to geometrically symmetric mappings. Moreover, we give the upper and lower bounds for the weighted inequalities via products of two different mappings. Some applications of the presented results to special means are also provided.

scholarly journals On the Second-Largest Reciprocal Distance Signless Laplacian Eigenvalue

Mathematics ◽  
2021 ◽  
Vol 9 (5) ◽  
pp. 512
Author(s):  
Maryam Baghipur ◽  
Modjtaba Ghorbani ◽  
Hilal A. Ganie ◽  
Yilun Shang
Keyword(s):  
Lower Bounds ◽  
Complete Graph ◽  
Distance Matrix ◽  
Upper And Lower Bounds ◽  
Laplacian Eigenvalue ◽  
Signless Laplacian ◽  
Graph Parameters ◽  
Simple Connected Graph ◽  
Second Largest Eigenvalue ◽  
Reciprocal Distance Matrix

The signless Laplacian reciprocal distance matrix for a simple connected graph G is defined as RQ(G)=diag(RH(G))+RD(G). Here, RD(G) is the Harary matrix (also called reciprocal distance matrix) while diag(RH(G)) represents the diagonal matrix of the total reciprocal distance vertices. In the present work, some upper and lower bounds for the second-largest eigenvalue of the signless Laplacian reciprocal distance matrix of graphs in terms of various graph parameters are investigated. Besides, all graphs attaining these new bounds are characterized. Additionally, it is inferred that among all connected graphs with n vertices, the complete graph Kn and the graph Kn−e obtained from Kn by deleting an edge e have the maximum second-largest signless Laplacian reciprocal distance eigenvalue.

Sign in / Sign up

Export Citation Format

Share Document