Landry, Minsky and Taylor defined the taut polynomial of a veering triangulation. Its specialisations generalise Teichmuller fibred face Thurston norm ball. We prove that triangulation is equal to certain twisted Alexander underlying manifold. Then we give formulas relating untwisted polynomial. There are two formulas; one holds when maximal free abelian cover edge-orientable, another it not ed...

in this article, by using chebyshev’s polynomials and chebyshev’s expansion, we obtain the best uniform polynomial approximation out of p2n to a class of rational functions of the form (ax2+c)-1 on any non symmetric interval [d,e]. using the obtained approximation, we provide the best uniform polynomial approximation to a class of rational functions of the form (ax2+bx+c)-1 for both cases b2-4a...

Let $G$ be a graph and let $m_{ij}(G)$, $i,jge 1$, be the number of edges $uv$ of $G$ such that ${d_v(G), d_u(G)} = {i,j}$. The {em $M$-polynomial} of $G$ is introduced with $displaystyle{M(G;x,y) = sum_{ile j} m_{ij}(G)x^iy^j}$. It is shown that degree-based topological indices can be routinely computed from the polynomial, thus reducing the problem of their determination in each particular ca...

test day milk records of a holstein dairy farm collected during years 2004 to 2006 on 142 cows in the 1st lactation vs. 140 cows in the 2nd lactation were used in this research. there were real milk yields of cows available in each part of lactation in this farm making it possible to compare functions based on the new criteria (squared error of estimation). five functions were compared to estim...

background: identification of disease risk factors can help in the prevention of diseases. in assessing the predictive value of continuous variables, a routine procedure is to categorize the factors. this yield to inability to detect non‑linear relationship, if exist. multivariate fractional polynomial (mfp) modeling is a flexible method to reveal non‑linear associations. we aim to demonstrate ...

A graph $G$ is called $P_4$-free, if $G$ does not contain an induced subgraph $P_4$. The domination polynomial of a graph $G$ of order $n$ is the polynomial $D(G,x)=sum_{i=1}^{n} d(G,i) x^{i}$, where $d(G,i)$ is the number of dominating sets of $G$ of size $i$. Every root of $D(G,x)$ is called a domination root of $G$. In this paper we state and prove formula for the domination polynomial of no...