we consider the number of zeros of the integral $i(h) = oint_{gamma_h} omega$ of real polynomial form $omega$ of degree not greater than $n$ over a family of vanishing cycles on curves $gamma_h:$ $y^2+3x^2-x^6=h$, where the integral is considered as a function of the parameter $h$. we prove that the number of zeros of $i(h)$, for $0 < h < 2$, is bounded above by $2[frac{n-1}{2}]+1$.

Omega polynomial, counting opposite edge strips ops, was proposed by Diudea to describe cycle-containing molecular structures, particularly those associated with nanostructures. In this paper, some theoretical aspects are evidenced and particular cases are illustrated.

Design of crystal-like lattices can be achieved by using some net operations. Hypothetical networks, thus obtained, can be characterized in their topology by various counting polynomials and topological indices derived from them. The networks herein presented are related to the Dyck graph and described in terms of Omega polynomial and PIv polynomials.

A topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. A new counting polynomial, called the "Omega" W(G, x) polynomial, was recently proposed by Diudea on the ground of quasi-orthogonal cut "qoc" edge strips in a polycyclic graph. In this paper, the vertex PI, Szeged and omega polynomials of carbon nanocones CNC4[n] are computed.

Let G be a simple connected graph with the vertex set V = V(G) and the edge set E = E(G), without loops and multiple edges. For counting qoc strips in G, Omega polynomial was introduced by Diudea and was defined as Ω(G,x ) = ( , ). , c c m G c x  where m(G,c) be the number of qoc strips of length c in the graph G. Following Omega polynomial, the Sadhana polynomial was defined by Ashrafi et al ...

The topological index of a graph G is a numeric quantity related to G which is invariant under automorphisms of G. The vertex PI polynomial is defined as v u v e uv PI (G) n (e) n (e). = = + ∑ Then Omega polynomial Ω(G,x) for counting qoc strips in G is defined as Ω(G,x) = ∑cm(G,c)x with m(G,c) being the number of strips of length c. In this paper, a new infinite class of fullerenes is construc...

The Omega test is an integer programming algorithm that can determine whether a dependence exists between two array references, and if so, under what conditions. Conventional wisdom holds that integer programming techniques are far too expensive to be used for dependence analysis, except as a method of last resort for situations that cannot be decided by simpler methods. We present evidence tha...

In 1978, Courcelle asked for a complete set of axioms and rules for the equational theory of (discrete regular) words equipped with the operations of product, omega power and omega-op power. In this paper we find a simple set of equations and prove they are complete. Moreover, we show that the equational theory is decidable in polynomial time.