We study the factorization into irreducibles of iterates of a quadratic polynomial f over a finite field. We call f settled when the factorization of its nth iterate for large n is dominated by “stable” polynomials, namely those that are irreducible under post-composition by any iterate of f . We prove that stable polynomials may be detected by their action on the critical orbit of f , and that...

Waste palm dates were subjected to analysis for composition and enzymatic hydrolysis of their flesh fibers. The fruit contained 32% glucose and 30% fructose, while the water-insoluble fibers of its flesh consisted of 49.9% lignin and 20.9% polysaccharides. Water-insoluble fibers were settled to 55% of its initial volume in 12 h. The presence of skin and flesh colloidal fibers results in high vi...

We study the parameterized complexity of cardinality constrained optimization problems, i.e. optimization problems that require their solutions to contain specified numbers of elements to optimize solution values. For this purpose, we consider around 20 such optimization problems, as well as their parametric duals, that deal with various fundamental relations among vertices and edges in graphs....

Given a polynomial of degree d over number field, the image associated arboreal representation absolute Galois group field is profinite acting on d-ary tree. Boston and Jones conjectured that for quadratic polynomial, such contains dense set settled elements. Here an element if it exhibits certain pattern growth cycles at finite levels In this paper, we prove conjecture generically in case when...

We compare several formal and informal approaches to define the semantics of the Object Constraint Language (OCL) [22]. This comparison reveals a number of minor and major design problems to be settled in upcoming versions of the OCL standard. We review these problems in the context of our work of providing a formal semantics of OCL through an conservative embedding in HOL using the Isabelle th...