scholarly journals Characterization of $[1,k]$-Bar Visibility Trees

10.37236/1116 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Guantao Chen ◽  
Joan P. Hutchinson ◽  
Ken Keating ◽  
Jian Shen
Keyword(s):  
Knapsack Problem ◽  
Unit Length ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Visibility Representation ◽  
Visibility Graphs ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if there is a unobstructed, non-degenerate, vertical band of visibility between the corresponding bars. We generalize unit bar-visibility graphs to $[1,k]$-bar-visibility graphs by allowing the lengths of the bars to be between $1/k$ and $1$. We completely characterize these graphs for trees. We establish an algorithm with complexity $O(kn)$ to determine whether a tree with $n$ vertices has a $[1,k]$-bar-visibility representation. In the course of developing the algorithm, we study a special case of the knapsack problem: Partitioning a set of positive integers into two sets with sums as equal as possible. We give a necessary and sufficient condition for the existence of such a partition.

A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours

1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó
Keyword(s):  
Formal Languages ◽  
Parallel Program ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Concurrent System ◽  
Closure Properties ◽  
Sequential Program ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Independence Relations

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.

On representation of Poisson mixtures as Poisson sums and a characterization of the gamma distribution

1977 ◽  
Vol 82 (2) ◽  
pp. 297-300 ◽  
Author(s):  
A. V. Godambe
Keyword(s):  
Gamma Distribution ◽  
Exponential Type ◽  
Similar Condition ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Poisson Mixture ◽  
Mixing Distribution ◽  
Poisson Mixtures ◽  
Necessary And Sufficient

AbstractA necessary and sufficient condition for a Poisson mixture with an exponential type mixing distribution to be equivalently represented as a Poisson sum is obtained. The problem of deriving a similar condition under any mixing distribution on (0, ∞) is discussed. Finally, a characterization of the gamma distribution is obtained.

A characterization of the Poisson process

1974 ◽  
Vol 11 (1) ◽  
pp. 72-85 ◽  
Author(s):  
S. M. Samuels
Keyword(s):  
Poisson Process ◽  
Renewal Process ◽  
Poisson Processes ◽  
Renewal Processes ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Complete Proof ◽  
Necessary And Sufficient

Theorem: A necessary and sufficient condition for the superposition of two ordinary renewal processes to again be a renewal process is that they be Poisson processes.A complete proof of this theorem is given; also it is shown how the theorem follows from the corresponding one for the superposition of two stationary renewal processes.

On weak convergence within the hnbue family of life distributions

1984 ◽  
Vol 21 (03) ◽  
pp. 654-660 ◽  
Author(s):  
Sujit K. Basu ◽  
Manish C. Bhattacharjee
Keyword(s):  
Weak Convergence ◽  
Exponential Distribution ◽  
Limiting Distribution ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Moment Sequence ◽  
Positive Order ◽  
Life Distributions ◽  
Necessary And Sufficient

We show that the HNBUE family of life distributions is closed under weak convergence and that weak convergence within this family is equivalent to convergence of each moment sequence of positive order to the corresponding moment of the limiting distribution. A necessary and sufficient condition for weak convergence to the exponential distribution is given, based on a new characterization of exponentials within the HNBUE family of life distributions.

A characterization of the exponential distribution

1972 ◽  
Vol 9 (02) ◽  
pp. 457-461 ◽  
Author(s):  
M. Ahsanullah ◽  
M. Rahman
Keyword(s):  
Probability Distribution ◽  
Order Statistics ◽  
Lebesgue Measure ◽  
Random Variable ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Positive Random Variable ◽  
Absolutely Continuous ◽  
Necessary And Sufficient

A necessary and sufficient condition based on order statistics that a positive random variable having an absolutely continuous probability distribution (with respect to Lebesgue measure) will be exponential is given.

scholarly journals On composition of formal power series

2002 ◽  
Vol 30 (12) ◽  
pp. 761-770 ◽  
Author(s):  
Xiao-Xiong Gan ◽  
Nathaniel Knox
Keyword(s):  
Power Series ◽  
Formal Power Series ◽  
Open Problem ◽  
Constant Term ◽  
Radius Of Convergence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient ◽  
Formal Power ◽  
Special Case

Given a formal power seriesg(x)=b0+b1x+b2x2+⋯and a nonunitf(x)=a1x+a2x2+⋯, it is well known that the composition ofgwithf,g(f(x)), is a formal power series. If the formal power seriesfabove is not a nonunit, that is, the constant term offis not zero, the existence of the compositiong(f(x))has been an open problem for many years. The recent development investigated the radius of convergence of a composed formal power series likefabove and obtained some very good results. This note gives a necessary and sufficient condition for the existence of the composition of some formal power series. By means of the theorems established in this note, the existence of the composition of a nonunit formal power series is a special case.

On the general bilinear time series model

1988 ◽  
Vol 25 (3) ◽  
pp. 553-564 ◽  
Author(s):  
Jian Liu ◽  
Peter J. Brockwell
Keyword(s):  
Time Series ◽  
Stationary Solution ◽  
Time Series Model ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Special Cases ◽  
Non Linear ◽  
Necessary And Sufficient ◽  
Special Case

A sufficient condition is derived for the existence of a strictly stationary solution of the general bilinear time series equations. The condition is shown to reduce to the conditions of Pham and Tran (1981) and Bhaskara Rao et al. (1983) in the special cases which they consider. Under the condition specified, a solution is constructed which is shown to be causal, stationary and ergodic. It is moreover the unique causal solution and the unique stationary solution of the defining equations. In the special case when the defining equations contain no non-linear terms, our condition reduces to the well-known necessary and sufficient condition for existence of a causal stationary solution.

A dynamical characterization of diagonal-preserving -isomorphisms of graph -algebras

2017 ◽  
Vol 38 (7) ◽  
pp. 2401-2421 ◽  
Author(s):  
SARA E. ARKLINT ◽  
SØREN EILERS ◽  
EFREN RUIZ
Keyword(s):  
Directed Graphs ◽  
Sufficient Condition ◽  
Orbit Equivalence ◽  
Necessary And Sufficient Condition ◽  
Graph Algebras ◽  
Boundary Path ◽  
Necessary And Sufficient

We characterize when there exists a diagonal-preserving $\ast$-isomorphism between two graph $C^{\ast }$-algebras in terms of the dynamics of the boundary path spaces. In particular, we refine the notion of ‘orbit equivalence’ between the boundary path spaces of the directed graphs $E$ and $F$ and show that this is a necessary and sufficient condition for the existence of a diagonal-preserving $\ast$-isomorphism between the graph $C^{\ast }$-algebras $C^{\ast }(E)$ and $C^{\ast }(F)$.

scholarly journals QKSpaces on the Unit Circle

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Jizhen Zhou
Keyword(s):  
Sobolev Space ◽  
Unit Circle ◽  
Measurable Function ◽  
Weight Functions ◽  
Sufficient Condition ◽  
General Criterion ◽  
Necessary And Sufficient Condition ◽  
New Space ◽  
Necessary And Sufficient

We introduce a new spaceQK(∂D)of Lebesgue measurable functions on the unit circle connecting closely with the Sobolev space. We obtain a necessary and sufficient condition onKsuch thatQK(∂D)=BMO(∂D), as well as a general criterion on weight functionsK1andK2,K1≤K2, such thatQK1(∂D)QK2(∂D). We also prove that a measurable function belongs toQK(∂D)if and only if it is Möbius bounded in the Sobolev spaceLK2(∂D). Finally, we obtain a dyadic characterization of functions inQK(∂D)spaces in terms of dyadic arcs on the unit circle.

A CHARACTERIZATION OF KNOTS IN A SPATIAL GRAPH

2000 ◽  
Vol 09 (08) ◽  
pp. 1069-1084 ◽  
Author(s):  
KAZUKO ONDA
Keyword(s):  
Finite Graph ◽  
Restriction Map ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Spatial Graph ◽  
Necessary And Sufficient

For a finite graph G, let Γ(G) be the set of all cycles of G. Suppose that for each γ∈Γ(G), an embedding ϕγ:γ→S3 is given. A set {ϕγ|γ∈Γ(G)} of embeddings is said to be realizable if there is an embedding f:G→S3 such that the restriction map f|γ is ambient isotopic to ϕγ for any γ∈Γ(G). In this paper on seven specified graphs G, we give a necessary and sufficient condition for the set {ϕγ|γ∈Γ(G)} to be realizable by using the second coefficients of Conway polynomials of knots.

Sign in / Sign up

Export Citation Format

Share Document